/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 11:35:51,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 11:35:51,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 11:35:51,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 11:35:51,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 11:35:51,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 11:35:51,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 11:35:51,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 11:35:51,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 11:35:51,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 11:35:51,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 11:35:51,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 11:35:51,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 11:35:51,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 11:35:51,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 11:35:51,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 11:35:51,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 11:35:51,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 11:35:51,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 11:35:51,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 11:35:51,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 11:35:51,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 11:35:51,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 11:35:51,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 11:35:51,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 11:35:51,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 11:35:51,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 11:35:51,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 11:35:51,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 11:35:51,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 11:35:51,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 11:35:51,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 11:35:51,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 11:35:51,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 11:35:51,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 11:35:51,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 11:35:51,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 11:35:51,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 11:35:51,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 11:35:51,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 11:35:51,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 11:35:51,891 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-NoLbe.epf [2021-06-10 11:35:51,917 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 11:35:51,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 11:35:51,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 11:35:51,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 11:35:51,920 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 11:35:51,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 11:35:51,920 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 11:35:51,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 11:35:51,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 11:35:51,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 11:35:51,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 11:35:51,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 11:35:51,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 11:35:51,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 11:35:51,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 11:35:51,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 11:35:51,923 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 11:35:51,923 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 11:35:51,923 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-06-10 11:35:52,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 11:35:52,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 11:35:52,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 11:35:52,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 11:35:52,194 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 11:35:52,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2021-06-10 11:35:52,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee97fa9cc/0c06f3b7aaa542e4a2912e9697d93a24/FLAG0608c7728 [2021-06-10 11:35:52,654 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 11:35:52,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2021-06-10 11:35:52,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee97fa9cc/0c06f3b7aaa542e4a2912e9697d93a24/FLAG0608c7728 [2021-06-10 11:35:52,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee97fa9cc/0c06f3b7aaa542e4a2912e9697d93a24 [2021-06-10 11:35:52,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 11:35:52,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 11:35:52,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 11:35:52,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 11:35:52,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 11:35:52,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 11:35:52" (1/1) ... [2021-06-10 11:35:52,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238ac8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:52, skipping insertion in model container [2021-06-10 11:35:52,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 11:35:52" (1/1) ... [2021-06-10 11:35:52,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 11:35:53,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 11:35:53,225 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-ext/29_conditionals_vs.i[30422,30435] [2021-06-10 11:35:53,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 11:35:53,268 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 11:35:53,293 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-ext/29_conditionals_vs.i[30422,30435] [2021-06-10 11:35:53,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 11:35:53,346 INFO L208 MainTranslator]: Completed translation [2021-06-10 11:35:53,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53 WrapperNode [2021-06-10 11:35:53,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 11:35:53,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 11:35:53,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 11:35:53,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 11:35:53,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 11:35:53,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 11:35:53,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 11:35:53,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 11:35:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (1/1) ... [2021-06-10 11:35:53,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 11:35:53,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 11:35:53,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 11:35:53,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 11:35:53,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (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-06-10 11:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-10 11:35:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-10 11:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 11:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 11:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 11:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 11:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 11:35:53,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 11:35:53,474 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 11:35:53,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 11:35:53,777 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-06-10 11:35:53,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 11:35:53 BoogieIcfgContainer [2021-06-10 11:35:53,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 11:35:53,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 11:35:53,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 11:35:53,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 11:35:53,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 11:35:52" (1/3) ... [2021-06-10 11:35:53,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942c04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 11:35:53, skipping insertion in model container [2021-06-10 11:35:53,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 11:35:53" (2/3) ... [2021-06-10 11:35:53,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942c04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 11:35:53, skipping insertion in model container [2021-06-10 11:35:53,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 11:35:53" (3/3) ... [2021-06-10 11:35:53,783 INFO L111 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2021-06-10 11:35:53,786 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 11:35:53,794 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-10 11:35:53,795 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 11:35:53,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:53,829 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:53,841 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-10 11:35:53,855 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:53,855 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:53,855 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:53,855 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:53,855 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:53,855 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:53,855 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:53,855 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:53,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 103 flow [2021-06-10 11:35:53,883 INFO L129 PetriNetUnfolder]: 6/57 cut-off events. [2021-06-10 11:35:53,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 11:35:53,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 57 events. 6/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2021-06-10 11:35:53,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 103 flow [2021-06-10 11:35:53,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 49 transitions, 103 flow [2021-06-10 11:35:53,899 INFO L129 PetriNetUnfolder]: 2/29 cut-off events. [2021-06-10 11:35:53,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 11:35:53,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:53,900 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:53,900 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:53,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash 250824221, now seen corresponding path program 1 times [2021-06-10 11:35:53,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:53,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796682482] [2021-06-10 11:35:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,011 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,041 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,060 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:54,061 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:54,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 11:35:54,062 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:54,062 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,106 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:54,106 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-10 11:35:54,109 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:54,109 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:54,109 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:54,109 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:54,109 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:54,109 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:54,109 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:54,109 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:54,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 77 transitions, 166 flow [2021-06-10 11:35:54,133 INFO L129 PetriNetUnfolder]: 11/94 cut-off events. [2021-06-10 11:35:54,133 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-10 11:35:54,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 11/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2021-06-10 11:35:54,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 77 transitions, 166 flow [2021-06-10 11:35:54,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 77 transitions, 166 flow [2021-06-10 11:35:54,154 INFO L129 PetriNetUnfolder]: 3/48 cut-off events. [2021-06-10 11:35:54,154 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-10 11:35:54,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,154 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:54,154 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:35:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1918253415, now seen corresponding path program 1 times [2021-06-10 11:35:54,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660276204] [2021-06-10 11:35:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,190 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,200 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,204 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:54,204 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:54,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 11:35:54,206 WARN L342 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:54,207 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,264 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:54,264 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 11:35:54,265 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:54,265 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:54,265 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:54,265 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:54,265 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:54,266 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:54,266 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:54,266 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:54,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 105 transitions, 231 flow [2021-06-10 11:35:54,298 INFO L129 PetriNetUnfolder]: 16/131 cut-off events. [2021-06-10 11:35:54,298 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-10 11:35:54,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 131 events. 16/131 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 337 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2021-06-10 11:35:54,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 105 transitions, 231 flow [2021-06-10 11:35:54,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 105 transitions, 231 flow [2021-06-10 11:35:54,315 INFO L129 PetriNetUnfolder]: 5/70 cut-off events. [2021-06-10 11:35:54,316 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-10 11:35:54,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,316 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:54,316 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:35:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1779002648, now seen corresponding path program 1 times [2021-06-10 11:35:54,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512221321] [2021-06-10 11:35:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,329 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,340 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:54,346 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:54,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 11:35:54,346 WARN L342 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:54,346 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-10 11:35:54,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,397 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:54,397 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 11:35:54,398 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:54,398 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:54,398 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:54,398 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:54,398 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:54,398 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:54,399 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:54,399 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:54,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 133 transitions, 298 flow [2021-06-10 11:35:54,424 INFO L129 PetriNetUnfolder]: 21/168 cut-off events. [2021-06-10 11:35:54,424 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:35:54,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 168 events. 21/168 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 501 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 139. Up to 10 conditions per place. [2021-06-10 11:35:54,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 133 transitions, 298 flow [2021-06-10 11:35:54,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 133 transitions, 298 flow [2021-06-10 11:35:54,442 INFO L129 PetriNetUnfolder]: 10/103 cut-off events. [2021-06-10 11:35:54,442 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:35:54,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,442 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-06-10 11:35:54,442 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash 801905474, now seen corresponding path program 1 times [2021-06-10 11:35:54,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735282280] [2021-06-10 11:35:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:54,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:54,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:54,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735282280] [2021-06-10 11:35:54,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:54,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:54,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557610474] [2021-06-10 11:35:54,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:54,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:54,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133 [2021-06-10 11:35:54,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:54,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133 [2021-06-10 11:35:54,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:54,563 INFO L129 PetriNetUnfolder]: 10/135 cut-off events. [2021-06-10 11:35:54,563 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:35:54,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 135 events. 10/135 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 366 event pairs, 0 based on Foata normal form. 18/137 useless extension candidates. Maximal degree in co-relation 121. Up to 5 conditions per place. [2021-06-10 11:35:54,565 INFO L132 encePairwiseOnDemand]: 124/133 looper letters, 5 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2021-06-10 11:35:54,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 286 flow [2021-06-10 11:35:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2021-06-10 11:35:54,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2021-06-10 11:35:54,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2021-06-10 11:35:54,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2021-06-10 11:35:54,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:54,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2021-06-10 11:35:54,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,585 INFO L185 Difference]: Start difference. First operand has 125 places, 133 transitions, 298 flow. Second operand 3 states and 371 transitions. [2021-06-10 11:35:54,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 286 flow [2021-06-10 11:35:54,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 274 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:54,589 INFO L241 Difference]: Finished difference. Result has 120 places, 120 transitions, 272 flow [2021-06-10 11:35:54,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2021-06-10 11:35:54,591 INFO L343 CegarLoopForPetriNet]: 125 programPoint places, -5 predicate places. [2021-06-10 11:35:54,591 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 272 flow [2021-06-10 11:35:54,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,592 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:54,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 11:35:54,592 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1401122464, now seen corresponding path program 1 times [2021-06-10 11:35:54,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926932320] [2021-06-10 11:35:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,602 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,608 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:54,613 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:54,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 11:35:54,613 WARN L342 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:54,613 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:54,665 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:54,665 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-10 11:35:54,666 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:54,666 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:54,666 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:54,666 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:54,666 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:54,666 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:54,666 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:54,666 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:54,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 161 transitions, 367 flow [2021-06-10 11:35:54,682 INFO L129 PetriNetUnfolder]: 26/205 cut-off events. [2021-06-10 11:35:54,682 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:35:54,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 205 events. 26/205 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 660 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2021-06-10 11:35:54,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 161 transitions, 367 flow [2021-06-10 11:35:54,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 161 transitions, 367 flow [2021-06-10 11:35:54,691 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2021-06-10 11:35:54,691 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:54,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,691 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-06-10 11:35:54,691 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1936327651, now seen corresponding path program 1 times [2021-06-10 11:35:54,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566018451] [2021-06-10 11:35:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:54,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:54,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:54,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566018451] [2021-06-10 11:35:54,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:54,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:54,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918816403] [2021-06-10 11:35:54,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:54,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:54,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-06-10 11:35:54,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 161 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:54,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-06-10 11:35:54,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:54,743 INFO L129 PetriNetUnfolder]: 14/167 cut-off events. [2021-06-10 11:35:54,743 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:35:54,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 167 events. 14/167 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 503 event pairs, 0 based on Foata normal form. 28/174 useless extension candidates. Maximal degree in co-relation 164. Up to 9 conditions per place. [2021-06-10 11:35:54,745 INFO L132 encePairwiseOnDemand]: 149/161 looper letters, 10 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2021-06-10 11:35:54,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 147 transitions, 365 flow [2021-06-10 11:35:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2021-06-10 11:35:54,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.917184265010352 [2021-06-10 11:35:54,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2021-06-10 11:35:54,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2021-06-10 11:35:54,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:54,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2021-06-10 11:35:54,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,750 INFO L185 Difference]: Start difference. First operand has 151 places, 161 transitions, 367 flow. Second operand 3 states and 443 transitions. [2021-06-10 11:35:54,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 147 transitions, 365 flow [2021-06-10 11:35:54,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 147 transitions, 345 flow, removed 10 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:54,753 INFO L241 Difference]: Finished difference. Result has 145 places, 147 transitions, 339 flow [2021-06-10 11:35:54,753 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=145, PETRI_TRANSITIONS=147} [2021-06-10 11:35:54,754 INFO L343 CegarLoopForPetriNet]: 151 programPoint places, -6 predicate places. [2021-06-10 11:35:54,754 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 147 transitions, 339 flow [2021-06-10 11:35:54,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,754 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-06-10 11:35:54,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 11:35:54,754 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1936328674, now seen corresponding path program 1 times [2021-06-10 11:35:54,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667896366] [2021-06-10 11:35:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:54,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:54,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:54,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667896366] [2021-06-10 11:35:54,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:54,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:54,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366054080] [2021-06-10 11:35:54,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:54,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:54,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 161 [2021-06-10 11:35:54,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 147 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:54,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 161 [2021-06-10 11:35:54,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:54,801 INFO L129 PetriNetUnfolder]: 12/168 cut-off events. [2021-06-10 11:35:54,801 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:54,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 168 events. 12/168 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 528 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 177. Up to 6 conditions per place. [2021-06-10 11:35:54,803 INFO L132 encePairwiseOnDemand]: 159/161 looper letters, 6 selfloop transitions, 1 changer transitions 0/147 dead transitions. [2021-06-10 11:35:54,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 351 flow [2021-06-10 11:35:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2021-06-10 11:35:54,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:54,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2021-06-10 11:35:54,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2021-06-10 11:35:54,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:54,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2021-06-10 11:35:54,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,807 INFO L185 Difference]: Start difference. First operand has 145 places, 147 transitions, 339 flow. Second operand 3 states and 437 transitions. [2021-06-10 11:35:54,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 351 flow [2021-06-10 11:35:54,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:54,810 INFO L241 Difference]: Finished difference. Result has 147 places, 146 transitions, 335 flow [2021-06-10 11:35:54,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=147, PETRI_TRANSITIONS=146} [2021-06-10 11:35:54,810 INFO L343 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2021-06-10 11:35:54,810 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 335 flow [2021-06-10 11:35:54,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,811 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,811 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-06-10 11:35:54,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 11:35:54,811 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1937280963, now seen corresponding path program 1 times [2021-06-10 11:35:54,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350504204] [2021-06-10 11:35:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:54,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:54,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:54,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350504204] [2021-06-10 11:35:54,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:54,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:54,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877124008] [2021-06-10 11:35:54,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:54,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:54,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 161 [2021-06-10 11:35:54,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:54,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 161 [2021-06-10 11:35:54,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:54,855 INFO L129 PetriNetUnfolder]: 12/161 cut-off events. [2021-06-10 11:35:54,855 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:54,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 161 events. 12/161 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 473 event pairs, 0 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 179. Up to 6 conditions per place. [2021-06-10 11:35:54,857 INFO L132 encePairwiseOnDemand]: 159/161 looper letters, 5 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2021-06-10 11:35:54,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 338 flow [2021-06-10 11:35:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2021-06-10 11:35:54,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9026915113871635 [2021-06-10 11:35:54,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2021-06-10 11:35:54,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2021-06-10 11:35:54,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:54,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2021-06-10 11:35:54,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,860 INFO L185 Difference]: Start difference. First operand has 147 places, 146 transitions, 335 flow. Second operand 3 states and 436 transitions. [2021-06-10 11:35:54,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 338 flow [2021-06-10 11:35:54,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 331 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:54,863 INFO L241 Difference]: Finished difference. Result has 147 places, 144 transitions, 324 flow [2021-06-10 11:35:54,863 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2021-06-10 11:35:54,863 INFO L343 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2021-06-10 11:35:54,863 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 324 flow [2021-06-10 11:35:54,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,864 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-06-10 11:35:54,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 11:35:54,864 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1937281986, now seen corresponding path program 1 times [2021-06-10 11:35:54,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799366740] [2021-06-10 11:35:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:54,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:54,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:54,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:54,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799366740] [2021-06-10 11:35:54,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:54,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:54,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073207298] [2021-06-10 11:35:54,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:54,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:54,890 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-06-10 11:35:54,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:54,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-06-10 11:35:54,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:54,943 INFO L129 PetriNetUnfolder]: 12/159 cut-off events. [2021-06-10 11:35:54,943 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-06-10 11:35:54,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 159 events. 12/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 458 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 179. Up to 8 conditions per place. [2021-06-10 11:35:54,945 INFO L132 encePairwiseOnDemand]: 159/161 looper letters, 8 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2021-06-10 11:35:54,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 337 flow [2021-06-10 11:35:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2021-06-10 11:35:54,946 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778467908902692 [2021-06-10 11:35:54,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2021-06-10 11:35:54,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2021-06-10 11:35:54,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:54,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2021-06-10 11:35:54,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,948 INFO L185 Difference]: Start difference. First operand has 147 places, 144 transitions, 324 flow. Second operand 3 states and 424 transitions. [2021-06-10 11:35:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 337 flow [2021-06-10 11:35:54,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 142 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:54,950 INFO L241 Difference]: Finished difference. Result has 146 places, 142 transitions, 320 flow [2021-06-10 11:35:54,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=146, PETRI_TRANSITIONS=142} [2021-06-10 11:35:54,950 INFO L343 CegarLoopForPetriNet]: 151 programPoint places, -5 predicate places. [2021-06-10 11:35:54,951 INFO L480 AbstractCegarLoop]: Abstraction has has 146 places, 142 transitions, 320 flow [2021-06-10 11:35:54,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:54,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:54,951 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:54,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 11:35:54,951 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1274402673, now seen corresponding path program 1 times [2021-06-10 11:35:54,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:54,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036823378] [2021-06-10 11:35:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,958 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:54,970 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:54,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:54,974 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:54,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 11:35:54,974 WARN L342 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:54,975 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,040 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:55,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-10 11:35:55,041 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:55,041 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:55,041 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:55,041 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:55,042 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:55,042 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:55,042 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:55,042 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:55,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions, 438 flow [2021-06-10 11:35:55,066 INFO L129 PetriNetUnfolder]: 31/242 cut-off events. [2021-06-10 11:35:55,066 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:35:55,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 242 events. 31/242 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 837 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 226. Up to 14 conditions per place. [2021-06-10 11:35:55,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 189 transitions, 438 flow [2021-06-10 11:35:55,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 189 transitions, 438 flow [2021-06-10 11:35:55,077 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2021-06-10 11:35:55,077 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:55,077 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,077 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-06-10 11:35:55,077 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1164845208, now seen corresponding path program 1 times [2021-06-10 11:35:55,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114698326] [2021-06-10 11:35:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:55,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114698326] [2021-06-10 11:35:55,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853431876] [2021-06-10 11:35:55,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2021-06-10 11:35:55,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 189 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2021-06-10 11:35:55,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,167 INFO L129 PetriNetUnfolder]: 17/196 cut-off events. [2021-06-10 11:35:55,167 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-06-10 11:35:55,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 196 events. 17/196 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 626 event pairs, 0 based on Foata normal form. 32/203 useless extension candidates. Maximal degree in co-relation 199. Up to 9 conditions per place. [2021-06-10 11:35:55,170 INFO L132 encePairwiseOnDemand]: 176/189 looper letters, 10 selfloop transitions, 3 changer transitions 0/173 dead transitions. [2021-06-10 11:35:55,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 173 transitions, 432 flow [2021-06-10 11:35:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-06-10 11:35:55,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223985890652557 [2021-06-10 11:35:55,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-06-10 11:35:55,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-06-10 11:35:55,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-06-10 11:35:55,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,174 INFO L185 Difference]: Start difference. First operand has 177 places, 189 transitions, 438 flow. Second operand 3 states and 523 transitions. [2021-06-10 11:35:55,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 173 transitions, 432 flow [2021-06-10 11:35:55,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 173 transitions, 402 flow, removed 15 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:55,178 INFO L241 Difference]: Finished difference. Result has 170 places, 173 transitions, 396 flow [2021-06-10 11:35:55,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=170, PETRI_TRANSITIONS=173} [2021-06-10 11:35:55,178 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -7 predicate places. [2021-06-10 11:35:55,178 INFO L480 AbstractCegarLoop]: Abstraction has has 170 places, 173 transitions, 396 flow [2021-06-10 11:35:55,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,179 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-06-10 11:35:55,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 11:35:55,179 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1164844185, now seen corresponding path program 1 times [2021-06-10 11:35:55,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560788048] [2021-06-10 11:35:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560788048] [2021-06-10 11:35:55,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803525815] [2021-06-10 11:35:55,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2021-06-10 11:35:55,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 173 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2021-06-10 11:35:55,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,239 INFO L129 PetriNetUnfolder]: 15/197 cut-off events. [2021-06-10 11:35:55,239 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:55,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 197 events. 15/197 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 650 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 209. Up to 7 conditions per place. [2021-06-10 11:35:55,243 INFO L132 encePairwiseOnDemand]: 187/189 looper letters, 6 selfloop transitions, 1 changer transitions 0/173 dead transitions. [2021-06-10 11:35:55,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 173 transitions, 408 flow [2021-06-10 11:35:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2021-06-10 11:35:55,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.908289241622575 [2021-06-10 11:35:55,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,248 INFO L185 Difference]: Start difference. First operand has 170 places, 173 transitions, 396 flow. Second operand 3 states and 515 transitions. [2021-06-10 11:35:55,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 173 transitions, 408 flow [2021-06-10 11:35:55,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 173 transitions, 403 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,251 INFO L241 Difference]: Finished difference. Result has 172 places, 172 transitions, 392 flow [2021-06-10 11:35:55,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=172, PETRI_TRANSITIONS=172} [2021-06-10 11:35:55,251 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -5 predicate places. [2021-06-10 11:35:55,251 INFO L480 AbstractCegarLoop]: Abstraction has has 172 places, 172 transitions, 392 flow [2021-06-10 11:35:55,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,251 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,251 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-06-10 11:35:55,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 11:35:55,251 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1163890873, now seen corresponding path program 1 times [2021-06-10 11:35:55,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403162576] [2021-06-10 11:35:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:55,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403162576] [2021-06-10 11:35:55,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486057076] [2021-06-10 11:35:55,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,281 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2021-06-10 11:35:55,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 172 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2021-06-10 11:35:55,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,318 INFO L129 PetriNetUnfolder]: 15/191 cut-off events. [2021-06-10 11:35:55,318 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:55,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 191 events. 15/191 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 600 event pairs, 0 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 216. Up to 8 conditions per place. [2021-06-10 11:35:55,320 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 9 selfloop transitions, 1 changer transitions 0/170 dead transitions. [2021-06-10 11:35:55,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 402 flow [2021-06-10 11:35:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2021-06-10 11:35:55,322 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-06-10 11:35:55,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2021-06-10 11:35:55,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2021-06-10 11:35:55,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2021-06-10 11:35:55,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,324 INFO L185 Difference]: Start difference. First operand has 172 places, 172 transitions, 392 flow. Second operand 3 states and 504 transitions. [2021-06-10 11:35:55,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 402 flow [2021-06-10 11:35:55,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,327 INFO L241 Difference]: Finished difference. Result has 173 places, 170 transitions, 383 flow [2021-06-10 11:35:55,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2021-06-10 11:35:55,327 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -4 predicate places. [2021-06-10 11:35:55,327 INFO L480 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 383 flow [2021-06-10 11:35:55,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,328 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-06-10 11:35:55,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 11:35:55,328 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1163891896, now seen corresponding path program 1 times [2021-06-10 11:35:55,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384588617] [2021-06-10 11:35:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384588617] [2021-06-10 11:35:55,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939202690] [2021-06-10 11:35:55,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2021-06-10 11:35:55,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2021-06-10 11:35:55,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,383 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2021-06-10 11:35:55,384 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-10 11:35:55,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 188 events. 15/188 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 581 event pairs, 0 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 207. Up to 7 conditions per place. [2021-06-10 11:35:55,387 INFO L132 encePairwiseOnDemand]: 187/189 looper letters, 5 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2021-06-10 11:35:55,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 389 flow [2021-06-10 11:35:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-06-10 11:35:55,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9065255731922398 [2021-06-10 11:35:55,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,390 INFO L185 Difference]: Start difference. First operand has 173 places, 170 transitions, 383 flow. Second operand 3 states and 514 transitions. [2021-06-10 11:35:55,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 389 flow [2021-06-10 11:35:55,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 384 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:55,392 INFO L241 Difference]: Finished difference. Result has 171 places, 168 transitions, 377 flow [2021-06-10 11:35:55,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2021-06-10 11:35:55,393 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -6 predicate places. [2021-06-10 11:35:55,393 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 377 flow [2021-06-10 11:35:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,393 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:55,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 11:35:55,393 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -121801191, now seen corresponding path program 1 times [2021-06-10 11:35:55,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193433180] [2021-06-10 11:35:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:55,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:55,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193433180] [2021-06-10 11:35:55,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101697299] [2021-06-10 11:35:55,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2021-06-10 11:35:55,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2021-06-10 11:35:55,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,446 INFO L129 PetriNetUnfolder]: 14/196 cut-off events. [2021-06-10 11:35:55,446 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:55,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 196 events. 14/196 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 225. Up to 9 conditions per place. [2021-06-10 11:35:55,449 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 10 selfloop transitions, 3 changer transitions 0/170 dead transitions. [2021-06-10 11:35:55,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 170 transitions, 407 flow [2021-06-10 11:35:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2021-06-10 11:35:55,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8941798941798942 [2021-06-10 11:35:55,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2021-06-10 11:35:55,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2021-06-10 11:35:55,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2021-06-10 11:35:55,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,452 INFO L185 Difference]: Start difference. First operand has 171 places, 168 transitions, 377 flow. Second operand 3 states and 507 transitions. [2021-06-10 11:35:55,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 170 transitions, 407 flow [2021-06-10 11:35:55,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,457 INFO L241 Difference]: Finished difference. Result has 174 places, 170 transitions, 400 flow [2021-06-10 11:35:55,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2021-06-10 11:35:55,458 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -3 predicate places. [2021-06-10 11:35:55,458 INFO L480 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 400 flow [2021-06-10 11:35:55,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,458 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,458 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:55,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 11:35:55,458 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash -121800168, now seen corresponding path program 1 times [2021-06-10 11:35:55,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659586312] [2021-06-10 11:35:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:55,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659586312] [2021-06-10 11:35:55,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646615707] [2021-06-10 11:35:55,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,482 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2021-06-10 11:35:55,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2021-06-10 11:35:55,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,513 INFO L129 PetriNetUnfolder]: 13/194 cut-off events. [2021-06-10 11:35:55,513 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:55,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 194 events. 13/194 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 641 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 220. Up to 7 conditions per place. [2021-06-10 11:35:55,516 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 5 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2021-06-10 11:35:55,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 170 transitions, 412 flow [2021-06-10 11:35:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2021-06-10 11:35:55,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.908289241622575 [2021-06-10 11:35:55,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2021-06-10 11:35:55,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,520 INFO L185 Difference]: Start difference. First operand has 174 places, 170 transitions, 400 flow. Second operand 3 states and 515 transitions. [2021-06-10 11:35:55,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 170 transitions, 412 flow [2021-06-10 11:35:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 170 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,523 INFO L241 Difference]: Finished difference. Result has 177 places, 170 transitions, 405 flow [2021-06-10 11:35:55,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=177, PETRI_TRANSITIONS=170} [2021-06-10 11:35:55,523 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, 0 predicate places. [2021-06-10 11:35:55,523 INFO L480 AbstractCegarLoop]: Abstraction has has 177 places, 170 transitions, 405 flow [2021-06-10 11:35:55,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,524 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:55,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 11:35:55,524 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -120847879, now seen corresponding path program 1 times [2021-06-10 11:35:55,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138264478] [2021-06-10 11:35:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:55,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138264478] [2021-06-10 11:35:55,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936927817] [2021-06-10 11:35:55,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2021-06-10 11:35:55,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 170 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2021-06-10 11:35:55,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,568 INFO L129 PetriNetUnfolder]: 12/190 cut-off events. [2021-06-10 11:35:55,569 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:55,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 190 events. 12/190 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 615 event pairs, 0 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 217. Up to 7 conditions per place. [2021-06-10 11:35:55,572 INFO L132 encePairwiseOnDemand]: 187/189 looper letters, 5 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2021-06-10 11:35:55,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 167 transitions, 402 flow [2021-06-10 11:35:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-06-10 11:35:55,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9065255731922398 [2021-06-10 11:35:55,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-06-10 11:35:55,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,576 INFO L185 Difference]: Start difference. First operand has 177 places, 170 transitions, 405 flow. Second operand 3 states and 514 transitions. [2021-06-10 11:35:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 167 transitions, 402 flow [2021-06-10 11:35:55,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 167 transitions, 395 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:55,578 INFO L241 Difference]: Finished difference. Result has 176 places, 167 transitions, 385 flow [2021-06-10 11:35:55,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=176, PETRI_TRANSITIONS=167} [2021-06-10 11:35:55,578 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -1 predicate places. [2021-06-10 11:35:55,578 INFO L480 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 385 flow [2021-06-10 11:35:55,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,579 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:55,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 11:35:55,579 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash -120846856, now seen corresponding path program 1 times [2021-06-10 11:35:55,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823224707] [2021-06-10 11:35:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:55,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:55,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823224707] [2021-06-10 11:35:55,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318554001] [2021-06-10 11:35:55,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2021-06-10 11:35:55,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2021-06-10 11:35:55,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,631 INFO L129 PetriNetUnfolder]: 12/188 cut-off events. [2021-06-10 11:35:55,631 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-10 11:35:55,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 188 events. 12/188 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 604 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2021-06-10 11:35:55,634 INFO L132 encePairwiseOnDemand]: 187/189 looper letters, 8 selfloop transitions, 1 changer transitions 0/165 dead transitions. [2021-06-10 11:35:55,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 165 transitions, 398 flow [2021-06-10 11:35:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-06-10 11:35:55,635 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2021-06-10 11:35:55,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-06-10 11:35:55,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-06-10 11:35:55,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-06-10 11:35:55,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,637 INFO L185 Difference]: Start difference. First operand has 176 places, 167 transitions, 385 flow. Second operand 3 states and 502 transitions. [2021-06-10 11:35:55,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 165 transitions, 398 flow [2021-06-10 11:35:55,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,639 INFO L241 Difference]: Finished difference. Result has 175 places, 165 transitions, 381 flow [2021-06-10 11:35:55,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=175, PETRI_TRANSITIONS=165} [2021-06-10 11:35:55,640 INFO L343 CegarLoopForPetriNet]: 177 programPoint places, -2 predicate places. [2021-06-10 11:35:55,640 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 381 flow [2021-06-10 11:35:55,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,641 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:55,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 11:35:55,641 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash -931767115, now seen corresponding path program 1 times [2021-06-10 11:35:55,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531307500] [2021-06-10 11:35:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:55,652 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:55,659 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:55,674 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:55,674 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:55,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 11:35:55,674 WARN L342 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:55,675 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-06-10 11:35:55,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:55,725 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:55,725 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-06-10 11:35:55,726 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:55,726 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:55,726 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:55,726 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:55,726 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:55,726 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:55,726 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:55,726 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:55,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 511 flow [2021-06-10 11:35:55,767 INFO L129 PetriNetUnfolder]: 36/279 cut-off events. [2021-06-10 11:35:55,768 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2021-06-10 11:35:55,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 279 events. 36/279 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1009 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2021-06-10 11:35:55,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 217 transitions, 511 flow [2021-06-10 11:35:55,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 511 flow [2021-06-10 11:35:55,778 INFO L129 PetriNetUnfolder]: 9/103 cut-off events. [2021-06-10 11:35:55,778 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:55,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,778 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-06-10 11:35:55,779 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 516425364, now seen corresponding path program 1 times [2021-06-10 11:35:55,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474382380] [2021-06-10 11:35:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474382380] [2021-06-10 11:35:55,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145737086] [2021-06-10 11:35:55,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:55,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 217 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:55,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,825 INFO L129 PetriNetUnfolder]: 20/224 cut-off events. [2021-06-10 11:35:55,825 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2021-06-10 11:35:55,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 224 events. 20/224 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 744 event pairs, 0 based on Foata normal form. 31/226 useless extension candidates. Maximal degree in co-relation 228. Up to 8 conditions per place. [2021-06-10 11:35:55,830 INFO L132 encePairwiseOnDemand]: 206/217 looper letters, 6 selfloop transitions, 1 changer transitions 0/198 dead transitions. [2021-06-10 11:35:55,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 198 transitions, 487 flow [2021-06-10 11:35:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2021-06-10 11:35:55,831 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9385560675883257 [2021-06-10 11:35:55,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2021-06-10 11:35:55,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2021-06-10 11:35:55,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2021-06-10 11:35:55,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,835 INFO L185 Difference]: Start difference. First operand has 203 places, 217 transitions, 511 flow. Second operand 3 states and 611 transitions. [2021-06-10 11:35:55,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 198 transitions, 487 flow [2021-06-10 11:35:55,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 445 flow, removed 21 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:55,837 INFO L241 Difference]: Finished difference. Result has 194 places, 197 transitions, 434 flow [2021-06-10 11:35:55,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=194, PETRI_TRANSITIONS=197} [2021-06-10 11:35:55,838 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -9 predicate places. [2021-06-10 11:35:55,838 INFO L480 AbstractCegarLoop]: Abstraction has has 194 places, 197 transitions, 434 flow [2021-06-10 11:35:55,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,838 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,838 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-06-10 11:35:55,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 11:35:55,838 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 515472052, now seen corresponding path program 1 times [2021-06-10 11:35:55,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810630445] [2021-06-10 11:35:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:55,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810630445] [2021-06-10 11:35:55,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107124195] [2021-06-10 11:35:55,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:55,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 197 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:55,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,887 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2021-06-10 11:35:55,887 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:55,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 222 events. 18/222 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 740 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 245. Up to 8 conditions per place. [2021-06-10 11:35:55,891 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 9 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2021-06-10 11:35:55,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 197 transitions, 456 flow [2021-06-10 11:35:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-06-10 11:35:55,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2021-06-10 11:35:55,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-06-10 11:35:55,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-06-10 11:35:55,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-06-10 11:35:55,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,896 INFO L185 Difference]: Start difference. First operand has 194 places, 197 transitions, 434 flow. Second operand 3 states and 583 transitions. [2021-06-10 11:35:55,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 197 transitions, 456 flow [2021-06-10 11:35:55,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 197 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:55,898 INFO L241 Difference]: Finished difference. Result has 197 places, 197 transitions, 445 flow [2021-06-10 11:35:55,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=197, PETRI_TRANSITIONS=197} [2021-06-10 11:35:55,899 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -6 predicate places. [2021-06-10 11:35:55,899 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 197 transitions, 445 flow [2021-06-10 11:35:55,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,900 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-06-10 11:35:55,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 11:35:55,900 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash 515473075, now seen corresponding path program 1 times [2021-06-10 11:35:55,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361741319] [2021-06-10 11:35:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:55,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361741319] [2021-06-10 11:35:55,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098768558] [2021-06-10 11:35:55,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:55,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 197 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:55,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:55,942 INFO L129 PetriNetUnfolder]: 18/219 cut-off events. [2021-06-10 11:35:55,943 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:55,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 219 events. 18/219 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 0 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 237. Up to 8 conditions per place. [2021-06-10 11:35:55,946 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 5 selfloop transitions, 1 changer transitions 0/196 dead transitions. [2021-06-10 11:35:55,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 453 flow [2021-06-10 11:35:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2021-06-10 11:35:55,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9093701996927803 [2021-06-10 11:35:55,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2021-06-10 11:35:55,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2021-06-10 11:35:55,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:55,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2021-06-10 11:35:55,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,950 INFO L185 Difference]: Start difference. First operand has 197 places, 197 transitions, 445 flow. Second operand 3 states and 592 transitions. [2021-06-10 11:35:55,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 453 flow [2021-06-10 11:35:55,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 196 transitions, 447 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:35:55,952 INFO L241 Difference]: Finished difference. Result has 198 places, 196 transitions, 440 flow [2021-06-10 11:35:55,952 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2021-06-10 11:35:55,953 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -5 predicate places. [2021-06-10 11:35:55,953 INFO L480 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 440 flow [2021-06-10 11:35:55,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:55,953 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-06-10 11:35:55,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 11:35:55,953 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 516426387, now seen corresponding path program 1 times [2021-06-10 11:35:55,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:55,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953613610] [2021-06-10 11:35:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:55,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:55,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:55,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:55,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953613610] [2021-06-10 11:35:55,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:55,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:55,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076170839] [2021-06-10 11:35:55,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:55,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:55,973 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:55,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:55,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:55,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:55,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,001 INFO L129 PetriNetUnfolder]: 18/217 cut-off events. [2021-06-10 11:35:56,002 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:56,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 217 events. 18/217 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 706 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 244. Up to 8 conditions per place. [2021-06-10 11:35:56,007 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 8 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2021-06-10 11:35:56,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 194 transitions, 452 flow [2021-06-10 11:35:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2021-06-10 11:35:56,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.890937019969278 [2021-06-10 11:35:56,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,013 INFO L185 Difference]: Start difference. First operand has 198 places, 196 transitions, 440 flow. Second operand 3 states and 580 transitions. [2021-06-10 11:35:56,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 194 transitions, 452 flow [2021-06-10 11:35:56,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 194 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,016 INFO L241 Difference]: Finished difference. Result has 197 places, 194 transitions, 435 flow [2021-06-10 11:35:56,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=197, PETRI_TRANSITIONS=194} [2021-06-10 11:35:56,016 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -6 predicate places. [2021-06-10 11:35:56,016 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 194 transitions, 435 flow [2021-06-10 11:35:56,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,017 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 11:35:56,017 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 632544719, now seen corresponding path program 1 times [2021-06-10 11:35:56,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795787322] [2021-06-10 11:35:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795787322] [2021-06-10 11:35:56,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714438195] [2021-06-10 11:35:56,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:56,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 194 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:56,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,067 INFO L129 PetriNetUnfolder]: 17/224 cut-off events. [2021-06-10 11:35:56,067 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:56,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 224 events. 17/224 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 767 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place. [2021-06-10 11:35:56,071 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 6 selfloop transitions, 1 changer transitions 0/195 dead transitions. [2021-06-10 11:35:56,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 195 transitions, 451 flow [2021-06-10 11:35:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2021-06-10 11:35:56,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9109062980030722 [2021-06-10 11:35:56,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,075 INFO L185 Difference]: Start difference. First operand has 197 places, 194 transitions, 435 flow. Second operand 3 states and 593 transitions. [2021-06-10 11:35:56,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 195 transitions, 451 flow [2021-06-10 11:35:56,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 195 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,077 INFO L241 Difference]: Finished difference. Result has 199 places, 194 transitions, 439 flow [2021-06-10 11:35:56,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=199, PETRI_TRANSITIONS=194} [2021-06-10 11:35:56,078 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -4 predicate places. [2021-06-10 11:35:56,078 INFO L480 AbstractCegarLoop]: Abstraction has has 199 places, 194 transitions, 439 flow [2021-06-10 11:35:56,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,078 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 11:35:56,079 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash 632545742, now seen corresponding path program 1 times [2021-06-10 11:35:56,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030992326] [2021-06-10 11:35:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:56,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030992326] [2021-06-10 11:35:56,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225811676] [2021-06-10 11:35:56,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:56,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 194 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:56,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,129 INFO L129 PetriNetUnfolder]: 15/226 cut-off events. [2021-06-10 11:35:56,130 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:56,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 226 events. 15/226 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 794 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 260. Up to 9 conditions per place. [2021-06-10 11:35:56,133 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 9 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2021-06-10 11:35:56,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 195 transitions, 465 flow [2021-06-10 11:35:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-06-10 11:35:56,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2021-06-10 11:35:56,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,137 INFO L185 Difference]: Start difference. First operand has 199 places, 194 transitions, 439 flow. Second operand 3 states and 583 transitions. [2021-06-10 11:35:56,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 195 transitions, 465 flow [2021-06-10 11:35:56,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 195 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,139 INFO L241 Difference]: Finished difference. Result has 202 places, 195 transitions, 456 flow [2021-06-10 11:35:56,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=202, PETRI_TRANSITIONS=195} [2021-06-10 11:35:56,140 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -1 predicate places. [2021-06-10 11:35:56,140 INFO L480 AbstractCegarLoop]: Abstraction has has 202 places, 195 transitions, 456 flow [2021-06-10 11:35:56,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,140 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,140 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 11:35:56,140 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 631592430, now seen corresponding path program 1 times [2021-06-10 11:35:56,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170309007] [2021-06-10 11:35:56,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170309007] [2021-06-10 11:35:56,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511611002] [2021-06-10 11:35:56,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,158 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:56,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 195 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:56,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,198 INFO L129 PetriNetUnfolder]: 15/219 cut-off events. [2021-06-10 11:35:56,198 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:56,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 219 events. 15/219 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 741 event pairs, 0 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2021-06-10 11:35:56,201 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 5 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2021-06-10 11:35:56,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 193 transitions, 458 flow [2021-06-10 11:35:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2021-06-10 11:35:56,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9093701996927803 [2021-06-10 11:35:56,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,205 INFO L185 Difference]: Start difference. First operand has 202 places, 195 transitions, 456 flow. Second operand 3 states and 592 transitions. [2021-06-10 11:35:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 193 transitions, 458 flow [2021-06-10 11:35:56,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 193 transitions, 450 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:56,207 INFO L241 Difference]: Finished difference. Result has 202 places, 193 transitions, 443 flow [2021-06-10 11:35:56,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=202, PETRI_TRANSITIONS=193} [2021-06-10 11:35:56,207 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -1 predicate places. [2021-06-10 11:35:56,207 INFO L480 AbstractCegarLoop]: Abstraction has has 202 places, 193 transitions, 443 flow [2021-06-10 11:35:56,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,208 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 11:35:56,208 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 631591407, now seen corresponding path program 1 times [2021-06-10 11:35:56,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828072532] [2021-06-10 11:35:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:56,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828072532] [2021-06-10 11:35:56,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715682318] [2021-06-10 11:35:56,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:56,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 193 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:56,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,249 INFO L129 PetriNetUnfolder]: 15/217 cut-off events. [2021-06-10 11:35:56,250 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:56,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 217 events. 15/217 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 725 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 250. Up to 8 conditions per place. [2021-06-10 11:35:56,253 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 8 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2021-06-10 11:35:56,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 191 transitions, 456 flow [2021-06-10 11:35:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2021-06-10 11:35:56,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.890937019969278 [2021-06-10 11:35:56,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2021-06-10 11:35:56,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,257 INFO L185 Difference]: Start difference. First operand has 202 places, 193 transitions, 443 flow. Second operand 3 states and 580 transitions. [2021-06-10 11:35:56,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 191 transitions, 456 flow [2021-06-10 11:35:56,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 191 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,259 INFO L241 Difference]: Finished difference. Result has 201 places, 191 transitions, 439 flow [2021-06-10 11:35:56,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=201, PETRI_TRANSITIONS=191} [2021-06-10 11:35:56,259 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, -2 predicate places. [2021-06-10 11:35:56,259 INFO L480 AbstractCegarLoop]: Abstraction has has 201 places, 191 transitions, 439 flow [2021-06-10 11:35:56,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,260 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,260 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 11:35:56,260 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash -439024470, now seen corresponding path program 1 times [2021-06-10 11:35:56,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849835895] [2021-06-10 11:35:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:56,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849835895] [2021-06-10 11:35:56,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634628886] [2021-06-10 11:35:56,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:56,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 191 transitions, 439 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:56,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,304 INFO L129 PetriNetUnfolder]: 13/222 cut-off events. [2021-06-10 11:35:56,304 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-10 11:35:56,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 222 events. 13/222 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 774 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 253. Up to 8 conditions per place. [2021-06-10 11:35:56,308 INFO L132 encePairwiseOnDemand]: 214/217 looper letters, 5 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2021-06-10 11:35:56,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 192 transitions, 455 flow [2021-06-10 11:35:56,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2021-06-10 11:35:56,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9109062980030722 [2021-06-10 11:35:56,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2021-06-10 11:35:56,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,311 INFO L185 Difference]: Start difference. First operand has 201 places, 191 transitions, 439 flow. Second operand 3 states and 593 transitions. [2021-06-10 11:35:56,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 192 transitions, 455 flow [2021-06-10 11:35:56,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 192 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,313 INFO L241 Difference]: Finished difference. Result has 204 places, 192 transitions, 452 flow [2021-06-10 11:35:56,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=204, PETRI_TRANSITIONS=192} [2021-06-10 11:35:56,314 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, 1 predicate places. [2021-06-10 11:35:56,314 INFO L480 AbstractCegarLoop]: Abstraction has has 204 places, 192 transitions, 452 flow [2021-06-10 11:35:56,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,314 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-10 11:35:56,314 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash -439025493, now seen corresponding path program 1 times [2021-06-10 11:35:56,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138237592] [2021-06-10 11:35:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:56,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:56,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138237592] [2021-06-10 11:35:56,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578228836] [2021-06-10 11:35:56,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,328 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:56,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 192 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:56,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,359 INFO L129 PetriNetUnfolder]: 13/223 cut-off events. [2021-06-10 11:35:56,359 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:56,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 223 events. 13/223 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 784 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 261. Up to 9 conditions per place. [2021-06-10 11:35:56,362 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 9 selfloop transitions, 3 changer transitions 0/193 dead transitions. [2021-06-10 11:35:56,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 193 transitions, 478 flow [2021-06-10 11:35:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-06-10 11:35:56,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2021-06-10 11:35:56,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-06-10 11:35:56,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,366 INFO L185 Difference]: Start difference. First operand has 204 places, 192 transitions, 452 flow. Second operand 3 states and 583 transitions. [2021-06-10 11:35:56,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 193 transitions, 478 flow [2021-06-10 11:35:56,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 193 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,368 INFO L241 Difference]: Finished difference. Result has 207 places, 193 transitions, 468 flow [2021-06-10 11:35:56,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=207, PETRI_TRANSITIONS=193} [2021-06-10 11:35:56,369 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, 4 predicate places. [2021-06-10 11:35:56,369 INFO L480 AbstractCegarLoop]: Abstraction has has 207 places, 193 transitions, 468 flow [2021-06-10 11:35:56,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,369 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-10 11:35:56,369 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash -438071158, now seen corresponding path program 1 times [2021-06-10 11:35:56,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909926306] [2021-06-10 11:35:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:56,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:56,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909926306] [2021-06-10 11:35:56,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213851990] [2021-06-10 11:35:56,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 217 [2021-06-10 11:35:56,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 193 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 217 [2021-06-10 11:35:56,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,414 INFO L129 PetriNetUnfolder]: 12/220 cut-off events. [2021-06-10 11:35:56,414 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:35:56,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 220 events. 12/220 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 768 event pairs, 0 based on Foata normal form. 2/203 useless extension candidates. Maximal degree in co-relation 260. Up to 8 conditions per place. [2021-06-10 11:35:56,417 INFO L132 encePairwiseOnDemand]: 214/217 looper letters, 9 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2021-06-10 11:35:56,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 191 transitions, 476 flow [2021-06-10 11:35:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2021-06-10 11:35:56,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8940092165898618 [2021-06-10 11:35:56,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2021-06-10 11:35:56,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2021-06-10 11:35:56,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2021-06-10 11:35:56,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,420 INFO L185 Difference]: Start difference. First operand has 207 places, 193 transitions, 468 flow. Second operand 3 states and 582 transitions. [2021-06-10 11:35:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 191 transitions, 476 flow [2021-06-10 11:35:56,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 191 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,423 INFO L241 Difference]: Finished difference. Result has 208 places, 191 transitions, 457 flow [2021-06-10 11:35:56,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=208, PETRI_TRANSITIONS=191} [2021-06-10 11:35:56,423 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, 5 predicate places. [2021-06-10 11:35:56,423 INFO L480 AbstractCegarLoop]: Abstraction has has 208 places, 191 transitions, 457 flow [2021-06-10 11:35:56,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,424 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-10 11:35:56,424 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash -438072181, now seen corresponding path program 1 times [2021-06-10 11:35:56,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841197947] [2021-06-10 11:35:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:56,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841197947] [2021-06-10 11:35:56,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600730590] [2021-06-10 11:35:56,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 217 [2021-06-10 11:35:56,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 191 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 217 [2021-06-10 11:35:56,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,473 INFO L129 PetriNetUnfolder]: 12/217 cut-off events. [2021-06-10 11:35:56,473 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:56,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 217 events. 12/217 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 742 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 254. Up to 8 conditions per place. [2021-06-10 11:35:56,476 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 5 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2021-06-10 11:35:56,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 188 transitions, 458 flow [2021-06-10 11:35:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2021-06-10 11:35:56,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9093701996927803 [2021-06-10 11:35:56,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2021-06-10 11:35:56,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,480 INFO L185 Difference]: Start difference. First operand has 208 places, 191 transitions, 457 flow. Second operand 3 states and 592 transitions. [2021-06-10 11:35:56,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 188 transitions, 458 flow [2021-06-10 11:35:56,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 188 transitions, 453 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:56,483 INFO L241 Difference]: Finished difference. Result has 205 places, 188 transitions, 443 flow [2021-06-10 11:35:56,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=205, PETRI_TRANSITIONS=188} [2021-06-10 11:35:56,484 INFO L343 CegarLoopForPetriNet]: 203 programPoint places, 2 predicate places. [2021-06-10 11:35:56,484 INFO L480 AbstractCegarLoop]: Abstraction has has 205 places, 188 transitions, 443 flow [2021-06-10 11:35:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,484 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:56,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-10 11:35:56,484 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1844320494, now seen corresponding path program 1 times [2021-06-10 11:35:56,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675829901] [2021-06-10 11:35:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:56,492 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:56,497 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:56,507 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:56,507 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:56,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-10 11:35:56,507 WARN L342 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:56,508 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-06-10 11:35:56,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:56,562 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:56,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-06-10 11:35:56,563 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:56,563 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:56,563 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:56,563 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:56,563 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:56,563 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:56,563 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:56,563 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:56,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 229 places, 245 transitions, 586 flow [2021-06-10 11:35:56,612 INFO L129 PetriNetUnfolder]: 41/316 cut-off events. [2021-06-10 11:35:56,612 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2021-06-10 11:35:56,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 316 events. 41/316 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1142 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 319. Up to 18 conditions per place. [2021-06-10 11:35:56,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 245 transitions, 586 flow [2021-06-10 11:35:56,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 245 transitions, 586 flow [2021-06-10 11:35:56,621 INFO L129 PetriNetUnfolder]: 8/100 cut-off events. [2021-06-10 11:35:56,621 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:56,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,621 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-06-10 11:35:56,621 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 117527087, now seen corresponding path program 1 times [2021-06-10 11:35:56,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610383360] [2021-06-10 11:35:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:56,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:56,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610383360] [2021-06-10 11:35:56,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706365118] [2021-06-10 11:35:56,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:56,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 245 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:56,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,672 INFO L129 PetriNetUnfolder]: 23/254 cut-off events. [2021-06-10 11:35:56,672 INFO L130 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2021-06-10 11:35:56,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 254 events. 23/254 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 870 event pairs, 0 based on Foata normal form. 40/261 useless extension candidates. Maximal degree in co-relation 272. Up to 9 conditions per place. [2021-06-10 11:35:56,677 INFO L132 encePairwiseOnDemand]: 230/245 looper letters, 10 selfloop transitions, 3 changer transitions 0/225 dead transitions. [2021-06-10 11:35:56,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 572 flow [2021-06-10 11:35:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2021-06-10 11:35:56,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9292517006802721 [2021-06-10 11:35:56,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 683 transitions. [2021-06-10 11:35:56,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 683 transitions. [2021-06-10 11:35:56,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 683 transitions. [2021-06-10 11:35:56,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,681 INFO L185 Difference]: Start difference. First operand has 229 places, 245 transitions, 586 flow. Second operand 3 states and 683 transitions. [2021-06-10 11:35:56,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 572 flow [2021-06-10 11:35:56,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 225 transitions, 516 flow, removed 28 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:56,684 INFO L241 Difference]: Finished difference. Result has 220 places, 225 transitions, 510 flow [2021-06-10 11:35:56,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=220, PETRI_TRANSITIONS=225} [2021-06-10 11:35:56,684 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -9 predicate places. [2021-06-10 11:35:56,684 INFO L480 AbstractCegarLoop]: Abstraction has has 220 places, 225 transitions, 510 flow [2021-06-10 11:35:56,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,684 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-06-10 11:35:56,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-10 11:35:56,685 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 118480399, now seen corresponding path program 1 times [2021-06-10 11:35:56,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65204051] [2021-06-10 11:35:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:56,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65204051] [2021-06-10 11:35:56,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338156264] [2021-06-10 11:35:56,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,703 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:56,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 225 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:56,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,731 INFO L129 PetriNetUnfolder]: 21/251 cut-off events. [2021-06-10 11:35:56,731 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:56,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 251 events. 21/251 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 859 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 268. Up to 9 conditions per place. [2021-06-10 11:35:56,735 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 6 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2021-06-10 11:35:56,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 224 transitions, 516 flow [2021-06-10 11:35:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2021-06-10 11:35:56,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9129251700680272 [2021-06-10 11:35:56,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,744 INFO L185 Difference]: Start difference. First operand has 220 places, 225 transitions, 510 flow. Second operand 3 states and 671 transitions. [2021-06-10 11:35:56,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 224 transitions, 516 flow [2021-06-10 11:35:56,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 512 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,747 INFO L241 Difference]: Finished difference. Result has 222 places, 223 transitions, 501 flow [2021-06-10 11:35:56,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2021-06-10 11:35:56,747 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -7 predicate places. [2021-06-10 11:35:56,747 INFO L480 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 501 flow [2021-06-10 11:35:56,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,748 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-06-10 11:35:56,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-10 11:35:56,748 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 117528110, now seen corresponding path program 1 times [2021-06-10 11:35:56,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313862062] [2021-06-10 11:35:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:56,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313862062] [2021-06-10 11:35:56,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975165683] [2021-06-10 11:35:56,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:56,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:56,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,788 INFO L129 PetriNetUnfolder]: 21/248 cut-off events. [2021-06-10 11:35:56,789 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:56,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 248 events. 21/248 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 840 event pairs, 0 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 271. Up to 9 conditions per place. [2021-06-10 11:35:56,793 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 5 selfloop transitions, 1 changer transitions 0/222 dead transitions. [2021-06-10 11:35:56,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 222 transitions, 509 flow [2021-06-10 11:35:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2021-06-10 11:35:56,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2021-06-10 11:35:56,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2021-06-10 11:35:56,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2021-06-10 11:35:56,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2021-06-10 11:35:56,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,797 INFO L185 Difference]: Start difference. First operand has 222 places, 223 transitions, 501 flow. Second operand 3 states and 670 transitions. [2021-06-10 11:35:56,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 222 transitions, 509 flow [2021-06-10 11:35:56,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 222 transitions, 504 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:35:56,800 INFO L241 Difference]: Finished difference. Result has 223 places, 222 transitions, 497 flow [2021-06-10 11:35:56,800 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=223, PETRI_TRANSITIONS=222} [2021-06-10 11:35:56,800 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -6 predicate places. [2021-06-10 11:35:56,800 INFO L480 AbstractCegarLoop]: Abstraction has has 223 places, 222 transitions, 497 flow [2021-06-10 11:35:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,801 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-06-10 11:35:56,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-10 11:35:56,801 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 118481422, now seen corresponding path program 1 times [2021-06-10 11:35:56,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883930604] [2021-06-10 11:35:56,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:56,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:56,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883930604] [2021-06-10 11:35:56,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574247492] [2021-06-10 11:35:56,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,818 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:56,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 222 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:56,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,847 INFO L129 PetriNetUnfolder]: 21/246 cut-off events. [2021-06-10 11:35:56,847 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:56,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 246 events. 21/246 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 828 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 276. Up to 9 conditions per place. [2021-06-10 11:35:56,851 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 8 selfloop transitions, 1 changer transitions 0/220 dead transitions. [2021-06-10 11:35:56,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 509 flow [2021-06-10 11:35:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-06-10 11:35:56,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8952380952380953 [2021-06-10 11:35:56,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-06-10 11:35:56,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-06-10 11:35:56,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-06-10 11:35:56,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,855 INFO L185 Difference]: Start difference. First operand has 223 places, 222 transitions, 497 flow. Second operand 3 states and 658 transitions. [2021-06-10 11:35:56,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 509 flow [2021-06-10 11:35:56,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 220 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,858 INFO L241 Difference]: Finished difference. Result has 222 places, 220 transitions, 492 flow [2021-06-10 11:35:56,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2021-06-10 11:35:56,860 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -7 predicate places. [2021-06-10 11:35:56,860 INFO L480 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 492 flow [2021-06-10 11:35:56,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,860 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,860 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-10 11:35:56,860 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1444842683, now seen corresponding path program 1 times [2021-06-10 11:35:56,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310454332] [2021-06-10 11:35:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:56,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310454332] [2021-06-10 11:35:56,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464108768] [2021-06-10 11:35:56,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:56,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:56,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,917 INFO L129 PetriNetUnfolder]: 20/254 cut-off events. [2021-06-10 11:35:56,917 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:56,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 254 events. 20/254 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 897 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 288. Up to 9 conditions per place. [2021-06-10 11:35:56,922 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 10 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2021-06-10 11:35:56,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 222 transitions, 522 flow [2021-06-10 11:35:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2021-06-10 11:35:56,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9020408163265307 [2021-06-10 11:35:56,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2021-06-10 11:35:56,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2021-06-10 11:35:56,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2021-06-10 11:35:56,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,925 INFO L185 Difference]: Start difference. First operand has 222 places, 220 transitions, 492 flow. Second operand 3 states and 663 transitions. [2021-06-10 11:35:56,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 222 transitions, 522 flow [2021-06-10 11:35:56,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,928 INFO L241 Difference]: Finished difference. Result has 225 places, 222 transitions, 515 flow [2021-06-10 11:35:56,929 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2021-06-10 11:35:56,930 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -4 predicate places. [2021-06-10 11:35:56,930 INFO L480 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 515 flow [2021-06-10 11:35:56,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,930 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-10 11:35:56,930 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1444841660, now seen corresponding path program 1 times [2021-06-10 11:35:56,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792813157] [2021-06-10 11:35:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:56,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:56,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:56,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:56,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792813157] [2021-06-10 11:35:56,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:56,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:56,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093157980] [2021-06-10 11:35:56,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:56,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:56,945 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:56,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:56,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:56,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:56,976 INFO L129 PetriNetUnfolder]: 19/252 cut-off events. [2021-06-10 11:35:56,976 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:35:56,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 252 events. 19/252 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 884 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 285. Up to 9 conditions per place. [2021-06-10 11:35:56,983 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 5 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2021-06-10 11:35:56,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 222 transitions, 527 flow [2021-06-10 11:35:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2021-06-10 11:35:56,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9129251700680272 [2021-06-10 11:35:56,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:56,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2021-06-10 11:35:56,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,987 INFO L185 Difference]: Start difference. First operand has 225 places, 222 transitions, 515 flow. Second operand 3 states and 671 transitions. [2021-06-10 11:35:56,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 222 transitions, 527 flow [2021-06-10 11:35:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 222 transitions, 522 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:56,990 INFO L241 Difference]: Finished difference. Result has 228 places, 222 transitions, 520 flow [2021-06-10 11:35:56,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=228, PETRI_TRANSITIONS=222} [2021-06-10 11:35:56,991 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -1 predicate places. [2021-06-10 11:35:56,991 INFO L480 AbstractCegarLoop]: Abstraction has has 228 places, 222 transitions, 520 flow [2021-06-10 11:35:56,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:56,991 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:56,991 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:56,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-10 11:35:56,992 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1443889371, now seen corresponding path program 1 times [2021-06-10 11:35:56,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:56,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133092925] [2021-06-10 11:35:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:57,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133092925] [2021-06-10 11:35:57,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413948886] [2021-06-10 11:35:57,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:57,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 222 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:57,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,056 INFO L129 PetriNetUnfolder]: 18/248 cut-off events. [2021-06-10 11:35:57,056 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:57,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 248 events. 18/248 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 860 event pairs, 0 based on Foata normal form. 1/224 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2021-06-10 11:35:57,061 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 5 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2021-06-10 11:35:57,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 219 transitions, 517 flow [2021-06-10 11:35:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2021-06-10 11:35:57,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2021-06-10 11:35:57,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,065 INFO L185 Difference]: Start difference. First operand has 228 places, 222 transitions, 520 flow. Second operand 3 states and 670 transitions. [2021-06-10 11:35:57,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 219 transitions, 517 flow [2021-06-10 11:35:57,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 219 transitions, 510 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:57,067 INFO L241 Difference]: Finished difference. Result has 227 places, 219 transitions, 500 flow [2021-06-10 11:35:57,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=227, PETRI_TRANSITIONS=219} [2021-06-10 11:35:57,068 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -2 predicate places. [2021-06-10 11:35:57,068 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 219 transitions, 500 flow [2021-06-10 11:35:57,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,068 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-10 11:35:57,068 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1443888348, now seen corresponding path program 1 times [2021-06-10 11:35:57,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795437232] [2021-06-10 11:35:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:57,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:57,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795437232] [2021-06-10 11:35:57,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023792967] [2021-06-10 11:35:57,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:57,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 219 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:57,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,128 INFO L129 PetriNetUnfolder]: 18/246 cut-off events. [2021-06-10 11:35:57,128 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:57,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 246 events. 18/246 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 845 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 283. Up to 9 conditions per place. [2021-06-10 11:35:57,132 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 8 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2021-06-10 11:35:57,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 217 transitions, 513 flow [2021-06-10 11:35:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-06-10 11:35:57,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8952380952380953 [2021-06-10 11:35:57,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,136 INFO L185 Difference]: Start difference. First operand has 227 places, 219 transitions, 500 flow. Second operand 3 states and 658 transitions. [2021-06-10 11:35:57,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 217 transitions, 513 flow [2021-06-10 11:35:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 217 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,139 INFO L241 Difference]: Finished difference. Result has 226 places, 217 transitions, 496 flow [2021-06-10 11:35:57,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2021-06-10 11:35:57,139 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, -3 predicate places. [2021-06-10 11:35:57,139 INFO L480 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 496 flow [2021-06-10 11:35:57,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,140 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,140 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-10 11:35:57,140 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2054097317, now seen corresponding path program 1 times [2021-06-10 11:35:57,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927699723] [2021-06-10 11:35:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:57,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927699723] [2021-06-10 11:35:57,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710995499] [2021-06-10 11:35:57,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:57,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:57,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,201 INFO L129 PetriNetUnfolder]: 16/251 cut-off events. [2021-06-10 11:35:57,202 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:57,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 251 events. 16/251 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 898 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 286. Up to 9 conditions per place. [2021-06-10 11:35:57,205 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 5 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2021-06-10 11:35:57,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 218 transitions, 512 flow [2021-06-10 11:35:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2021-06-10 11:35:57,207 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9129251700680272 [2021-06-10 11:35:57,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,210 INFO L185 Difference]: Start difference. First operand has 226 places, 217 transitions, 496 flow. Second operand 3 states and 671 transitions. [2021-06-10 11:35:57,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 218 transitions, 512 flow [2021-06-10 11:35:57,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 218 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,214 INFO L241 Difference]: Finished difference. Result has 229 places, 218 transitions, 509 flow [2021-06-10 11:35:57,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=229, PETRI_TRANSITIONS=218} [2021-06-10 11:35:57,214 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2021-06-10 11:35:57,215 INFO L480 AbstractCegarLoop]: Abstraction has has 229 places, 218 transitions, 509 flow [2021-06-10 11:35:57,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,215 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-10 11:35:57,215 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2054098340, now seen corresponding path program 1 times [2021-06-10 11:35:57,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330514381] [2021-06-10 11:35:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:57,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:57,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330514381] [2021-06-10 11:35:57,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894745371] [2021-06-10 11:35:57,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:57,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 218 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:57,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,271 INFO L129 PetriNetUnfolder]: 16/252 cut-off events. [2021-06-10 11:35:57,271 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:57,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 252 events. 16/252 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 906 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 294. Up to 9 conditions per place. [2021-06-10 11:35:57,274 INFO L132 encePairwiseOnDemand]: 241/245 looper letters, 9 selfloop transitions, 3 changer transitions 0/219 dead transitions. [2021-06-10 11:35:57,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 219 transitions, 535 flow [2021-06-10 11:35:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2021-06-10 11:35:57,278 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8993197278911564 [2021-06-10 11:35:57,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2021-06-10 11:35:57,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2021-06-10 11:35:57,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2021-06-10 11:35:57,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,279 INFO L185 Difference]: Start difference. First operand has 229 places, 218 transitions, 509 flow. Second operand 3 states and 661 transitions. [2021-06-10 11:35:57,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 219 transitions, 535 flow [2021-06-10 11:35:57,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 219 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,282 INFO L241 Difference]: Finished difference. Result has 232 places, 219 transitions, 525 flow [2021-06-10 11:35:57,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=232, PETRI_TRANSITIONS=219} [2021-06-10 11:35:57,283 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 3 predicate places. [2021-06-10 11:35:57,283 INFO L480 AbstractCegarLoop]: Abstraction has has 232 places, 219 transitions, 525 flow [2021-06-10 11:35:57,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,283 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-10 11:35:57,283 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2053145028, now seen corresponding path program 1 times [2021-06-10 11:35:57,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748935201] [2021-06-10 11:35:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:57,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748935201] [2021-06-10 11:35:57,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025952525] [2021-06-10 11:35:57,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,296 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:57,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 219 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:57,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,326 INFO L129 PetriNetUnfolder]: 15/248 cut-off events. [2021-06-10 11:35:57,326 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:35:57,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 248 events. 15/248 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 876 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 287. Up to 9 conditions per place. [2021-06-10 11:35:57,329 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 5 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2021-06-10 11:35:57,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 216 transitions, 522 flow [2021-06-10 11:35:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2021-06-10 11:35:57,330 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2021-06-10 11:35:57,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,332 INFO L185 Difference]: Start difference. First operand has 232 places, 219 transitions, 525 flow. Second operand 3 states and 670 transitions. [2021-06-10 11:35:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 216 transitions, 522 flow [2021-06-10 11:35:57,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 216 transitions, 514 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:57,335 INFO L241 Difference]: Finished difference. Result has 231 places, 216 transitions, 504 flow [2021-06-10 11:35:57,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=231, PETRI_TRANSITIONS=216} [2021-06-10 11:35:57,335 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 2 predicate places. [2021-06-10 11:35:57,335 INFO L480 AbstractCegarLoop]: Abstraction has has 231 places, 216 transitions, 504 flow [2021-06-10 11:35:57,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,336 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,336 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-10 11:35:57,336 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2053144005, now seen corresponding path program 1 times [2021-06-10 11:35:57,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399716948] [2021-06-10 11:35:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:57,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:57,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399716948] [2021-06-10 11:35:57,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490834487] [2021-06-10 11:35:57,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:57,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 216 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:57,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,379 INFO L129 PetriNetUnfolder]: 15/246 cut-off events. [2021-06-10 11:35:57,379 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:57,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 246 events. 15/246 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 862 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 290. Up to 9 conditions per place. [2021-06-10 11:35:57,383 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 8 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2021-06-10 11:35:57,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 214 transitions, 517 flow [2021-06-10 11:35:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-06-10 11:35:57,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8952380952380953 [2021-06-10 11:35:57,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,386 INFO L185 Difference]: Start difference. First operand has 231 places, 216 transitions, 504 flow. Second operand 3 states and 658 transitions. [2021-06-10 11:35:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 214 transitions, 517 flow [2021-06-10 11:35:57,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 214 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,389 INFO L241 Difference]: Finished difference. Result has 230 places, 214 transitions, 500 flow [2021-06-10 11:35:57,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=230, PETRI_TRANSITIONS=214} [2021-06-10 11:35:57,389 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 1 predicate places. [2021-06-10 11:35:57,389 INFO L480 AbstractCegarLoop]: Abstraction has has 230 places, 214 transitions, 500 flow [2021-06-10 11:35:57,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,389 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-10 11:35:57,390 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1499500276, now seen corresponding path program 1 times [2021-06-10 11:35:57,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504834628] [2021-06-10 11:35:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:57,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:57,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504834628] [2021-06-10 11:35:57,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287344563] [2021-06-10 11:35:57,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:57,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 214 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:57,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,440 INFO L129 PetriNetUnfolder]: 14/254 cut-off events. [2021-06-10 11:35:57,440 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:57,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 254 events. 14/254 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 934 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 302. Up to 9 conditions per place. [2021-06-10 11:35:57,443 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 10 selfloop transitions, 3 changer transitions 0/216 dead transitions. [2021-06-10 11:35:57,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 216 transitions, 530 flow [2021-06-10 11:35:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2021-06-10 11:35:57,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9020408163265307 [2021-06-10 11:35:57,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2021-06-10 11:35:57,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2021-06-10 11:35:57,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2021-06-10 11:35:57,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,446 INFO L185 Difference]: Start difference. First operand has 230 places, 214 transitions, 500 flow. Second operand 3 states and 663 transitions. [2021-06-10 11:35:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 216 transitions, 530 flow [2021-06-10 11:35:57,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 216 transitions, 529 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,449 INFO L241 Difference]: Finished difference. Result has 233 places, 216 transitions, 523 flow [2021-06-10 11:35:57,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=233, PETRI_TRANSITIONS=216} [2021-06-10 11:35:57,449 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 4 predicate places. [2021-06-10 11:35:57,450 INFO L480 AbstractCegarLoop]: Abstraction has has 233 places, 216 transitions, 523 flow [2021-06-10 11:35:57,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,450 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-10 11:35:57,450 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1499501299, now seen corresponding path program 1 times [2021-06-10 11:35:57,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845463183] [2021-06-10 11:35:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:57,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845463183] [2021-06-10 11:35:57,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024168222] [2021-06-10 11:35:57,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:57,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 216 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:57,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,494 INFO L129 PetriNetUnfolder]: 13/252 cut-off events. [2021-06-10 11:35:57,494 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:35:57,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 252 events. 13/252 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 919 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 299. Up to 9 conditions per place. [2021-06-10 11:35:57,498 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 5 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2021-06-10 11:35:57,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 216 transitions, 535 flow [2021-06-10 11:35:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2021-06-10 11:35:57,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9129251700680272 [2021-06-10 11:35:57,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2021-06-10 11:35:57,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,501 INFO L185 Difference]: Start difference. First operand has 233 places, 216 transitions, 523 flow. Second operand 3 states and 671 transitions. [2021-06-10 11:35:57,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 216 transitions, 535 flow [2021-06-10 11:35:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 216 transitions, 530 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,504 INFO L241 Difference]: Finished difference. Result has 236 places, 216 transitions, 528 flow [2021-06-10 11:35:57,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=236, PETRI_TRANSITIONS=216} [2021-06-10 11:35:57,504 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 7 predicate places. [2021-06-10 11:35:57,504 INFO L480 AbstractCegarLoop]: Abstraction has has 236 places, 216 transitions, 528 flow [2021-06-10 11:35:57,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,504 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,504 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-10 11:35:57,504 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1500453588, now seen corresponding path program 1 times [2021-06-10 11:35:57,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462856544] [2021-06-10 11:35:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:57,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462856544] [2021-06-10 11:35:57,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174360406] [2021-06-10 11:35:57,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 245 [2021-06-10 11:35:57,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 216 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 245 [2021-06-10 11:35:57,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,561 INFO L129 PetriNetUnfolder]: 12/248 cut-off events. [2021-06-10 11:35:57,561 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:57,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 248 events. 12/248 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 895 event pairs, 0 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 296. Up to 9 conditions per place. [2021-06-10 11:35:57,564 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 5 selfloop transitions, 1 changer transitions 0/213 dead transitions. [2021-06-10 11:35:57,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 213 transitions, 525 flow [2021-06-10 11:35:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2021-06-10 11:35:57,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9115646258503401 [2021-06-10 11:35:57,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2021-06-10 11:35:57,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,567 INFO L185 Difference]: Start difference. First operand has 236 places, 216 transitions, 528 flow. Second operand 3 states and 670 transitions. [2021-06-10 11:35:57,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 213 transitions, 525 flow [2021-06-10 11:35:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 213 transitions, 518 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:57,569 INFO L241 Difference]: Finished difference. Result has 235 places, 213 transitions, 508 flow [2021-06-10 11:35:57,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=235, PETRI_TRANSITIONS=213} [2021-06-10 11:35:57,570 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 6 predicate places. [2021-06-10 11:35:57,570 INFO L480 AbstractCegarLoop]: Abstraction has has 235 places, 213 transitions, 508 flow [2021-06-10 11:35:57,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,570 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:57,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-10 11:35:57,570 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1500454611, now seen corresponding path program 1 times [2021-06-10 11:35:57,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112543541] [2021-06-10 11:35:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:57,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:57,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112543541] [2021-06-10 11:35:57,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165154270] [2021-06-10 11:35:57,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2021-06-10 11:35:57,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 213 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2021-06-10 11:35:57,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,619 INFO L129 PetriNetUnfolder]: 12/246 cut-off events. [2021-06-10 11:35:57,620 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:57,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 246 events. 12/246 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 881 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 297. Up to 9 conditions per place. [2021-06-10 11:35:57,623 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 8 selfloop transitions, 1 changer transitions 0/211 dead transitions. [2021-06-10 11:35:57,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 211 transitions, 521 flow [2021-06-10 11:35:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-06-10 11:35:57,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8952380952380953 [2021-06-10 11:35:57,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-06-10 11:35:57,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,626 INFO L185 Difference]: Start difference. First operand has 235 places, 213 transitions, 508 flow. Second operand 3 states and 658 transitions. [2021-06-10 11:35:57,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 211 transitions, 521 flow [2021-06-10 11:35:57,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 211 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,628 INFO L241 Difference]: Finished difference. Result has 234 places, 211 transitions, 504 flow [2021-06-10 11:35:57,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=234, PETRI_TRANSITIONS=211} [2021-06-10 11:35:57,629 INFO L343 CegarLoopForPetriNet]: 229 programPoint places, 5 predicate places. [2021-06-10 11:35:57,629 INFO L480 AbstractCegarLoop]: Abstraction has has 234 places, 211 transitions, 504 flow [2021-06-10 11:35:57,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,629 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:57,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-10 11:35:57,629 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,629 INFO L82 PathProgramCache]: Analyzing trace with hash -83565658, now seen corresponding path program 1 times [2021-06-10 11:35:57,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062801288] [2021-06-10 11:35:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:57,636 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:57,639 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:57,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:57,644 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:57,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-10 11:35:57,644 WARN L342 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:57,644 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of9ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of9ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:57,697 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:57,697 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-06-10 11:35:57,697 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:57,697 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:57,697 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:57,697 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:57,697 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:57,697 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:57,697 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:57,697 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:57,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 255 places, 273 transitions, 663 flow [2021-06-10 11:35:57,731 INFO L129 PetriNetUnfolder]: 46/353 cut-off events. [2021-06-10 11:35:57,731 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2021-06-10 11:35:57,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 353 events. 46/353 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1297 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 367. Up to 20 conditions per place. [2021-06-10 11:35:57,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 273 transitions, 663 flow [2021-06-10 11:35:57,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 273 transitions, 663 flow [2021-06-10 11:35:57,744 INFO L129 PetriNetUnfolder]: 10/104 cut-off events. [2021-06-10 11:35:57,744 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:57,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,744 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-06-10 11:35:57,744 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2060838409, now seen corresponding path program 1 times [2021-06-10 11:35:57,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276206018] [2021-06-10 11:35:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:57,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:57,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276206018] [2021-06-10 11:35:57,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453840938] [2021-06-10 11:35:57,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:57,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 273 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:57,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,797 INFO L129 PetriNetUnfolder]: 26/283 cut-off events. [2021-06-10 11:35:57,797 INFO L130 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2021-06-10 11:35:57,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 283 events. 26/283 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 997 event pairs, 0 based on Foata normal form. 44/290 useless extension candidates. Maximal degree in co-relation 310. Up to 10 conditions per place. [2021-06-10 11:35:57,803 INFO L132 encePairwiseOnDemand]: 257/273 looper letters, 10 selfloop transitions, 3 changer transitions 0/251 dead transitions. [2021-06-10 11:35:57,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 251 transitions, 645 flow [2021-06-10 11:35:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2021-06-10 11:35:57,804 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9316239316239316 [2021-06-10 11:35:57,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 763 transitions. [2021-06-10 11:35:57,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 763 transitions. [2021-06-10 11:35:57,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 763 transitions. [2021-06-10 11:35:57,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,806 INFO L185 Difference]: Start difference. First operand has 255 places, 273 transitions, 663 flow. Second operand 3 states and 763 transitions. [2021-06-10 11:35:57,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 251 transitions, 645 flow [2021-06-10 11:35:57,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 251 transitions, 573 flow, removed 36 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:57,810 INFO L241 Difference]: Finished difference. Result has 245 places, 251 transitions, 567 flow [2021-06-10 11:35:57,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=245, PETRI_TRANSITIONS=251} [2021-06-10 11:35:57,810 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -10 predicate places. [2021-06-10 11:35:57,810 INFO L480 AbstractCegarLoop]: Abstraction has has 245 places, 251 transitions, 567 flow [2021-06-10 11:35:57,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,810 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-06-10 11:35:57,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-10 11:35:57,811 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2059885097, now seen corresponding path program 1 times [2021-06-10 11:35:57,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126071719] [2021-06-10 11:35:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:57,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126071719] [2021-06-10 11:35:57,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147155440] [2021-06-10 11:35:57,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:57,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 251 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:57,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,860 INFO L129 PetriNetUnfolder]: 25/279 cut-off events. [2021-06-10 11:35:57,860 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:57,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 279 events. 25/279 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 972 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 300. Up to 10 conditions per place. [2021-06-10 11:35:57,865 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 5 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2021-06-10 11:35:57,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 250 transitions, 573 flow [2021-06-10 11:35:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2021-06-10 11:35:57,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-06-10 11:35:57,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2021-06-10 11:35:57,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2021-06-10 11:35:57,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2021-06-10 11:35:57,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,869 INFO L185 Difference]: Start difference. First operand has 245 places, 251 transitions, 567 flow. Second operand 3 states and 749 transitions. [2021-06-10 11:35:57,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 250 transitions, 573 flow [2021-06-10 11:35:57,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 250 transitions, 569 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:57,872 INFO L241 Difference]: Finished difference. Result has 248 places, 250 transitions, 567 flow [2021-06-10 11:35:57,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=248, PETRI_TRANSITIONS=250} [2021-06-10 11:35:57,872 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -7 predicate places. [2021-06-10 11:35:57,872 INFO L480 AbstractCegarLoop]: Abstraction has has 248 places, 250 transitions, 567 flow [2021-06-10 11:35:57,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,872 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-06-10 11:35:57,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-10 11:35:57,873 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2060837386, now seen corresponding path program 1 times [2021-06-10 11:35:57,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901734640] [2021-06-10 11:35:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:57,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:57,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901734640] [2021-06-10 11:35:57,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119637962] [2021-06-10 11:35:57,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:57,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 250 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:57,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,918 INFO L129 PetriNetUnfolder]: 24/277 cut-off events. [2021-06-10 11:35:57,918 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:57,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 277 events. 24/277 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 964 event pairs, 0 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 303. Up to 10 conditions per place. [2021-06-10 11:35:57,923 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 0/248 dead transitions. [2021-06-10 11:35:57,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 248 transitions, 569 flow [2021-06-10 11:35:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2021-06-10 11:35:57,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9133089133089133 [2021-06-10 11:35:57,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2021-06-10 11:35:57,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2021-06-10 11:35:57,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:57,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2021-06-10 11:35:57,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,926 INFO L185 Difference]: Start difference. First operand has 248 places, 250 transitions, 567 flow. Second operand 3 states and 748 transitions. [2021-06-10 11:35:57,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 248 transitions, 569 flow [2021-06-10 11:35:57,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 248 transitions, 564 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:35:57,929 INFO L241 Difference]: Finished difference. Result has 248 places, 248 transitions, 554 flow [2021-06-10 11:35:57,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=248, PETRI_TRANSITIONS=248} [2021-06-10 11:35:57,930 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -7 predicate places. [2021-06-10 11:35:57,930 INFO L480 AbstractCegarLoop]: Abstraction has has 248 places, 248 transitions, 554 flow [2021-06-10 11:35:57,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:57,930 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-06-10 11:35:57,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-10 11:35:57,930 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2059884074, now seen corresponding path program 1 times [2021-06-10 11:35:57,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:57,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220446148] [2021-06-10 11:35:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:57,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:57,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:57,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:57,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220446148] [2021-06-10 11:35:57,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:57,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:57,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082679834] [2021-06-10 11:35:57,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:57,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:57,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:57,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 248 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:57,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:57,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:57,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:57,977 INFO L129 PetriNetUnfolder]: 24/275 cut-off events. [2021-06-10 11:35:57,978 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-10 11:35:58,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 275 events. 24/275 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 950 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 309. Up to 10 conditions per place. [2021-06-10 11:35:58,014 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 8 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2021-06-10 11:35:58,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 246 transitions, 566 flow [2021-06-10 11:35:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-06-10 11:35:58,015 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2021-06-10 11:35:58,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,017 INFO L185 Difference]: Start difference. First operand has 248 places, 248 transitions, 554 flow. Second operand 3 states and 736 transitions. [2021-06-10 11:35:58,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 246 transitions, 566 flow [2021-06-10 11:35:58,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 246 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,020 INFO L241 Difference]: Finished difference. Result has 247 places, 246 transitions, 549 flow [2021-06-10 11:35:58,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=247, PETRI_TRANSITIONS=246} [2021-06-10 11:35:58,021 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -8 predicate places. [2021-06-10 11:35:58,021 INFO L480 AbstractCegarLoop]: Abstraction has has 247 places, 246 transitions, 549 flow [2021-06-10 11:35:58,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,021 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-10 11:35:58,021 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1738822939, now seen corresponding path program 1 times [2021-06-10 11:35:58,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794113890] [2021-06-10 11:35:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:58,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:58,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794113890] [2021-06-10 11:35:58,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742980943] [2021-06-10 11:35:58,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 246 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,079 INFO L129 PetriNetUnfolder]: 23/283 cut-off events. [2021-06-10 11:35:58,079 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:58,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 283 events. 23/283 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1021 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 320. Up to 10 conditions per place. [2021-06-10 11:35:58,084 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 10 selfloop transitions, 3 changer transitions 0/248 dead transitions. [2021-06-10 11:35:58,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 579 flow [2021-06-10 11:35:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2021-06-10 11:35:58,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:58,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,088 INFO L185 Difference]: Start difference. First operand has 247 places, 246 transitions, 549 flow. Second operand 3 states and 741 transitions. [2021-06-10 11:35:58,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 579 flow [2021-06-10 11:35:58,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,091 INFO L241 Difference]: Finished difference. Result has 250 places, 248 transitions, 572 flow [2021-06-10 11:35:58,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=250, PETRI_TRANSITIONS=248} [2021-06-10 11:35:58,091 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -5 predicate places. [2021-06-10 11:35:58,091 INFO L480 AbstractCegarLoop]: Abstraction has has 250 places, 248 transitions, 572 flow [2021-06-10 11:35:58,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,092 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-10 11:35:58,092 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1738823962, now seen corresponding path program 1 times [2021-06-10 11:35:58,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596359244] [2021-06-10 11:35:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:58,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596359244] [2021-06-10 11:35:58,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396896472] [2021-06-10 11:35:58,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 248 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,145 INFO L129 PetriNetUnfolder]: 22/281 cut-off events. [2021-06-10 11:35:58,145 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:58,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 281 events. 22/281 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1011 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 317. Up to 10 conditions per place. [2021-06-10 11:35:58,150 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 5 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2021-06-10 11:35:58,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 248 transitions, 584 flow [2021-06-10 11:35:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2021-06-10 11:35:58,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-06-10 11:35:58,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,154 INFO L185 Difference]: Start difference. First operand has 250 places, 248 transitions, 572 flow. Second operand 3 states and 749 transitions. [2021-06-10 11:35:58,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 248 transitions, 584 flow [2021-06-10 11:35:58,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 248 transitions, 579 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,157 INFO L241 Difference]: Finished difference. Result has 253 places, 248 transitions, 577 flow [2021-06-10 11:35:58,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2021-06-10 11:35:58,157 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -2 predicate places. [2021-06-10 11:35:58,157 INFO L480 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 577 flow [2021-06-10 11:35:58,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,157 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-10 11:35:58,157 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1739776251, now seen corresponding path program 1 times [2021-06-10 11:35:58,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777776894] [2021-06-10 11:35:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:58,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777776894] [2021-06-10 11:35:58,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183173553] [2021-06-10 11:35:58,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,170 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,204 INFO L129 PetriNetUnfolder]: 21/277 cut-off events. [2021-06-10 11:35:58,204 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:35:58,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 277 events. 21/277 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 984 event pairs, 0 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 315. Up to 10 conditions per place. [2021-06-10 11:35:58,209 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 0/245 dead transitions. [2021-06-10 11:35:58,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 245 transitions, 574 flow [2021-06-10 11:35:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2021-06-10 11:35:58,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9133089133089133 [2021-06-10 11:35:58,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,212 INFO L185 Difference]: Start difference. First operand has 253 places, 248 transitions, 577 flow. Second operand 3 states and 748 transitions. [2021-06-10 11:35:58,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 245 transitions, 574 flow [2021-06-10 11:35:58,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 245 transitions, 567 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:58,215 INFO L241 Difference]: Finished difference. Result has 252 places, 245 transitions, 557 flow [2021-06-10 11:35:58,215 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=252, PETRI_TRANSITIONS=245} [2021-06-10 11:35:58,215 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -3 predicate places. [2021-06-10 11:35:58,215 INFO L480 AbstractCegarLoop]: Abstraction has has 252 places, 245 transitions, 557 flow [2021-06-10 11:35:58,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,216 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-10 11:35:58,216 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1739777274, now seen corresponding path program 1 times [2021-06-10 11:35:58,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515015809] [2021-06-10 11:35:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:58,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:58,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515015809] [2021-06-10 11:35:58,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146250554] [2021-06-10 11:35:58,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 245 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,275 INFO L129 PetriNetUnfolder]: 21/275 cut-off events. [2021-06-10 11:35:58,275 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:58,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 275 events. 21/275 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 973 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 316. Up to 10 conditions per place. [2021-06-10 11:35:58,280 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 8 selfloop transitions, 1 changer transitions 0/243 dead transitions. [2021-06-10 11:35:58,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 243 transitions, 570 flow [2021-06-10 11:35:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-06-10 11:35:58,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2021-06-10 11:35:58,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,283 INFO L185 Difference]: Start difference. First operand has 252 places, 245 transitions, 557 flow. Second operand 3 states and 736 transitions. [2021-06-10 11:35:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 243 transitions, 570 flow [2021-06-10 11:35:58,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 243 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,286 INFO L241 Difference]: Finished difference. Result has 251 places, 243 transitions, 553 flow [2021-06-10 11:35:58,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=251, PETRI_TRANSITIONS=243} [2021-06-10 11:35:58,286 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -4 predicate places. [2021-06-10 11:35:58,286 INFO L480 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 553 flow [2021-06-10 11:35:58,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,287 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-10 11:35:58,287 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1243007892, now seen corresponding path program 1 times [2021-06-10 11:35:58,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844729412] [2021-06-10 11:35:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:58,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:58,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844729412] [2021-06-10 11:35:58,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069822763] [2021-06-10 11:35:58,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 243 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,355 INFO L129 PetriNetUnfolder]: 20/283 cut-off events. [2021-06-10 11:35:58,356 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:58,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 283 events. 20/283 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1042 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 328. Up to 10 conditions per place. [2021-06-10 11:35:58,361 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 10 selfloop transitions, 3 changer transitions 0/245 dead transitions. [2021-06-10 11:35:58,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 583 flow [2021-06-10 11:35:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2021-06-10 11:35:58,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:58,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,364 INFO L185 Difference]: Start difference. First operand has 251 places, 243 transitions, 553 flow. Second operand 3 states and 741 transitions. [2021-06-10 11:35:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 245 transitions, 583 flow [2021-06-10 11:35:58,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 245 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,368 INFO L241 Difference]: Finished difference. Result has 254 places, 245 transitions, 576 flow [2021-06-10 11:35:58,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=254, PETRI_TRANSITIONS=245} [2021-06-10 11:35:58,369 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, -1 predicate places. [2021-06-10 11:35:58,369 INFO L480 AbstractCegarLoop]: Abstraction has has 254 places, 245 transitions, 576 flow [2021-06-10 11:35:58,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,369 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-10 11:35:58,369 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1243008915, now seen corresponding path program 1 times [2021-06-10 11:35:58,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630977287] [2021-06-10 11:35:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:58,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630977287] [2021-06-10 11:35:58,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932907802] [2021-06-10 11:35:58,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,381 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 245 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,419 INFO L129 PetriNetUnfolder]: 18/284 cut-off events. [2021-06-10 11:35:58,419 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:58,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 284 events. 18/284 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1063 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 327. Up to 10 conditions per place. [2021-06-10 11:35:58,424 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 6 selfloop transitions, 1 changer transitions 0/245 dead transitions. [2021-06-10 11:35:58,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 588 flow [2021-06-10 11:35:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2021-06-10 11:35:58,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-06-10 11:35:58,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,428 INFO L185 Difference]: Start difference. First operand has 254 places, 245 transitions, 576 flow. Second operand 3 states and 749 transitions. [2021-06-10 11:35:58,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 588 flow [2021-06-10 11:35:58,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 245 transitions, 583 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,431 INFO L241 Difference]: Finished difference. Result has 256 places, 244 transitions, 572 flow [2021-06-10 11:35:58,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=256, PETRI_TRANSITIONS=244} [2021-06-10 11:35:58,431 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 1 predicate places. [2021-06-10 11:35:58,431 INFO L480 AbstractCegarLoop]: Abstraction has has 256 places, 244 transitions, 572 flow [2021-06-10 11:35:58,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,431 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-10 11:35:58,431 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1243961204, now seen corresponding path program 1 times [2021-06-10 11:35:58,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904787378] [2021-06-10 11:35:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:58,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904787378] [2021-06-10 11:35:58,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243652773] [2021-06-10 11:35:58,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 244 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,481 INFO L129 PetriNetUnfolder]: 18/277 cut-off events. [2021-06-10 11:35:58,482 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:58,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 277 events. 18/277 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1002 event pairs, 0 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2021-06-10 11:35:58,486 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 0/242 dead transitions. [2021-06-10 11:35:58,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 242 transitions, 575 flow [2021-06-10 11:35:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2021-06-10 11:35:58,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9133089133089133 [2021-06-10 11:35:58,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,490 INFO L185 Difference]: Start difference. First operand has 256 places, 244 transitions, 572 flow. Second operand 3 states and 748 transitions. [2021-06-10 11:35:58,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 242 transitions, 575 flow [2021-06-10 11:35:58,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 242 transitions, 568 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:58,509 INFO L241 Difference]: Finished difference. Result has 256 places, 242 transitions, 561 flow [2021-06-10 11:35:58,509 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=256, PETRI_TRANSITIONS=242} [2021-06-10 11:35:58,509 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 1 predicate places. [2021-06-10 11:35:58,509 INFO L480 AbstractCegarLoop]: Abstraction has has 256 places, 242 transitions, 561 flow [2021-06-10 11:35:58,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,509 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-10 11:35:58,509 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1243962227, now seen corresponding path program 1 times [2021-06-10 11:35:58,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712040187] [2021-06-10 11:35:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:58,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:58,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712040187] [2021-06-10 11:35:58,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307899032] [2021-06-10 11:35:58,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 242 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,561 INFO L129 PetriNetUnfolder]: 18/275 cut-off events. [2021-06-10 11:35:58,561 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:58,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 275 events. 18/275 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 986 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2021-06-10 11:35:58,565 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 8 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2021-06-10 11:35:58,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 240 transitions, 574 flow [2021-06-10 11:35:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-06-10 11:35:58,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2021-06-10 11:35:58,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,568 INFO L185 Difference]: Start difference. First operand has 256 places, 242 transitions, 561 flow. Second operand 3 states and 736 transitions. [2021-06-10 11:35:58,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 240 transitions, 574 flow [2021-06-10 11:35:58,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 240 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,571 INFO L241 Difference]: Finished difference. Result has 255 places, 240 transitions, 557 flow [2021-06-10 11:35:58,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2021-06-10 11:35:58,571 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 0 predicate places. [2021-06-10 11:35:58,571 INFO L480 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 557 flow [2021-06-10 11:35:58,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,571 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-10 11:35:58,572 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1292227808, now seen corresponding path program 1 times [2021-06-10 11:35:58,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26114899] [2021-06-10 11:35:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:58,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26114899] [2021-06-10 11:35:58,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676083462] [2021-06-10 11:35:58,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,622 INFO L129 PetriNetUnfolder]: 17/282 cut-off events. [2021-06-10 11:35:58,623 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:58,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 282 events. 17/282 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1048 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 327. Up to 10 conditions per place. [2021-06-10 11:35:58,627 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 6 selfloop transitions, 1 changer transitions 0/241 dead transitions. [2021-06-10 11:35:58,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 241 transitions, 573 flow [2021-06-10 11:35:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2021-06-10 11:35:58,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-06-10 11:35:58,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,632 INFO L185 Difference]: Start difference. First operand has 255 places, 240 transitions, 557 flow. Second operand 3 states and 749 transitions. [2021-06-10 11:35:58,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 241 transitions, 573 flow [2021-06-10 11:35:58,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 241 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,636 INFO L241 Difference]: Finished difference. Result has 257 places, 240 transitions, 561 flow [2021-06-10 11:35:58,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=257, PETRI_TRANSITIONS=240} [2021-06-10 11:35:58,636 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 2 predicate places. [2021-06-10 11:35:58,636 INFO L480 AbstractCegarLoop]: Abstraction has has 257 places, 240 transitions, 561 flow [2021-06-10 11:35:58,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,636 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-10 11:35:58,636 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1292228831, now seen corresponding path program 1 times [2021-06-10 11:35:58,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892756423] [2021-06-10 11:35:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:58,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:58,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892756423] [2021-06-10 11:35:58,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733213555] [2021-06-10 11:35:58,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,654 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 240 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,697 INFO L129 PetriNetUnfolder]: 15/284 cut-off events. [2021-06-10 11:35:58,697 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:58,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 284 events. 15/284 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1080 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 338. Up to 10 conditions per place. [2021-06-10 11:35:58,702 INFO L132 encePairwiseOnDemand]: 269/273 looper letters, 9 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2021-06-10 11:35:58,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 241 transitions, 587 flow [2021-06-10 11:35:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2021-06-10 11:35:58,703 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2021-06-10 11:35:58,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2021-06-10 11:35:58,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2021-06-10 11:35:58,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2021-06-10 11:35:58,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,705 INFO L185 Difference]: Start difference. First operand has 257 places, 240 transitions, 561 flow. Second operand 3 states and 739 transitions. [2021-06-10 11:35:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 241 transitions, 587 flow [2021-06-10 11:35:58,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 241 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,709 INFO L241 Difference]: Finished difference. Result has 260 places, 241 transitions, 578 flow [2021-06-10 11:35:58,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=260, PETRI_TRANSITIONS=241} [2021-06-10 11:35:58,709 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 5 predicate places. [2021-06-10 11:35:58,709 INFO L480 AbstractCegarLoop]: Abstraction has has 260 places, 241 transitions, 578 flow [2021-06-10 11:35:58,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,709 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-10 11:35:58,710 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1291275519, now seen corresponding path program 1 times [2021-06-10 11:35:58,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175300246] [2021-06-10 11:35:58,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:58,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175300246] [2021-06-10 11:35:58,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131654203] [2021-06-10 11:35:58,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,722 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 241 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,761 INFO L129 PetriNetUnfolder]: 15/277 cut-off events. [2021-06-10 11:35:58,761 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:58,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 277 events. 15/277 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1021 event pairs, 0 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 324. Up to 10 conditions per place. [2021-06-10 11:35:58,766 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 0/239 dead transitions. [2021-06-10 11:35:58,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 239 transitions, 580 flow [2021-06-10 11:35:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2021-06-10 11:35:58,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9133089133089133 [2021-06-10 11:35:58,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2021-06-10 11:35:58,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,769 INFO L185 Difference]: Start difference. First operand has 260 places, 241 transitions, 578 flow. Second operand 3 states and 748 transitions. [2021-06-10 11:35:58,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 239 transitions, 580 flow [2021-06-10 11:35:58,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 239 transitions, 572 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:58,772 INFO L241 Difference]: Finished difference. Result has 260 places, 239 transitions, 565 flow [2021-06-10 11:35:58,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=260, PETRI_TRANSITIONS=239} [2021-06-10 11:35:58,772 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 5 predicate places. [2021-06-10 11:35:58,772 INFO L480 AbstractCegarLoop]: Abstraction has has 260 places, 239 transitions, 565 flow [2021-06-10 11:35:58,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,772 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,772 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-10 11:35:58,773 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1291274496, now seen corresponding path program 1 times [2021-06-10 11:35:58,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672201438] [2021-06-10 11:35:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:58,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:35:58,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672201438] [2021-06-10 11:35:58,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251868887] [2021-06-10 11:35:58,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 239 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,823 INFO L129 PetriNetUnfolder]: 15/275 cut-off events. [2021-06-10 11:35:58,823 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:58,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 275 events. 15/275 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1003 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 328. Up to 10 conditions per place. [2021-06-10 11:35:58,828 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 8 selfloop transitions, 1 changer transitions 0/237 dead transitions. [2021-06-10 11:35:58,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 237 transitions, 578 flow [2021-06-10 11:35:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-06-10 11:35:58,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2021-06-10 11:35:58,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-06-10 11:35:58,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,831 INFO L185 Difference]: Start difference. First operand has 260 places, 239 transitions, 565 flow. Second operand 3 states and 736 transitions. [2021-06-10 11:35:58,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 237 transitions, 578 flow [2021-06-10 11:35:58,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 237 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,834 INFO L241 Difference]: Finished difference. Result has 259 places, 237 transitions, 561 flow [2021-06-10 11:35:58,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=259, PETRI_TRANSITIONS=237} [2021-06-10 11:35:58,834 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 4 predicate places. [2021-06-10 11:35:58,834 INFO L480 AbstractCegarLoop]: Abstraction has has 259 places, 237 transitions, 561 flow [2021-06-10 11:35:58,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,835 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-10 11:35:58,835 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1636050221, now seen corresponding path program 1 times [2021-06-10 11:35:58,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702415026] [2021-06-10 11:35:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:58,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:35:58,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702415026] [2021-06-10 11:35:58,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631749090] [2021-06-10 11:35:58,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:58,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 237 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:58,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,892 INFO L129 PetriNetUnfolder]: 14/283 cut-off events. [2021-06-10 11:35:58,892 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:58,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 283 events. 14/283 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1075 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 340. Up to 10 conditions per place. [2021-06-10 11:35:58,897 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 10 selfloop transitions, 3 changer transitions 0/239 dead transitions. [2021-06-10 11:35:58,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 239 transitions, 591 flow [2021-06-10 11:35:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2021-06-10 11:35:58,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:58,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2021-06-10 11:35:58,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,900 INFO L185 Difference]: Start difference. First operand has 259 places, 237 transitions, 561 flow. Second operand 3 states and 741 transitions. [2021-06-10 11:35:58,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 239 transitions, 591 flow [2021-06-10 11:35:58,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 239 transitions, 590 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,903 INFO L241 Difference]: Finished difference. Result has 262 places, 239 transitions, 584 flow [2021-06-10 11:35:58,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=262, PETRI_TRANSITIONS=239} [2021-06-10 11:35:58,903 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 7 predicate places. [2021-06-10 11:35:58,903 INFO L480 AbstractCegarLoop]: Abstraction has has 262 places, 239 transitions, 584 flow [2021-06-10 11:35:58,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,903 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-10 11:35:58,904 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1636051244, now seen corresponding path program 1 times [2021-06-10 11:35:58,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853345200] [2021-06-10 11:35:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:58,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:58,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:58,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:35:58,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853345200] [2021-06-10 11:35:58,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:58,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:58,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920591942] [2021-06-10 11:35:58,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:58,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:58,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:58,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 239 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:58,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:58,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:58,976 INFO L129 PetriNetUnfolder]: 12/284 cut-off events. [2021-06-10 11:35:58,976 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:58,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 284 events. 12/284 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1099 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 340. Up to 10 conditions per place. [2021-06-10 11:35:58,980 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 6 selfloop transitions, 1 changer transitions 0/239 dead transitions. [2021-06-10 11:35:58,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 239 transitions, 596 flow [2021-06-10 11:35:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2021-06-10 11:35:58,981 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-06-10 11:35:58,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:58,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2021-06-10 11:35:58,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,984 INFO L185 Difference]: Start difference. First operand has 262 places, 239 transitions, 584 flow. Second operand 3 states and 749 transitions. [2021-06-10 11:35:58,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 239 transitions, 596 flow [2021-06-10 11:35:58,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 239 transitions, 591 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:58,988 INFO L241 Difference]: Finished difference. Result has 264 places, 238 transitions, 580 flow [2021-06-10 11:35:58,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=264, PETRI_TRANSITIONS=238} [2021-06-10 11:35:58,988 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 9 predicate places. [2021-06-10 11:35:58,988 INFO L480 AbstractCegarLoop]: Abstraction has has 264 places, 238 transitions, 580 flow [2021-06-10 11:35:58,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:58,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:58,988 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:58,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-10 11:35:58,989 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1637003533, now seen corresponding path program 1 times [2021-06-10 11:35:58,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:58,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049372988] [2021-06-10 11:35:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:35:59,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049372988] [2021-06-10 11:35:59,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225261351] [2021-06-10 11:35:59,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 273 [2021-06-10 11:35:59,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 238 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 273 [2021-06-10 11:35:59,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,059 INFO L129 PetriNetUnfolder]: 12/277 cut-off events. [2021-06-10 11:35:59,059 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:59,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 277 events. 12/277 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1035 event pairs, 0 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 334. Up to 10 conditions per place. [2021-06-10 11:35:59,064 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 5 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2021-06-10 11:35:59,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 236 transitions, 583 flow [2021-06-10 11:35:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2021-06-10 11:35:59,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9133089133089133 [2021-06-10 11:35:59,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 748 transitions. [2021-06-10 11:35:59,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 748 transitions. [2021-06-10 11:35:59,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 748 transitions. [2021-06-10 11:35:59,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,067 INFO L185 Difference]: Start difference. First operand has 264 places, 238 transitions, 580 flow. Second operand 3 states and 748 transitions. [2021-06-10 11:35:59,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 236 transitions, 583 flow [2021-06-10 11:35:59,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 236 transitions, 576 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:59,071 INFO L241 Difference]: Finished difference. Result has 264 places, 236 transitions, 569 flow [2021-06-10 11:35:59,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=264, PETRI_TRANSITIONS=236} [2021-06-10 11:35:59,071 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 9 predicate places. [2021-06-10 11:35:59,071 INFO L480 AbstractCegarLoop]: Abstraction has has 264 places, 236 transitions, 569 flow [2021-06-10 11:35:59,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,071 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-10 11:35:59,072 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1637004556, now seen corresponding path program 1 times [2021-06-10 11:35:59,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798500041] [2021-06-10 11:35:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:59,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:35:59,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798500041] [2021-06-10 11:35:59,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374808522] [2021-06-10 11:35:59,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 273 [2021-06-10 11:35:59,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 236 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 273 [2021-06-10 11:35:59,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,136 INFO L129 PetriNetUnfolder]: 12/275 cut-off events. [2021-06-10 11:35:59,136 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:59,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 275 events. 12/275 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1025 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 334. Up to 10 conditions per place. [2021-06-10 11:35:59,141 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 8 selfloop transitions, 1 changer transitions 0/234 dead transitions. [2021-06-10 11:35:59,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 234 transitions, 582 flow [2021-06-10 11:35:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2021-06-10 11:35:59,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2021-06-10 11:35:59,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2021-06-10 11:35:59,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2021-06-10 11:35:59,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2021-06-10 11:35:59,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,144 INFO L185 Difference]: Start difference. First operand has 264 places, 236 transitions, 569 flow. Second operand 3 states and 736 transitions. [2021-06-10 11:35:59,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 234 transitions, 582 flow [2021-06-10 11:35:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 234 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,147 INFO L241 Difference]: Finished difference. Result has 263 places, 234 transitions, 565 flow [2021-06-10 11:35:59,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=263, PETRI_TRANSITIONS=234} [2021-06-10 11:35:59,147 INFO L343 CegarLoopForPetriNet]: 255 programPoint places, 8 predicate places. [2021-06-10 11:35:59,147 INFO L480 AbstractCegarLoop]: Abstraction has has 263 places, 234 transitions, 565 flow [2021-06-10 11:35:59,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,147 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:35:59,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-10 11:35:59,147 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -556421519, now seen corresponding path program 1 times [2021-06-10 11:35:59,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294205704] [2021-06-10 11:35:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:59,155 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:35:59,161 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:35:59,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:35:59,166 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:35:59,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-10 11:35:59,166 WARN L342 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:35:59,166 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of10ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of10ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:35:59,228 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:35:59,228 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-06-10 11:35:59,228 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:35:59,228 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:35:59,228 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:35:59,228 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:35:59,228 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:35:59,228 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:35:59,228 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:35:59,228 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:35:59,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 281 places, 301 transitions, 742 flow [2021-06-10 11:35:59,277 INFO L129 PetriNetUnfolder]: 51/390 cut-off events. [2021-06-10 11:35:59,277 INFO L130 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2021-06-10 11:35:59,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 390 events. 51/390 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1463 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 416. Up to 22 conditions per place. [2021-06-10 11:35:59,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 301 transitions, 742 flow [2021-06-10 11:35:59,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 301 transitions, 742 flow [2021-06-10 11:35:59,291 INFO L129 PetriNetUnfolder]: 9/100 cut-off events. [2021-06-10 11:35:59,291 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:35:59,291 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,291 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-06-10 11:35:59,291 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 957765028, now seen corresponding path program 1 times [2021-06-10 11:35:59,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386787539] [2021-06-10 11:35:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:59,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386787539] [2021-06-10 11:35:59,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046505566] [2021-06-10 11:35:59,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:35:59,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 301 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:35:59,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,351 INFO L129 PetriNetUnfolder]: 28/309 cut-off events. [2021-06-10 11:35:59,351 INFO L130 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2021-06-10 11:35:59,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 309 events. 28/309 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1107 event pairs, 0 based on Foata normal form. 42/311 useless extension candidates. Maximal degree in co-relation 347. Up to 11 conditions per place. [2021-06-10 11:35:59,357 INFO L132 encePairwiseOnDemand]: 286/301 looper letters, 5 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2021-06-10 11:35:59,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 276 transitions, 706 flow [2021-06-10 11:35:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2021-06-10 11:35:59,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9424141749723145 [2021-06-10 11:35:59,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2021-06-10 11:35:59,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2021-06-10 11:35:59,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2021-06-10 11:35:59,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,360 INFO L185 Difference]: Start difference. First operand has 281 places, 301 transitions, 742 flow. Second operand 3 states and 851 transitions. [2021-06-10 11:35:59,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 276 transitions, 706 flow [2021-06-10 11:35:59,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 616 flow, removed 45 selfloop flow, removed 0 redundant places. [2021-06-10 11:35:59,363 INFO L241 Difference]: Finished difference. Result has 270 places, 276 transitions, 614 flow [2021-06-10 11:35:59,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2021-06-10 11:35:59,363 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -11 predicate places. [2021-06-10 11:35:59,363 INFO L480 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 614 flow [2021-06-10 11:35:59,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,363 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-06-10 11:35:59,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-10 11:35:59,363 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 957764005, now seen corresponding path program 1 times [2021-06-10 11:35:59,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177764183] [2021-06-10 11:35:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:59,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:59,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177764183] [2021-06-10 11:35:59,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879391810] [2021-06-10 11:35:59,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:35:59,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:35:59,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,420 INFO L129 PetriNetUnfolder]: 28/310 cut-off events. [2021-06-10 11:35:59,421 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:35:59,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 310 events. 28/310 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1113 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 340. Up to 11 conditions per place. [2021-06-10 11:35:59,426 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 9 selfloop transitions, 3 changer transitions 0/277 dead transitions. [2021-06-10 11:35:59,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 277 transitions, 640 flow [2021-06-10 11:35:59,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2021-06-10 11:35:59,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:59,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,429 INFO L185 Difference]: Start difference. First operand has 270 places, 276 transitions, 614 flow. Second operand 3 states and 817 transitions. [2021-06-10 11:35:59,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 277 transitions, 640 flow [2021-06-10 11:35:59,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,432 INFO L241 Difference]: Finished difference. Result has 273 places, 277 transitions, 630 flow [2021-06-10 11:35:59,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=273, PETRI_TRANSITIONS=277} [2021-06-10 11:35:59,432 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -8 predicate places. [2021-06-10 11:35:59,432 INFO L480 AbstractCegarLoop]: Abstraction has has 273 places, 277 transitions, 630 flow [2021-06-10 11:35:59,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,433 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,433 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-06-10 11:35:59,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-10 11:35:59,433 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 958717317, now seen corresponding path program 1 times [2021-06-10 11:35:59,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030426249] [2021-06-10 11:35:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:59,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030426249] [2021-06-10 11:35:59,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138844411] [2021-06-10 11:35:59,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,451 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:35:59,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 277 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:35:59,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,494 INFO L129 PetriNetUnfolder]: 27/306 cut-off events. [2021-06-10 11:35:59,494 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:59,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 306 events. 27/306 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1091 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 332. Up to 11 conditions per place. [2021-06-10 11:35:59,501 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/274 dead transitions. [2021-06-10 11:35:59,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 274 transitions, 627 flow [2021-06-10 11:35:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:35:59,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:35:59,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,506 INFO L185 Difference]: Start difference. First operand has 273 places, 277 transitions, 630 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:35:59,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 274 transitions, 627 flow [2021-06-10 11:35:59,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 274 transitions, 619 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:59,510 INFO L241 Difference]: Finished difference. Result has 272 places, 274 transitions, 609 flow [2021-06-10 11:35:59,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2021-06-10 11:35:59,510 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -9 predicate places. [2021-06-10 11:35:59,510 INFO L480 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 609 flow [2021-06-10 11:35:59,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,511 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-06-10 11:35:59,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-10 11:35:59,511 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,511 INFO L82 PathProgramCache]: Analyzing trace with hash 958718340, now seen corresponding path program 1 times [2021-06-10 11:35:59,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586985039] [2021-06-10 11:35:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:59,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:35:59,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586985039] [2021-06-10 11:35:59,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776037303] [2021-06-10 11:35:59,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:35:59,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:35:59,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,589 INFO L129 PetriNetUnfolder]: 27/304 cut-off events. [2021-06-10 11:35:59,589 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-10 11:35:59,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 304 events. 27/304 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1077 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 340. Up to 11 conditions per place. [2021-06-10 11:35:59,594 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2021-06-10 11:35:59,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 622 flow [2021-06-10 11:35:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-10 11:35:59,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-06-10 11:35:59,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-10 11:35:59,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-10 11:35:59,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-10 11:35:59,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 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-06-10 11:35:59,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,597 INFO L185 Difference]: Start difference. First operand has 272 places, 274 transitions, 609 flow. Second operand 3 states and 814 transitions. [2021-06-10 11:35:59,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 622 flow [2021-06-10 11:35:59,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 272 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,600 INFO L241 Difference]: Finished difference. Result has 271 places, 272 transitions, 605 flow [2021-06-10 11:35:59,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=272} [2021-06-10 11:35:59,600 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -10 predicate places. [2021-06-10 11:35:59,600 INFO L480 AbstractCegarLoop]: Abstraction has has 271 places, 272 transitions, 605 flow [2021-06-10 11:35:59,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,600 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-10 11:35:59,600 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1407394448, now seen corresponding path program 1 times [2021-06-10 11:35:59,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519679457] [2021-06-10 11:35:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:59,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519679457] [2021-06-10 11:35:59,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740893105] [2021-06-10 11:35:59,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:35:59,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 272 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:35:59,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,657 INFO L129 PetriNetUnfolder]: 25/309 cut-off events. [2021-06-10 11:35:59,657 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:59,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 309 events. 25/309 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1126 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 343. Up to 11 conditions per place. [2021-06-10 11:35:59,664 INFO L132 encePairwiseOnDemand]: 298/301 looper letters, 5 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2021-06-10 11:35:59,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 621 flow [2021-06-10 11:35:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2021-06-10 11:35:59,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158361018826136 [2021-06-10 11:35:59,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,667 INFO L185 Difference]: Start difference. First operand has 271 places, 272 transitions, 605 flow. Second operand 3 states and 827 transitions. [2021-06-10 11:35:59,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 621 flow [2021-06-10 11:35:59,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 273 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,670 INFO L241 Difference]: Finished difference. Result has 274 places, 273 transitions, 618 flow [2021-06-10 11:35:59,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2021-06-10 11:35:59,670 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -7 predicate places. [2021-06-10 11:35:59,670 INFO L480 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 618 flow [2021-06-10 11:35:59,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,670 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,670 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-10 11:35:59,671 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1407395471, now seen corresponding path program 1 times [2021-06-10 11:35:59,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793116065] [2021-06-10 11:35:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:59,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:59,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793116065] [2021-06-10 11:35:59,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462396658] [2021-06-10 11:35:59,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:35:59,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:35:59,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,728 INFO L129 PetriNetUnfolder]: 25/310 cut-off events. [2021-06-10 11:35:59,729 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:35:59,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 310 events. 25/310 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1135 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 350. Up to 11 conditions per place. [2021-06-10 11:35:59,735 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 9 selfloop transitions, 3 changer transitions 0/274 dead transitions. [2021-06-10 11:35:59,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 274 transitions, 644 flow [2021-06-10 11:35:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2021-06-10 11:35:59,736 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:35:59,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2021-06-10 11:35:59,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,737 INFO L185 Difference]: Start difference. First operand has 274 places, 273 transitions, 618 flow. Second operand 3 states and 817 transitions. [2021-06-10 11:35:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 274 transitions, 644 flow [2021-06-10 11:35:59,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 274 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,740 INFO L241 Difference]: Finished difference. Result has 277 places, 274 transitions, 634 flow [2021-06-10 11:35:59,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2021-06-10 11:35:59,740 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -4 predicate places. [2021-06-10 11:35:59,741 INFO L480 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 634 flow [2021-06-10 11:35:59,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,741 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-10 11:35:59,741 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1406441136, now seen corresponding path program 1 times [2021-06-10 11:35:59,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589962497] [2021-06-10 11:35:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:35:59,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:59,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589962497] [2021-06-10 11:35:59,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604347722] [2021-06-10 11:35:59,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:35:59,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:35:59,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,799 INFO L129 PetriNetUnfolder]: 24/307 cut-off events. [2021-06-10 11:35:59,799 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:35:59,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 307 events. 24/307 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1118 event pairs, 0 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 349. Up to 11 conditions per place. [2021-06-10 11:35:59,806 INFO L132 encePairwiseOnDemand]: 298/301 looper letters, 9 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2021-06-10 11:35:59,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 272 transitions, 642 flow [2021-06-10 11:35:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2021-06-10 11:35:59,807 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9036544850498339 [2021-06-10 11:35:59,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2021-06-10 11:35:59,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2021-06-10 11:35:59,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2021-06-10 11:35:59,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,808 INFO L185 Difference]: Start difference. First operand has 277 places, 274 transitions, 634 flow. Second operand 3 states and 816 transitions. [2021-06-10 11:35:59,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 272 transitions, 642 flow [2021-06-10 11:35:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 272 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,812 INFO L241 Difference]: Finished difference. Result has 278 places, 272 transitions, 623 flow [2021-06-10 11:35:59,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=278, PETRI_TRANSITIONS=272} [2021-06-10 11:35:59,812 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -3 predicate places. [2021-06-10 11:35:59,812 INFO L480 AbstractCegarLoop]: Abstraction has has 278 places, 272 transitions, 623 flow [2021-06-10 11:35:59,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,812 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-10 11:35:59,812 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1406442159, now seen corresponding path program 1 times [2021-06-10 11:35:59,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615847468] [2021-06-10 11:35:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:35:59,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615847468] [2021-06-10 11:35:59,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820757897] [2021-06-10 11:35:59,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,824 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:35:59,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 272 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:35:59,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,863 INFO L129 PetriNetUnfolder]: 24/304 cut-off events. [2021-06-10 11:35:59,863 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:35:59,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 304 events. 24/304 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1096 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 344. Up to 11 conditions per place. [2021-06-10 11:35:59,869 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/269 dead transitions. [2021-06-10 11:35:59,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 269 transitions, 624 flow [2021-06-10 11:35:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:35:59,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:35:59,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:35:59,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,871 INFO L185 Difference]: Start difference. First operand has 278 places, 272 transitions, 623 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:35:59,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 269 transitions, 624 flow [2021-06-10 11:35:59,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 269 transitions, 619 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:35:59,874 INFO L241 Difference]: Finished difference. Result has 275 places, 269 transitions, 609 flow [2021-06-10 11:35:59,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=275, PETRI_TRANSITIONS=269} [2021-06-10 11:35:59,875 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -6 predicate places. [2021-06-10 11:35:59,875 INFO L480 AbstractCegarLoop]: Abstraction has has 275 places, 269 transitions, 609 flow [2021-06-10 11:35:59,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,875 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-10 11:35:59,875 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash -713763523, now seen corresponding path program 1 times [2021-06-10 11:35:59,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315544460] [2021-06-10 11:35:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:35:59,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:59,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315544460] [2021-06-10 11:35:59,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662012536] [2021-06-10 11:35:59,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:35:59,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 269 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:35:59,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,927 INFO L129 PetriNetUnfolder]: 22/309 cut-off events. [2021-06-10 11:35:59,927 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:35:59,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 309 events. 22/309 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1145 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 352. Up to 11 conditions per place. [2021-06-10 11:35:59,932 INFO L132 encePairwiseOnDemand]: 298/301 looper letters, 5 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2021-06-10 11:35:59,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 270 transitions, 625 flow [2021-06-10 11:35:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:35:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:35:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2021-06-10 11:35:59,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158361018826136 [2021-06-10 11:35:59,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:35:59,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2021-06-10 11:35:59,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,935 INFO L185 Difference]: Start difference. First operand has 275 places, 269 transitions, 609 flow. Second operand 3 states and 827 transitions. [2021-06-10 11:35:59,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 270 transitions, 625 flow [2021-06-10 11:35:59,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 270 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:35:59,938 INFO L241 Difference]: Finished difference. Result has 278 places, 270 transitions, 622 flow [2021-06-10 11:35:59,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=278, PETRI_TRANSITIONS=270} [2021-06-10 11:35:59,939 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -3 predicate places. [2021-06-10 11:35:59,939 INFO L480 AbstractCegarLoop]: Abstraction has has 278 places, 270 transitions, 622 flow [2021-06-10 11:35:59,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:35:59,939 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:35:59,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-10 11:35:59,939 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:35:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:35:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -713764546, now seen corresponding path program 1 times [2021-06-10 11:35:59,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:35:59,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784352644] [2021-06-10 11:35:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:35:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:35:59,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:35:59,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:35:59,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:35:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:35:59,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784352644] [2021-06-10 11:35:59,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:35:59,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:35:59,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876590000] [2021-06-10 11:35:59,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:35:59,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:35:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:35:59,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:35:59,950 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:35:59,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 270 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:35:59,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:35:59,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:35:59,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:35:59,995 INFO L129 PetriNetUnfolder]: 22/310 cut-off events. [2021-06-10 11:35:59,996 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:00,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 310 events. 22/310 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1155 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 357. Up to 11 conditions per place. [2021-06-10 11:36:00,002 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 9 selfloop transitions, 3 changer transitions 0/271 dead transitions. [2021-06-10 11:36:00,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 271 transitions, 648 flow [2021-06-10 11:36:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2021-06-10 11:36:00,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:36:00,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,005 INFO L185 Difference]: Start difference. First operand has 278 places, 270 transitions, 622 flow. Second operand 3 states and 817 transitions. [2021-06-10 11:36:00,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 271 transitions, 648 flow [2021-06-10 11:36:00,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 271 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,008 INFO L241 Difference]: Finished difference. Result has 281 places, 271 transitions, 638 flow [2021-06-10 11:36:00,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2021-06-10 11:36:00,008 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 0 predicate places. [2021-06-10 11:36:00,008 INFO L480 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 638 flow [2021-06-10 11:36:00,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,009 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,009 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-10 11:36:00,009 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -712811234, now seen corresponding path program 1 times [2021-06-10 11:36:00,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323756544] [2021-06-10 11:36:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:00,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323756544] [2021-06-10 11:36:00,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032150408] [2021-06-10 11:36:00,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 271 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,062 INFO L129 PetriNetUnfolder]: 21/306 cut-off events. [2021-06-10 11:36:00,062 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:00,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 306 events. 21/306 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1129 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 350. Up to 11 conditions per place. [2021-06-10 11:36:00,068 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/268 dead transitions. [2021-06-10 11:36:00,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 268 transitions, 635 flow [2021-06-10 11:36:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:36:00,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:36:00,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,071 INFO L185 Difference]: Start difference. First operand has 281 places, 271 transitions, 638 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:36:00,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 268 transitions, 635 flow [2021-06-10 11:36:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 268 transitions, 627 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:00,074 INFO L241 Difference]: Finished difference. Result has 280 places, 268 transitions, 617 flow [2021-06-10 11:36:00,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=280, PETRI_TRANSITIONS=268} [2021-06-10 11:36:00,074 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -1 predicate places. [2021-06-10 11:36:00,074 INFO L480 AbstractCegarLoop]: Abstraction has has 280 places, 268 transitions, 617 flow [2021-06-10 11:36:00,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,075 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-10 11:36:00,075 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash -712810211, now seen corresponding path program 1 times [2021-06-10 11:36:00,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614192750] [2021-06-10 11:36:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:00,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:00,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614192750] [2021-06-10 11:36:00,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758008965] [2021-06-10 11:36:00,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 268 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,144 INFO L129 PetriNetUnfolder]: 21/304 cut-off events. [2021-06-10 11:36:00,144 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:36:00,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 304 events. 21/304 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1113 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 354. Up to 11 conditions per place. [2021-06-10 11:36:00,150 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2021-06-10 11:36:00,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 266 transitions, 630 flow [2021-06-10 11:36:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-10 11:36:00,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-06-10 11:36:00,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 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-06-10 11:36:00,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,152 INFO L185 Difference]: Start difference. First operand has 280 places, 268 transitions, 617 flow. Second operand 3 states and 814 transitions. [2021-06-10 11:36:00,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 266 transitions, 630 flow [2021-06-10 11:36:00,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 266 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,155 INFO L241 Difference]: Finished difference. Result has 279 places, 266 transitions, 613 flow [2021-06-10 11:36:00,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=279, PETRI_TRANSITIONS=266} [2021-06-10 11:36:00,156 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, -2 predicate places. [2021-06-10 11:36:00,156 INFO L480 AbstractCegarLoop]: Abstraction has has 279 places, 266 transitions, 613 flow [2021-06-10 11:36:00,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,156 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-10 11:36:00,156 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1766453652, now seen corresponding path program 1 times [2021-06-10 11:36:00,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175698578] [2021-06-10 11:36:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:00,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175698578] [2021-06-10 11:36:00,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137548857] [2021-06-10 11:36:00,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 266 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,210 INFO L129 PetriNetUnfolder]: 20/311 cut-off events. [2021-06-10 11:36:00,210 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:36:00,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 311 events. 20/311 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1172 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 359. Up to 11 conditions per place. [2021-06-10 11:36:00,216 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 6 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2021-06-10 11:36:00,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 267 transitions, 629 flow [2021-06-10 11:36:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2021-06-10 11:36:00,217 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158361018826136 [2021-06-10 11:36:00,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,218 INFO L185 Difference]: Start difference. First operand has 279 places, 266 transitions, 613 flow. Second operand 3 states and 827 transitions. [2021-06-10 11:36:00,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 267 transitions, 629 flow [2021-06-10 11:36:00,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 267 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,223 INFO L241 Difference]: Finished difference. Result has 281 places, 266 transitions, 617 flow [2021-06-10 11:36:00,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=281, PETRI_TRANSITIONS=266} [2021-06-10 11:36:00,223 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 0 predicate places. [2021-06-10 11:36:00,223 INFO L480 AbstractCegarLoop]: Abstraction has has 281 places, 266 transitions, 617 flow [2021-06-10 11:36:00,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,224 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-10 11:36:00,224 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1766452629, now seen corresponding path program 1 times [2021-06-10 11:36:00,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911077263] [2021-06-10 11:36:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:00,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:00,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911077263] [2021-06-10 11:36:00,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779200006] [2021-06-10 11:36:00,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 266 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,283 INFO L129 PetriNetUnfolder]: 18/313 cut-off events. [2021-06-10 11:36:00,284 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:00,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 313 events. 18/313 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1204 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 370. Up to 11 conditions per place. [2021-06-10 11:36:00,290 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 9 selfloop transitions, 3 changer transitions 0/267 dead transitions. [2021-06-10 11:36:00,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 267 transitions, 643 flow [2021-06-10 11:36:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2021-06-10 11:36:00,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:36:00,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,292 INFO L185 Difference]: Start difference. First operand has 281 places, 266 transitions, 617 flow. Second operand 3 states and 817 transitions. [2021-06-10 11:36:00,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 267 transitions, 643 flow [2021-06-10 11:36:00,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 267 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,295 INFO L241 Difference]: Finished difference. Result has 284 places, 267 transitions, 634 flow [2021-06-10 11:36:00,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=284, PETRI_TRANSITIONS=267} [2021-06-10 11:36:00,296 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 3 predicate places. [2021-06-10 11:36:00,296 INFO L480 AbstractCegarLoop]: Abstraction has has 284 places, 267 transitions, 634 flow [2021-06-10 11:36:00,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,296 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,296 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-10 11:36:00,296 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1767405941, now seen corresponding path program 1 times [2021-06-10 11:36:00,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322285312] [2021-06-10 11:36:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:00,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322285312] [2021-06-10 11:36:00,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741427649] [2021-06-10 11:36:00,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 267 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,347 INFO L129 PetriNetUnfolder]: 18/306 cut-off events. [2021-06-10 11:36:00,347 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:00,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 306 events. 18/306 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1147 event pairs, 0 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 355. Up to 11 conditions per place. [2021-06-10 11:36:00,353 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2021-06-10 11:36:00,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 265 transitions, 636 flow [2021-06-10 11:36:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:36:00,354 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:36:00,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,355 INFO L185 Difference]: Start difference. First operand has 284 places, 267 transitions, 634 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:36:00,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 265 transitions, 636 flow [2021-06-10 11:36:00,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 265 transitions, 628 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:00,358 INFO L241 Difference]: Finished difference. Result has 284 places, 265 transitions, 621 flow [2021-06-10 11:36:00,359 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=284, PETRI_TRANSITIONS=265} [2021-06-10 11:36:00,359 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 3 predicate places. [2021-06-10 11:36:00,359 INFO L480 AbstractCegarLoop]: Abstraction has has 284 places, 265 transitions, 621 flow [2021-06-10 11:36:00,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,359 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-10 11:36:00,359 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1767406964, now seen corresponding path program 1 times [2021-06-10 11:36:00,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95608212] [2021-06-10 11:36:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:00,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:00,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95608212] [2021-06-10 11:36:00,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437548781] [2021-06-10 11:36:00,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,370 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 265 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,412 INFO L129 PetriNetUnfolder]: 18/304 cut-off events. [2021-06-10 11:36:00,413 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:00,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 304 events. 18/304 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1129 event pairs, 0 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 360. Up to 11 conditions per place. [2021-06-10 11:36:00,418 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2021-06-10 11:36:00,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 263 transitions, 634 flow [2021-06-10 11:36:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-10 11:36:00,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-06-10 11:36:00,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 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-06-10 11:36:00,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,420 INFO L185 Difference]: Start difference. First operand has 284 places, 265 transitions, 621 flow. Second operand 3 states and 814 transitions. [2021-06-10 11:36:00,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 263 transitions, 634 flow [2021-06-10 11:36:00,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 263 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,423 INFO L241 Difference]: Finished difference. Result has 283 places, 263 transitions, 617 flow [2021-06-10 11:36:00,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=283, PETRI_TRANSITIONS=263} [2021-06-10 11:36:00,424 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 2 predicate places. [2021-06-10 11:36:00,424 INFO L480 AbstractCegarLoop]: Abstraction has has 283 places, 263 transitions, 617 flow [2021-06-10 11:36:00,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,424 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-10 11:36:00,424 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash 134562235, now seen corresponding path program 1 times [2021-06-10 11:36:00,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864966941] [2021-06-10 11:36:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:00,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864966941] [2021-06-10 11:36:00,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115479780] [2021-06-10 11:36:00,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 263 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,478 INFO L129 PetriNetUnfolder]: 17/311 cut-off events. [2021-06-10 11:36:00,479 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:36:00,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 311 events. 17/311 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1191 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 365. Up to 11 conditions per place. [2021-06-10 11:36:00,484 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 6 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2021-06-10 11:36:00,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 264 transitions, 633 flow [2021-06-10 11:36:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2021-06-10 11:36:00,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158361018826136 [2021-06-10 11:36:00,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,487 INFO L185 Difference]: Start difference. First operand has 283 places, 263 transitions, 617 flow. Second operand 3 states and 827 transitions. [2021-06-10 11:36:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 264 transitions, 633 flow [2021-06-10 11:36:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 264 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,490 INFO L241 Difference]: Finished difference. Result has 285 places, 263 transitions, 621 flow [2021-06-10 11:36:00,490 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=285, PETRI_TRANSITIONS=263} [2021-06-10 11:36:00,490 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 4 predicate places. [2021-06-10 11:36:00,490 INFO L480 AbstractCegarLoop]: Abstraction has has 285 places, 263 transitions, 621 flow [2021-06-10 11:36:00,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,490 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-10 11:36:00,490 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 134563258, now seen corresponding path program 1 times [2021-06-10 11:36:00,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886984300] [2021-06-10 11:36:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:00,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:00,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886984300] [2021-06-10 11:36:00,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913784566] [2021-06-10 11:36:00,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 263 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,551 INFO L129 PetriNetUnfolder]: 15/313 cut-off events. [2021-06-10 11:36:00,551 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:00,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 313 events. 15/313 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1221 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 376. Up to 11 conditions per place. [2021-06-10 11:36:00,557 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 9 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2021-06-10 11:36:00,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 264 transitions, 647 flow [2021-06-10 11:36:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2021-06-10 11:36:00,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2021-06-10 11:36:00,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2021-06-10 11:36:00,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,560 INFO L185 Difference]: Start difference. First operand has 285 places, 263 transitions, 621 flow. Second operand 3 states and 817 transitions. [2021-06-10 11:36:00,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 264 transitions, 647 flow [2021-06-10 11:36:00,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 264 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,563 INFO L241 Difference]: Finished difference. Result has 288 places, 264 transitions, 638 flow [2021-06-10 11:36:00,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=288, PETRI_TRANSITIONS=264} [2021-06-10 11:36:00,564 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 7 predicate places. [2021-06-10 11:36:00,564 INFO L480 AbstractCegarLoop]: Abstraction has has 288 places, 264 transitions, 638 flow [2021-06-10 11:36:00,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,564 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-10 11:36:00,564 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 133609946, now seen corresponding path program 1 times [2021-06-10 11:36:00,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575641818] [2021-06-10 11:36:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:00,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575641818] [2021-06-10 11:36:00,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089747613] [2021-06-10 11:36:00,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,579 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 264 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,639 INFO L129 PetriNetUnfolder]: 15/306 cut-off events. [2021-06-10 11:36:00,640 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:00,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 306 events. 15/306 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1164 event pairs, 0 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 362. Up to 11 conditions per place. [2021-06-10 11:36:00,644 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2021-06-10 11:36:00,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 262 transitions, 640 flow [2021-06-10 11:36:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:36:00,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:36:00,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,647 INFO L185 Difference]: Start difference. First operand has 288 places, 264 transitions, 638 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:36:00,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 262 transitions, 640 flow [2021-06-10 11:36:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 262 transitions, 632 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:00,649 INFO L241 Difference]: Finished difference. Result has 288 places, 262 transitions, 625 flow [2021-06-10 11:36:00,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=288, PETRI_TRANSITIONS=262} [2021-06-10 11:36:00,650 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 7 predicate places. [2021-06-10 11:36:00,650 INFO L480 AbstractCegarLoop]: Abstraction has has 288 places, 262 transitions, 625 flow [2021-06-10 11:36:00,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,650 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-10 11:36:00,650 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash 133608923, now seen corresponding path program 1 times [2021-06-10 11:36:00,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863415816] [2021-06-10 11:36:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:00,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:00,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863415816] [2021-06-10 11:36:00,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926398705] [2021-06-10 11:36:00,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,663 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 262 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,706 INFO L129 PetriNetUnfolder]: 15/304 cut-off events. [2021-06-10 11:36:00,707 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:00,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 304 events. 15/304 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1147 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 366. Up to 11 conditions per place. [2021-06-10 11:36:00,712 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2021-06-10 11:36:00,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 260 transitions, 638 flow [2021-06-10 11:36:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-10 11:36:00,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-06-10 11:36:00,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-10 11:36:00,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 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-06-10 11:36:00,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,715 INFO L185 Difference]: Start difference. First operand has 288 places, 262 transitions, 625 flow. Second operand 3 states and 814 transitions. [2021-06-10 11:36:00,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 260 transitions, 638 flow [2021-06-10 11:36:00,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 260 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,718 INFO L241 Difference]: Finished difference. Result has 287 places, 260 transitions, 621 flow [2021-06-10 11:36:00,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=287, PETRI_TRANSITIONS=260} [2021-06-10 11:36:00,718 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 6 predicate places. [2021-06-10 11:36:00,718 INFO L480 AbstractCegarLoop]: Abstraction has has 287 places, 260 transitions, 621 flow [2021-06-10 11:36:00,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,719 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-10 11:36:00,719 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1971399339, now seen corresponding path program 1 times [2021-06-10 11:36:00,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617974702] [2021-06-10 11:36:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:00,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:00,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617974702] [2021-06-10 11:36:00,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137126328] [2021-06-10 11:36:00,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 260 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,784 INFO L129 PetriNetUnfolder]: 14/312 cut-off events. [2021-06-10 11:36:00,784 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:36:00,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 312 events. 14/312 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1218 event pairs, 0 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 378. Up to 11 conditions per place. [2021-06-10 11:36:00,791 INFO L132 encePairwiseOnDemand]: 296/301 looper letters, 10 selfloop transitions, 3 changer transitions 0/262 dead transitions. [2021-06-10 11:36:00,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 262 transitions, 651 flow [2021-06-10 11:36:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2021-06-10 11:36:00,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2021-06-10 11:36:00,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 819 transitions. [2021-06-10 11:36:00,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 819 transitions. [2021-06-10 11:36:00,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 819 transitions. [2021-06-10 11:36:00,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,793 INFO L185 Difference]: Start difference. First operand has 287 places, 260 transitions, 621 flow. Second operand 3 states and 819 transitions. [2021-06-10 11:36:00,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 262 transitions, 651 flow [2021-06-10 11:36:00,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 262 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,797 INFO L241 Difference]: Finished difference. Result has 290 places, 262 transitions, 644 flow [2021-06-10 11:36:00,797 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=290, PETRI_TRANSITIONS=262} [2021-06-10 11:36:00,797 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 9 predicate places. [2021-06-10 11:36:00,797 INFO L480 AbstractCegarLoop]: Abstraction has has 290 places, 262 transitions, 644 flow [2021-06-10 11:36:00,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,797 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,797 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-10 11:36:00,797 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1971400362, now seen corresponding path program 1 times [2021-06-10 11:36:00,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143340124] [2021-06-10 11:36:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:00,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143340124] [2021-06-10 11:36:00,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300945366] [2021-06-10 11:36:00,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 262 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,859 INFO L129 PetriNetUnfolder]: 13/310 cut-off events. [2021-06-10 11:36:00,859 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:00,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 310 events. 13/310 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1208 event pairs, 0 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 375. Up to 11 conditions per place. [2021-06-10 11:36:00,866 INFO L132 encePairwiseOnDemand]: 298/301 looper letters, 5 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2021-06-10 11:36:00,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 262 transitions, 656 flow [2021-06-10 11:36:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2021-06-10 11:36:00,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158361018826136 [2021-06-10 11:36:00,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2021-06-10 11:36:00,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,869 INFO L185 Difference]: Start difference. First operand has 290 places, 262 transitions, 644 flow. Second operand 3 states and 827 transitions. [2021-06-10 11:36:00,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 262 transitions, 656 flow [2021-06-10 11:36:00,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 262 transitions, 651 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:00,872 INFO L241 Difference]: Finished difference. Result has 293 places, 262 transitions, 649 flow [2021-06-10 11:36:00,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=293, PETRI_TRANSITIONS=262} [2021-06-10 11:36:00,873 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 12 predicate places. [2021-06-10 11:36:00,873 INFO L480 AbstractCegarLoop]: Abstraction has has 293 places, 262 transitions, 649 flow [2021-06-10 11:36:00,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,873 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,873 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-10 11:36:00,873 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1972352651, now seen corresponding path program 1 times [2021-06-10 11:36:00,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334927649] [2021-06-10 11:36:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:00,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:00,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334927649] [2021-06-10 11:36:00,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25579026] [2021-06-10 11:36:00,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 301 [2021-06-10 11:36:00,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 262 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 301 [2021-06-10 11:36:00,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:00,935 INFO L129 PetriNetUnfolder]: 12/306 cut-off events. [2021-06-10 11:36:00,935 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:00,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 306 events. 12/306 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1183 event pairs, 0 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 372. Up to 11 conditions per place. [2021-06-10 11:36:00,941 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 5 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2021-06-10 11:36:00,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 259 transitions, 646 flow [2021-06-10 11:36:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2021-06-10 11:36:00,942 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2021-06-10 11:36:00,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:00,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 826 transitions. [2021-06-10 11:36:00,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,944 INFO L185 Difference]: Start difference. First operand has 293 places, 262 transitions, 649 flow. Second operand 3 states and 826 transitions. [2021-06-10 11:36:00,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 259 transitions, 646 flow [2021-06-10 11:36:00,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 259 transitions, 639 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:00,947 INFO L241 Difference]: Finished difference. Result has 292 places, 259 transitions, 629 flow [2021-06-10 11:36:00,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=292, PETRI_TRANSITIONS=259} [2021-06-10 11:36:00,947 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 11 predicate places. [2021-06-10 11:36:00,947 INFO L480 AbstractCegarLoop]: Abstraction has has 292 places, 259 transitions, 629 flow [2021-06-10 11:36:00,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:00,948 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:00,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-10 11:36:00,948 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1972353674, now seen corresponding path program 1 times [2021-06-10 11:36:00,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:00,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246734938] [2021-06-10 11:36:00,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:00,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:00,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:00,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:00,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246734938] [2021-06-10 11:36:00,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:00,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:00,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39693349] [2021-06-10 11:36:00,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:00,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:00,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 301 [2021-06-10 11:36:00,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 259 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:00,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:00,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 301 [2021-06-10 11:36:00,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,012 INFO L129 PetriNetUnfolder]: 12/304 cut-off events. [2021-06-10 11:36:01,013 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-06-10 11:36:01,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 304 events. 12/304 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1165 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 373. Up to 11 conditions per place. [2021-06-10 11:36:01,019 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 8 selfloop transitions, 1 changer transitions 0/257 dead transitions. [2021-06-10 11:36:01,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 257 transitions, 642 flow [2021-06-10 11:36:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-10 11:36:01,020 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-06-10 11:36:01,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-10 11:36:01,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-10 11:36:01,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-10 11:36:01,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 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-06-10 11:36:01,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,021 INFO L185 Difference]: Start difference. First operand has 292 places, 259 transitions, 629 flow. Second operand 3 states and 814 transitions. [2021-06-10 11:36:01,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 257 transitions, 642 flow [2021-06-10 11:36:01,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 257 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,025 INFO L241 Difference]: Finished difference. Result has 291 places, 257 transitions, 625 flow [2021-06-10 11:36:01,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=291, PETRI_TRANSITIONS=257} [2021-06-10 11:36:01,025 INFO L343 CegarLoopForPetriNet]: 281 programPoint places, 10 predicate places. [2021-06-10 11:36:01,025 INFO L480 AbstractCegarLoop]: Abstraction has has 291 places, 257 transitions, 625 flow [2021-06-10 11:36:01,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,025 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:36:01,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-10 11:36:01,026 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 585687923, now seen corresponding path program 1 times [2021-06-10 11:36:01,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727155530] [2021-06-10 11:36:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:01,032 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:01,037 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:01,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:01,042 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:01,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-10 11:36:01,042 WARN L342 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:01,042 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of11ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of11ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:01,109 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:01,110 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-06-10 11:36:01,110 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:01,110 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:01,110 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:01,110 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:01,110 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:01,110 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:01,110 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:01,110 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:01,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 307 places, 329 transitions, 823 flow [2021-06-10 11:36:01,205 INFO L129 PetriNetUnfolder]: 56/427 cut-off events. [2021-06-10 11:36:01,205 INFO L130 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2021-06-10 11:36:01,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 427 events. 56/427 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1635 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 466. Up to 24 conditions per place. [2021-06-10 11:36:01,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 329 transitions, 823 flow [2021-06-10 11:36:01,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 307 places, 329 transitions, 823 flow [2021-06-10 11:36:01,221 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:36:01,222 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:01,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,222 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-06-10 11:36:01,222 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -893898592, now seen corresponding path program 1 times [2021-06-10 11:36:01,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175484791] [2021-06-10 11:36:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:01,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:01,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175484791] [2021-06-10 11:36:01,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657810746] [2021-06-10 11:36:01,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:01,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 329 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:01,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,309 INFO L129 PetriNetUnfolder]: 32/341 cut-off events. [2021-06-10 11:36:01,309 INFO L130 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2021-06-10 11:36:01,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 341 events. 32/341 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1239 event pairs, 0 based on Foata normal form. 52/348 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2021-06-10 11:36:01,318 INFO L132 encePairwiseOnDemand]: 311/329 looper letters, 10 selfloop transitions, 3 changer transitions 0/303 dead transitions. [2021-06-10 11:36:01,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 303 transitions, 797 flow [2021-06-10 11:36:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2021-06-10 11:36:01,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2021-06-10 11:36:01,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 923 transitions. [2021-06-10 11:36:01,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 923 transitions. [2021-06-10 11:36:01,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 923 transitions. [2021-06-10 11:36:01,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,329 INFO L185 Difference]: Start difference. First operand has 307 places, 329 transitions, 823 flow. Second operand 3 states and 923 transitions. [2021-06-10 11:36:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 303 transitions, 797 flow [2021-06-10 11:36:01,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 303 transitions, 687 flow, removed 55 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:01,333 INFO L241 Difference]: Finished difference. Result has 295 places, 303 transitions, 681 flow [2021-06-10 11:36:01,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=295, PETRI_TRANSITIONS=303} [2021-06-10 11:36:01,334 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -12 predicate places. [2021-06-10 11:36:01,334 INFO L480 AbstractCegarLoop]: Abstraction has has 295 places, 303 transitions, 681 flow [2021-06-10 11:36:01,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,334 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-06-10 11:36:01,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-10 11:36:01,334 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -893897569, now seen corresponding path program 1 times [2021-06-10 11:36:01,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685809920] [2021-06-10 11:36:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:01,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:01,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685809920] [2021-06-10 11:36:01,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314601534] [2021-06-10 11:36:01,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,347 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:01,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 303 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:01,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,403 INFO L129 PetriNetUnfolder]: 31/339 cut-off events. [2021-06-10 11:36:01,404 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:01,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 339 events. 31/339 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1233 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 369. Up to 12 conditions per place. [2021-06-10 11:36:01,412 INFO L132 encePairwiseOnDemand]: 326/329 looper letters, 5 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2021-06-10 11:36:01,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 303 transitions, 693 flow [2021-06-10 11:36:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:01,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:01,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,426 INFO L185 Difference]: Start difference. First operand has 295 places, 303 transitions, 681 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:01,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 303 transitions, 693 flow [2021-06-10 11:36:01,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 303 transitions, 688 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,429 INFO L241 Difference]: Finished difference. Result has 298 places, 303 transitions, 686 flow [2021-06-10 11:36:01,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=298, PETRI_TRANSITIONS=303} [2021-06-10 11:36:01,430 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -9 predicate places. [2021-06-10 11:36:01,430 INFO L480 AbstractCegarLoop]: Abstraction has has 298 places, 303 transitions, 686 flow [2021-06-10 11:36:01,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,430 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-06-10 11:36:01,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-10 11:36:01,430 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash -892944257, now seen corresponding path program 1 times [2021-06-10 11:36:01,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584686437] [2021-06-10 11:36:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:01,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:01,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584686437] [2021-06-10 11:36:01,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060404082] [2021-06-10 11:36:01,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:01,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 303 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:01,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,532 INFO L129 PetriNetUnfolder]: 30/336 cut-off events. [2021-06-10 11:36:01,532 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:01,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 336 events. 30/336 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1214 event pairs, 0 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 371. Up to 12 conditions per place. [2021-06-10 11:36:01,540 INFO L132 encePairwiseOnDemand]: 326/329 looper letters, 9 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2021-06-10 11:36:01,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 301 transitions, 696 flow [2021-06-10 11:36:01,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2021-06-10 11:36:01,542 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9057750759878419 [2021-06-10 11:36:01,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 894 transitions. [2021-06-10 11:36:01,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 894 transitions. [2021-06-10 11:36:01,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 894 transitions. [2021-06-10 11:36:01,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,544 INFO L185 Difference]: Start difference. First operand has 298 places, 303 transitions, 686 flow. Second operand 3 states and 894 transitions. [2021-06-10 11:36:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 301 transitions, 696 flow [2021-06-10 11:36:01,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 301 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,548 INFO L241 Difference]: Finished difference. Result has 299 places, 301 transitions, 676 flow [2021-06-10 11:36:01,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=299, PETRI_TRANSITIONS=301} [2021-06-10 11:36:01,548 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -8 predicate places. [2021-06-10 11:36:01,548 INFO L480 AbstractCegarLoop]: Abstraction has has 299 places, 301 transitions, 676 flow [2021-06-10 11:36:01,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,548 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-06-10 11:36:01,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-10 11:36:01,548 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash -892945280, now seen corresponding path program 1 times [2021-06-10 11:36:01,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236291384] [2021-06-10 11:36:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:01,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:01,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236291384] [2021-06-10 11:36:01,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220771835] [2021-06-10 11:36:01,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:01,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 301 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:01,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,610 INFO L129 PetriNetUnfolder]: 30/333 cut-off events. [2021-06-10 11:36:01,611 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:01,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 333 events. 30/333 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1194 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 369. Up to 12 conditions per place. [2021-06-10 11:36:01,617 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/298 dead transitions. [2021-06-10 11:36:01,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 298 transitions, 677 flow [2021-06-10 11:36:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:01,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:01,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,620 INFO L185 Difference]: Start difference. First operand has 299 places, 301 transitions, 676 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:01,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 298 transitions, 677 flow [2021-06-10 11:36:01,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 298 transitions, 672 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:01,623 INFO L241 Difference]: Finished difference. Result has 296 places, 298 transitions, 662 flow [2021-06-10 11:36:01,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=296, PETRI_TRANSITIONS=298} [2021-06-10 11:36:01,624 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -11 predicate places. [2021-06-10 11:36:01,624 INFO L480 AbstractCegarLoop]: Abstraction has has 296 places, 298 transitions, 662 flow [2021-06-10 11:36:01,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,624 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-10 11:36:01,624 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash -792585433, now seen corresponding path program 1 times [2021-06-10 11:36:01,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154293893] [2021-06-10 11:36:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:01,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:01,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154293893] [2021-06-10 11:36:01,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161559662] [2021-06-10 11:36:01,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:01,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 298 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:01,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,680 INFO L129 PetriNetUnfolder]: 29/340 cut-off events. [2021-06-10 11:36:01,681 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:01,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 340 events. 29/340 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1255 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 379. Up to 12 conditions per place. [2021-06-10 11:36:01,688 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 6 selfloop transitions, 1 changer transitions 0/299 dead transitions. [2021-06-10 11:36:01,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 299 transitions, 678 flow [2021-06-10 11:36:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:01,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:01,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,691 INFO L185 Difference]: Start difference. First operand has 296 places, 298 transitions, 662 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:01,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 299 transitions, 678 flow [2021-06-10 11:36:01,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 299 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,694 INFO L241 Difference]: Finished difference. Result has 298 places, 298 transitions, 666 flow [2021-06-10 11:36:01,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=298, PETRI_TRANSITIONS=298} [2021-06-10 11:36:01,694 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -9 predicate places. [2021-06-10 11:36:01,694 INFO L480 AbstractCegarLoop]: Abstraction has has 298 places, 298 transitions, 666 flow [2021-06-10 11:36:01,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,694 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-10 11:36:01,695 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash -792584410, now seen corresponding path program 1 times [2021-06-10 11:36:01,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158538334] [2021-06-10 11:36:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:01,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:01,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158538334] [2021-06-10 11:36:01,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817028687] [2021-06-10 11:36:01,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:01,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 298 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:01,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,756 INFO L129 PetriNetUnfolder]: 27/342 cut-off events. [2021-06-10 11:36:01,756 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:01,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 342 events. 27/342 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1288 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 388. Up to 12 conditions per place. [2021-06-10 11:36:01,764 INFO L132 encePairwiseOnDemand]: 325/329 looper letters, 9 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2021-06-10 11:36:01,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 299 transitions, 692 flow [2021-06-10 11:36:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2021-06-10 11:36:01,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9067882472137792 [2021-06-10 11:36:01,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2021-06-10 11:36:01,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2021-06-10 11:36:01,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2021-06-10 11:36:01,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,766 INFO L185 Difference]: Start difference. First operand has 298 places, 298 transitions, 666 flow. Second operand 3 states and 895 transitions. [2021-06-10 11:36:01,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 299 transitions, 692 flow [2021-06-10 11:36:01,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,770 INFO L241 Difference]: Finished difference. Result has 301 places, 299 transitions, 683 flow [2021-06-10 11:36:01,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2021-06-10 11:36:01,770 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -6 predicate places. [2021-06-10 11:36:01,770 INFO L480 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 683 flow [2021-06-10 11:36:01,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,770 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-10 11:36:01,771 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -793537722, now seen corresponding path program 1 times [2021-06-10 11:36:01,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066407686] [2021-06-10 11:36:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:01,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:01,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066407686] [2021-06-10 11:36:01,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666842762] [2021-06-10 11:36:01,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,782 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:01,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:01,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,826 INFO L129 PetriNetUnfolder]: 27/335 cut-off events. [2021-06-10 11:36:01,826 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:01,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 335 events. 27/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1226 event pairs, 0 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 373. Up to 12 conditions per place. [2021-06-10 11:36:01,834 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2021-06-10 11:36:01,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 685 flow [2021-06-10 11:36:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:01,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:01,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:01,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,836 INFO L185 Difference]: Start difference. First operand has 301 places, 299 transitions, 683 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:01,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 685 flow [2021-06-10 11:36:01,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 297 transitions, 677 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:01,839 INFO L241 Difference]: Finished difference. Result has 301 places, 297 transitions, 670 flow [2021-06-10 11:36:01,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=301, PETRI_TRANSITIONS=297} [2021-06-10 11:36:01,840 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -6 predicate places. [2021-06-10 11:36:01,840 INFO L480 AbstractCegarLoop]: Abstraction has has 301 places, 297 transitions, 670 flow [2021-06-10 11:36:01,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,840 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-10 11:36:01,840 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash -793538745, now seen corresponding path program 1 times [2021-06-10 11:36:01,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116509322] [2021-06-10 11:36:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:01,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:01,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116509322] [2021-06-10 11:36:01,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799136114] [2021-06-10 11:36:01,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:01,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 297 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:01,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,898 INFO L129 PetriNetUnfolder]: 27/333 cut-off events. [2021-06-10 11:36:01,898 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:01,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 333 events. 27/333 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1212 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 378. Up to 12 conditions per place. [2021-06-10 11:36:01,906 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/295 dead transitions. [2021-06-10 11:36:01,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 295 transitions, 683 flow [2021-06-10 11:36:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:01,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:01,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:01,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:01,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:01,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,908 INFO L185 Difference]: Start difference. First operand has 301 places, 297 transitions, 670 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:01,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 295 transitions, 683 flow [2021-06-10 11:36:01,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 295 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,911 INFO L241 Difference]: Finished difference. Result has 300 places, 295 transitions, 666 flow [2021-06-10 11:36:01,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=300, PETRI_TRANSITIONS=295} [2021-06-10 11:36:01,912 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -7 predicate places. [2021-06-10 11:36:01,912 INFO L480 AbstractCegarLoop]: Abstraction has has 300 places, 295 transitions, 666 flow [2021-06-10 11:36:01,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,912 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-10 11:36:01,912 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash -757453745, now seen corresponding path program 1 times [2021-06-10 11:36:01,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412235621] [2021-06-10 11:36:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:01,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:01,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:01,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:01,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412235621] [2021-06-10 11:36:01,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:01,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:01,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289268190] [2021-06-10 11:36:01,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:01,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:01,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:01,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:01,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 295 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:01,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:01,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:01,988 INFO L129 PetriNetUnfolder]: 26/340 cut-off events. [2021-06-10 11:36:01,988 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:01,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 340 events. 26/340 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1270 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 383. Up to 12 conditions per place. [2021-06-10 11:36:01,993 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 6 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2021-06-10 11:36:01,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 296 transitions, 682 flow [2021-06-10 11:36:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:01,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:01,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:01,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:01,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,995 INFO L185 Difference]: Start difference. First operand has 300 places, 295 transitions, 666 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:01,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 296 transitions, 682 flow [2021-06-10 11:36:01,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:01,998 INFO L241 Difference]: Finished difference. Result has 302 places, 295 transitions, 670 flow [2021-06-10 11:36:01,998 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2021-06-10 11:36:01,998 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -5 predicate places. [2021-06-10 11:36:01,998 INFO L480 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 670 flow [2021-06-10 11:36:01,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:01,999 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:01,999 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:01,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-10 11:36:01,999 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -757452722, now seen corresponding path program 1 times [2021-06-10 11:36:01,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:01,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023982257] [2021-06-10 11:36:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:02,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:02,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023982257] [2021-06-10 11:36:02,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818960861] [2021-06-10 11:36:02,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,062 INFO L129 PetriNetUnfolder]: 24/342 cut-off events. [2021-06-10 11:36:02,062 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:02,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 342 events. 24/342 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1305 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 394. Up to 12 conditions per place. [2021-06-10 11:36:02,069 INFO L132 encePairwiseOnDemand]: 325/329 looper letters, 9 selfloop transitions, 3 changer transitions 0/296 dead transitions. [2021-06-10 11:36:02,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 696 flow [2021-06-10 11:36:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2021-06-10 11:36:02,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9067882472137792 [2021-06-10 11:36:02,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,072 INFO L185 Difference]: Start difference. First operand has 302 places, 295 transitions, 670 flow. Second operand 3 states and 895 transitions. [2021-06-10 11:36:02,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 696 flow [2021-06-10 11:36:02,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 296 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,075 INFO L241 Difference]: Finished difference. Result has 305 places, 296 transitions, 687 flow [2021-06-10 11:36:02,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=305, PETRI_TRANSITIONS=296} [2021-06-10 11:36:02,075 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -2 predicate places. [2021-06-10 11:36:02,075 INFO L480 AbstractCegarLoop]: Abstraction has has 305 places, 296 transitions, 687 flow [2021-06-10 11:36:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,076 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-10 11:36:02,076 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash -758406034, now seen corresponding path program 1 times [2021-06-10 11:36:02,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783894188] [2021-06-10 11:36:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:02,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783894188] [2021-06-10 11:36:02,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768508003] [2021-06-10 11:36:02,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 296 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,132 INFO L129 PetriNetUnfolder]: 24/335 cut-off events. [2021-06-10 11:36:02,132 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:02,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 335 events. 24/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1241 event pairs, 0 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 380. Up to 12 conditions per place. [2021-06-10 11:36:02,139 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/294 dead transitions. [2021-06-10 11:36:02,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 689 flow [2021-06-10 11:36:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:02,140 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:02,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,142 INFO L185 Difference]: Start difference. First operand has 305 places, 296 transitions, 687 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:02,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 689 flow [2021-06-10 11:36:02,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 294 transitions, 681 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:02,145 INFO L241 Difference]: Finished difference. Result has 305 places, 294 transitions, 674 flow [2021-06-10 11:36:02,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=305, PETRI_TRANSITIONS=294} [2021-06-10 11:36:02,145 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -2 predicate places. [2021-06-10 11:36:02,145 INFO L480 AbstractCegarLoop]: Abstraction has has 305 places, 294 transitions, 674 flow [2021-06-10 11:36:02,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,145 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-10 11:36:02,146 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -758407057, now seen corresponding path program 1 times [2021-06-10 11:36:02,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487555697] [2021-06-10 11:36:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:02,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:02,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487555697] [2021-06-10 11:36:02,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689015265] [2021-06-10 11:36:02,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 294 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,206 INFO L129 PetriNetUnfolder]: 24/333 cut-off events. [2021-06-10 11:36:02,206 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:02,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 333 events. 24/333 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1230 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 384. Up to 12 conditions per place. [2021-06-10 11:36:02,213 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2021-06-10 11:36:02,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 292 transitions, 687 flow [2021-06-10 11:36:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:02,214 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:02,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,216 INFO L185 Difference]: Start difference. First operand has 305 places, 294 transitions, 674 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:02,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 292 transitions, 687 flow [2021-06-10 11:36:02,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 292 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,219 INFO L241 Difference]: Finished difference. Result has 304 places, 292 transitions, 670 flow [2021-06-10 11:36:02,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=304, PETRI_TRANSITIONS=292} [2021-06-10 11:36:02,219 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, -3 predicate places. [2021-06-10 11:36:02,219 INFO L480 AbstractCegarLoop]: Abstraction has has 304 places, 292 transitions, 670 flow [2021-06-10 11:36:02,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,219 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-10 11:36:02,220 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2119467639, now seen corresponding path program 1 times [2021-06-10 11:36:02,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619914609] [2021-06-10 11:36:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:02,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:02,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619914609] [2021-06-10 11:36:02,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752777080] [2021-06-10 11:36:02,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 292 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,285 INFO L129 PetriNetUnfolder]: 23/341 cut-off events. [2021-06-10 11:36:02,286 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:02,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 341 events. 23/341 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1299 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 396. Up to 12 conditions per place. [2021-06-10 11:36:02,293 INFO L132 encePairwiseOnDemand]: 324/329 looper letters, 10 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2021-06-10 11:36:02,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 294 transitions, 700 flow [2021-06-10 11:36:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2021-06-10 11:36:02,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9088145896656535 [2021-06-10 11:36:02,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 897 transitions. [2021-06-10 11:36:02,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 897 transitions. [2021-06-10 11:36:02,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 897 transitions. [2021-06-10 11:36:02,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,296 INFO L185 Difference]: Start difference. First operand has 304 places, 292 transitions, 670 flow. Second operand 3 states and 897 transitions. [2021-06-10 11:36:02,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 294 transitions, 700 flow [2021-06-10 11:36:02,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 294 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,299 INFO L241 Difference]: Finished difference. Result has 307 places, 294 transitions, 693 flow [2021-06-10 11:36:02,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=307, PETRI_TRANSITIONS=294} [2021-06-10 11:36:02,299 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 0 predicate places. [2021-06-10 11:36:02,299 INFO L480 AbstractCegarLoop]: Abstraction has has 307 places, 294 transitions, 693 flow [2021-06-10 11:36:02,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,300 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-06-10 11:36:02,300 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2119466616, now seen corresponding path program 1 times [2021-06-10 11:36:02,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901809134] [2021-06-10 11:36:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:02,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901809134] [2021-06-10 11:36:02,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104082995] [2021-06-10 11:36:02,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 294 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,362 INFO L129 PetriNetUnfolder]: 21/342 cut-off events. [2021-06-10 11:36:02,362 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:02,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 342 events. 21/342 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1325 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 396. Up to 12 conditions per place. [2021-06-10 11:36:02,370 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 6 selfloop transitions, 1 changer transitions 0/294 dead transitions. [2021-06-10 11:36:02,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 294 transitions, 705 flow [2021-06-10 11:36:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:02,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:02,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,372 INFO L185 Difference]: Start difference. First operand has 307 places, 294 transitions, 693 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:02,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 294 transitions, 705 flow [2021-06-10 11:36:02,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 294 transitions, 700 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,376 INFO L241 Difference]: Finished difference. Result has 309 places, 293 transitions, 689 flow [2021-06-10 11:36:02,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=309, PETRI_TRANSITIONS=293} [2021-06-10 11:36:02,376 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 2 predicate places. [2021-06-10 11:36:02,376 INFO L480 AbstractCegarLoop]: Abstraction has has 309 places, 293 transitions, 689 flow [2021-06-10 11:36:02,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,376 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,376 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-06-10 11:36:02,376 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2118514327, now seen corresponding path program 1 times [2021-06-10 11:36:02,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865385670] [2021-06-10 11:36:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:02,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865385670] [2021-06-10 11:36:02,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90411593] [2021-06-10 11:36:02,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 293 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,436 INFO L129 PetriNetUnfolder]: 21/335 cut-off events. [2021-06-10 11:36:02,436 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:02,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 335 events. 21/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1262 event pairs, 0 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 390. Up to 12 conditions per place. [2021-06-10 11:36:02,443 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2021-06-10 11:36:02,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 291 transitions, 692 flow [2021-06-10 11:36:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:02,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:02,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,451 INFO L185 Difference]: Start difference. First operand has 309 places, 293 transitions, 689 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:02,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 291 transitions, 692 flow [2021-06-10 11:36:02,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 291 transitions, 685 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:02,456 INFO L241 Difference]: Finished difference. Result has 309 places, 291 transitions, 678 flow [2021-06-10 11:36:02,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=309, PETRI_TRANSITIONS=291} [2021-06-10 11:36:02,457 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 2 predicate places. [2021-06-10 11:36:02,457 INFO L480 AbstractCegarLoop]: Abstraction has has 309 places, 291 transitions, 678 flow [2021-06-10 11:36:02,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,457 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,457 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-06-10 11:36:02,457 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2118513304, now seen corresponding path program 1 times [2021-06-10 11:36:02,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252066290] [2021-06-10 11:36:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:02,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:02,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252066290] [2021-06-10 11:36:02,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415419122] [2021-06-10 11:36:02,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,470 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 291 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,521 INFO L129 PetriNetUnfolder]: 21/333 cut-off events. [2021-06-10 11:36:02,522 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:02,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 333 events. 21/333 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1247 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 390. Up to 12 conditions per place. [2021-06-10 11:36:02,529 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2021-06-10 11:36:02,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 289 transitions, 691 flow [2021-06-10 11:36:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:02,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:02,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,532 INFO L185 Difference]: Start difference. First operand has 309 places, 291 transitions, 678 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 289 transitions, 691 flow [2021-06-10 11:36:02,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 289 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,536 INFO L241 Difference]: Finished difference. Result has 308 places, 289 transitions, 674 flow [2021-06-10 11:36:02,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=308, PETRI_TRANSITIONS=289} [2021-06-10 11:36:02,537 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 1 predicate places. [2021-06-10 11:36:02,537 INFO L480 AbstractCegarLoop]: Abstraction has has 308 places, 289 transitions, 674 flow [2021-06-10 11:36:02,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,538 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-06-10 11:36:02,538 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1303524161, now seen corresponding path program 1 times [2021-06-10 11:36:02,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297148609] [2021-06-10 11:36:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:02,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297148609] [2021-06-10 11:36:02,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125498358] [2021-06-10 11:36:02,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 289 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,606 INFO L129 PetriNetUnfolder]: 19/338 cut-off events. [2021-06-10 11:36:02,607 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:02,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 338 events. 19/338 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1297 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2021-06-10 11:36:02,614 INFO L132 encePairwiseOnDemand]: 326/329 looper letters, 5 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2021-06-10 11:36:02,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 290 transitions, 690 flow [2021-06-10 11:36:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:02,615 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:02,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,616 INFO L185 Difference]: Start difference. First operand has 308 places, 289 transitions, 674 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:02,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 290 transitions, 690 flow [2021-06-10 11:36:02,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 290 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,621 INFO L241 Difference]: Finished difference. Result has 311 places, 290 transitions, 687 flow [2021-06-10 11:36:02,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=311, PETRI_TRANSITIONS=290} [2021-06-10 11:36:02,622 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 4 predicate places. [2021-06-10 11:36:02,622 INFO L480 AbstractCegarLoop]: Abstraction has has 311 places, 290 transitions, 687 flow [2021-06-10 11:36:02,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,623 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-06-10 11:36:02,623 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1303523138, now seen corresponding path program 1 times [2021-06-10 11:36:02,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420300655] [2021-06-10 11:36:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:02,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:02,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420300655] [2021-06-10 11:36:02,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812019906] [2021-06-10 11:36:02,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 290 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,714 INFO L129 PetriNetUnfolder]: 19/339 cut-off events. [2021-06-10 11:36:02,715 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:02,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 339 events. 19/339 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1304 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 401. Up to 12 conditions per place. [2021-06-10 11:36:02,721 INFO L132 encePairwiseOnDemand]: 325/329 looper letters, 9 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2021-06-10 11:36:02,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 291 transitions, 713 flow [2021-06-10 11:36:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2021-06-10 11:36:02,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9067882472137792 [2021-06-10 11:36:02,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2021-06-10 11:36:02,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,723 INFO L185 Difference]: Start difference. First operand has 311 places, 290 transitions, 687 flow. Second operand 3 states and 895 transitions. [2021-06-10 11:36:02,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 291 transitions, 713 flow [2021-06-10 11:36:02,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 291 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,727 INFO L241 Difference]: Finished difference. Result has 314 places, 291 transitions, 703 flow [2021-06-10 11:36:02,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=314, PETRI_TRANSITIONS=291} [2021-06-10 11:36:02,728 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 7 predicate places. [2021-06-10 11:36:02,728 INFO L480 AbstractCegarLoop]: Abstraction has has 314 places, 291 transitions, 703 flow [2021-06-10 11:36:02,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,728 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-06-10 11:36:02,728 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1304476450, now seen corresponding path program 1 times [2021-06-10 11:36:02,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612304621] [2021-06-10 11:36:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:02,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612304621] [2021-06-10 11:36:02,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124897253] [2021-06-10 11:36:02,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 291 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,792 INFO L129 PetriNetUnfolder]: 18/335 cut-off events. [2021-06-10 11:36:02,792 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:02,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 335 events. 18/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1280 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 394. Up to 12 conditions per place. [2021-06-10 11:36:02,799 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2021-06-10 11:36:02,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 288 transitions, 700 flow [2021-06-10 11:36:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:02,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:02,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:02,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,801 INFO L185 Difference]: Start difference. First operand has 314 places, 291 transitions, 703 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:02,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 288 transitions, 700 flow [2021-06-10 11:36:02,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 288 transitions, 692 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:02,809 INFO L241 Difference]: Finished difference. Result has 313 places, 288 transitions, 682 flow [2021-06-10 11:36:02,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=313, PETRI_TRANSITIONS=288} [2021-06-10 11:36:02,810 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 6 predicate places. [2021-06-10 11:36:02,810 INFO L480 AbstractCegarLoop]: Abstraction has has 313 places, 288 transitions, 682 flow [2021-06-10 11:36:02,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,810 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-06-10 11:36:02,810 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1304477473, now seen corresponding path program 1 times [2021-06-10 11:36:02,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043999909] [2021-06-10 11:36:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:02,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:02,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043999909] [2021-06-10 11:36:02,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956993096] [2021-06-10 11:36:02,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 288 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,880 INFO L129 PetriNetUnfolder]: 18/333 cut-off events. [2021-06-10 11:36:02,880 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:02,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 333 events. 18/333 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1265 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 397. Up to 12 conditions per place. [2021-06-10 11:36:02,887 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/286 dead transitions. [2021-06-10 11:36:02,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 286 transitions, 695 flow [2021-06-10 11:36:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:02,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:02,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:02,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,889 INFO L185 Difference]: Start difference. First operand has 313 places, 288 transitions, 682 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:02,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 286 transitions, 695 flow [2021-06-10 11:36:02,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 286 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,892 INFO L241 Difference]: Finished difference. Result has 312 places, 286 transitions, 678 flow [2021-06-10 11:36:02,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=312, PETRI_TRANSITIONS=286} [2021-06-10 11:36:02,892 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 5 predicate places. [2021-06-10 11:36:02,892 INFO L480 AbstractCegarLoop]: Abstraction has has 312 places, 286 transitions, 678 flow [2021-06-10 11:36:02,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,893 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-06-10 11:36:02,893 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1362492948, now seen corresponding path program 1 times [2021-06-10 11:36:02,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759767228] [2021-06-10 11:36:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:02,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:02,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759767228] [2021-06-10 11:36:02,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959638367] [2021-06-10 11:36:02,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:02,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 286 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:02,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:02,956 INFO L129 PetriNetUnfolder]: 16/338 cut-off events. [2021-06-10 11:36:02,956 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:02,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 338 events. 16/338 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1318 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 400. Up to 12 conditions per place. [2021-06-10 11:36:02,963 INFO L132 encePairwiseOnDemand]: 326/329 looper letters, 5 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2021-06-10 11:36:02,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 287 transitions, 694 flow [2021-06-10 11:36:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:02,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:02,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:02,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:02,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,966 INFO L185 Difference]: Start difference. First operand has 312 places, 286 transitions, 678 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:02,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 287 transitions, 694 flow [2021-06-10 11:36:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 287 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:02,969 INFO L241 Difference]: Finished difference. Result has 315 places, 287 transitions, 691 flow [2021-06-10 11:36:02,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=315, PETRI_TRANSITIONS=287} [2021-06-10 11:36:02,969 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 8 predicate places. [2021-06-10 11:36:02,969 INFO L480 AbstractCegarLoop]: Abstraction has has 315 places, 287 transitions, 691 flow [2021-06-10 11:36:02,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:02,969 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:02,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-06-10 11:36:02,970 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1362493971, now seen corresponding path program 1 times [2021-06-10 11:36:02,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:02,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423429724] [2021-06-10 11:36:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:02,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:02,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:02,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423429724] [2021-06-10 11:36:02,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:02,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:02,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895371702] [2021-06-10 11:36:02,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:02,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:02,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:02,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 287 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:02,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:02,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:02,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,043 INFO L129 PetriNetUnfolder]: 16/339 cut-off events. [2021-06-10 11:36:03,044 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:03,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 339 events. 16/339 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1326 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 408. Up to 12 conditions per place. [2021-06-10 11:36:03,051 INFO L132 encePairwiseOnDemand]: 325/329 looper letters, 9 selfloop transitions, 3 changer transitions 0/288 dead transitions. [2021-06-10 11:36:03,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 288 transitions, 717 flow [2021-06-10 11:36:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2021-06-10 11:36:03,052 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9067882472137792 [2021-06-10 11:36:03,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2021-06-10 11:36:03,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2021-06-10 11:36:03,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2021-06-10 11:36:03,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,053 INFO L185 Difference]: Start difference. First operand has 315 places, 287 transitions, 691 flow. Second operand 3 states and 895 transitions. [2021-06-10 11:36:03,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 288 transitions, 717 flow [2021-06-10 11:36:03,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 288 transitions, 715 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,057 INFO L241 Difference]: Finished difference. Result has 318 places, 288 transitions, 707 flow [2021-06-10 11:36:03,057 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=318, PETRI_TRANSITIONS=288} [2021-06-10 11:36:03,057 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 11 predicate places. [2021-06-10 11:36:03,057 INFO L480 AbstractCegarLoop]: Abstraction has has 318 places, 288 transitions, 707 flow [2021-06-10 11:36:03,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,057 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,057 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,057 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-06-10 11:36:03,057 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1361540659, now seen corresponding path program 1 times [2021-06-10 11:36:03,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99179074] [2021-06-10 11:36:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:03,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:03,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99179074] [2021-06-10 11:36:03,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271405519] [2021-06-10 11:36:03,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:03,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 288 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:03,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,120 INFO L129 PetriNetUnfolder]: 15/335 cut-off events. [2021-06-10 11:36:03,120 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:03,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 335 events. 15/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1299 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 401. Up to 12 conditions per place. [2021-06-10 11:36:03,127 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/285 dead transitions. [2021-06-10 11:36:03,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 285 transitions, 704 flow [2021-06-10 11:36:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:03,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:03,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,130 INFO L185 Difference]: Start difference. First operand has 318 places, 288 transitions, 707 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:03,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 285 transitions, 704 flow [2021-06-10 11:36:03,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 285 transitions, 696 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:03,133 INFO L241 Difference]: Finished difference. Result has 317 places, 285 transitions, 686 flow [2021-06-10 11:36:03,133 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=317, PETRI_TRANSITIONS=285} [2021-06-10 11:36:03,133 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 10 predicate places. [2021-06-10 11:36:03,133 INFO L480 AbstractCegarLoop]: Abstraction has has 317 places, 285 transitions, 686 flow [2021-06-10 11:36:03,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,134 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-10 11:36:03,134 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1361539636, now seen corresponding path program 1 times [2021-06-10 11:36:03,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206474016] [2021-06-10 11:36:03,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:03,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:03,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206474016] [2021-06-10 11:36:03,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893453178] [2021-06-10 11:36:03,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,147 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:03,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 285 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:03,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,198 INFO L129 PetriNetUnfolder]: 15/333 cut-off events. [2021-06-10 11:36:03,198 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:03,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 333 events. 15/333 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1284 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 404. Up to 12 conditions per place. [2021-06-10 11:36:03,205 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/283 dead transitions. [2021-06-10 11:36:03,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 283 transitions, 699 flow [2021-06-10 11:36:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:03,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:03,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,208 INFO L185 Difference]: Start difference. First operand has 317 places, 285 transitions, 686 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:03,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 283 transitions, 699 flow [2021-06-10 11:36:03,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 283 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,211 INFO L241 Difference]: Finished difference. Result has 316 places, 283 transitions, 682 flow [2021-06-10 11:36:03,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=316, PETRI_TRANSITIONS=283} [2021-06-10 11:36:03,211 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 9 predicate places. [2021-06-10 11:36:03,211 INFO L480 AbstractCegarLoop]: Abstraction has has 316 places, 283 transitions, 682 flow [2021-06-10 11:36:03,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,211 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,212 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-06-10 11:36:03,212 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,212 INFO L82 PathProgramCache]: Analyzing trace with hash -335889672, now seen corresponding path program 1 times [2021-06-10 11:36:03,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937522938] [2021-06-10 11:36:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:03,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:03,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937522938] [2021-06-10 11:36:03,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414181700] [2021-06-10 11:36:03,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,225 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:03,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 283 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:03,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,284 INFO L129 PetriNetUnfolder]: 14/341 cut-off events. [2021-06-10 11:36:03,284 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:03,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 341 events. 14/341 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1352 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 416. Up to 12 conditions per place. [2021-06-10 11:36:03,291 INFO L132 encePairwiseOnDemand]: 324/329 looper letters, 10 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2021-06-10 11:36:03,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 285 transitions, 712 flow [2021-06-10 11:36:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2021-06-10 11:36:03,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9088145896656535 [2021-06-10 11:36:03,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 897 transitions. [2021-06-10 11:36:03,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 897 transitions. [2021-06-10 11:36:03,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 897 transitions. [2021-06-10 11:36:03,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,294 INFO L185 Difference]: Start difference. First operand has 316 places, 283 transitions, 682 flow. Second operand 3 states and 897 transitions. [2021-06-10 11:36:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 285 transitions, 712 flow [2021-06-10 11:36:03,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 285 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,297 INFO L241 Difference]: Finished difference. Result has 319 places, 285 transitions, 705 flow [2021-06-10 11:36:03,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=319, PETRI_TRANSITIONS=285} [2021-06-10 11:36:03,297 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 12 predicate places. [2021-06-10 11:36:03,297 INFO L480 AbstractCegarLoop]: Abstraction has has 319 places, 285 transitions, 705 flow [2021-06-10 11:36:03,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,297 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-10 11:36:03,298 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -335890695, now seen corresponding path program 1 times [2021-06-10 11:36:03,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564865002] [2021-06-10 11:36:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:03,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:03,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564865002] [2021-06-10 11:36:03,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900230406] [2021-06-10 11:36:03,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,310 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:03,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 285 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:03,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,364 INFO L129 PetriNetUnfolder]: 12/342 cut-off events. [2021-06-10 11:36:03,364 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:03,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 342 events. 12/342 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1373 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 416. Up to 12 conditions per place. [2021-06-10 11:36:03,372 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 6 selfloop transitions, 1 changer transitions 0/285 dead transitions. [2021-06-10 11:36:03,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 285 transitions, 717 flow [2021-06-10 11:36:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2021-06-10 11:36:03,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916919959473151 [2021-06-10 11:36:03,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2021-06-10 11:36:03,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2021-06-10 11:36:03,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2021-06-10 11:36:03,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,374 INFO L185 Difference]: Start difference. First operand has 319 places, 285 transitions, 705 flow. Second operand 3 states and 905 transitions. [2021-06-10 11:36:03,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 285 transitions, 717 flow [2021-06-10 11:36:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 285 transitions, 712 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,418 INFO L241 Difference]: Finished difference. Result has 321 places, 284 transitions, 701 flow [2021-06-10 11:36:03,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=321, PETRI_TRANSITIONS=284} [2021-06-10 11:36:03,418 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 14 predicate places. [2021-06-10 11:36:03,418 INFO L480 AbstractCegarLoop]: Abstraction has has 321 places, 284 transitions, 701 flow [2021-06-10 11:36:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,418 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-10 11:36:03,419 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -336842984, now seen corresponding path program 1 times [2021-06-10 11:36:03,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057185838] [2021-06-10 11:36:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:03,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:03,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057185838] [2021-06-10 11:36:03,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439191819] [2021-06-10 11:36:03,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 329 [2021-06-10 11:36:03,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 284 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 329 [2021-06-10 11:36:03,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,498 INFO L129 PetriNetUnfolder]: 12/335 cut-off events. [2021-06-10 11:36:03,498 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:03,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 335 events. 12/335 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1313 event pairs, 0 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 410. Up to 12 conditions per place. [2021-06-10 11:36:03,505 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 5 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2021-06-10 11:36:03,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 282 transitions, 704 flow [2021-06-10 11:36:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2021-06-10 11:36:03,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159067882472138 [2021-06-10 11:36:03,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2021-06-10 11:36:03,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,507 INFO L185 Difference]: Start difference. First operand has 321 places, 284 transitions, 701 flow. Second operand 3 states and 904 transitions. [2021-06-10 11:36:03,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 282 transitions, 704 flow [2021-06-10 11:36:03,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 282 transitions, 697 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:03,511 INFO L241 Difference]: Finished difference. Result has 321 places, 282 transitions, 690 flow [2021-06-10 11:36:03,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=321, PETRI_TRANSITIONS=282} [2021-06-10 11:36:03,511 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 14 predicate places. [2021-06-10 11:36:03,511 INFO L480 AbstractCegarLoop]: Abstraction has has 321 places, 282 transitions, 690 flow [2021-06-10 11:36:03,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,511 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:03,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-10 11:36:03,511 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -336844007, now seen corresponding path program 1 times [2021-06-10 11:36:03,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818797813] [2021-06-10 11:36:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:03,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:03,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818797813] [2021-06-10 11:36:03,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041776082] [2021-06-10 11:36:03,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 329 [2021-06-10 11:36:03,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 282 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 329 [2021-06-10 11:36:03,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,577 INFO L129 PetriNetUnfolder]: 12/333 cut-off events. [2021-06-10 11:36:03,578 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:03,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 333 events. 12/333 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1300 event pairs, 0 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 410. Up to 12 conditions per place. [2021-06-10 11:36:03,584 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 8 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2021-06-10 11:36:03,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 280 transitions, 703 flow [2021-06-10 11:36:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2021-06-10 11:36:03,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9037487335359676 [2021-06-10 11:36:03,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 892 transitions. [2021-06-10 11:36:03,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,587 INFO L185 Difference]: Start difference. First operand has 321 places, 282 transitions, 690 flow. Second operand 3 states and 892 transitions. [2021-06-10 11:36:03,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 280 transitions, 703 flow [2021-06-10 11:36:03,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 280 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,590 INFO L241 Difference]: Finished difference. Result has 320 places, 280 transitions, 686 flow [2021-06-10 11:36:03,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=320, PETRI_TRANSITIONS=280} [2021-06-10 11:36:03,590 INFO L343 CegarLoopForPetriNet]: 307 programPoint places, 13 predicate places. [2021-06-10 11:36:03,590 INFO L480 AbstractCegarLoop]: Abstraction has has 320 places, 280 transitions, 686 flow [2021-06-10 11:36:03,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,591 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 11:36:03,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-06-10 11:36:03,591 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash -553558356, now seen corresponding path program 1 times [2021-06-10 11:36:03,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090481666] [2021-06-10 11:36:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:03,598 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:03,602 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:03,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:03,607 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:03,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-10 11:36:03,607 WARN L342 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:03,607 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of12ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of12ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:03,679 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:03,679 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-06-10 11:36:03,681 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:03,681 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:03,681 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:03,681 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:03,681 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:03,681 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:03,681 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:03,681 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:03,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 333 places, 357 transitions, 906 flow [2021-06-10 11:36:03,745 INFO L129 PetriNetUnfolder]: 61/464 cut-off events. [2021-06-10 11:36:03,745 INFO L130 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2021-06-10 11:36:03,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 464 events. 61/464 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1800 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 517. Up to 26 conditions per place. [2021-06-10 11:36:03,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 357 transitions, 906 flow [2021-06-10 11:36:03,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 357 transitions, 906 flow [2021-06-10 11:36:03,767 INFO L129 PetriNetUnfolder]: 8/98 cut-off events. [2021-06-10 11:36:03,767 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:03,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,768 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-06-10 11:36:03,768 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash 94749978, now seen corresponding path program 1 times [2021-06-10 11:36:03,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387652210] [2021-06-10 11:36:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:03,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:03,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387652210] [2021-06-10 11:36:03,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585238038] [2021-06-10 11:36:03,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:03,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 357 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:03,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,840 INFO L129 PetriNetUnfolder]: 34/367 cut-off events. [2021-06-10 11:36:03,840 INFO L130 PetriNetUnfolder]: For 353/353 co-relation queries the response was YES. [2021-06-10 11:36:03,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 367 events. 34/367 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1349 event pairs, 0 based on Foata normal form. 50/369 useless extension candidates. Maximal degree in co-relation 432. Up to 13 conditions per place. [2021-06-10 11:36:03,849 INFO L132 encePairwiseOnDemand]: 340/357 looper letters, 5 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2021-06-10 11:36:03,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 328 transitions, 862 flow [2021-06-10 11:36:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2021-06-10 11:36:03,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2021-06-10 11:36:03,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2021-06-10 11:36:03,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2021-06-10 11:36:03,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2021-06-10 11:36:03,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,852 INFO L185 Difference]: Start difference. First operand has 333 places, 357 transitions, 906 flow. Second operand 3 states and 1011 transitions. [2021-06-10 11:36:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 328 transitions, 862 flow [2021-06-10 11:36:03,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 730 flow, removed 66 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:03,856 INFO L241 Difference]: Finished difference. Result has 320 places, 328 transitions, 728 flow [2021-06-10 11:36:03,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=320, PETRI_TRANSITIONS=328} [2021-06-10 11:36:03,856 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -13 predicate places. [2021-06-10 11:36:03,856 INFO L480 AbstractCegarLoop]: Abstraction has has 320 places, 328 transitions, 728 flow [2021-06-10 11:36:03,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,857 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,857 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-06-10 11:36:03,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-06-10 11:36:03,857 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 95702267, now seen corresponding path program 1 times [2021-06-10 11:36:03,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797305981] [2021-06-10 11:36:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:03,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:03,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797305981] [2021-06-10 11:36:03,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065755945] [2021-06-10 11:36:03,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:03,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 328 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:03,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:03,918 INFO L129 PetriNetUnfolder]: 33/366 cut-off events. [2021-06-10 11:36:03,919 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:03,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 366 events. 33/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1346 event pairs, 0 based on Foata normal form. 1/320 useless extension candidates. Maximal degree in co-relation 399. Up to 13 conditions per place. [2021-06-10 11:36:03,929 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2021-06-10 11:36:03,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 327 transitions, 734 flow [2021-06-10 11:36:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:03,930 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:03,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:03,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:03,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:03,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:03,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,931 INFO L185 Difference]: Start difference. First operand has 320 places, 328 transitions, 728 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:03,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 327 transitions, 734 flow [2021-06-10 11:36:03,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 327 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:03,934 INFO L241 Difference]: Finished difference. Result has 321 places, 327 transitions, 723 flow [2021-06-10 11:36:03,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=321, PETRI_TRANSITIONS=327} [2021-06-10 11:36:03,935 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -12 predicate places. [2021-06-10 11:36:03,935 INFO L480 AbstractCegarLoop]: Abstraction has has 321 places, 327 transitions, 723 flow [2021-06-10 11:36:03,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,935 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:03,935 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-06-10 11:36:03,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-06-10 11:36:03,935 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 95703290, now seen corresponding path program 1 times [2021-06-10 11:36:03,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:03,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559830688] [2021-06-10 11:36:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:03,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:03,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:03,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:03,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559830688] [2021-06-10 11:36:03,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:03,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:03,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331116921] [2021-06-10 11:36:03,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:03,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:03,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:03,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 327 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:03,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:03,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:03,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,007 INFO L129 PetriNetUnfolder]: 33/364 cut-off events. [2021-06-10 11:36:04,007 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-10 11:36:04,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 364 events. 33/364 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1333 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 406. Up to 13 conditions per place. [2021-06-10 11:36:04,017 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 8 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2021-06-10 11:36:04,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 326 transitions, 741 flow [2021-06-10 11:36:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2021-06-10 11:36:04,018 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9066293183940243 [2021-06-10 11:36:04,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2021-06-10 11:36:04,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2021-06-10 11:36:04,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2021-06-10 11:36:04,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,020 INFO L185 Difference]: Start difference. First operand has 321 places, 327 transitions, 723 flow. Second operand 3 states and 971 transitions. [2021-06-10 11:36:04,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 326 transitions, 741 flow [2021-06-10 11:36:04,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 326 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,023 INFO L241 Difference]: Finished difference. Result has 322 places, 326 transitions, 724 flow [2021-06-10 11:36:04,023 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=322, PETRI_TRANSITIONS=326} [2021-06-10 11:36:04,023 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -11 predicate places. [2021-06-10 11:36:04,023 INFO L480 AbstractCegarLoop]: Abstraction has has 322 places, 326 transitions, 724 flow [2021-06-10 11:36:04,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,023 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-06-10 11:36:04,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-06-10 11:36:04,024 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 94748955, now seen corresponding path program 1 times [2021-06-10 11:36:04,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124772011] [2021-06-10 11:36:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:04,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:04,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124772011] [2021-06-10 11:36:04,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332376296] [2021-06-10 11:36:04,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 326 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,092 INFO L129 PetriNetUnfolder]: 33/362 cut-off events. [2021-06-10 11:36:04,093 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:04,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 362 events. 33/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1321 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 401. Up to 13 conditions per place. [2021-06-10 11:36:04,101 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/324 dead transitions. [2021-06-10 11:36:04,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 736 flow [2021-06-10 11:36:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:04,102 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:04,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,104 INFO L185 Difference]: Start difference. First operand has 322 places, 326 transitions, 724 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 736 flow [2021-06-10 11:36:04,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 324 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,107 INFO L241 Difference]: Finished difference. Result has 321 places, 324 transitions, 719 flow [2021-06-10 11:36:04,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=321, PETRI_TRANSITIONS=324} [2021-06-10 11:36:04,107 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -12 predicate places. [2021-06-10 11:36:04,107 INFO L480 AbstractCegarLoop]: Abstraction has has 321 places, 324 transitions, 719 flow [2021-06-10 11:36:04,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,107 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-06-10 11:36:04,109 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 286395517, now seen corresponding path program 1 times [2021-06-10 11:36:04,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780892186] [2021-06-10 11:36:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:04,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:04,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780892186] [2021-06-10 11:36:04,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373684] [2021-06-10 11:36:04,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:04,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 324 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:04,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,206 INFO L129 PetriNetUnfolder]: 32/369 cut-off events. [2021-06-10 11:36:04,206 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:04,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 369 events. 32/369 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1380 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 408. Up to 13 conditions per place. [2021-06-10 11:36:04,215 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 6 selfloop transitions, 1 changer transitions 0/325 dead transitions. [2021-06-10 11:36:04,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 325 transitions, 735 flow [2021-06-10 11:36:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:04,217 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:04,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,219 INFO L185 Difference]: Start difference. First operand has 321 places, 324 transitions, 719 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:04,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 325 transitions, 735 flow [2021-06-10 11:36:04,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,222 INFO L241 Difference]: Finished difference. Result has 323 places, 324 transitions, 723 flow [2021-06-10 11:36:04,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=323, PETRI_TRANSITIONS=324} [2021-06-10 11:36:04,222 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -10 predicate places. [2021-06-10 11:36:04,222 INFO L480 AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 723 flow [2021-06-10 11:36:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,223 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-06-10 11:36:04,223 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash 286396540, now seen corresponding path program 1 times [2021-06-10 11:36:04,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756087012] [2021-06-10 11:36:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:04,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:04,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756087012] [2021-06-10 11:36:04,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714619430] [2021-06-10 11:36:04,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,307 INFO L129 PetriNetUnfolder]: 30/371 cut-off events. [2021-06-10 11:36:04,307 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:04,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 371 events. 30/371 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1413 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 420. Up to 13 conditions per place. [2021-06-10 11:36:04,317 INFO L132 encePairwiseOnDemand]: 353/357 looper letters, 9 selfloop transitions, 3 changer transitions 0/325 dead transitions. [2021-06-10 11:36:04,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 325 transitions, 749 flow [2021-06-10 11:36:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2021-06-10 11:36:04,318 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2021-06-10 11:36:04,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,320 INFO L185 Difference]: Start difference. First operand has 323 places, 324 transitions, 723 flow. Second operand 3 states and 973 transitions. [2021-06-10 11:36:04,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 325 transitions, 749 flow [2021-06-10 11:36:04,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 325 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,323 INFO L241 Difference]: Finished difference. Result has 326 places, 325 transitions, 740 flow [2021-06-10 11:36:04,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2021-06-10 11:36:04,324 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -7 predicate places. [2021-06-10 11:36:04,324 INFO L480 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 740 flow [2021-06-10 11:36:04,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,324 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-06-10 11:36:04,324 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 285443228, now seen corresponding path program 1 times [2021-06-10 11:36:04,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878309254] [2021-06-10 11:36:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:04,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:04,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878309254] [2021-06-10 11:36:04,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429992240] [2021-06-10 11:36:04,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:04,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:04,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,401 INFO L129 PetriNetUnfolder]: 30/364 cut-off events. [2021-06-10 11:36:04,401 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:04,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 364 events. 30/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1354 event pairs, 0 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 405. Up to 13 conditions per place. [2021-06-10 11:36:04,411 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2021-06-10 11:36:04,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 323 transitions, 742 flow [2021-06-10 11:36:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:04,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:04,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,414 INFO L185 Difference]: Start difference. First operand has 326 places, 325 transitions, 740 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:04,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 323 transitions, 742 flow [2021-06-10 11:36:04,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 323 transitions, 734 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:04,417 INFO L241 Difference]: Finished difference. Result has 326 places, 323 transitions, 727 flow [2021-06-10 11:36:04,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=326, PETRI_TRANSITIONS=323} [2021-06-10 11:36:04,418 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -7 predicate places. [2021-06-10 11:36:04,418 INFO L480 AbstractCegarLoop]: Abstraction has has 326 places, 323 transitions, 727 flow [2021-06-10 11:36:04,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,418 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-06-10 11:36:04,418 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash 285442205, now seen corresponding path program 1 times [2021-06-10 11:36:04,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067446677] [2021-06-10 11:36:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:04,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:04,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067446677] [2021-06-10 11:36:04,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535511922] [2021-06-10 11:36:04,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 323 transitions, 727 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,496 INFO L129 PetriNetUnfolder]: 30/362 cut-off events. [2021-06-10 11:36:04,497 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:04,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 362 events. 30/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1339 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 410. Up to 13 conditions per place. [2021-06-10 11:36:04,506 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2021-06-10 11:36:04,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 740 flow [2021-06-10 11:36:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:04,507 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:04,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:04,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,509 INFO L185 Difference]: Start difference. First operand has 326 places, 323 transitions, 727 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:04,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 740 flow [2021-06-10 11:36:04,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 321 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,512 INFO L241 Difference]: Finished difference. Result has 325 places, 321 transitions, 723 flow [2021-06-10 11:36:04,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2021-06-10 11:36:04,513 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -8 predicate places. [2021-06-10 11:36:04,513 INFO L480 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 723 flow [2021-06-10 11:36:04,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,513 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,513 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-06-10 11:36:04,513 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 327242271, now seen corresponding path program 1 times [2021-06-10 11:36:04,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719986315] [2021-06-10 11:36:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:04,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:04,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719986315] [2021-06-10 11:36:04,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026181677] [2021-06-10 11:36:04,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:04,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:04,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,591 INFO L129 PetriNetUnfolder]: 28/367 cut-off events. [2021-06-10 11:36:04,591 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:04,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 367 events. 28/367 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1390 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 413. Up to 13 conditions per place. [2021-06-10 11:36:04,600 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 5 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2021-06-10 11:36:04,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 739 flow [2021-06-10 11:36:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:04,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:04,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:04,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,603 INFO L185 Difference]: Start difference. First operand has 325 places, 321 transitions, 723 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:04,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 739 flow [2021-06-10 11:36:04,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 322 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,607 INFO L241 Difference]: Finished difference. Result has 328 places, 322 transitions, 736 flow [2021-06-10 11:36:04,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=328, PETRI_TRANSITIONS=322} [2021-06-10 11:36:04,607 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -5 predicate places. [2021-06-10 11:36:04,607 INFO L480 AbstractCegarLoop]: Abstraction has has 328 places, 322 transitions, 736 flow [2021-06-10 11:36:04,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,607 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-06-10 11:36:04,607 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 327241248, now seen corresponding path program 1 times [2021-06-10 11:36:04,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929217689] [2021-06-10 11:36:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:04,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:04,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929217689] [2021-06-10 11:36:04,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006028709] [2021-06-10 11:36:04,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 322 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,696 INFO L129 PetriNetUnfolder]: 28/368 cut-off events. [2021-06-10 11:36:04,696 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:04,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 368 events. 28/368 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1398 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 421. Up to 13 conditions per place. [2021-06-10 11:36:04,706 INFO L132 encePairwiseOnDemand]: 353/357 looper letters, 9 selfloop transitions, 3 changer transitions 0/323 dead transitions. [2021-06-10 11:36:04,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 323 transitions, 762 flow [2021-06-10 11:36:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2021-06-10 11:36:04,707 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2021-06-10 11:36:04,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2021-06-10 11:36:04,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,709 INFO L185 Difference]: Start difference. First operand has 328 places, 322 transitions, 736 flow. Second operand 3 states and 973 transitions. [2021-06-10 11:36:04,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 323 transitions, 762 flow [2021-06-10 11:36:04,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 323 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,712 INFO L241 Difference]: Finished difference. Result has 331 places, 323 transitions, 752 flow [2021-06-10 11:36:04,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=331, PETRI_TRANSITIONS=323} [2021-06-10 11:36:04,713 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -2 predicate places. [2021-06-10 11:36:04,713 INFO L480 AbstractCegarLoop]: Abstraction has has 331 places, 323 transitions, 752 flow [2021-06-10 11:36:04,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,713 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-06-10 11:36:04,713 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 328195583, now seen corresponding path program 1 times [2021-06-10 11:36:04,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804968182] [2021-06-10 11:36:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:04,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:04,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804968182] [2021-06-10 11:36:04,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670865691] [2021-06-10 11:36:04,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 323 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,813 INFO L129 PetriNetUnfolder]: 27/365 cut-off events. [2021-06-10 11:36:04,814 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:04,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 365 events. 27/365 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1381 event pairs, 0 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 420. Up to 13 conditions per place. [2021-06-10 11:36:04,823 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 9 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2021-06-10 11:36:04,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 321 transitions, 760 flow [2021-06-10 11:36:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2021-06-10 11:36:04,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2021-06-10 11:36:04,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2021-06-10 11:36:04,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2021-06-10 11:36:04,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2021-06-10 11:36:04,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,826 INFO L185 Difference]: Start difference. First operand has 331 places, 323 transitions, 752 flow. Second operand 3 states and 972 transitions. [2021-06-10 11:36:04,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 321 transitions, 760 flow [2021-06-10 11:36:04,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 321 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:04,830 INFO L241 Difference]: Finished difference. Result has 332 places, 321 transitions, 741 flow [2021-06-10 11:36:04,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=332, PETRI_TRANSITIONS=321} [2021-06-10 11:36:04,830 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -1 predicate places. [2021-06-10 11:36:04,830 INFO L480 AbstractCegarLoop]: Abstraction has has 332 places, 321 transitions, 741 flow [2021-06-10 11:36:04,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,830 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-06-10 11:36:04,830 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash 328194560, now seen corresponding path program 1 times [2021-06-10 11:36:04,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648341672] [2021-06-10 11:36:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:04,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:04,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648341672] [2021-06-10 11:36:04,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993414065] [2021-06-10 11:36:04,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:04,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 321 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:04,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:04,914 INFO L129 PetriNetUnfolder]: 27/362 cut-off events. [2021-06-10 11:36:04,914 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:04,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 362 events. 27/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1355 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 414. Up to 13 conditions per place. [2021-06-10 11:36:04,923 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2021-06-10 11:36:04,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 318 transitions, 742 flow [2021-06-10 11:36:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:04,925 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:04,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:04,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:04,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,926 INFO L185 Difference]: Start difference. First operand has 332 places, 321 transitions, 741 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:04,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 318 transitions, 742 flow [2021-06-10 11:36:04,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 318 transitions, 737 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:04,930 INFO L241 Difference]: Finished difference. Result has 329 places, 318 transitions, 727 flow [2021-06-10 11:36:04,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=329, PETRI_TRANSITIONS=318} [2021-06-10 11:36:04,930 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -4 predicate places. [2021-06-10 11:36:04,930 INFO L480 AbstractCegarLoop]: Abstraction has has 329 places, 318 transitions, 727 flow [2021-06-10 11:36:04,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:04,930 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:04,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-06-10 11:36:04,931 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2141005788, now seen corresponding path program 1 times [2021-06-10 11:36:04,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:04,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929554560] [2021-06-10 11:36:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:04,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:04,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:04,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:04,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929554560] [2021-06-10 11:36:04,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:04,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:04,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757014894] [2021-06-10 11:36:04,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:04,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:04,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:04,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 318 transitions, 727 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:04,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:04,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:04,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,017 INFO L129 PetriNetUnfolder]: 26/370 cut-off events. [2021-06-10 11:36:05,017 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:05,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 370 events. 26/370 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1424 event pairs, 0 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 431. Up to 13 conditions per place. [2021-06-10 11:36:05,025 INFO L132 encePairwiseOnDemand]: 352/357 looper letters, 10 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2021-06-10 11:36:05,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 320 transitions, 757 flow [2021-06-10 11:36:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2021-06-10 11:36:05,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2021-06-10 11:36:05,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,028 INFO L185 Difference]: Start difference. First operand has 329 places, 318 transitions, 727 flow. Second operand 3 states and 975 transitions. [2021-06-10 11:36:05,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 320 transitions, 757 flow [2021-06-10 11:36:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 320 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,031 INFO L241 Difference]: Finished difference. Result has 332 places, 320 transitions, 750 flow [2021-06-10 11:36:05,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=332, PETRI_TRANSITIONS=320} [2021-06-10 11:36:05,031 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, -1 predicate places. [2021-06-10 11:36:05,031 INFO L480 AbstractCegarLoop]: Abstraction has has 332 places, 320 transitions, 750 flow [2021-06-10 11:36:05,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,031 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-06-10 11:36:05,032 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2141004765, now seen corresponding path program 1 times [2021-06-10 11:36:05,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280368133] [2021-06-10 11:36:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:05,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280368133] [2021-06-10 11:36:05,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214926546] [2021-06-10 11:36:05,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 320 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,097 INFO L129 PetriNetUnfolder]: 25/368 cut-off events. [2021-06-10 11:36:05,098 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:05,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 368 events. 25/368 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1413 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 426. Up to 13 conditions per place. [2021-06-10 11:36:05,107 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 5 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2021-06-10 11:36:05,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 320 transitions, 762 flow [2021-06-10 11:36:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:05,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:05,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,109 INFO L185 Difference]: Start difference. First operand has 332 places, 320 transitions, 750 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:05,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 320 transitions, 762 flow [2021-06-10 11:36:05,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 320 transitions, 757 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,113 INFO L241 Difference]: Finished difference. Result has 335 places, 320 transitions, 755 flow [2021-06-10 11:36:05,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=335, PETRI_TRANSITIONS=320} [2021-06-10 11:36:05,113 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 2 predicate places. [2021-06-10 11:36:05,113 INFO L480 AbstractCegarLoop]: Abstraction has has 335 places, 320 transitions, 755 flow [2021-06-10 11:36:05,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,113 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-06-10 11:36:05,113 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2140052476, now seen corresponding path program 1 times [2021-06-10 11:36:05,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041790065] [2021-06-10 11:36:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:05,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041790065] [2021-06-10 11:36:05,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187620847] [2021-06-10 11:36:05,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 320 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,184 INFO L129 PetriNetUnfolder]: 24/364 cut-off events. [2021-06-10 11:36:05,184 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:05,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 364 events. 24/364 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1387 event pairs, 0 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 423. Up to 13 conditions per place. [2021-06-10 11:36:05,192 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2021-06-10 11:36:05,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 317 transitions, 752 flow [2021-06-10 11:36:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:05,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:05,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,195 INFO L185 Difference]: Start difference. First operand has 335 places, 320 transitions, 755 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:05,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 317 transitions, 752 flow [2021-06-10 11:36:05,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 317 transitions, 745 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:05,198 INFO L241 Difference]: Finished difference. Result has 334 places, 317 transitions, 735 flow [2021-06-10 11:36:05,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=334, PETRI_TRANSITIONS=317} [2021-06-10 11:36:05,198 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 1 predicate places. [2021-06-10 11:36:05,198 INFO L480 AbstractCegarLoop]: Abstraction has has 334 places, 317 transitions, 735 flow [2021-06-10 11:36:05,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,198 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,199 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,199 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-06-10 11:36:05,199 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2140051453, now seen corresponding path program 1 times [2021-06-10 11:36:05,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655799150] [2021-06-10 11:36:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:05,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:05,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655799150] [2021-06-10 11:36:05,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452362995] [2021-06-10 11:36:05,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:05,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 317 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:05,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,266 INFO L129 PetriNetUnfolder]: 24/362 cut-off events. [2021-06-10 11:36:05,266 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:05,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 362 events. 24/362 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1369 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 424. Up to 13 conditions per place. [2021-06-10 11:36:05,274 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2021-06-10 11:36:05,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 315 transitions, 748 flow [2021-06-10 11:36:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:05,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:05,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,277 INFO L185 Difference]: Start difference. First operand has 334 places, 317 transitions, 735 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:05,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 315 transitions, 748 flow [2021-06-10 11:36:05,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 315 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,280 INFO L241 Difference]: Finished difference. Result has 333 places, 315 transitions, 731 flow [2021-06-10 11:36:05,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=333, PETRI_TRANSITIONS=315} [2021-06-10 11:36:05,280 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 0 predicate places. [2021-06-10 11:36:05,280 INFO L480 AbstractCegarLoop]: Abstraction has has 333 places, 315 transitions, 731 flow [2021-06-10 11:36:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,280 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-06-10 11:36:05,281 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2126373112, now seen corresponding path program 1 times [2021-06-10 11:36:05,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375048706] [2021-06-10 11:36:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:05,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:05,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375048706] [2021-06-10 11:36:05,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563848240] [2021-06-10 11:36:05,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:05,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 315 transitions, 731 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:05,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,373 INFO L129 PetriNetUnfolder]: 23/370 cut-off events. [2021-06-10 11:36:05,373 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:05,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 370 events. 23/370 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1439 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 13 conditions per place. [2021-06-10 11:36:05,382 INFO L132 encePairwiseOnDemand]: 352/357 looper letters, 10 selfloop transitions, 3 changer transitions 0/317 dead transitions. [2021-06-10 11:36:05,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 317 transitions, 761 flow [2021-06-10 11:36:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2021-06-10 11:36:05,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2021-06-10 11:36:05,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,386 INFO L185 Difference]: Start difference. First operand has 333 places, 315 transitions, 731 flow. Second operand 3 states and 975 transitions. [2021-06-10 11:36:05,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 317 transitions, 761 flow [2021-06-10 11:36:05,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 317 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,389 INFO L241 Difference]: Finished difference. Result has 336 places, 317 transitions, 754 flow [2021-06-10 11:36:05,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=336, PETRI_TRANSITIONS=317} [2021-06-10 11:36:05,389 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 3 predicate places. [2021-06-10 11:36:05,389 INFO L480 AbstractCegarLoop]: Abstraction has has 336 places, 317 transitions, 754 flow [2021-06-10 11:36:05,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,390 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,390 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-06-10 11:36:05,390 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2126374135, now seen corresponding path program 1 times [2021-06-10 11:36:05,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779020023] [2021-06-10 11:36:05,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:05,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779020023] [2021-06-10 11:36:05,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737254250] [2021-06-10 11:36:05,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 317 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,469 INFO L129 PetriNetUnfolder]: 21/371 cut-off events. [2021-06-10 11:36:05,470 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:05,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 371 events. 21/371 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1461 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 436. Up to 13 conditions per place. [2021-06-10 11:36:05,478 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 6 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2021-06-10 11:36:05,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 317 transitions, 766 flow [2021-06-10 11:36:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:05,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:05,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,480 INFO L185 Difference]: Start difference. First operand has 336 places, 317 transitions, 754 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:05,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 317 transitions, 766 flow [2021-06-10 11:36:05,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 317 transitions, 761 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,483 INFO L241 Difference]: Finished difference. Result has 338 places, 316 transitions, 750 flow [2021-06-10 11:36:05,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=338, PETRI_TRANSITIONS=316} [2021-06-10 11:36:05,483 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 5 predicate places. [2021-06-10 11:36:05,484 INFO L480 AbstractCegarLoop]: Abstraction has has 338 places, 316 transitions, 750 flow [2021-06-10 11:36:05,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,484 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-06-10 11:36:05,484 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2127326424, now seen corresponding path program 1 times [2021-06-10 11:36:05,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974500633] [2021-06-10 11:36:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:05,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974500633] [2021-06-10 11:36:05,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491444996] [2021-06-10 11:36:05,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 316 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,553 INFO L129 PetriNetUnfolder]: 21/364 cut-off events. [2021-06-10 11:36:05,553 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:05,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 364 events. 21/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1406 event pairs, 0 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 430. Up to 13 conditions per place. [2021-06-10 11:36:05,562 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2021-06-10 11:36:05,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 314 transitions, 753 flow [2021-06-10 11:36:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:05,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:05,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,564 INFO L185 Difference]: Start difference. First operand has 338 places, 316 transitions, 750 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 314 transitions, 753 flow [2021-06-10 11:36:05,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 314 transitions, 746 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:05,567 INFO L241 Difference]: Finished difference. Result has 338 places, 314 transitions, 739 flow [2021-06-10 11:36:05,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=338, PETRI_TRANSITIONS=314} [2021-06-10 11:36:05,568 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 5 predicate places. [2021-06-10 11:36:05,568 INFO L480 AbstractCegarLoop]: Abstraction has has 338 places, 314 transitions, 739 flow [2021-06-10 11:36:05,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,568 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-06-10 11:36:05,568 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2127327447, now seen corresponding path program 1 times [2021-06-10 11:36:05,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427417800] [2021-06-10 11:36:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:05,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:05,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427417800] [2021-06-10 11:36:05,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117328416] [2021-06-10 11:36:05,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,582 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:05,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 314 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:05,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,640 INFO L129 PetriNetUnfolder]: 21/362 cut-off events. [2021-06-10 11:36:05,640 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:05,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 362 events. 21/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1391 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 430. Up to 13 conditions per place. [2021-06-10 11:36:05,649 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/312 dead transitions. [2021-06-10 11:36:05,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 312 transitions, 752 flow [2021-06-10 11:36:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:05,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:05,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:05,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,651 INFO L185 Difference]: Start difference. First operand has 338 places, 314 transitions, 739 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:05,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 312 transitions, 752 flow [2021-06-10 11:36:05,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 312 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,654 INFO L241 Difference]: Finished difference. Result has 337 places, 312 transitions, 735 flow [2021-06-10 11:36:05,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=337, PETRI_TRANSITIONS=312} [2021-06-10 11:36:05,655 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 4 predicate places. [2021-06-10 11:36:05,655 INFO L480 AbstractCegarLoop]: Abstraction has has 337 places, 312 transitions, 735 flow [2021-06-10 11:36:05,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,655 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-06-10 11:36:05,655 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1956382350, now seen corresponding path program 1 times [2021-06-10 11:36:05,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469760933] [2021-06-10 11:36:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:05,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:05,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469760933] [2021-06-10 11:36:05,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389558383] [2021-06-10 11:36:05,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:05,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 312 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:05,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,733 INFO L129 PetriNetUnfolder]: 20/370 cut-off events. [2021-06-10 11:36:05,733 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:05,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 370 events. 20/370 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1461 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2021-06-10 11:36:05,741 INFO L132 encePairwiseOnDemand]: 352/357 looper letters, 10 selfloop transitions, 3 changer transitions 0/314 dead transitions. [2021-06-10 11:36:05,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 314 transitions, 765 flow [2021-06-10 11:36:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2021-06-10 11:36:05,743 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2021-06-10 11:36:05,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2021-06-10 11:36:05,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,744 INFO L185 Difference]: Start difference. First operand has 337 places, 312 transitions, 735 flow. Second operand 3 states and 975 transitions. [2021-06-10 11:36:05,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 314 transitions, 765 flow [2021-06-10 11:36:05,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 314 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,748 INFO L241 Difference]: Finished difference. Result has 340 places, 314 transitions, 758 flow [2021-06-10 11:36:05,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=340, PETRI_TRANSITIONS=314} [2021-06-10 11:36:05,748 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 7 predicate places. [2021-06-10 11:36:05,748 INFO L480 AbstractCegarLoop]: Abstraction has has 340 places, 314 transitions, 758 flow [2021-06-10 11:36:05,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,749 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-06-10 11:36:05,749 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1956381327, now seen corresponding path program 1 times [2021-06-10 11:36:05,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212894403] [2021-06-10 11:36:05,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:05,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212894403] [2021-06-10 11:36:05,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854658839] [2021-06-10 11:36:05,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 314 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,820 INFO L129 PetriNetUnfolder]: 18/371 cut-off events. [2021-06-10 11:36:05,820 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:05,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 371 events. 18/371 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1483 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2021-06-10 11:36:05,829 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 6 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2021-06-10 11:36:05,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 314 transitions, 770 flow [2021-06-10 11:36:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:05,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:05,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:05,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,832 INFO L185 Difference]: Start difference. First operand has 340 places, 314 transitions, 758 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:05,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 314 transitions, 770 flow [2021-06-10 11:36:05,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 314 transitions, 765 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:05,835 INFO L241 Difference]: Finished difference. Result has 342 places, 313 transitions, 754 flow [2021-06-10 11:36:05,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=342, PETRI_TRANSITIONS=313} [2021-06-10 11:36:05,835 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 9 predicate places. [2021-06-10 11:36:05,835 INFO L480 AbstractCegarLoop]: Abstraction has has 342 places, 313 transitions, 754 flow [2021-06-10 11:36:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,836 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-06-10 11:36:05,836 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1955429038, now seen corresponding path program 1 times [2021-06-10 11:36:05,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461115093] [2021-06-10 11:36:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:05,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:05,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461115093] [2021-06-10 11:36:05,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319608420] [2021-06-10 11:36:05,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:05,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 313 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:05,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,909 INFO L129 PetriNetUnfolder]: 18/364 cut-off events. [2021-06-10 11:36:05,909 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:05,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 364 events. 18/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1421 event pairs, 0 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 436. Up to 13 conditions per place. [2021-06-10 11:36:05,917 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/311 dead transitions. [2021-06-10 11:36:05,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 311 transitions, 757 flow [2021-06-10 11:36:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:05,918 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:05,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:05,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:05,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,920 INFO L185 Difference]: Start difference. First operand has 342 places, 313 transitions, 754 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:05,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 311 transitions, 757 flow [2021-06-10 11:36:05,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 311 transitions, 750 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:05,923 INFO L241 Difference]: Finished difference. Result has 342 places, 311 transitions, 743 flow [2021-06-10 11:36:05,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=342, PETRI_TRANSITIONS=311} [2021-06-10 11:36:05,923 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 9 predicate places. [2021-06-10 11:36:05,923 INFO L480 AbstractCegarLoop]: Abstraction has has 342 places, 311 transitions, 743 flow [2021-06-10 11:36:05,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:05,923 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:05,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-06-10 11:36:05,923 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1955428015, now seen corresponding path program 1 times [2021-06-10 11:36:05,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:05,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640241525] [2021-06-10 11:36:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:05,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:05,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:05,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:05,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640241525] [2021-06-10 11:36:05,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:05,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:05,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126445489] [2021-06-10 11:36:05,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:05,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:05,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:05,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 311 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:05,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:05,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:05,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:05,996 INFO L129 PetriNetUnfolder]: 18/362 cut-off events. [2021-06-10 11:36:05,996 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:06,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 362 events. 18/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1405 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 436. Up to 13 conditions per place. [2021-06-10 11:36:06,004 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2021-06-10 11:36:06,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 309 transitions, 756 flow [2021-06-10 11:36:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:06,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:06,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,006 INFO L185 Difference]: Start difference. First operand has 342 places, 311 transitions, 743 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:06,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 309 transitions, 756 flow [2021-06-10 11:36:06,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 309 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,009 INFO L241 Difference]: Finished difference. Result has 341 places, 309 transitions, 739 flow [2021-06-10 11:36:06,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=341, PETRI_TRANSITIONS=309} [2021-06-10 11:36:06,009 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 8 predicate places. [2021-06-10 11:36:06,009 INFO L480 AbstractCegarLoop]: Abstraction has has 341 places, 309 transitions, 739 flow [2021-06-10 11:36:06,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,010 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-06-10 11:36:06,010 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1735872053, now seen corresponding path program 1 times [2021-06-10 11:36:06,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830962969] [2021-06-10 11:36:06,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:06,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:06,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830962969] [2021-06-10 11:36:06,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962033058] [2021-06-10 11:36:06,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,024 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:06,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 309 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:06,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,086 INFO L129 PetriNetUnfolder]: 16/367 cut-off events. [2021-06-10 11:36:06,086 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:06,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 367 events. 16/367 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1456 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 439. Up to 13 conditions per place. [2021-06-10 11:36:06,094 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 5 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2021-06-10 11:36:06,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 310 transitions, 755 flow [2021-06-10 11:36:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:06,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:06,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,097 INFO L185 Difference]: Start difference. First operand has 341 places, 309 transitions, 739 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:06,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 310 transitions, 755 flow [2021-06-10 11:36:06,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 310 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,100 INFO L241 Difference]: Finished difference. Result has 344 places, 310 transitions, 752 flow [2021-06-10 11:36:06,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=344, PETRI_TRANSITIONS=310} [2021-06-10 11:36:06,100 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 11 predicate places. [2021-06-10 11:36:06,100 INFO L480 AbstractCegarLoop]: Abstraction has has 344 places, 310 transitions, 752 flow [2021-06-10 11:36:06,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,100 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-06-10 11:36:06,101 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1735871030, now seen corresponding path program 1 times [2021-06-10 11:36:06,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450105199] [2021-06-10 11:36:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:06,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:06,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450105199] [2021-06-10 11:36:06,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728591537] [2021-06-10 11:36:06,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:06,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 310 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:06,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,177 INFO L129 PetriNetUnfolder]: 16/368 cut-off events. [2021-06-10 11:36:06,177 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:06,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 368 events. 16/368 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1466 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 447. Up to 13 conditions per place. [2021-06-10 11:36:06,185 INFO L132 encePairwiseOnDemand]: 353/357 looper letters, 9 selfloop transitions, 3 changer transitions 0/311 dead transitions. [2021-06-10 11:36:06,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 311 transitions, 778 flow [2021-06-10 11:36:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2021-06-10 11:36:06,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2021-06-10 11:36:06,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,188 INFO L185 Difference]: Start difference. First operand has 344 places, 310 transitions, 752 flow. Second operand 3 states and 973 transitions. [2021-06-10 11:36:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 311 transitions, 778 flow [2021-06-10 11:36:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 311 transitions, 776 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,191 INFO L241 Difference]: Finished difference. Result has 347 places, 311 transitions, 768 flow [2021-06-10 11:36:06,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=347, PETRI_TRANSITIONS=311} [2021-06-10 11:36:06,191 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 14 predicate places. [2021-06-10 11:36:06,191 INFO L480 AbstractCegarLoop]: Abstraction has has 347 places, 311 transitions, 768 flow [2021-06-10 11:36:06,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,191 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-06-10 11:36:06,191 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1736824342, now seen corresponding path program 1 times [2021-06-10 11:36:06,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549585919] [2021-06-10 11:36:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:06,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:06,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549585919] [2021-06-10 11:36:06,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737014020] [2021-06-10 11:36:06,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:06,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 311 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:06,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,261 INFO L129 PetriNetUnfolder]: 15/364 cut-off events. [2021-06-10 11:36:06,261 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:06,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 364 events. 15/364 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1439 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 440. Up to 13 conditions per place. [2021-06-10 11:36:06,269 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2021-06-10 11:36:06,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 308 transitions, 765 flow [2021-06-10 11:36:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:06,271 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:06,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,272 INFO L185 Difference]: Start difference. First operand has 347 places, 311 transitions, 768 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:06,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 308 transitions, 765 flow [2021-06-10 11:36:06,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 308 transitions, 757 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:06,275 INFO L241 Difference]: Finished difference. Result has 346 places, 308 transitions, 747 flow [2021-06-10 11:36:06,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=346, PETRI_TRANSITIONS=308} [2021-06-10 11:36:06,275 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 13 predicate places. [2021-06-10 11:36:06,275 INFO L480 AbstractCegarLoop]: Abstraction has has 346 places, 308 transitions, 747 flow [2021-06-10 11:36:06,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,276 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-06-10 11:36:06,276 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1736825365, now seen corresponding path program 1 times [2021-06-10 11:36:06,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252244723] [2021-06-10 11:36:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:06,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:06,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252244723] [2021-06-10 11:36:06,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66002141] [2021-06-10 11:36:06,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,289 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:06,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 308 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:06,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,346 INFO L129 PetriNetUnfolder]: 15/362 cut-off events. [2021-06-10 11:36:06,346 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:06,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 362 events. 15/362 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1422 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 443. Up to 13 conditions per place. [2021-06-10 11:36:06,354 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 8 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2021-06-10 11:36:06,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 306 transitions, 760 flow [2021-06-10 11:36:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2021-06-10 11:36:06,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2021-06-10 11:36:06,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2021-06-10 11:36:06,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,357 INFO L185 Difference]: Start difference. First operand has 346 places, 308 transitions, 747 flow. Second operand 3 states and 970 transitions. [2021-06-10 11:36:06,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 306 transitions, 760 flow [2021-06-10 11:36:06,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 306 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,360 INFO L241 Difference]: Finished difference. Result has 345 places, 306 transitions, 743 flow [2021-06-10 11:36:06,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=345, PETRI_TRANSITIONS=306} [2021-06-10 11:36:06,360 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 12 predicate places. [2021-06-10 11:36:06,360 INFO L480 AbstractCegarLoop]: Abstraction has has 345 places, 306 transitions, 743 flow [2021-06-10 11:36:06,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,360 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-06-10 11:36:06,361 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash -387524035, now seen corresponding path program 1 times [2021-06-10 11:36:06,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144779246] [2021-06-10 11:36:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:06,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:06,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144779246] [2021-06-10 11:36:06,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544024046] [2021-06-10 11:36:06,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:06,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 306 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:06,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,432 INFO L129 PetriNetUnfolder]: 13/367 cut-off events. [2021-06-10 11:36:06,432 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:06,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 367 events. 13/367 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1471 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 446. Up to 13 conditions per place. [2021-06-10 11:36:06,441 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 5 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2021-06-10 11:36:06,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 307 transitions, 759 flow [2021-06-10 11:36:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2021-06-10 11:36:06,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-06-10 11:36:06,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2021-06-10 11:36:06,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,443 INFO L185 Difference]: Start difference. First operand has 345 places, 306 transitions, 743 flow. Second operand 3 states and 983 transitions. [2021-06-10 11:36:06,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 307 transitions, 759 flow [2021-06-10 11:36:06,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 307 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,446 INFO L241 Difference]: Finished difference. Result has 348 places, 307 transitions, 756 flow [2021-06-10 11:36:06,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=348, PETRI_TRANSITIONS=307} [2021-06-10 11:36:06,446 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 15 predicate places. [2021-06-10 11:36:06,446 INFO L480 AbstractCegarLoop]: Abstraction has has 348 places, 307 transitions, 756 flow [2021-06-10 11:36:06,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,447 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,447 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-06-10 11:36:06,447 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -387525058, now seen corresponding path program 1 times [2021-06-10 11:36:06,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348268794] [2021-06-10 11:36:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:06,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:06,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348268794] [2021-06-10 11:36:06,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006159292] [2021-06-10 11:36:06,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:06,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 307 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:06,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,539 INFO L129 PetriNetUnfolder]: 13/368 cut-off events. [2021-06-10 11:36:06,539 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:06,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 368 events. 13/368 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1482 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 454. Up to 13 conditions per place. [2021-06-10 11:36:06,546 INFO L132 encePairwiseOnDemand]: 353/357 looper letters, 9 selfloop transitions, 3 changer transitions 0/308 dead transitions. [2021-06-10 11:36:06,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 308 transitions, 782 flow [2021-06-10 11:36:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2021-06-10 11:36:06,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2021-06-10 11:36:06,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2021-06-10 11:36:06,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,548 INFO L185 Difference]: Start difference. First operand has 348 places, 307 transitions, 756 flow. Second operand 3 states and 973 transitions. [2021-06-10 11:36:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 308 transitions, 782 flow [2021-06-10 11:36:06,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 308 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,551 INFO L241 Difference]: Finished difference. Result has 351 places, 308 transitions, 772 flow [2021-06-10 11:36:06,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=351, PETRI_TRANSITIONS=308} [2021-06-10 11:36:06,551 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 18 predicate places. [2021-06-10 11:36:06,552 INFO L480 AbstractCegarLoop]: Abstraction has has 351 places, 308 transitions, 772 flow [2021-06-10 11:36:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,552 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-06-10 11:36:06,552 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -386570723, now seen corresponding path program 1 times [2021-06-10 11:36:06,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141545513] [2021-06-10 11:36:06,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:06,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:06,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141545513] [2021-06-10 11:36:06,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975885926] [2021-06-10 11:36:06,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,565 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 357 [2021-06-10 11:36:06,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 308 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 357 [2021-06-10 11:36:06,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,629 INFO L129 PetriNetUnfolder]: 12/365 cut-off events. [2021-06-10 11:36:06,629 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:06,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 365 events. 12/365 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1463 event pairs, 0 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 453. Up to 13 conditions per place. [2021-06-10 11:36:06,639 INFO L132 encePairwiseOnDemand]: 354/357 looper letters, 9 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2021-06-10 11:36:06,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 306 transitions, 780 flow [2021-06-10 11:36:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2021-06-10 11:36:06,640 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2021-06-10 11:36:06,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2021-06-10 11:36:06,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2021-06-10 11:36:06,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2021-06-10 11:36:06,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,641 INFO L185 Difference]: Start difference. First operand has 351 places, 308 transitions, 772 flow. Second operand 3 states and 972 transitions. [2021-06-10 11:36:06,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 306 transitions, 780 flow [2021-06-10 11:36:06,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 306 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:06,644 INFO L241 Difference]: Finished difference. Result has 352 places, 306 transitions, 761 flow [2021-06-10 11:36:06,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=352, PETRI_TRANSITIONS=306} [2021-06-10 11:36:06,645 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 19 predicate places. [2021-06-10 11:36:06,645 INFO L480 AbstractCegarLoop]: Abstraction has has 352 places, 306 transitions, 761 flow [2021-06-10 11:36:06,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,645 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:06,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-06-10 11:36:06,645 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash -386571746, now seen corresponding path program 1 times [2021-06-10 11:36:06,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269949233] [2021-06-10 11:36:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:06,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:06,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:06,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:06,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269949233] [2021-06-10 11:36:06,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:06,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:06,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287466403] [2021-06-10 11:36:06,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:06,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:06,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 357 [2021-06-10 11:36:06,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 306 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:06,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 357 [2021-06-10 11:36:06,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:06,722 INFO L129 PetriNetUnfolder]: 12/362 cut-off events. [2021-06-10 11:36:06,722 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:06,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 362 events. 12/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1442 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 447. Up to 13 conditions per place. [2021-06-10 11:36:06,730 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 5 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2021-06-10 11:36:06,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 303 transitions, 762 flow [2021-06-10 11:36:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2021-06-10 11:36:06,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9169000933706816 [2021-06-10 11:36:06,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:06,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2021-06-10 11:36:06,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,734 INFO L185 Difference]: Start difference. First operand has 352 places, 306 transitions, 761 flow. Second operand 3 states and 982 transitions. [2021-06-10 11:36:06,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 303 transitions, 762 flow [2021-06-10 11:36:06,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 303 transitions, 757 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:06,738 INFO L241 Difference]: Finished difference. Result has 349 places, 303 transitions, 747 flow [2021-06-10 11:36:06,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=349, PETRI_TRANSITIONS=303} [2021-06-10 11:36:06,738 INFO L343 CegarLoopForPetriNet]: 333 programPoint places, 16 predicate places. [2021-06-10 11:36:06,738 INFO L480 AbstractCegarLoop]: Abstraction has has 349 places, 303 transitions, 747 flow [2021-06-10 11:36:06,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:06,738 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:06,738 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 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-06-10 11:36:06,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-06-10 11:36:06,738 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1782563812, now seen corresponding path program 1 times [2021-06-10 11:36:06,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:06,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236481458] [2021-06-10 11:36:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:06,746 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:06,751 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:06,757 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:06,757 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:06,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-06-10 11:36:06,757 WARN L342 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:06,758 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,844 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of13ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of13ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:06,960 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:06,960 INFO L253 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2021-06-10 11:36:06,961 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:06,961 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:06,961 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:06,961 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:06,961 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:06,961 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:06,961 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:06,961 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:06,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 359 places, 385 transitions, 991 flow [2021-06-10 11:36:07,025 INFO L129 PetriNetUnfolder]: 66/501 cut-off events. [2021-06-10 11:36:07,025 INFO L130 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2021-06-10 11:36:07,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 501 events. 66/501 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1990 event pairs, 0 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 569. Up to 28 conditions per place. [2021-06-10 11:36:07,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 359 places, 385 transitions, 991 flow [2021-06-10 11:36:07,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 385 transitions, 991 flow [2021-06-10 11:36:07,046 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2021-06-10 11:36:07,046 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:07,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,046 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-06-10 11:36:07,047 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1629726453, now seen corresponding path program 1 times [2021-06-10 11:36:07,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515792131] [2021-06-10 11:36:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:07,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:07,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515792131] [2021-06-10 11:36:07,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539588550] [2021-06-10 11:36:07,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:07,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 385 transitions, 991 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:07,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,126 INFO L129 PetriNetUnfolder]: 38/399 cut-off events. [2021-06-10 11:36:07,126 INFO L130 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2021-06-10 11:36:07,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 399 events. 38/399 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1485 event pairs, 0 based on Foata normal form. 60/406 useless extension candidates. Maximal degree in co-relation 480. Up to 14 conditions per place. [2021-06-10 11:36:07,137 INFO L132 encePairwiseOnDemand]: 365/385 looper letters, 10 selfloop transitions, 3 changer transitions 0/355 dead transitions. [2021-06-10 11:36:07,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 355 transitions, 957 flow [2021-06-10 11:36:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2021-06-10 11:36:07,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9376623376623376 [2021-06-10 11:36:07,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1083 transitions. [2021-06-10 11:36:07,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1083 transitions. [2021-06-10 11:36:07,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1083 transitions. [2021-06-10 11:36:07,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,140 INFO L185 Difference]: Start difference. First operand has 359 places, 385 transitions, 991 flow. Second operand 3 states and 1083 transitions. [2021-06-10 11:36:07,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 355 transitions, 957 flow [2021-06-10 11:36:07,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 355 transitions, 801 flow, removed 78 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:07,143 INFO L241 Difference]: Finished difference. Result has 345 places, 355 transitions, 795 flow [2021-06-10 11:36:07,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=345, PETRI_TRANSITIONS=355} [2021-06-10 11:36:07,144 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -14 predicate places. [2021-06-10 11:36:07,144 INFO L480 AbstractCegarLoop]: Abstraction has has 345 places, 355 transitions, 795 flow [2021-06-10 11:36:07,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,144 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,144 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-06-10 11:36:07,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-06-10 11:36:07,144 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1628773141, now seen corresponding path program 1 times [2021-06-10 11:36:07,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338592352] [2021-06-10 11:36:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:07,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338592352] [2021-06-10 11:36:07,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355933307] [2021-06-10 11:36:07,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 355 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,213 INFO L129 PetriNetUnfolder]: 37/395 cut-off events. [2021-06-10 11:36:07,213 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:07,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 395 events. 37/395 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1458 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 428. Up to 14 conditions per place. [2021-06-10 11:36:07,224 INFO L132 encePairwiseOnDemand]: 382/385 looper letters, 5 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2021-06-10 11:36:07,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 354 transitions, 801 flow [2021-06-10 11:36:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:07,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:07,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,227 INFO L185 Difference]: Start difference. First operand has 345 places, 355 transitions, 795 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:07,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 354 transitions, 801 flow [2021-06-10 11:36:07,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 797 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,231 INFO L241 Difference]: Finished difference. Result has 348 places, 354 transitions, 795 flow [2021-06-10 11:36:07,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=348, PETRI_TRANSITIONS=354} [2021-06-10 11:36:07,231 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -11 predicate places. [2021-06-10 11:36:07,231 INFO L480 AbstractCegarLoop]: Abstraction has has 348 places, 354 transitions, 795 flow [2021-06-10 11:36:07,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,231 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-06-10 11:36:07,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-06-10 11:36:07,231 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1629725430, now seen corresponding path program 1 times [2021-06-10 11:36:07,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827386452] [2021-06-10 11:36:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:07,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827386452] [2021-06-10 11:36:07,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016452142] [2021-06-10 11:36:07,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 354 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,302 INFO L129 PetriNetUnfolder]: 36/393 cut-off events. [2021-06-10 11:36:07,302 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:07,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 393 events. 36/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1449 event pairs, 0 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 431. Up to 14 conditions per place. [2021-06-10 11:36:07,312 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/352 dead transitions. [2021-06-10 11:36:07,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 352 transitions, 797 flow [2021-06-10 11:36:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:07,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:07,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,315 INFO L185 Difference]: Start difference. First operand has 348 places, 354 transitions, 795 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:07,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 352 transitions, 797 flow [2021-06-10 11:36:07,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 352 transitions, 792 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:36:07,318 INFO L241 Difference]: Finished difference. Result has 348 places, 352 transitions, 782 flow [2021-06-10 11:36:07,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2021-06-10 11:36:07,318 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -11 predicate places. [2021-06-10 11:36:07,318 INFO L480 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 782 flow [2021-06-10 11:36:07,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,319 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-06-10 11:36:07,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-06-10 11:36:07,319 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1628772118, now seen corresponding path program 1 times [2021-06-10 11:36:07,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381003210] [2021-06-10 11:36:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:07,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:07,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381003210] [2021-06-10 11:36:07,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451076063] [2021-06-10 11:36:07,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:07,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:07,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,393 INFO L129 PetriNetUnfolder]: 36/391 cut-off events. [2021-06-10 11:36:07,393 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-06-10 11:36:07,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 391 events. 36/391 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1440 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 437. Up to 14 conditions per place. [2021-06-10 11:36:07,403 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/350 dead transitions. [2021-06-10 11:36:07,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 794 flow [2021-06-10 11:36:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:07,404 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:07,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,405 INFO L185 Difference]: Start difference. First operand has 348 places, 352 transitions, 782 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:07,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 794 flow [2021-06-10 11:36:07,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,409 INFO L241 Difference]: Finished difference. Result has 347 places, 350 transitions, 777 flow [2021-06-10 11:36:07,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=347, PETRI_TRANSITIONS=350} [2021-06-10 11:36:07,409 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -12 predicate places. [2021-06-10 11:36:07,409 INFO L480 AbstractCegarLoop]: Abstraction has has 347 places, 350 transitions, 777 flow [2021-06-10 11:36:07,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,409 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-06-10 11:36:07,409 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash 239728498, now seen corresponding path program 1 times [2021-06-10 11:36:07,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275747152] [2021-06-10 11:36:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:07,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275747152] [2021-06-10 11:36:07,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889111268] [2021-06-10 11:36:07,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,422 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 350 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,476 INFO L129 PetriNetUnfolder]: 34/396 cut-off events. [2021-06-10 11:36:07,476 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:07,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 396 events. 34/396 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1490 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 439. Up to 14 conditions per place. [2021-06-10 11:36:07,486 INFO L132 encePairwiseOnDemand]: 382/385 looper letters, 5 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2021-06-10 11:36:07,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 351 transitions, 793 flow [2021-06-10 11:36:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:07,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:07,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,488 INFO L185 Difference]: Start difference. First operand has 347 places, 350 transitions, 777 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:07,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 351 transitions, 793 flow [2021-06-10 11:36:07,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 351 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,493 INFO L241 Difference]: Finished difference. Result has 350 places, 351 transitions, 790 flow [2021-06-10 11:36:07,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=350, PETRI_TRANSITIONS=351} [2021-06-10 11:36:07,493 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -9 predicate places. [2021-06-10 11:36:07,494 INFO L480 AbstractCegarLoop]: Abstraction has has 350 places, 351 transitions, 790 flow [2021-06-10 11:36:07,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,494 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-06-10 11:36:07,494 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 239727475, now seen corresponding path program 1 times [2021-06-10 11:36:07,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245472308] [2021-06-10 11:36:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:07,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:07,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245472308] [2021-06-10 11:36:07,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394876558] [2021-06-10 11:36:07,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:07,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 351 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:07,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,570 INFO L129 PetriNetUnfolder]: 34/397 cut-off events. [2021-06-10 11:36:07,571 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:07,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 397 events. 34/397 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1497 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 447. Up to 14 conditions per place. [2021-06-10 11:36:07,580 INFO L132 encePairwiseOnDemand]: 381/385 looper letters, 9 selfloop transitions, 3 changer transitions 0/352 dead transitions. [2021-06-10 11:36:07,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 352 transitions, 816 flow [2021-06-10 11:36:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2021-06-10 11:36:07,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90995670995671 [2021-06-10 11:36:07,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,583 INFO L185 Difference]: Start difference. First operand has 350 places, 351 transitions, 790 flow. Second operand 3 states and 1051 transitions. [2021-06-10 11:36:07,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 352 transitions, 816 flow [2021-06-10 11:36:07,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 352 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,586 INFO L241 Difference]: Finished difference. Result has 353 places, 352 transitions, 806 flow [2021-06-10 11:36:07,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=353, PETRI_TRANSITIONS=352} [2021-06-10 11:36:07,587 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -6 predicate places. [2021-06-10 11:36:07,587 INFO L480 AbstractCegarLoop]: Abstraction has has 353 places, 352 transitions, 806 flow [2021-06-10 11:36:07,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,587 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-06-10 11:36:07,587 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash 240680787, now seen corresponding path program 1 times [2021-06-10 11:36:07,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371187890] [2021-06-10 11:36:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:07,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371187890] [2021-06-10 11:36:07,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429914909] [2021-06-10 11:36:07,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 352 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,652 INFO L129 PetriNetUnfolder]: 33/393 cut-off events. [2021-06-10 11:36:07,653 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:07,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 393 events. 33/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1468 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 440. Up to 14 conditions per place. [2021-06-10 11:36:07,662 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2021-06-10 11:36:07,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 349 transitions, 803 flow [2021-06-10 11:36:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:07,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:07,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:07,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,665 INFO L185 Difference]: Start difference. First operand has 353 places, 352 transitions, 806 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:07,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 349 transitions, 803 flow [2021-06-10 11:36:07,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 349 transitions, 795 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:07,668 INFO L241 Difference]: Finished difference. Result has 352 places, 349 transitions, 785 flow [2021-06-10 11:36:07,668 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2021-06-10 11:36:07,668 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -7 predicate places. [2021-06-10 11:36:07,668 INFO L480 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 785 flow [2021-06-10 11:36:07,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,668 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-06-10 11:36:07,668 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 240681810, now seen corresponding path program 1 times [2021-06-10 11:36:07,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792864277] [2021-06-10 11:36:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:07,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:07,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792864277] [2021-06-10 11:36:07,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970953430] [2021-06-10 11:36:07,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:07,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:07,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,746 INFO L129 PetriNetUnfolder]: 33/391 cut-off events. [2021-06-10 11:36:07,746 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:07,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 391 events. 33/391 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1457 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 444. Up to 14 conditions per place. [2021-06-10 11:36:07,754 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/347 dead transitions. [2021-06-10 11:36:07,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 347 transitions, 798 flow [2021-06-10 11:36:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:07,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:07,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:07,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,757 INFO L185 Difference]: Start difference. First operand has 352 places, 349 transitions, 785 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:07,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 347 transitions, 798 flow [2021-06-10 11:36:07,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 347 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,760 INFO L241 Difference]: Finished difference. Result has 351 places, 347 transitions, 781 flow [2021-06-10 11:36:07,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=351, PETRI_TRANSITIONS=347} [2021-06-10 11:36:07,760 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -8 predicate places. [2021-06-10 11:36:07,760 INFO L480 AbstractCegarLoop]: Abstraction has has 351 places, 347 transitions, 781 flow [2021-06-10 11:36:07,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,760 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-06-10 11:36:07,761 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1132952144, now seen corresponding path program 1 times [2021-06-10 11:36:07,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742404826] [2021-06-10 11:36:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:07,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742404826] [2021-06-10 11:36:07,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503137656] [2021-06-10 11:36:07,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 347 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,826 INFO L129 PetriNetUnfolder]: 31/396 cut-off events. [2021-06-10 11:36:07,827 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:07,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 396 events. 31/396 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1508 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 447. Up to 14 conditions per place. [2021-06-10 11:36:07,836 INFO L132 encePairwiseOnDemand]: 382/385 looper letters, 5 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2021-06-10 11:36:07,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 797 flow [2021-06-10 11:36:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:07,837 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:07,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:07,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,839 INFO L185 Difference]: Start difference. First operand has 351 places, 347 transitions, 781 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:07,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 797 flow [2021-06-10 11:36:07,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 796 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,842 INFO L241 Difference]: Finished difference. Result has 354 places, 348 transitions, 794 flow [2021-06-10 11:36:07,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=354, PETRI_TRANSITIONS=348} [2021-06-10 11:36:07,843 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -5 predicate places. [2021-06-10 11:36:07,843 INFO L480 AbstractCegarLoop]: Abstraction has has 354 places, 348 transitions, 794 flow [2021-06-10 11:36:07,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,843 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-06-10 11:36:07,843 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1132951121, now seen corresponding path program 1 times [2021-06-10 11:36:07,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795669255] [2021-06-10 11:36:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:07,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:07,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795669255] [2021-06-10 11:36:07,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717886839] [2021-06-10 11:36:07,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,855 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:07,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 348 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:07,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,915 INFO L129 PetriNetUnfolder]: 31/397 cut-off events. [2021-06-10 11:36:07,916 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:07,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 397 events. 31/397 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1517 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 454. Up to 14 conditions per place. [2021-06-10 11:36:07,926 INFO L132 encePairwiseOnDemand]: 381/385 looper letters, 9 selfloop transitions, 3 changer transitions 0/349 dead transitions. [2021-06-10 11:36:07,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 349 transitions, 820 flow [2021-06-10 11:36:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2021-06-10 11:36:07,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90995670995671 [2021-06-10 11:36:07,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:07,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2021-06-10 11:36:07,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,928 INFO L185 Difference]: Start difference. First operand has 354 places, 348 transitions, 794 flow. Second operand 3 states and 1051 transitions. [2021-06-10 11:36:07,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 349 transitions, 820 flow [2021-06-10 11:36:07,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 349 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:07,932 INFO L241 Difference]: Finished difference. Result has 357 places, 349 transitions, 810 flow [2021-06-10 11:36:07,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=357, PETRI_TRANSITIONS=349} [2021-06-10 11:36:07,932 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -2 predicate places. [2021-06-10 11:36:07,932 INFO L480 AbstractCegarLoop]: Abstraction has has 357 places, 349 transitions, 810 flow [2021-06-10 11:36:07,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:07,932 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:07,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-06-10 11:36:07,932 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1133904433, now seen corresponding path program 1 times [2021-06-10 11:36:07,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:07,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673013752] [2021-06-10 11:36:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:07,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:07,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:07,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:07,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673013752] [2021-06-10 11:36:07,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:07,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:07,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52881005] [2021-06-10 11:36:07,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:07,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:07,944 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:07,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 349 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:07,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:07,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:07,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:07,999 INFO L129 PetriNetUnfolder]: 30/393 cut-off events. [2021-06-10 11:36:07,999 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:08,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 393 events. 30/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1489 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 447. Up to 14 conditions per place. [2021-06-10 11:36:08,008 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2021-06-10 11:36:08,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 346 transitions, 807 flow [2021-06-10 11:36:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:08,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:08,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,010 INFO L185 Difference]: Start difference. First operand has 357 places, 349 transitions, 810 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:08,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 346 transitions, 807 flow [2021-06-10 11:36:08,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 346 transitions, 799 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:08,014 INFO L241 Difference]: Finished difference. Result has 356 places, 346 transitions, 789 flow [2021-06-10 11:36:08,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=356, PETRI_TRANSITIONS=346} [2021-06-10 11:36:08,014 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -3 predicate places. [2021-06-10 11:36:08,014 INFO L480 AbstractCegarLoop]: Abstraction has has 356 places, 346 transitions, 789 flow [2021-06-10 11:36:08,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,014 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-06-10 11:36:08,014 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1133905456, now seen corresponding path program 1 times [2021-06-10 11:36:08,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360076391] [2021-06-10 11:36:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:08,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:08,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360076391] [2021-06-10 11:36:08,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607773759] [2021-06-10 11:36:08,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 346 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,094 INFO L129 PetriNetUnfolder]: 30/391 cut-off events. [2021-06-10 11:36:08,094 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:08,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 391 events. 30/391 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1475 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 451. Up to 14 conditions per place. [2021-06-10 11:36:08,103 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2021-06-10 11:36:08,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 344 transitions, 802 flow [2021-06-10 11:36:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:08,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:08,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,105 INFO L185 Difference]: Start difference. First operand has 356 places, 346 transitions, 789 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 344 transitions, 802 flow [2021-06-10 11:36:08,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 344 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,108 INFO L241 Difference]: Finished difference. Result has 355 places, 344 transitions, 785 flow [2021-06-10 11:36:08,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=355, PETRI_TRANSITIONS=344} [2021-06-10 11:36:08,108 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -4 predicate places. [2021-06-10 11:36:08,108 INFO L480 AbstractCegarLoop]: Abstraction has has 355 places, 344 transitions, 785 flow [2021-06-10 11:36:08,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,108 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-06-10 11:36:08,109 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 634826511, now seen corresponding path program 1 times [2021-06-10 11:36:08,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552085896] [2021-06-10 11:36:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:08,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:08,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552085896] [2021-06-10 11:36:08,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71780183] [2021-06-10 11:36:08,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 344 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,218 INFO L129 PetriNetUnfolder]: 29/399 cut-off events. [2021-06-10 11:36:08,218 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:08,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 399 events. 29/399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1544 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 463. Up to 14 conditions per place. [2021-06-10 11:36:08,227 INFO L132 encePairwiseOnDemand]: 380/385 looper letters, 10 selfloop transitions, 3 changer transitions 0/346 dead transitions. [2021-06-10 11:36:08,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 346 transitions, 815 flow [2021-06-10 11:36:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1053 transitions. [2021-06-10 11:36:08,228 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9116883116883117 [2021-06-10 11:36:08,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,230 INFO L185 Difference]: Start difference. First operand has 355 places, 344 transitions, 785 flow. Second operand 3 states and 1053 transitions. [2021-06-10 11:36:08,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 346 transitions, 815 flow [2021-06-10 11:36:08,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 346 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,233 INFO L241 Difference]: Finished difference. Result has 358 places, 346 transitions, 808 flow [2021-06-10 11:36:08,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=358, PETRI_TRANSITIONS=346} [2021-06-10 11:36:08,233 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, -1 predicate places. [2021-06-10 11:36:08,233 INFO L480 AbstractCegarLoop]: Abstraction has has 358 places, 346 transitions, 808 flow [2021-06-10 11:36:08,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,233 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-06-10 11:36:08,233 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 634825488, now seen corresponding path program 1 times [2021-06-10 11:36:08,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193795914] [2021-06-10 11:36:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:08,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:08,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193795914] [2021-06-10 11:36:08,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945472110] [2021-06-10 11:36:08,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,246 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:08,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 346 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:08,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,316 INFO L129 PetriNetUnfolder]: 27/400 cut-off events. [2021-06-10 11:36:08,316 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:08,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 400 events. 27/400 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1570 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 462. Up to 14 conditions per place. [2021-06-10 11:36:08,326 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 6 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2021-06-10 11:36:08,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 346 transitions, 820 flow [2021-06-10 11:36:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:08,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:08,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,328 INFO L185 Difference]: Start difference. First operand has 358 places, 346 transitions, 808 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:08,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 346 transitions, 820 flow [2021-06-10 11:36:08,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 346 transitions, 815 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,331 INFO L241 Difference]: Finished difference. Result has 360 places, 345 transitions, 804 flow [2021-06-10 11:36:08,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=360, PETRI_TRANSITIONS=345} [2021-06-10 11:36:08,331 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 1 predicate places. [2021-06-10 11:36:08,332 INFO L480 AbstractCegarLoop]: Abstraction has has 360 places, 345 transitions, 804 flow [2021-06-10 11:36:08,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,332 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-06-10 11:36:08,332 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash 633873199, now seen corresponding path program 1 times [2021-06-10 11:36:08,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372540461] [2021-06-10 11:36:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:08,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:08,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372540461] [2021-06-10 11:36:08,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107541325] [2021-06-10 11:36:08,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:08,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 345 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:08,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,398 INFO L129 PetriNetUnfolder]: 27/393 cut-off events. [2021-06-10 11:36:08,398 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:08,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 393 events. 27/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1508 event pairs, 0 based on Foata normal form. 1/355 useless extension candidates. Maximal degree in co-relation 457. Up to 14 conditions per place. [2021-06-10 11:36:08,407 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/343 dead transitions. [2021-06-10 11:36:08,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 343 transitions, 807 flow [2021-06-10 11:36:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:08,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:08,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,410 INFO L185 Difference]: Start difference. First operand has 360 places, 345 transitions, 804 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:08,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 343 transitions, 807 flow [2021-06-10 11:36:08,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 343 transitions, 800 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:08,412 INFO L241 Difference]: Finished difference. Result has 360 places, 343 transitions, 793 flow [2021-06-10 11:36:08,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=360, PETRI_TRANSITIONS=343} [2021-06-10 11:36:08,413 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 1 predicate places. [2021-06-10 11:36:08,413 INFO L480 AbstractCegarLoop]: Abstraction has has 360 places, 343 transitions, 793 flow [2021-06-10 11:36:08,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,413 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-06-10 11:36:08,413 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,413 INFO L82 PathProgramCache]: Analyzing trace with hash 633872176, now seen corresponding path program 1 times [2021-06-10 11:36:08,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744799354] [2021-06-10 11:36:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:08,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:08,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744799354] [2021-06-10 11:36:08,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016789800] [2021-06-10 11:36:08,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 343 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,482 INFO L129 PetriNetUnfolder]: 27/391 cut-off events. [2021-06-10 11:36:08,482 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:08,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 391 events. 27/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1492 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 457. Up to 14 conditions per place. [2021-06-10 11:36:08,491 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2021-06-10 11:36:08,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 341 transitions, 806 flow [2021-06-10 11:36:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:08,492 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:08,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,493 INFO L185 Difference]: Start difference. First operand has 360 places, 343 transitions, 793 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:08,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 341 transitions, 806 flow [2021-06-10 11:36:08,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 341 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,496 INFO L241 Difference]: Finished difference. Result has 359 places, 341 transitions, 789 flow [2021-06-10 11:36:08,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=359, PETRI_TRANSITIONS=341} [2021-06-10 11:36:08,496 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 0 predicate places. [2021-06-10 11:36:08,496 INFO L480 AbstractCegarLoop]: Abstraction has has 359 places, 341 transitions, 789 flow [2021-06-10 11:36:08,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,496 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-06-10 11:36:08,497 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash 726879600, now seen corresponding path program 1 times [2021-06-10 11:36:08,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334940504] [2021-06-10 11:36:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:08,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:08,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334940504] [2021-06-10 11:36:08,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138809674] [2021-06-10 11:36:08,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:08,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 341 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:08,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,571 INFO L129 PetriNetUnfolder]: 26/398 cut-off events. [2021-06-10 11:36:08,572 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:08,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 398 events. 26/398 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1552 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 462. Up to 14 conditions per place. [2021-06-10 11:36:08,581 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 6 selfloop transitions, 1 changer transitions 0/342 dead transitions. [2021-06-10 11:36:08,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 342 transitions, 805 flow [2021-06-10 11:36:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:08,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:08,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:08,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,583 INFO L185 Difference]: Start difference. First operand has 359 places, 341 transitions, 789 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:08,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 342 transitions, 805 flow [2021-06-10 11:36:08,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 342 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,586 INFO L241 Difference]: Finished difference. Result has 361 places, 341 transitions, 793 flow [2021-06-10 11:36:08,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=361, PETRI_TRANSITIONS=341} [2021-06-10 11:36:08,587 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 2 predicate places. [2021-06-10 11:36:08,587 INFO L480 AbstractCegarLoop]: Abstraction has has 361 places, 341 transitions, 793 flow [2021-06-10 11:36:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,587 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-06-10 11:36:08,587 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 726880623, now seen corresponding path program 1 times [2021-06-10 11:36:08,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777291721] [2021-06-10 11:36:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:08,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:08,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777291721] [2021-06-10 11:36:08,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219597131] [2021-06-10 11:36:08,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 341 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,666 INFO L129 PetriNetUnfolder]: 24/400 cut-off events. [2021-06-10 11:36:08,666 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:08,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 400 events. 24/400 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1585 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 473. Up to 14 conditions per place. [2021-06-10 11:36:08,676 INFO L132 encePairwiseOnDemand]: 381/385 looper letters, 9 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2021-06-10 11:36:08,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 342 transitions, 819 flow [2021-06-10 11:36:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2021-06-10 11:36:08,677 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90995670995671 [2021-06-10 11:36:08,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2021-06-10 11:36:08,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2021-06-10 11:36:08,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2021-06-10 11:36:08,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,678 INFO L185 Difference]: Start difference. First operand has 361 places, 341 transitions, 793 flow. Second operand 3 states and 1051 transitions. [2021-06-10 11:36:08,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 342 transitions, 819 flow [2021-06-10 11:36:08,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 342 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,681 INFO L241 Difference]: Finished difference. Result has 364 places, 342 transitions, 810 flow [2021-06-10 11:36:08,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=364, PETRI_TRANSITIONS=342} [2021-06-10 11:36:08,681 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 5 predicate places. [2021-06-10 11:36:08,681 INFO L480 AbstractCegarLoop]: Abstraction has has 364 places, 342 transitions, 810 flow [2021-06-10 11:36:08,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,681 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-06-10 11:36:08,682 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 725927311, now seen corresponding path program 1 times [2021-06-10 11:36:08,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025627726] [2021-06-10 11:36:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:08,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:08,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025627726] [2021-06-10 11:36:08,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888329447] [2021-06-10 11:36:08,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,694 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:08,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 342 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:08,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,771 INFO L129 PetriNetUnfolder]: 24/393 cut-off events. [2021-06-10 11:36:08,771 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:08,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 393 events. 24/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1524 event pairs, 0 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 459. Up to 14 conditions per place. [2021-06-10 11:36:08,777 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2021-06-10 11:36:08,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 340 transitions, 812 flow [2021-06-10 11:36:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:08,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:08,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:08,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,780 INFO L185 Difference]: Start difference. First operand has 364 places, 342 transitions, 810 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:08,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 340 transitions, 812 flow [2021-06-10 11:36:08,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 340 transitions, 804 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:08,783 INFO L241 Difference]: Finished difference. Result has 364 places, 340 transitions, 797 flow [2021-06-10 11:36:08,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=364, PETRI_TRANSITIONS=340} [2021-06-10 11:36:08,783 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 5 predicate places. [2021-06-10 11:36:08,783 INFO L480 AbstractCegarLoop]: Abstraction has has 364 places, 340 transitions, 797 flow [2021-06-10 11:36:08,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,783 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,783 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-06-10 11:36:08,783 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 725926288, now seen corresponding path program 1 times [2021-06-10 11:36:08,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625577260] [2021-06-10 11:36:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:08,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:08,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625577260] [2021-06-10 11:36:08,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443651181] [2021-06-10 11:36:08,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,795 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 340 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,855 INFO L129 PetriNetUnfolder]: 24/391 cut-off events. [2021-06-10 11:36:08,855 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:08,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 391 events. 24/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1510 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 463. Up to 14 conditions per place. [2021-06-10 11:36:08,865 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/338 dead transitions. [2021-06-10 11:36:08,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 338 transitions, 810 flow [2021-06-10 11:36:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:08,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:08,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:08,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,867 INFO L185 Difference]: Start difference. First operand has 364 places, 340 transitions, 797 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:08,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 338 transitions, 810 flow [2021-06-10 11:36:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 338 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,870 INFO L241 Difference]: Finished difference. Result has 363 places, 338 transitions, 793 flow [2021-06-10 11:36:08,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=363, PETRI_TRANSITIONS=338} [2021-06-10 11:36:08,870 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 4 predicate places. [2021-06-10 11:36:08,870 INFO L480 AbstractCegarLoop]: Abstraction has has 363 places, 338 transitions, 793 flow [2021-06-10 11:36:08,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,871 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-06-10 11:36:08,871 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash -344417295, now seen corresponding path program 1 times [2021-06-10 11:36:08,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637295863] [2021-06-10 11:36:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:08,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:08,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637295863] [2021-06-10 11:36:08,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183044126] [2021-06-10 11:36:08,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,883 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:08,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 338 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:08,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:08,947 INFO L129 PetriNetUnfolder]: 23/399 cut-off events. [2021-06-10 11:36:08,947 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:08,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 399 events. 23/399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1579 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 475. Up to 14 conditions per place. [2021-06-10 11:36:08,957 INFO L132 encePairwiseOnDemand]: 380/385 looper letters, 10 selfloop transitions, 3 changer transitions 0/340 dead transitions. [2021-06-10 11:36:08,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 340 transitions, 823 flow [2021-06-10 11:36:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1053 transitions. [2021-06-10 11:36:08,957 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9116883116883117 [2021-06-10 11:36:08,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:08,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1053 transitions. [2021-06-10 11:36:08,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,959 INFO L185 Difference]: Start difference. First operand has 363 places, 338 transitions, 793 flow. Second operand 3 states and 1053 transitions. [2021-06-10 11:36:08,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 340 transitions, 823 flow [2021-06-10 11:36:08,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 340 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:08,962 INFO L241 Difference]: Finished difference. Result has 366 places, 340 transitions, 816 flow [2021-06-10 11:36:08,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=366, PETRI_TRANSITIONS=340} [2021-06-10 11:36:08,962 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 7 predicate places. [2021-06-10 11:36:08,962 INFO L480 AbstractCegarLoop]: Abstraction has has 366 places, 340 transitions, 816 flow [2021-06-10 11:36:08,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:08,962 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:08,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-06-10 11:36:08,963 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -344416272, now seen corresponding path program 1 times [2021-06-10 11:36:08,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:08,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516641836] [2021-06-10 11:36:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:08,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:08,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:08,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:08,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516641836] [2021-06-10 11:36:08,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:08,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:08,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480020112] [2021-06-10 11:36:08,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:08,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:08,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:08,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 340 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:08,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:08,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:08,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,038 INFO L129 PetriNetUnfolder]: 22/397 cut-off events. [2021-06-10 11:36:09,038 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:09,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 397 events. 22/397 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1567 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 472. Up to 14 conditions per place. [2021-06-10 11:36:09,048 INFO L132 encePairwiseOnDemand]: 382/385 looper letters, 5 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2021-06-10 11:36:09,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 340 transitions, 828 flow [2021-06-10 11:36:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:09,049 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:09,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,050 INFO L185 Difference]: Start difference. First operand has 366 places, 340 transitions, 816 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:09,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 340 transitions, 828 flow [2021-06-10 11:36:09,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 340 transitions, 823 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,053 INFO L241 Difference]: Finished difference. Result has 369 places, 340 transitions, 821 flow [2021-06-10 11:36:09,053 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=369, PETRI_TRANSITIONS=340} [2021-06-10 11:36:09,053 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 10 predicate places. [2021-06-10 11:36:09,053 INFO L480 AbstractCegarLoop]: Abstraction has has 369 places, 340 transitions, 821 flow [2021-06-10 11:36:09,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,054 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-06-10 11:36:09,054 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash -343463983, now seen corresponding path program 1 times [2021-06-10 11:36:09,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139330477] [2021-06-10 11:36:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:09,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:09,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139330477] [2021-06-10 11:36:09,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266115626] [2021-06-10 11:36:09,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:09,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 340 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:09,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,126 INFO L129 PetriNetUnfolder]: 21/393 cut-off events. [2021-06-10 11:36:09,126 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:09,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 393 events. 21/393 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1541 event pairs, 0 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 469. Up to 14 conditions per place. [2021-06-10 11:36:09,135 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2021-06-10 11:36:09,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 337 transitions, 818 flow [2021-06-10 11:36:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:09,136 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:09,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,138 INFO L185 Difference]: Start difference. First operand has 369 places, 340 transitions, 821 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:09,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 337 transitions, 818 flow [2021-06-10 11:36:09,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 337 transitions, 811 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:09,141 INFO L241 Difference]: Finished difference. Result has 368 places, 337 transitions, 801 flow [2021-06-10 11:36:09,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=368, PETRI_TRANSITIONS=337} [2021-06-10 11:36:09,141 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 9 predicate places. [2021-06-10 11:36:09,141 INFO L480 AbstractCegarLoop]: Abstraction has has 368 places, 337 transitions, 801 flow [2021-06-10 11:36:09,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,142 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-06-10 11:36:09,142 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -343462960, now seen corresponding path program 1 times [2021-06-10 11:36:09,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499027034] [2021-06-10 11:36:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:09,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:09,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499027034] [2021-06-10 11:36:09,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103789594] [2021-06-10 11:36:09,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:09,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 337 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:09,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,214 INFO L129 PetriNetUnfolder]: 21/391 cut-off events. [2021-06-10 11:36:09,215 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:09,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 391 events. 21/391 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1527 event pairs, 0 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 470. Up to 14 conditions per place. [2021-06-10 11:36:09,224 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2021-06-10 11:36:09,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 335 transitions, 814 flow [2021-06-10 11:36:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:09,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:09,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,226 INFO L185 Difference]: Start difference. First operand has 368 places, 337 transitions, 801 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 335 transitions, 814 flow [2021-06-10 11:36:09,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 335 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,229 INFO L241 Difference]: Finished difference. Result has 367 places, 335 transitions, 797 flow [2021-06-10 11:36:09,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=367, PETRI_TRANSITIONS=335} [2021-06-10 11:36:09,229 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 8 predicate places. [2021-06-10 11:36:09,229 INFO L480 AbstractCegarLoop]: Abstraction has has 367 places, 335 transitions, 797 flow [2021-06-10 11:36:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,230 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-06-10 11:36:09,230 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1692984910, now seen corresponding path program 1 times [2021-06-10 11:36:09,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631299636] [2021-06-10 11:36:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:09,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:09,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631299636] [2021-06-10 11:36:09,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529311476] [2021-06-10 11:36:09,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:09,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 335 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:09,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,309 INFO L129 PetriNetUnfolder]: 20/399 cut-off events. [2021-06-10 11:36:09,309 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:09,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 399 events. 20/399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1597 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 482. Up to 14 conditions per place. [2021-06-10 11:36:09,318 INFO L132 encePairwiseOnDemand]: 380/385 looper letters, 10 selfloop transitions, 3 changer transitions 0/337 dead transitions. [2021-06-10 11:36:09,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 337 transitions, 827 flow [2021-06-10 11:36:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1053 transitions. [2021-06-10 11:36:09,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9116883116883117 [2021-06-10 11:36:09,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1053 transitions. [2021-06-10 11:36:09,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1053 transitions. [2021-06-10 11:36:09,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1053 transitions. [2021-06-10 11:36:09,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,320 INFO L185 Difference]: Start difference. First operand has 367 places, 335 transitions, 797 flow. Second operand 3 states and 1053 transitions. [2021-06-10 11:36:09,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 337 transitions, 827 flow [2021-06-10 11:36:09,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 337 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,323 INFO L241 Difference]: Finished difference. Result has 370 places, 337 transitions, 820 flow [2021-06-10 11:36:09,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=370, PETRI_TRANSITIONS=337} [2021-06-10 11:36:09,323 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 11 predicate places. [2021-06-10 11:36:09,323 INFO L480 AbstractCegarLoop]: Abstraction has has 370 places, 337 transitions, 820 flow [2021-06-10 11:36:09,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,324 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-06-10 11:36:09,324 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1692985933, now seen corresponding path program 1 times [2021-06-10 11:36:09,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129469995] [2021-06-10 11:36:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:09,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:09,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129469995] [2021-06-10 11:36:09,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712411207] [2021-06-10 11:36:09,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:09,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 337 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:09,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,402 INFO L129 PetriNetUnfolder]: 18/400 cut-off events. [2021-06-10 11:36:09,402 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:09,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 400 events. 18/400 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1623 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 482. Up to 14 conditions per place. [2021-06-10 11:36:09,411 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 6 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2021-06-10 11:36:09,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 337 transitions, 832 flow [2021-06-10 11:36:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:09,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:09,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,414 INFO L185 Difference]: Start difference. First operand has 370 places, 337 transitions, 820 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:09,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 337 transitions, 832 flow [2021-06-10 11:36:09,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 337 transitions, 827 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,417 INFO L241 Difference]: Finished difference. Result has 372 places, 336 transitions, 816 flow [2021-06-10 11:36:09,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=372, PETRI_TRANSITIONS=336} [2021-06-10 11:36:09,417 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 13 predicate places. [2021-06-10 11:36:09,417 INFO L480 AbstractCegarLoop]: Abstraction has has 372 places, 336 transitions, 816 flow [2021-06-10 11:36:09,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,417 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-06-10 11:36:09,417 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1693938222, now seen corresponding path program 1 times [2021-06-10 11:36:09,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001507269] [2021-06-10 11:36:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:09,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:09,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001507269] [2021-06-10 11:36:09,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301941190] [2021-06-10 11:36:09,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:09,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 336 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:09,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,493 INFO L129 PetriNetUnfolder]: 18/393 cut-off events. [2021-06-10 11:36:09,493 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:09,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 393 events. 18/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1557 event pairs, 0 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 476. Up to 14 conditions per place. [2021-06-10 11:36:09,502 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/334 dead transitions. [2021-06-10 11:36:09,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 334 transitions, 819 flow [2021-06-10 11:36:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:09,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:09,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,504 INFO L185 Difference]: Start difference. First operand has 372 places, 336 transitions, 816 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:09,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 334 transitions, 819 flow [2021-06-10 11:36:09,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 334 transitions, 812 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:09,508 INFO L241 Difference]: Finished difference. Result has 372 places, 334 transitions, 805 flow [2021-06-10 11:36:09,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=372, PETRI_TRANSITIONS=334} [2021-06-10 11:36:09,508 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 13 predicate places. [2021-06-10 11:36:09,508 INFO L480 AbstractCegarLoop]: Abstraction has has 372 places, 334 transitions, 805 flow [2021-06-10 11:36:09,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,508 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-06-10 11:36:09,508 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1693939245, now seen corresponding path program 1 times [2021-06-10 11:36:09,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948242601] [2021-06-10 11:36:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:09,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:09,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948242601] [2021-06-10 11:36:09,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294766] [2021-06-10 11:36:09,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:09,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 334 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:09,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,589 INFO L129 PetriNetUnfolder]: 18/391 cut-off events. [2021-06-10 11:36:09,589 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:09,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 391 events. 18/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1545 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 476. Up to 14 conditions per place. [2021-06-10 11:36:09,598 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2021-06-10 11:36:09,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 332 transitions, 818 flow [2021-06-10 11:36:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:09,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:09,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:09,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,601 INFO L185 Difference]: Start difference. First operand has 372 places, 334 transitions, 805 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 332 transitions, 818 flow [2021-06-10 11:36:09,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 332 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,604 INFO L241 Difference]: Finished difference. Result has 371 places, 332 transitions, 801 flow [2021-06-10 11:36:09,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=801, PETRI_PLACES=371, PETRI_TRANSITIONS=332} [2021-06-10 11:36:09,604 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 12 predicate places. [2021-06-10 11:36:09,604 INFO L480 AbstractCegarLoop]: Abstraction has has 371 places, 332 transitions, 801 flow [2021-06-10 11:36:09,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,604 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-06-10 11:36:09,605 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2134196586, now seen corresponding path program 1 times [2021-06-10 11:36:09,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232578426] [2021-06-10 11:36:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:09,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:09,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232578426] [2021-06-10 11:36:09,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499850138] [2021-06-10 11:36:09,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:09,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 332 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:09,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,686 INFO L129 PetriNetUnfolder]: 17/398 cut-off events. [2021-06-10 11:36:09,686 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:09,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 398 events. 17/398 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1603 event pairs, 0 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 481. Up to 14 conditions per place. [2021-06-10 11:36:09,696 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 6 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2021-06-10 11:36:09,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 333 transitions, 817 flow [2021-06-10 11:36:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:09,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:09,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:09,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,698 INFO L185 Difference]: Start difference. First operand has 371 places, 332 transitions, 801 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:09,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 333 transitions, 817 flow [2021-06-10 11:36:09,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 333 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,701 INFO L241 Difference]: Finished difference. Result has 373 places, 332 transitions, 805 flow [2021-06-10 11:36:09,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=373, PETRI_TRANSITIONS=332} [2021-06-10 11:36:09,701 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 14 predicate places. [2021-06-10 11:36:09,701 INFO L480 AbstractCegarLoop]: Abstraction has has 373 places, 332 transitions, 805 flow [2021-06-10 11:36:09,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,701 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-06-10 11:36:09,702 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2134195563, now seen corresponding path program 1 times [2021-06-10 11:36:09,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042420624] [2021-06-10 11:36:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:09,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:09,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042420624] [2021-06-10 11:36:09,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433624074] [2021-06-10 11:36:09,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:09,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 332 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:09,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,810 INFO L129 PetriNetUnfolder]: 15/400 cut-off events. [2021-06-10 11:36:09,810 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:09,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 400 events. 15/400 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1640 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 492. Up to 14 conditions per place. [2021-06-10 11:36:09,818 INFO L132 encePairwiseOnDemand]: 381/385 looper letters, 9 selfloop transitions, 3 changer transitions 0/333 dead transitions. [2021-06-10 11:36:09,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 333 transitions, 831 flow [2021-06-10 11:36:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2021-06-10 11:36:09,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90995670995671 [2021-06-10 11:36:09,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2021-06-10 11:36:09,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2021-06-10 11:36:09,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2021-06-10 11:36:09,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,821 INFO L185 Difference]: Start difference. First operand has 373 places, 332 transitions, 805 flow. Second operand 3 states and 1051 transitions. [2021-06-10 11:36:09,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 333 transitions, 831 flow [2021-06-10 11:36:09,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 333 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:09,824 INFO L241 Difference]: Finished difference. Result has 376 places, 333 transitions, 822 flow [2021-06-10 11:36:09,824 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=376, PETRI_TRANSITIONS=333} [2021-06-10 11:36:09,824 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 17 predicate places. [2021-06-10 11:36:09,824 INFO L480 AbstractCegarLoop]: Abstraction has has 376 places, 333 transitions, 822 flow [2021-06-10 11:36:09,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,824 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-06-10 11:36:09,824 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2135148875, now seen corresponding path program 1 times [2021-06-10 11:36:09,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348177409] [2021-06-10 11:36:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:09,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:09,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348177409] [2021-06-10 11:36:09,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536034643] [2021-06-10 11:36:09,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:09,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 333 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:09,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:09,917 INFO L129 PetriNetUnfolder]: 15/393 cut-off events. [2021-06-10 11:36:09,917 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:09,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 393 events. 15/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1572 event pairs, 0 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 478. Up to 14 conditions per place. [2021-06-10 11:36:09,927 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2021-06-10 11:36:09,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 331 transitions, 824 flow [2021-06-10 11:36:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:09,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:09,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:09,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:09,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,929 INFO L185 Difference]: Start difference. First operand has 376 places, 333 transitions, 822 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:09,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 331 transitions, 824 flow [2021-06-10 11:36:09,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 331 transitions, 816 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:09,933 INFO L241 Difference]: Finished difference. Result has 376 places, 331 transitions, 809 flow [2021-06-10 11:36:09,933 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=376, PETRI_TRANSITIONS=331} [2021-06-10 11:36:09,933 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 17 predicate places. [2021-06-10 11:36:09,933 INFO L480 AbstractCegarLoop]: Abstraction has has 376 places, 331 transitions, 809 flow [2021-06-10 11:36:09,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,933 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:09,933 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:09,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-06-10 11:36:09,933 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2135149898, now seen corresponding path program 1 times [2021-06-10 11:36:09,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:09,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463458783] [2021-06-10 11:36:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:09,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:09,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:09,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:09,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463458783] [2021-06-10 11:36:09,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:09,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:09,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716657001] [2021-06-10 11:36:09,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:09,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:09,948 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:09,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 331 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:09,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:09,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:09,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,030 INFO L129 PetriNetUnfolder]: 15/391 cut-off events. [2021-06-10 11:36:10,030 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:10,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 391 events. 15/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1561 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 482. Up to 14 conditions per place. [2021-06-10 11:36:10,039 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/329 dead transitions. [2021-06-10 11:36:10,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 329 transitions, 822 flow [2021-06-10 11:36:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:10,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:10,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,042 INFO L185 Difference]: Start difference. First operand has 376 places, 331 transitions, 809 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:10,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 329 transitions, 822 flow [2021-06-10 11:36:10,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 329 transitions, 821 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:10,046 INFO L241 Difference]: Finished difference. Result has 375 places, 329 transitions, 805 flow [2021-06-10 11:36:10,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=375, PETRI_TRANSITIONS=329} [2021-06-10 11:36:10,046 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 16 predicate places. [2021-06-10 11:36:10,046 INFO L480 AbstractCegarLoop]: Abstraction has has 375 places, 329 transitions, 805 flow [2021-06-10 11:36:10,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,046 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:10,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-06-10 11:36:10,046 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,046 INFO L82 PathProgramCache]: Analyzing trace with hash 209629178, now seen corresponding path program 1 times [2021-06-10 11:36:10,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324186649] [2021-06-10 11:36:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:10,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:10,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324186649] [2021-06-10 11:36:10,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984455380] [2021-06-10 11:36:10,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:10,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 329 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:10,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,141 INFO L129 PetriNetUnfolder]: 14/398 cut-off events. [2021-06-10 11:36:10,141 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 11:36:10,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 398 events. 14/398 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1621 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 487. Up to 14 conditions per place. [2021-06-10 11:36:10,151 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 6 selfloop transitions, 1 changer transitions 0/330 dead transitions. [2021-06-10 11:36:10,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 330 transitions, 821 flow [2021-06-10 11:36:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1061 transitions. [2021-06-10 11:36:10,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186147186147187 [2021-06-10 11:36:10,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1061 transitions. [2021-06-10 11:36:10,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1061 transitions. [2021-06-10 11:36:10,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1061 transitions. [2021-06-10 11:36:10,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,154 INFO L185 Difference]: Start difference. First operand has 375 places, 329 transitions, 805 flow. Second operand 3 states and 1061 transitions. [2021-06-10 11:36:10,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 330 transitions, 821 flow [2021-06-10 11:36:10,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 330 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:10,157 INFO L241 Difference]: Finished difference. Result has 377 places, 329 transitions, 809 flow [2021-06-10 11:36:10,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=377, PETRI_TRANSITIONS=329} [2021-06-10 11:36:10,157 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 18 predicate places. [2021-06-10 11:36:10,157 INFO L480 AbstractCegarLoop]: Abstraction has has 377 places, 329 transitions, 809 flow [2021-06-10 11:36:10,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,157 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:10,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-06-10 11:36:10,157 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 209630201, now seen corresponding path program 1 times [2021-06-10 11:36:10,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61416701] [2021-06-10 11:36:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:10,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:10,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61416701] [2021-06-10 11:36:10,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116514815] [2021-06-10 11:36:10,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:10,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 329 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:10,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,241 INFO L129 PetriNetUnfolder]: 12/400 cut-off events. [2021-06-10 11:36:10,241 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:10,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 400 events. 12/400 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1655 event pairs, 0 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 498. Up to 14 conditions per place. [2021-06-10 11:36:10,250 INFO L132 encePairwiseOnDemand]: 381/385 looper letters, 9 selfloop transitions, 3 changer transitions 0/330 dead transitions. [2021-06-10 11:36:10,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 330 transitions, 835 flow [2021-06-10 11:36:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1051 transitions. [2021-06-10 11:36:10,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90995670995671 [2021-06-10 11:36:10,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1051 transitions. [2021-06-10 11:36:10,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1051 transitions. [2021-06-10 11:36:10,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1051 transitions. [2021-06-10 11:36:10,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.3333333333333) internal successors, (1051), 3 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,255 INFO L185 Difference]: Start difference. First operand has 377 places, 329 transitions, 809 flow. Second operand 3 states and 1051 transitions. [2021-06-10 11:36:10,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 330 transitions, 835 flow [2021-06-10 11:36:10,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 330 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:10,258 INFO L241 Difference]: Finished difference. Result has 380 places, 330 transitions, 826 flow [2021-06-10 11:36:10,258 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=380, PETRI_TRANSITIONS=330} [2021-06-10 11:36:10,258 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 21 predicate places. [2021-06-10 11:36:10,258 INFO L480 AbstractCegarLoop]: Abstraction has has 380 places, 330 transitions, 826 flow [2021-06-10 11:36:10,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,259 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:10,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-06-10 11:36:10,259 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 208676889, now seen corresponding path program 1 times [2021-06-10 11:36:10,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912253422] [2021-06-10 11:36:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:10,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:10,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912253422] [2021-06-10 11:36:10,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578570855] [2021-06-10 11:36:10,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 385 [2021-06-10 11:36:10,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 330 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 385 [2021-06-10 11:36:10,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,351 INFO L129 PetriNetUnfolder]: 12/393 cut-off events. [2021-06-10 11:36:10,351 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:10,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 393 events. 12/393 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1593 event pairs, 0 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 484. Up to 14 conditions per place. [2021-06-10 11:36:10,360 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 5 selfloop transitions, 1 changer transitions 0/328 dead transitions. [2021-06-10 11:36:10,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 328 transitions, 828 flow [2021-06-10 11:36:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2021-06-10 11:36:10,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:36:10,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2021-06-10 11:36:10,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2021-06-10 11:36:10,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2021-06-10 11:36:10,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,362 INFO L185 Difference]: Start difference. First operand has 380 places, 330 transitions, 826 flow. Second operand 3 states and 1060 transitions. [2021-06-10 11:36:10,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 328 transitions, 828 flow [2021-06-10 11:36:10,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 328 transitions, 820 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:10,389 INFO L241 Difference]: Finished difference. Result has 380 places, 328 transitions, 813 flow [2021-06-10 11:36:10,390 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=380, PETRI_TRANSITIONS=328} [2021-06-10 11:36:10,390 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 21 predicate places. [2021-06-10 11:36:10,390 INFO L480 AbstractCegarLoop]: Abstraction has has 380 places, 328 transitions, 813 flow [2021-06-10 11:36:10,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,390 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,390 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:10,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-06-10 11:36:10,390 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 208675866, now seen corresponding path program 1 times [2021-06-10 11:36:10,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27533992] [2021-06-10 11:36:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:10,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:10,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27533992] [2021-06-10 11:36:10,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255212758] [2021-06-10 11:36:10,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 385 [2021-06-10 11:36:10,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 328 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 385 [2021-06-10 11:36:10,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,535 INFO L129 PetriNetUnfolder]: 12/391 cut-off events. [2021-06-10 11:36:10,535 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:10,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 391 events. 12/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1579 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 488. Up to 14 conditions per place. [2021-06-10 11:36:10,544 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 8 selfloop transitions, 1 changer transitions 0/326 dead transitions. [2021-06-10 11:36:10,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 326 transitions, 826 flow [2021-06-10 11:36:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1048 transitions. [2021-06-10 11:36:10,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9073593073593074 [2021-06-10 11:36:10,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1048 transitions. [2021-06-10 11:36:10,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,547 INFO L185 Difference]: Start difference. First operand has 380 places, 328 transitions, 813 flow. Second operand 3 states and 1048 transitions. [2021-06-10 11:36:10,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 326 transitions, 826 flow [2021-06-10 11:36:10,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 326 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:10,550 INFO L241 Difference]: Finished difference. Result has 379 places, 326 transitions, 809 flow [2021-06-10 11:36:10,550 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=379, PETRI_TRANSITIONS=326} [2021-06-10 11:36:10,550 INFO L343 CegarLoopForPetriNet]: 359 programPoint places, 20 predicate places. [2021-06-10 11:36:10,550 INFO L480 AbstractCegarLoop]: Abstraction has has 379 places, 326 transitions, 809 flow [2021-06-10 11:36:10,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,550 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,550 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 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-06-10 11:36:10,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-06-10 11:36:10,551 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-10 11:36:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2099566531, now seen corresponding path program 1 times [2021-06-10 11:36:10,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333804233] [2021-06-10 11:36:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:10,558 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:10,562 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:10,568 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:10,569 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:10,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-06-10 11:36:10,570 WARN L342 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:10,572 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of14ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of14ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:10,661 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:10,661 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-06-10 11:36:10,661 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:10,661 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:10,661 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:10,661 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:10,661 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:10,661 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:10,661 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:10,661 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:10,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 385 places, 413 transitions, 1078 flow [2021-06-10 11:36:10,733 INFO L129 PetriNetUnfolder]: 71/538 cut-off events. [2021-06-10 11:36:10,733 INFO L130 PetriNetUnfolder]: For 546/546 co-relation queries the response was YES. [2021-06-10 11:36:10,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 538 events. 71/538 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2157 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 622. Up to 30 conditions per place. [2021-06-10 11:36:10,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 413 transitions, 1078 flow [2021-06-10 11:36:10,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 413 transitions, 1078 flow [2021-06-10 11:36:10,755 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2021-06-10 11:36:10,755 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:10,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,755 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-06-10 11:36:10,755 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 324377969, now seen corresponding path program 1 times [2021-06-10 11:36:10,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464078869] [2021-06-10 11:36:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:10,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:10,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464078869] [2021-06-10 11:36:10,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051377317] [2021-06-10 11:36:10,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:10,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 413 transitions, 1078 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:10,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,828 INFO L129 PetriNetUnfolder]: 41/427 cut-off events. [2021-06-10 11:36:10,828 INFO L130 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2021-06-10 11:36:10,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 427 events. 41/427 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1605 event pairs, 0 based on Foata normal form. 59/429 useless extension candidates. Maximal degree in co-relation 521. Up to 15 conditions per place. [2021-06-10 11:36:10,840 INFO L132 encePairwiseOnDemand]: 395/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2021-06-10 11:36:10,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 380 transitions, 1026 flow [2021-06-10 11:36:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1171 transitions. [2021-06-10 11:36:10,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9451170298627926 [2021-06-10 11:36:10,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1171 transitions. [2021-06-10 11:36:10,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1171 transitions. [2021-06-10 11:36:10,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1171 transitions. [2021-06-10 11:36:10,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,843 INFO L185 Difference]: Start difference. First operand has 385 places, 413 transitions, 1078 flow. Second operand 3 states and 1171 transitions. [2021-06-10 11:36:10,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 380 transitions, 1026 flow [2021-06-10 11:36:10,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 380 transitions, 844 flow, removed 91 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:10,846 INFO L241 Difference]: Finished difference. Result has 369 places, 379 transitions, 833 flow [2021-06-10 11:36:10,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=369, PETRI_TRANSITIONS=379} [2021-06-10 11:36:10,847 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -16 predicate places. [2021-06-10 11:36:10,847 INFO L480 AbstractCegarLoop]: Abstraction has has 369 places, 379 transitions, 833 flow [2021-06-10 11:36:10,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,847 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-06-10 11:36:10,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-06-10 11:36:10,847 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,847 INFO L82 PathProgramCache]: Analyzing trace with hash 324378992, now seen corresponding path program 1 times [2021-06-10 11:36:10,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088479353] [2021-06-10 11:36:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:10,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:10,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088479353] [2021-06-10 11:36:10,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126437113] [2021-06-10 11:36:10,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:10,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 379 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:10,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:10,920 INFO L129 PetriNetUnfolder]: 39/429 cut-off events. [2021-06-10 11:36:10,920 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:10,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 429 events. 39/429 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1639 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 477. Up to 15 conditions per place. [2021-06-10 11:36:10,932 INFO L132 encePairwiseOnDemand]: 409/413 looper letters, 9 selfloop transitions, 3 changer transitions 0/380 dead transitions. [2021-06-10 11:36:10,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 380 transitions, 859 flow [2021-06-10 11:36:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2021-06-10 11:36:10,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112187247780468 [2021-06-10 11:36:10,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1129 transitions. [2021-06-10 11:36:10,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1129 transitions. [2021-06-10 11:36:10,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:10,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1129 transitions. [2021-06-10 11:36:10,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,934 INFO L185 Difference]: Start difference. First operand has 369 places, 379 transitions, 833 flow. Second operand 3 states and 1129 transitions. [2021-06-10 11:36:10,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 380 transitions, 859 flow [2021-06-10 11:36:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 380 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:10,938 INFO L241 Difference]: Finished difference. Result has 372 places, 380 transitions, 850 flow [2021-06-10 11:36:10,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=372, PETRI_TRANSITIONS=380} [2021-06-10 11:36:10,938 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -13 predicate places. [2021-06-10 11:36:10,938 INFO L480 AbstractCegarLoop]: Abstraction has has 372 places, 380 transitions, 850 flow [2021-06-10 11:36:10,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:10,938 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-06-10 11:36:10,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-06-10 11:36:10,938 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:10,938 INFO L82 PathProgramCache]: Analyzing trace with hash 323425680, now seen corresponding path program 1 times [2021-06-10 11:36:10,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:10,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182944806] [2021-06-10 11:36:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:10,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:10,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:10,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:10,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182944806] [2021-06-10 11:36:10,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:10,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:10,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004363641] [2021-06-10 11:36:10,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:10,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:10,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:10,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:10,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:10,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 380 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:10,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:10,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:10,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,008 INFO L129 PetriNetUnfolder]: 39/422 cut-off events. [2021-06-10 11:36:11,008 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:11,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 422 events. 39/422 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1583 event pairs, 0 based on Foata normal form. 1/371 useless extension candidates. Maximal degree in co-relation 460. Up to 15 conditions per place. [2021-06-10 11:36:11,019 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2021-06-10 11:36:11,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 852 flow [2021-06-10 11:36:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:11,020 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:11,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:11,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,021 INFO L185 Difference]: Start difference. First operand has 372 places, 380 transitions, 850 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:11,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 852 flow [2021-06-10 11:36:11,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 378 transitions, 844 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:11,025 INFO L241 Difference]: Finished difference. Result has 372 places, 378 transitions, 837 flow [2021-06-10 11:36:11,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2021-06-10 11:36:11,025 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -13 predicate places. [2021-06-10 11:36:11,025 INFO L480 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 837 flow [2021-06-10 11:36:11,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,025 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-06-10 11:36:11,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-06-10 11:36:11,025 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 323424657, now seen corresponding path program 1 times [2021-06-10 11:36:11,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186578416] [2021-06-10 11:36:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:11,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:11,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186578416] [2021-06-10 11:36:11,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581345365] [2021-06-10 11:36:11,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,096 INFO L129 PetriNetUnfolder]: 39/420 cut-off events. [2021-06-10 11:36:11,097 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:11,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 420 events. 39/420 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1569 event pairs, 0 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 467. Up to 15 conditions per place. [2021-06-10 11:36:11,109 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2021-06-10 11:36:11,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 850 flow [2021-06-10 11:36:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:11,110 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:11,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,111 INFO L185 Difference]: Start difference. First operand has 372 places, 378 transitions, 837 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:11,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 850 flow [2021-06-10 11:36:11,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 376 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,115 INFO L241 Difference]: Finished difference. Result has 371 places, 376 transitions, 833 flow [2021-06-10 11:36:11,115 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=371, PETRI_TRANSITIONS=376} [2021-06-10 11:36:11,115 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -14 predicate places. [2021-06-10 11:36:11,115 INFO L480 AbstractCegarLoop]: Abstraction has has 371 places, 376 transitions, 833 flow [2021-06-10 11:36:11,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,115 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-06-10 11:36:11,115 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -45024343, now seen corresponding path program 1 times [2021-06-10 11:36:11,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589982765] [2021-06-10 11:36:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:11,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:11,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589982765] [2021-06-10 11:36:11,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818889324] [2021-06-10 11:36:11,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,132 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:11,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 376 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:11,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,200 INFO L129 PetriNetUnfolder]: 38/427 cut-off events. [2021-06-10 11:36:11,200 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:11,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 427 events. 38/427 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1630 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 472. Up to 15 conditions per place. [2021-06-10 11:36:11,210 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2021-06-10 11:36:11,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 849 flow [2021-06-10 11:36:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:11,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:11,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,213 INFO L185 Difference]: Start difference. First operand has 371 places, 376 transitions, 833 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:11,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 849 flow [2021-06-10 11:36:11,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 377 transitions, 848 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,216 INFO L241 Difference]: Finished difference. Result has 373 places, 376 transitions, 837 flow [2021-06-10 11:36:11,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=373, PETRI_TRANSITIONS=376} [2021-06-10 11:36:11,216 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -12 predicate places. [2021-06-10 11:36:11,216 INFO L480 AbstractCegarLoop]: Abstraction has has 373 places, 376 transitions, 837 flow [2021-06-10 11:36:11,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,216 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-06-10 11:36:11,216 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -45023320, now seen corresponding path program 1 times [2021-06-10 11:36:11,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618835922] [2021-06-10 11:36:11,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:11,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:11,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618835922] [2021-06-10 11:36:11,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983743780] [2021-06-10 11:36:11,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 376 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,292 INFO L129 PetriNetUnfolder]: 36/429 cut-off events. [2021-06-10 11:36:11,293 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:11,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 429 events. 36/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1659 event pairs, 0 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 483. Up to 15 conditions per place. [2021-06-10 11:36:11,304 INFO L132 encePairwiseOnDemand]: 409/413 looper letters, 9 selfloop transitions, 3 changer transitions 0/377 dead transitions. [2021-06-10 11:36:11,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 863 flow [2021-06-10 11:36:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2021-06-10 11:36:11,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112187247780468 [2021-06-10 11:36:11,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1129 transitions. [2021-06-10 11:36:11,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1129 transitions. [2021-06-10 11:36:11,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1129 transitions. [2021-06-10 11:36:11,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,307 INFO L185 Difference]: Start difference. First operand has 373 places, 376 transitions, 837 flow. Second operand 3 states and 1129 transitions. [2021-06-10 11:36:11,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 377 transitions, 863 flow [2021-06-10 11:36:11,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 377 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,310 INFO L241 Difference]: Finished difference. Result has 376 places, 377 transitions, 854 flow [2021-06-10 11:36:11,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=376, PETRI_TRANSITIONS=377} [2021-06-10 11:36:11,310 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -9 predicate places. [2021-06-10 11:36:11,310 INFO L480 AbstractCegarLoop]: Abstraction has has 376 places, 377 transitions, 854 flow [2021-06-10 11:36:11,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,311 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-06-10 11:36:11,311 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -45976632, now seen corresponding path program 1 times [2021-06-10 11:36:11,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50899176] [2021-06-10 11:36:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:11,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:11,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50899176] [2021-06-10 11:36:11,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116141440] [2021-06-10 11:36:11,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:11,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 377 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:11,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,384 INFO L129 PetriNetUnfolder]: 36/422 cut-off events. [2021-06-10 11:36:11,384 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:11,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 422 events. 36/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1604 event pairs, 0 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 469. Up to 15 conditions per place. [2021-06-10 11:36:11,396 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2021-06-10 11:36:11,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 375 transitions, 856 flow [2021-06-10 11:36:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:11,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:11,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:11,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,398 INFO L185 Difference]: Start difference. First operand has 376 places, 377 transitions, 854 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:11,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 375 transitions, 856 flow [2021-06-10 11:36:11,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 375 transitions, 848 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:11,401 INFO L241 Difference]: Finished difference. Result has 376 places, 375 transitions, 841 flow [2021-06-10 11:36:11,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2021-06-10 11:36:11,402 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -9 predicate places. [2021-06-10 11:36:11,402 INFO L480 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 841 flow [2021-06-10 11:36:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,402 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-06-10 11:36:11,402 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -45977655, now seen corresponding path program 1 times [2021-06-10 11:36:11,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980926792] [2021-06-10 11:36:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:11,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:11,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980926792] [2021-06-10 11:36:11,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119339732] [2021-06-10 11:36:11,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,474 INFO L129 PetriNetUnfolder]: 36/420 cut-off events. [2021-06-10 11:36:11,474 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:11,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 420 events. 36/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1588 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 473. Up to 15 conditions per place. [2021-06-10 11:36:11,485 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2021-06-10 11:36:11,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 373 transitions, 854 flow [2021-06-10 11:36:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:11,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:11,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,488 INFO L185 Difference]: Start difference. First operand has 376 places, 375 transitions, 841 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:11,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 373 transitions, 854 flow [2021-06-10 11:36:11,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 373 transitions, 853 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,491 INFO L241 Difference]: Finished difference. Result has 375 places, 373 transitions, 837 flow [2021-06-10 11:36:11,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=375, PETRI_TRANSITIONS=373} [2021-06-10 11:36:11,491 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -10 predicate places. [2021-06-10 11:36:11,491 INFO L480 AbstractCegarLoop]: Abstraction has has 375 places, 373 transitions, 837 flow [2021-06-10 11:36:11,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,491 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,491 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-06-10 11:36:11,491 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1635274015, now seen corresponding path program 1 times [2021-06-10 11:36:11,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644034826] [2021-06-10 11:36:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:11,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:11,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644034826] [2021-06-10 11:36:11,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018993117] [2021-06-10 11:36:11,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,511 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 373 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,576 INFO L129 PetriNetUnfolder]: 35/428 cut-off events. [2021-06-10 11:36:11,576 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:11,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 428 events. 35/428 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1658 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 485. Up to 15 conditions per place. [2021-06-10 11:36:11,587 INFO L132 encePairwiseOnDemand]: 408/413 looper letters, 10 selfloop transitions, 3 changer transitions 0/375 dead transitions. [2021-06-10 11:36:11,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 375 transitions, 867 flow [2021-06-10 11:36:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2021-06-10 11:36:11,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128329297820823 [2021-06-10 11:36:11,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1131 transitions. [2021-06-10 11:36:11,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1131 transitions. [2021-06-10 11:36:11,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1131 transitions. [2021-06-10 11:36:11,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,589 INFO L185 Difference]: Start difference. First operand has 375 places, 373 transitions, 837 flow. Second operand 3 states and 1131 transitions. [2021-06-10 11:36:11,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 375 transitions, 867 flow [2021-06-10 11:36:11,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 375 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,593 INFO L241 Difference]: Finished difference. Result has 378 places, 375 transitions, 860 flow [2021-06-10 11:36:11,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2021-06-10 11:36:11,593 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -7 predicate places. [2021-06-10 11:36:11,593 INFO L480 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 860 flow [2021-06-10 11:36:11,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,593 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-06-10 11:36:11,593 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1635275038, now seen corresponding path program 1 times [2021-06-10 11:36:11,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457006173] [2021-06-10 11:36:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:11,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:11,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457006173] [2021-06-10 11:36:11,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883433996] [2021-06-10 11:36:11,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:11,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:11,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,666 INFO L129 PetriNetUnfolder]: 33/429 cut-off events. [2021-06-10 11:36:11,667 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:11,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 429 events. 33/429 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1676 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 485. Up to 15 conditions per place. [2021-06-10 11:36:11,678 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2021-06-10 11:36:11,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 872 flow [2021-06-10 11:36:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:11,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:11,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,680 INFO L185 Difference]: Start difference. First operand has 378 places, 375 transitions, 860 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:11,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 872 flow [2021-06-10 11:36:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 375 transitions, 867 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,684 INFO L241 Difference]: Finished difference. Result has 380 places, 374 transitions, 856 flow [2021-06-10 11:36:11,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=380, PETRI_TRANSITIONS=374} [2021-06-10 11:36:11,684 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -5 predicate places. [2021-06-10 11:36:11,684 INFO L480 AbstractCegarLoop]: Abstraction has has 380 places, 374 transitions, 856 flow [2021-06-10 11:36:11,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,684 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-06-10 11:36:11,684 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1636227327, now seen corresponding path program 1 times [2021-06-10 11:36:11,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188771859] [2021-06-10 11:36:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:11,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:11,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188771859] [2021-06-10 11:36:11,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510840694] [2021-06-10 11:36:11,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:11,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 374 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:11,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,756 INFO L129 PetriNetUnfolder]: 33/422 cut-off events. [2021-06-10 11:36:11,757 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:11,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 422 events. 33/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1621 event pairs, 0 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 479. Up to 15 conditions per place. [2021-06-10 11:36:11,768 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/372 dead transitions. [2021-06-10 11:36:11,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 372 transitions, 859 flow [2021-06-10 11:36:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:11,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:11,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:11,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:11,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,771 INFO L185 Difference]: Start difference. First operand has 380 places, 374 transitions, 856 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:11,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 372 transitions, 859 flow [2021-06-10 11:36:11,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 372 transitions, 852 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:11,774 INFO L241 Difference]: Finished difference. Result has 380 places, 372 transitions, 845 flow [2021-06-10 11:36:11,774 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=845, PETRI_PLACES=380, PETRI_TRANSITIONS=372} [2021-06-10 11:36:11,774 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -5 predicate places. [2021-06-10 11:36:11,774 INFO L480 AbstractCegarLoop]: Abstraction has has 380 places, 372 transitions, 845 flow [2021-06-10 11:36:11,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,774 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-06-10 11:36:11,775 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1636228350, now seen corresponding path program 1 times [2021-06-10 11:36:11,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928661095] [2021-06-10 11:36:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:11,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:11,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928661095] [2021-06-10 11:36:11,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343852756] [2021-06-10 11:36:11,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 372 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,850 INFO L129 PetriNetUnfolder]: 33/420 cut-off events. [2021-06-10 11:36:11,850 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:11,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 420 events. 33/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1605 event pairs, 0 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 479. Up to 15 conditions per place. [2021-06-10 11:36:11,860 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/370 dead transitions. [2021-06-10 11:36:11,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 370 transitions, 858 flow [2021-06-10 11:36:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:11,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:11,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:11,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,863 INFO L185 Difference]: Start difference. First operand has 380 places, 372 transitions, 845 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:11,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 370 transitions, 858 flow [2021-06-10 11:36:11,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 370 transitions, 857 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,866 INFO L241 Difference]: Finished difference. Result has 379 places, 370 transitions, 841 flow [2021-06-10 11:36:11,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=379, PETRI_TRANSITIONS=370} [2021-06-10 11:36:11,867 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -6 predicate places. [2021-06-10 11:36:11,867 INFO L480 AbstractCegarLoop]: Abstraction has has 379 places, 370 transitions, 841 flow [2021-06-10 11:36:11,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,867 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-06-10 11:36:11,867 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1264362396, now seen corresponding path program 1 times [2021-06-10 11:36:11,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948695081] [2021-06-10 11:36:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:11,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:11,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948695081] [2021-06-10 11:36:11,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63184741] [2021-06-10 11:36:11,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:11,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 370 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:11,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:11,943 INFO L129 PetriNetUnfolder]: 32/427 cut-off events. [2021-06-10 11:36:11,943 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:11,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 427 events. 32/427 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1664 event pairs, 0 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 484. Up to 15 conditions per place. [2021-06-10 11:36:11,955 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/371 dead transitions. [2021-06-10 11:36:11,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 371 transitions, 857 flow [2021-06-10 11:36:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:11,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:11,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:11,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:11,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,957 INFO L185 Difference]: Start difference. First operand has 379 places, 370 transitions, 841 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:11,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 371 transitions, 857 flow [2021-06-10 11:36:11,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 371 transitions, 856 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:11,961 INFO L241 Difference]: Finished difference. Result has 381 places, 370 transitions, 845 flow [2021-06-10 11:36:11,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=845, PETRI_PLACES=381, PETRI_TRANSITIONS=370} [2021-06-10 11:36:11,961 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -4 predicate places. [2021-06-10 11:36:11,961 INFO L480 AbstractCegarLoop]: Abstraction has has 381 places, 370 transitions, 845 flow [2021-06-10 11:36:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:11,961 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:11,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-06-10 11:36:11,961 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1264363419, now seen corresponding path program 1 times [2021-06-10 11:36:11,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:11,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671946942] [2021-06-10 11:36:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:11,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:11,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:11,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:11,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671946942] [2021-06-10 11:36:11,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:11,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:11,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568232505] [2021-06-10 11:36:11,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:11,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:11,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:11,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:11,973 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:11,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 370 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:11,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:11,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:11,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,044 INFO L129 PetriNetUnfolder]: 30/429 cut-off events. [2021-06-10 11:36:12,044 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:12,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 429 events. 30/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1696 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 495. Up to 15 conditions per place. [2021-06-10 11:36:12,056 INFO L132 encePairwiseOnDemand]: 409/413 looper letters, 9 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2021-06-10 11:36:12,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 371 transitions, 871 flow [2021-06-10 11:36:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2021-06-10 11:36:12,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112187247780468 [2021-06-10 11:36:12,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,058 INFO L185 Difference]: Start difference. First operand has 381 places, 370 transitions, 845 flow. Second operand 3 states and 1129 transitions. [2021-06-10 11:36:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 371 transitions, 871 flow [2021-06-10 11:36:12,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 371 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,062 INFO L241 Difference]: Finished difference. Result has 384 places, 371 transitions, 862 flow [2021-06-10 11:36:12,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=384, PETRI_TRANSITIONS=371} [2021-06-10 11:36:12,062 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2021-06-10 11:36:12,062 INFO L480 AbstractCegarLoop]: Abstraction has has 384 places, 371 transitions, 862 flow [2021-06-10 11:36:12,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,062 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-06-10 11:36:12,062 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1263410107, now seen corresponding path program 1 times [2021-06-10 11:36:12,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496870376] [2021-06-10 11:36:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:12,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:12,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496870376] [2021-06-10 11:36:12,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414899471] [2021-06-10 11:36:12,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,074 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:12,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 371 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:12,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,139 INFO L129 PetriNetUnfolder]: 30/422 cut-off events. [2021-06-10 11:36:12,139 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:12,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 422 events. 30/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1639 event pairs, 0 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 481. Up to 15 conditions per place. [2021-06-10 11:36:12,151 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/369 dead transitions. [2021-06-10 11:36:12,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 369 transitions, 864 flow [2021-06-10 11:36:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:12,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:12,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:12,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,153 INFO L185 Difference]: Start difference. First operand has 384 places, 371 transitions, 862 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:12,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 369 transitions, 864 flow [2021-06-10 11:36:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 369 transitions, 856 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:12,157 INFO L241 Difference]: Finished difference. Result has 384 places, 369 transitions, 849 flow [2021-06-10 11:36:12,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=384, PETRI_TRANSITIONS=369} [2021-06-10 11:36:12,157 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -1 predicate places. [2021-06-10 11:36:12,157 INFO L480 AbstractCegarLoop]: Abstraction has has 384 places, 369 transitions, 849 flow [2021-06-10 11:36:12,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,157 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-06-10 11:36:12,157 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1263409084, now seen corresponding path program 1 times [2021-06-10 11:36:12,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519097823] [2021-06-10 11:36:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:12,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:12,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519097823] [2021-06-10 11:36:12,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604691959] [2021-06-10 11:36:12,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:12,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 369 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:12,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,237 INFO L129 PetriNetUnfolder]: 30/420 cut-off events. [2021-06-10 11:36:12,237 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:12,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 420 events. 30/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1621 event pairs, 0 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 485. Up to 15 conditions per place. [2021-06-10 11:36:12,248 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/367 dead transitions. [2021-06-10 11:36:12,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 367 transitions, 862 flow [2021-06-10 11:36:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:12,249 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:12,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,251 INFO L185 Difference]: Start difference. First operand has 384 places, 369 transitions, 849 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:12,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 367 transitions, 862 flow [2021-06-10 11:36:12,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 367 transitions, 861 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,254 INFO L241 Difference]: Finished difference. Result has 383 places, 367 transitions, 845 flow [2021-06-10 11:36:12,254 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=845, PETRI_PLACES=383, PETRI_TRANSITIONS=367} [2021-06-10 11:36:12,254 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, -2 predicate places. [2021-06-10 11:36:12,254 INFO L480 AbstractCegarLoop]: Abstraction has has 383 places, 367 transitions, 845 flow [2021-06-10 11:36:12,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,255 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-06-10 11:36:12,255 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash 479393111, now seen corresponding path program 1 times [2021-06-10 11:36:12,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839560483] [2021-06-10 11:36:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:12,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:12,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839560483] [2021-06-10 11:36:12,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099360966] [2021-06-10 11:36:12,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:12,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 367 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:12,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,335 INFO L129 PetriNetUnfolder]: 29/427 cut-off events. [2021-06-10 11:36:12,335 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:12,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 427 events. 29/427 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1683 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 490. Up to 15 conditions per place. [2021-06-10 11:36:12,347 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2021-06-10 11:36:12,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 368 transitions, 861 flow [2021-06-10 11:36:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:12,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:12,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,366 INFO L185 Difference]: Start difference. First operand has 383 places, 367 transitions, 845 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:12,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 368 transitions, 861 flow [2021-06-10 11:36:12,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 368 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,369 INFO L241 Difference]: Finished difference. Result has 385 places, 367 transitions, 849 flow [2021-06-10 11:36:12,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=385, PETRI_TRANSITIONS=367} [2021-06-10 11:36:12,370 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 0 predicate places. [2021-06-10 11:36:12,370 INFO L480 AbstractCegarLoop]: Abstraction has has 385 places, 367 transitions, 849 flow [2021-06-10 11:36:12,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,370 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-06-10 11:36:12,370 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 479394134, now seen corresponding path program 1 times [2021-06-10 11:36:12,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594200057] [2021-06-10 11:36:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:12,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:12,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594200057] [2021-06-10 11:36:12,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72325903] [2021-06-10 11:36:12,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:12,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 367 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:12,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,457 INFO L129 PetriNetUnfolder]: 27/429 cut-off events. [2021-06-10 11:36:12,457 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:12,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 429 events. 27/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1712 event pairs, 0 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 501. Up to 15 conditions per place. [2021-06-10 11:36:12,468 INFO L132 encePairwiseOnDemand]: 409/413 looper letters, 9 selfloop transitions, 3 changer transitions 0/368 dead transitions. [2021-06-10 11:36:12,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 368 transitions, 875 flow [2021-06-10 11:36:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2021-06-10 11:36:12,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112187247780468 [2021-06-10 11:36:12,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1129 transitions. [2021-06-10 11:36:12,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,471 INFO L185 Difference]: Start difference. First operand has 385 places, 367 transitions, 849 flow. Second operand 3 states and 1129 transitions. [2021-06-10 11:36:12,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 368 transitions, 875 flow [2021-06-10 11:36:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 368 transitions, 874 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,474 INFO L241 Difference]: Finished difference. Result has 388 places, 368 transitions, 866 flow [2021-06-10 11:36:12,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=388, PETRI_TRANSITIONS=368} [2021-06-10 11:36:12,474 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 3 predicate places. [2021-06-10 11:36:12,474 INFO L480 AbstractCegarLoop]: Abstraction has has 388 places, 368 transitions, 866 flow [2021-06-10 11:36:12,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,474 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-06-10 11:36:12,475 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash 478440822, now seen corresponding path program 1 times [2021-06-10 11:36:12,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461265874] [2021-06-10 11:36:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:12,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:12,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461265874] [2021-06-10 11:36:12,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920817555] [2021-06-10 11:36:12,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:12,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 368 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:12,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,554 INFO L129 PetriNetUnfolder]: 27/422 cut-off events. [2021-06-10 11:36:12,554 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:12,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 422 events. 27/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1656 event pairs, 0 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 487. Up to 15 conditions per place. [2021-06-10 11:36:12,565 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2021-06-10 11:36:12,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 366 transitions, 868 flow [2021-06-10 11:36:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:12,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:12,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,567 INFO L185 Difference]: Start difference. First operand has 388 places, 368 transitions, 866 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:12,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 366 transitions, 868 flow [2021-06-10 11:36:12,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 366 transitions, 860 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:12,570 INFO L241 Difference]: Finished difference. Result has 388 places, 366 transitions, 853 flow [2021-06-10 11:36:12,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=853, PETRI_PLACES=388, PETRI_TRANSITIONS=366} [2021-06-10 11:36:12,570 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 3 predicate places. [2021-06-10 11:36:12,571 INFO L480 AbstractCegarLoop]: Abstraction has has 388 places, 366 transitions, 853 flow [2021-06-10 11:36:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,571 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-06-10 11:36:12,571 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 478439799, now seen corresponding path program 1 times [2021-06-10 11:36:12,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147238325] [2021-06-10 11:36:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:12,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:12,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147238325] [2021-06-10 11:36:12,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296380062] [2021-06-10 11:36:12,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:12,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 366 transitions, 853 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:12,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,648 INFO L129 PetriNetUnfolder]: 27/420 cut-off events. [2021-06-10 11:36:12,649 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:12,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 420 events. 27/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1639 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 491. Up to 15 conditions per place. [2021-06-10 11:36:12,659 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2021-06-10 11:36:12,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 364 transitions, 866 flow [2021-06-10 11:36:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:12,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:12,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:12,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,661 INFO L185 Difference]: Start difference. First operand has 388 places, 366 transitions, 853 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:12,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 364 transitions, 866 flow [2021-06-10 11:36:12,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 364 transitions, 865 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,664 INFO L241 Difference]: Finished difference. Result has 387 places, 364 transitions, 849 flow [2021-06-10 11:36:12,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=387, PETRI_TRANSITIONS=364} [2021-06-10 11:36:12,665 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 2 predicate places. [2021-06-10 11:36:12,665 INFO L480 AbstractCegarLoop]: Abstraction has has 387 places, 364 transitions, 849 flow [2021-06-10 11:36:12,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,665 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,665 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-06-10 11:36:12,665 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1007503539, now seen corresponding path program 1 times [2021-06-10 11:36:12,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852689697] [2021-06-10 11:36:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:12,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:12,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852689697] [2021-06-10 11:36:12,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915173428] [2021-06-10 11:36:12,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,677 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:12,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 364 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:12,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,747 INFO L129 PetriNetUnfolder]: 26/428 cut-off events. [2021-06-10 11:36:12,747 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:12,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 428 events. 26/428 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1709 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 503. Up to 15 conditions per place. [2021-06-10 11:36:12,758 INFO L132 encePairwiseOnDemand]: 408/413 looper letters, 10 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2021-06-10 11:36:12,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 366 transitions, 879 flow [2021-06-10 11:36:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2021-06-10 11:36:12,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128329297820823 [2021-06-10 11:36:12,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1131 transitions. [2021-06-10 11:36:12,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1131 transitions. [2021-06-10 11:36:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1131 transitions. [2021-06-10 11:36:12,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,761 INFO L185 Difference]: Start difference. First operand has 387 places, 364 transitions, 849 flow. Second operand 3 states and 1131 transitions. [2021-06-10 11:36:12,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 366 transitions, 879 flow [2021-06-10 11:36:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,764 INFO L241 Difference]: Finished difference. Result has 390 places, 366 transitions, 872 flow [2021-06-10 11:36:12,764 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=390, PETRI_TRANSITIONS=366} [2021-06-10 11:36:12,764 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 5 predicate places. [2021-06-10 11:36:12,764 INFO L480 AbstractCegarLoop]: Abstraction has has 390 places, 366 transitions, 872 flow [2021-06-10 11:36:12,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,764 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-06-10 11:36:12,764 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1007504562, now seen corresponding path program 1 times [2021-06-10 11:36:12,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797905759] [2021-06-10 11:36:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:12,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:12,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797905759] [2021-06-10 11:36:12,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127302243] [2021-06-10 11:36:12,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:12,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 366 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:12,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,841 INFO L129 PetriNetUnfolder]: 25/426 cut-off events. [2021-06-10 11:36:12,841 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:12,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 426 events. 25/426 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1699 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 500. Up to 15 conditions per place. [2021-06-10 11:36:12,852 INFO L132 encePairwiseOnDemand]: 410/413 looper letters, 5 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2021-06-10 11:36:12,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 366 transitions, 884 flow [2021-06-10 11:36:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:12,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:12,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:12,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,855 INFO L185 Difference]: Start difference. First operand has 390 places, 366 transitions, 872 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:12,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 366 transitions, 884 flow [2021-06-10 11:36:12,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 366 transitions, 879 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:12,858 INFO L241 Difference]: Finished difference. Result has 393 places, 366 transitions, 877 flow [2021-06-10 11:36:12,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=393, PETRI_TRANSITIONS=366} [2021-06-10 11:36:12,858 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 8 predicate places. [2021-06-10 11:36:12,858 INFO L480 AbstractCegarLoop]: Abstraction has has 393 places, 366 transitions, 877 flow [2021-06-10 11:36:12,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,858 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-06-10 11:36:12,859 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1008456851, now seen corresponding path program 1 times [2021-06-10 11:36:12,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5324620] [2021-06-10 11:36:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:12,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:12,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5324620] [2021-06-10 11:36:12,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160227025] [2021-06-10 11:36:12,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:12,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 366 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:12,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:12,936 INFO L129 PetriNetUnfolder]: 24/422 cut-off events. [2021-06-10 11:36:12,936 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:12,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 422 events. 24/422 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1674 event pairs, 0 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 497. Up to 15 conditions per place. [2021-06-10 11:36:12,947 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/363 dead transitions. [2021-06-10 11:36:12,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 363 transitions, 874 flow [2021-06-10 11:36:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:12,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:12,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:12,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:12,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:12,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,949 INFO L185 Difference]: Start difference. First operand has 393 places, 366 transitions, 877 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:12,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 363 transitions, 874 flow [2021-06-10 11:36:12,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 363 transitions, 867 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:12,952 INFO L241 Difference]: Finished difference. Result has 392 places, 363 transitions, 857 flow [2021-06-10 11:36:12,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=857, PETRI_PLACES=392, PETRI_TRANSITIONS=363} [2021-06-10 11:36:12,953 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 7 predicate places. [2021-06-10 11:36:12,953 INFO L480 AbstractCegarLoop]: Abstraction has has 392 places, 363 transitions, 857 flow [2021-06-10 11:36:12,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:12,953 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:12,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-06-10 11:36:12,953 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1008457874, now seen corresponding path program 1 times [2021-06-10 11:36:12,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:12,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366705431] [2021-06-10 11:36:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:12,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:12,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:12,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:12,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366705431] [2021-06-10 11:36:12,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:12,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:12,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127251162] [2021-06-10 11:36:12,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:12,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:12,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:12,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 363 transitions, 857 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:12,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:12,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:12,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,033 INFO L129 PetriNetUnfolder]: 24/420 cut-off events. [2021-06-10 11:36:13,033 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 420 events. 24/420 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1656 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 498. Up to 15 conditions per place. [2021-06-10 11:36:13,044 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/361 dead transitions. [2021-06-10 11:36:13,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 361 transitions, 870 flow [2021-06-10 11:36:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:13,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:13,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,046 INFO L185 Difference]: Start difference. First operand has 392 places, 363 transitions, 857 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:13,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 361 transitions, 870 flow [2021-06-10 11:36:13,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 361 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,049 INFO L241 Difference]: Finished difference. Result has 391 places, 361 transitions, 853 flow [2021-06-10 11:36:13,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=853, PETRI_PLACES=391, PETRI_TRANSITIONS=361} [2021-06-10 11:36:13,050 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 6 predicate places. [2021-06-10 11:36:13,050 INFO L480 AbstractCegarLoop]: Abstraction has has 391 places, 361 transitions, 853 flow [2021-06-10 11:36:13,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,050 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,050 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-06-10 11:36:13,050 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1463717104, now seen corresponding path program 1 times [2021-06-10 11:36:13,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240906676] [2021-06-10 11:36:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:13,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:13,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240906676] [2021-06-10 11:36:13,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241878902] [2021-06-10 11:36:13,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:13,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 361 transitions, 853 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:13,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,136 INFO L129 PetriNetUnfolder]: 23/428 cut-off events. [2021-06-10 11:36:13,136 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 428 events. 23/428 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1727 event pairs, 0 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 510. Up to 15 conditions per place. [2021-06-10 11:36:13,147 INFO L132 encePairwiseOnDemand]: 408/413 looper letters, 10 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2021-06-10 11:36:13,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 363 transitions, 883 flow [2021-06-10 11:36:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2021-06-10 11:36:13,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128329297820823 [2021-06-10 11:36:13,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,149 INFO L185 Difference]: Start difference. First operand has 391 places, 361 transitions, 853 flow. Second operand 3 states and 1131 transitions. [2021-06-10 11:36:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 363 transitions, 883 flow [2021-06-10 11:36:13,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 363 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,153 INFO L241 Difference]: Finished difference. Result has 394 places, 363 transitions, 876 flow [2021-06-10 11:36:13,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=394, PETRI_TRANSITIONS=363} [2021-06-10 11:36:13,153 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 9 predicate places. [2021-06-10 11:36:13,153 INFO L480 AbstractCegarLoop]: Abstraction has has 394 places, 363 transitions, 876 flow [2021-06-10 11:36:13,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,153 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-06-10 11:36:13,153 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1463718127, now seen corresponding path program 1 times [2021-06-10 11:36:13,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375208969] [2021-06-10 11:36:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:13,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:13,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375208969] [2021-06-10 11:36:13,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117076440] [2021-06-10 11:36:13,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:13,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 363 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:13,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,250 INFO L129 PetriNetUnfolder]: 22/426 cut-off events. [2021-06-10 11:36:13,250 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:13,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 426 events. 22/426 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1717 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 507. Up to 15 conditions per place. [2021-06-10 11:36:13,260 INFO L132 encePairwiseOnDemand]: 410/413 looper letters, 5 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2021-06-10 11:36:13,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 363 transitions, 888 flow [2021-06-10 11:36:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:13,261 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:13,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,263 INFO L185 Difference]: Start difference. First operand has 394 places, 363 transitions, 876 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:13,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 363 transitions, 888 flow [2021-06-10 11:36:13,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 363 transitions, 883 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,266 INFO L241 Difference]: Finished difference. Result has 397 places, 363 transitions, 881 flow [2021-06-10 11:36:13,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=881, PETRI_PLACES=397, PETRI_TRANSITIONS=363} [2021-06-10 11:36:13,266 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 12 predicate places. [2021-06-10 11:36:13,266 INFO L480 AbstractCegarLoop]: Abstraction has has 397 places, 363 transitions, 881 flow [2021-06-10 11:36:13,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,267 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-06-10 11:36:13,267 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1464670416, now seen corresponding path program 1 times [2021-06-10 11:36:13,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375235116] [2021-06-10 11:36:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:13,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:13,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375235116] [2021-06-10 11:36:13,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527178045] [2021-06-10 11:36:13,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,280 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:13,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 363 transitions, 881 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:13,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,346 INFO L129 PetriNetUnfolder]: 21/422 cut-off events. [2021-06-10 11:36:13,347 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:13,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 422 events. 21/422 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1690 event pairs, 0 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 504. Up to 15 conditions per place. [2021-06-10 11:36:13,357 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2021-06-10 11:36:13,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 360 transitions, 878 flow [2021-06-10 11:36:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:13,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:13,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:13,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,359 INFO L185 Difference]: Start difference. First operand has 397 places, 363 transitions, 881 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:13,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 360 transitions, 878 flow [2021-06-10 11:36:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 360 transitions, 871 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:13,363 INFO L241 Difference]: Finished difference. Result has 396 places, 360 transitions, 861 flow [2021-06-10 11:36:13,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=396, PETRI_TRANSITIONS=360} [2021-06-10 11:36:13,363 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 11 predicate places. [2021-06-10 11:36:13,363 INFO L480 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 861 flow [2021-06-10 11:36:13,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,363 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-06-10 11:36:13,363 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1464671439, now seen corresponding path program 1 times [2021-06-10 11:36:13,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643311297] [2021-06-10 11:36:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:13,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:13,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643311297] [2021-06-10 11:36:13,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957275470] [2021-06-10 11:36:13,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:13,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 360 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:13,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,445 INFO L129 PetriNetUnfolder]: 21/420 cut-off events. [2021-06-10 11:36:13,446 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 420 events. 21/420 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1674 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 505. Up to 15 conditions per place. [2021-06-10 11:36:13,456 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/358 dead transitions. [2021-06-10 11:36:13,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 358 transitions, 874 flow [2021-06-10 11:36:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:13,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:13,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,458 INFO L185 Difference]: Start difference. First operand has 396 places, 360 transitions, 861 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:13,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 358 transitions, 874 flow [2021-06-10 11:36:13,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 358 transitions, 873 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,461 INFO L241 Difference]: Finished difference. Result has 395 places, 358 transitions, 857 flow [2021-06-10 11:36:13,461 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=857, PETRI_PLACES=395, PETRI_TRANSITIONS=358} [2021-06-10 11:36:13,461 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 10 predicate places. [2021-06-10 11:36:13,461 INFO L480 AbstractCegarLoop]: Abstraction has has 395 places, 358 transitions, 857 flow [2021-06-10 11:36:13,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,462 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-06-10 11:36:13,462 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1125359186, now seen corresponding path program 1 times [2021-06-10 11:36:13,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584145878] [2021-06-10 11:36:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:13,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:13,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584145878] [2021-06-10 11:36:13,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530568435] [2021-06-10 11:36:13,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:13,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 358 transitions, 857 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:13,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,561 INFO L129 PetriNetUnfolder]: 20/428 cut-off events. [2021-06-10 11:36:13,561 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 428 events. 20/428 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1744 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 517. Up to 15 conditions per place. [2021-06-10 11:36:13,569 INFO L132 encePairwiseOnDemand]: 408/413 looper letters, 10 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2021-06-10 11:36:13,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 360 transitions, 887 flow [2021-06-10 11:36:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2021-06-10 11:36:13,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128329297820823 [2021-06-10 11:36:13,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,572 INFO L185 Difference]: Start difference. First operand has 395 places, 358 transitions, 857 flow. Second operand 3 states and 1131 transitions. [2021-06-10 11:36:13,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 360 transitions, 887 flow [2021-06-10 11:36:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 360 transitions, 886 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,575 INFO L241 Difference]: Finished difference. Result has 398 places, 360 transitions, 880 flow [2021-06-10 11:36:13,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=398, PETRI_TRANSITIONS=360} [2021-06-10 11:36:13,575 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 13 predicate places. [2021-06-10 11:36:13,575 INFO L480 AbstractCegarLoop]: Abstraction has has 398 places, 360 transitions, 880 flow [2021-06-10 11:36:13,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,575 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,576 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-06-10 11:36:13,576 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1125358163, now seen corresponding path program 1 times [2021-06-10 11:36:13,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538678] [2021-06-10 11:36:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:13,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:13,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538678] [2021-06-10 11:36:13,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863541728] [2021-06-10 11:36:13,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:13,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 360 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:13,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,658 INFO L129 PetriNetUnfolder]: 19/426 cut-off events. [2021-06-10 11:36:13,658 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:13,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 426 events. 19/426 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1731 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 514. Up to 15 conditions per place. [2021-06-10 11:36:13,669 INFO L132 encePairwiseOnDemand]: 410/413 looper letters, 5 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2021-06-10 11:36:13,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 360 transitions, 892 flow [2021-06-10 11:36:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:13,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:13,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:13,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,672 INFO L185 Difference]: Start difference. First operand has 398 places, 360 transitions, 880 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:13,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 360 transitions, 892 flow [2021-06-10 11:36:13,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 360 transitions, 887 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,675 INFO L241 Difference]: Finished difference. Result has 401 places, 360 transitions, 885 flow [2021-06-10 11:36:13,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=885, PETRI_PLACES=401, PETRI_TRANSITIONS=360} [2021-06-10 11:36:13,675 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 16 predicate places. [2021-06-10 11:36:13,675 INFO L480 AbstractCegarLoop]: Abstraction has has 401 places, 360 transitions, 885 flow [2021-06-10 11:36:13,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,675 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2021-06-10 11:36:13,676 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1124405874, now seen corresponding path program 1 times [2021-06-10 11:36:13,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875856201] [2021-06-10 11:36:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:13,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:13,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875856201] [2021-06-10 11:36:13,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424308295] [2021-06-10 11:36:13,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,688 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:13,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 360 transitions, 885 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:13,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,756 INFO L129 PetriNetUnfolder]: 18/422 cut-off events. [2021-06-10 11:36:13,756 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:13,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 422 events. 18/422 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1709 event pairs, 0 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 511. Up to 15 conditions per place. [2021-06-10 11:36:13,766 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2021-06-10 11:36:13,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 357 transitions, 882 flow [2021-06-10 11:36:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:13,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:13,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:13,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:13,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,769 INFO L185 Difference]: Start difference. First operand has 401 places, 360 transitions, 885 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:13,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 357 transitions, 882 flow [2021-06-10 11:36:13,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 357 transitions, 875 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:13,772 INFO L241 Difference]: Finished difference. Result has 400 places, 357 transitions, 865 flow [2021-06-10 11:36:13,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=400, PETRI_TRANSITIONS=357} [2021-06-10 11:36:13,772 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 15 predicate places. [2021-06-10 11:36:13,772 INFO L480 AbstractCegarLoop]: Abstraction has has 400 places, 357 transitions, 865 flow [2021-06-10 11:36:13,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,773 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-06-10 11:36:13,773 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1124404851, now seen corresponding path program 1 times [2021-06-10 11:36:13,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6520510] [2021-06-10 11:36:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:13,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:13,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6520510] [2021-06-10 11:36:13,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242105893] [2021-06-10 11:36:13,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:13,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 357 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:13,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,857 INFO L129 PetriNetUnfolder]: 18/420 cut-off events. [2021-06-10 11:36:13,858 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 420 events. 18/420 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1691 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 512. Up to 15 conditions per place. [2021-06-10 11:36:13,867 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/355 dead transitions. [2021-06-10 11:36:13,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 355 transitions, 878 flow [2021-06-10 11:36:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:13,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:13,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:13,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,870 INFO L185 Difference]: Start difference. First operand has 400 places, 357 transitions, 865 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:13,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 355 transitions, 878 flow [2021-06-10 11:36:13,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 355 transitions, 877 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,873 INFO L241 Difference]: Finished difference. Result has 399 places, 355 transitions, 861 flow [2021-06-10 11:36:13,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=399, PETRI_TRANSITIONS=355} [2021-06-10 11:36:13,873 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 14 predicate places. [2021-06-10 11:36:13,873 INFO L480 AbstractCegarLoop]: Abstraction has has 399 places, 355 transitions, 861 flow [2021-06-10 11:36:13,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,873 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,873 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-06-10 11:36:13,874 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1226241868, now seen corresponding path program 1 times [2021-06-10 11:36:13,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954724613] [2021-06-10 11:36:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:13,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:13,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954724613] [2021-06-10 11:36:13,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634804508] [2021-06-10 11:36:13,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:13,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 355 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:13,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:13,964 INFO L129 PetriNetUnfolder]: 17/428 cut-off events. [2021-06-10 11:36:13,964 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:13,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 428 events. 17/428 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1763 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 524. Up to 15 conditions per place. [2021-06-10 11:36:13,975 INFO L132 encePairwiseOnDemand]: 408/413 looper letters, 10 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2021-06-10 11:36:13,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 357 transitions, 891 flow [2021-06-10 11:36:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2021-06-10 11:36:13,976 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128329297820823 [2021-06-10 11:36:13,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:13,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1131 transitions. [2021-06-10 11:36:13,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,977 INFO L185 Difference]: Start difference. First operand has 399 places, 355 transitions, 861 flow. Second operand 3 states and 1131 transitions. [2021-06-10 11:36:13,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 357 transitions, 891 flow [2021-06-10 11:36:13,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 357 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:13,980 INFO L241 Difference]: Finished difference. Result has 402 places, 357 transitions, 884 flow [2021-06-10 11:36:13,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=402, PETRI_TRANSITIONS=357} [2021-06-10 11:36:13,981 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 17 predicate places. [2021-06-10 11:36:13,981 INFO L480 AbstractCegarLoop]: Abstraction has has 402 places, 357 transitions, 884 flow [2021-06-10 11:36:13,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:13,981 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:13,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-06-10 11:36:13,981 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1226240845, now seen corresponding path program 1 times [2021-06-10 11:36:13,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:13,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209405474] [2021-06-10 11:36:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:13,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:13,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:13,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:13,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209405474] [2021-06-10 11:36:13,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:13,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:13,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463667689] [2021-06-10 11:36:13,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:13,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:13,996 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:13,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 357 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:13,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:13,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:13,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,066 INFO L129 PetriNetUnfolder]: 15/429 cut-off events. [2021-06-10 11:36:14,067 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:14,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 429 events. 15/429 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1781 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 524. Up to 15 conditions per place. [2021-06-10 11:36:14,077 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/357 dead transitions. [2021-06-10 11:36:14,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 357 transitions, 896 flow [2021-06-10 11:36:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:14,078 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:14,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,080 INFO L185 Difference]: Start difference. First operand has 402 places, 357 transitions, 884 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:14,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 357 transitions, 896 flow [2021-06-10 11:36:14,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 357 transitions, 891 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:14,083 INFO L241 Difference]: Finished difference. Result has 404 places, 356 transitions, 880 flow [2021-06-10 11:36:14,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=404, PETRI_TRANSITIONS=356} [2021-06-10 11:36:14,083 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 19 predicate places. [2021-06-10 11:36:14,083 INFO L480 AbstractCegarLoop]: Abstraction has has 404 places, 356 transitions, 880 flow [2021-06-10 11:36:14,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,084 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-06-10 11:36:14,084 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1225288556, now seen corresponding path program 1 times [2021-06-10 11:36:14,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778888351] [2021-06-10 11:36:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:14,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:14,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778888351] [2021-06-10 11:36:14,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881570612] [2021-06-10 11:36:14,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:14,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 356 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:14,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,164 INFO L129 PetriNetUnfolder]: 15/422 cut-off events. [2021-06-10 11:36:14,164 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:14,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 422 events. 15/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1726 event pairs, 0 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 518. Up to 15 conditions per place. [2021-06-10 11:36:14,174 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/354 dead transitions. [2021-06-10 11:36:14,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 354 transitions, 883 flow [2021-06-10 11:36:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:14,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:14,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:14,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,177 INFO L185 Difference]: Start difference. First operand has 404 places, 356 transitions, 880 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:14,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 354 transitions, 883 flow [2021-06-10 11:36:14,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 354 transitions, 876 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:14,180 INFO L241 Difference]: Finished difference. Result has 404 places, 354 transitions, 869 flow [2021-06-10 11:36:14,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=404, PETRI_TRANSITIONS=354} [2021-06-10 11:36:14,180 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 19 predicate places. [2021-06-10 11:36:14,180 INFO L480 AbstractCegarLoop]: Abstraction has has 404 places, 354 transitions, 869 flow [2021-06-10 11:36:14,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,180 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2021-06-10 11:36:14,180 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1225287533, now seen corresponding path program 1 times [2021-06-10 11:36:14,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592743491] [2021-06-10 11:36:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:14,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:14,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592743491] [2021-06-10 11:36:14,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3929239] [2021-06-10 11:36:14,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:14,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 354 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:14,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,264 INFO L129 PetriNetUnfolder]: 15/420 cut-off events. [2021-06-10 11:36:14,264 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:14,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 420 events. 15/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1710 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 518. Up to 15 conditions per place. [2021-06-10 11:36:14,274 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/352 dead transitions. [2021-06-10 11:36:14,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 352 transitions, 882 flow [2021-06-10 11:36:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:14,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:14,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,277 INFO L185 Difference]: Start difference. First operand has 404 places, 354 transitions, 869 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:14,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 352 transitions, 882 flow [2021-06-10 11:36:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 352 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:14,280 INFO L241 Difference]: Finished difference. Result has 403 places, 352 transitions, 865 flow [2021-06-10 11:36:14,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=403, PETRI_TRANSITIONS=352} [2021-06-10 11:36:14,280 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 18 predicate places. [2021-06-10 11:36:14,280 INFO L480 AbstractCegarLoop]: Abstraction has has 403 places, 352 transitions, 865 flow [2021-06-10 11:36:14,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,280 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2021-06-10 11:36:14,281 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1051527053, now seen corresponding path program 1 times [2021-06-10 11:36:14,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513197106] [2021-06-10 11:36:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:14,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:14,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513197106] [2021-06-10 11:36:14,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870650439] [2021-06-10 11:36:14,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:14,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 352 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:14,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,363 INFO L129 PetriNetUnfolder]: 14/427 cut-off events. [2021-06-10 11:36:14,363 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:14,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 427 events. 14/427 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1772 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 523. Up to 15 conditions per place. [2021-06-10 11:36:14,373 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 6 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2021-06-10 11:36:14,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 353 transitions, 881 flow [2021-06-10 11:36:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2021-06-10 11:36:14,374 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192897497982244 [2021-06-10 11:36:14,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1139 transitions. [2021-06-10 11:36:14,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.6666666666667) internal successors, (1139), 3 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,376 INFO L185 Difference]: Start difference. First operand has 403 places, 352 transitions, 865 flow. Second operand 3 states and 1139 transitions. [2021-06-10 11:36:14,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 353 transitions, 881 flow [2021-06-10 11:36:14,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 353 transitions, 880 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:14,379 INFO L241 Difference]: Finished difference. Result has 405 places, 352 transitions, 869 flow [2021-06-10 11:36:14,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=405, PETRI_TRANSITIONS=352} [2021-06-10 11:36:14,379 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 20 predicate places. [2021-06-10 11:36:14,379 INFO L480 AbstractCegarLoop]: Abstraction has has 405 places, 352 transitions, 869 flow [2021-06-10 11:36:14,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,379 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-06-10 11:36:14,380 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1051528076, now seen corresponding path program 1 times [2021-06-10 11:36:14,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184932350] [2021-06-10 11:36:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:14,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:14,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184932350] [2021-06-10 11:36:14,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025133694] [2021-06-10 11:36:14,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:14,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 352 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:14,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,468 INFO L129 PetriNetUnfolder]: 12/429 cut-off events. [2021-06-10 11:36:14,468 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:14,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 429 events. 12/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1802 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 534. Up to 15 conditions per place. [2021-06-10 11:36:14,479 INFO L132 encePairwiseOnDemand]: 409/413 looper letters, 9 selfloop transitions, 3 changer transitions 0/353 dead transitions. [2021-06-10 11:36:14,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 353 transitions, 895 flow [2021-06-10 11:36:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2021-06-10 11:36:14,480 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9112187247780468 [2021-06-10 11:36:14,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1129 transitions. [2021-06-10 11:36:14,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1129 transitions. [2021-06-10 11:36:14,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1129 transitions. [2021-06-10 11:36:14,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,481 INFO L185 Difference]: Start difference. First operand has 405 places, 352 transitions, 869 flow. Second operand 3 states and 1129 transitions. [2021-06-10 11:36:14,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 353 transitions, 895 flow [2021-06-10 11:36:14,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 353 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:14,484 INFO L241 Difference]: Finished difference. Result has 408 places, 353 transitions, 886 flow [2021-06-10 11:36:14,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=408, PETRI_TRANSITIONS=353} [2021-06-10 11:36:14,485 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 23 predicate places. [2021-06-10 11:36:14,485 INFO L480 AbstractCegarLoop]: Abstraction has has 408 places, 353 transitions, 886 flow [2021-06-10 11:36:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,485 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-06-10 11:36:14,485 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1050574764, now seen corresponding path program 1 times [2021-06-10 11:36:14,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975067719] [2021-06-10 11:36:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:14,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:14,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975067719] [2021-06-10 11:36:14,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363924061] [2021-06-10 11:36:14,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 413 [2021-06-10 11:36:14,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 353 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 413 [2021-06-10 11:36:14,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,572 INFO L129 PetriNetUnfolder]: 12/422 cut-off events. [2021-06-10 11:36:14,572 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:14,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 422 events. 12/422 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1745 event pairs, 0 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 520. Up to 15 conditions per place. [2021-06-10 11:36:14,583 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 5 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2021-06-10 11:36:14,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 351 transitions, 888 flow [2021-06-10 11:36:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2021-06-10 11:36:14,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184826472962067 [2021-06-10 11:36:14,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1138 transitions. [2021-06-10 11:36:14,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 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-06-10 11:36:14,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,585 INFO L185 Difference]: Start difference. First operand has 408 places, 353 transitions, 886 flow. Second operand 3 states and 1138 transitions. [2021-06-10 11:36:14,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 351 transitions, 888 flow [2021-06-10 11:36:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 351 transitions, 880 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:14,588 INFO L241 Difference]: Finished difference. Result has 408 places, 351 transitions, 873 flow [2021-06-10 11:36:14,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=408, PETRI_TRANSITIONS=351} [2021-06-10 11:36:14,589 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 23 predicate places. [2021-06-10 11:36:14,589 INFO L480 AbstractCegarLoop]: Abstraction has has 408 places, 351 transitions, 873 flow [2021-06-10 11:36:14,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,589 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:14,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2021-06-10 11:36:14,589 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1050573741, now seen corresponding path program 1 times [2021-06-10 11:36:14,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316448056] [2021-06-10 11:36:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:14,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:14,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316448056] [2021-06-10 11:36:14,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517389552] [2021-06-10 11:36:14,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 413 [2021-06-10 11:36:14,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 351 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 413 [2021-06-10 11:36:14,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:14,692 INFO L129 PetriNetUnfolder]: 12/420 cut-off events. [2021-06-10 11:36:14,692 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:14,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 420 events. 12/420 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1727 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 524. Up to 15 conditions per place. [2021-06-10 11:36:14,698 INFO L132 encePairwiseOnDemand]: 411/413 looper letters, 8 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2021-06-10 11:36:14,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 349 transitions, 886 flow [2021-06-10 11:36:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1126 transitions. [2021-06-10 11:36:14,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9087974172719936 [2021-06-10 11:36:14,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:14,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1126 transitions. [2021-06-10 11:36:14,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 413.0) internal successors, (1652), 4 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,701 INFO L185 Difference]: Start difference. First operand has 408 places, 351 transitions, 873 flow. Second operand 3 states and 1126 transitions. [2021-06-10 11:36:14,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 349 transitions, 886 flow [2021-06-10 11:36:14,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 349 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:14,704 INFO L241 Difference]: Finished difference. Result has 407 places, 349 transitions, 869 flow [2021-06-10 11:36:14,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=407, PETRI_TRANSITIONS=349} [2021-06-10 11:36:14,704 INFO L343 CegarLoopForPetriNet]: 385 programPoint places, 22 predicate places. [2021-06-10 11:36:14,704 INFO L480 AbstractCegarLoop]: Abstraction has has 407 places, 349 transitions, 869 flow [2021-06-10 11:36:14,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,704 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 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-06-10 11:36:14,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-06-10 11:36:14,704 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -687026783, now seen corresponding path program 1 times [2021-06-10 11:36:14,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017304411] [2021-06-10 11:36:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:14,711 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:14,715 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:14,723 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:14,723 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:14,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-06-10 11:36:14,724 WARN L342 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:14,724 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of15ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of15ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:14,835 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:14,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-06-10 11:36:14,835 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:14,835 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:14,835 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:14,835 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:14,836 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:14,836 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:14,836 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:14,836 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:14,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 411 places, 441 transitions, 1167 flow [2021-06-10 11:36:14,918 INFO L129 PetriNetUnfolder]: 76/575 cut-off events. [2021-06-10 11:36:14,919 INFO L130 PetriNetUnfolder]: For 665/665 co-relation queries the response was YES. [2021-06-10 11:36:14,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 575 events. 76/575 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2298 event pairs, 0 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 676. Up to 32 conditions per place. [2021-06-10 11:36:14,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 411 places, 441 transitions, 1167 flow [2021-06-10 11:36:14,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 411 places, 441 transitions, 1167 flow [2021-06-10 11:36:14,944 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:36:14,944 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:14,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:14,944 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-06-10 11:36:14,944 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1641668981, now seen corresponding path program 1 times [2021-06-10 11:36:14,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:14,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025701558] [2021-06-10 11:36:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:14,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:14,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:14,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:14,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025701558] [2021-06-10 11:36:14,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:14,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:14,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236853206] [2021-06-10 11:36:14,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:14,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:14,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:14,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:14,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 441 transitions, 1167 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:14,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:14,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:14,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,025 INFO L129 PetriNetUnfolder]: 43/454 cut-off events. [2021-06-10 11:36:15,025 INFO L130 PetriNetUnfolder]: For 666/666 co-relation queries the response was YES. [2021-06-10 11:36:15,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 454 events. 43/454 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1726 event pairs, 0 based on Foata normal form. 62/456 useless extension candidates. Maximal degree in co-relation 567. Up to 16 conditions per place. [2021-06-10 11:36:15,039 INFO L132 encePairwiseOnDemand]: 421/441 looper letters, 5 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2021-06-10 11:36:15,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 406 transitions, 1111 flow [2021-06-10 11:36:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2021-06-10 11:36:15,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9455782312925171 [2021-06-10 11:36:15,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1251 transitions. [2021-06-10 11:36:15,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1251 transitions. [2021-06-10 11:36:15,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1251 transitions. [2021-06-10 11:36:15,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,043 INFO L185 Difference]: Start difference. First operand has 411 places, 441 transitions, 1167 flow. Second operand 3 states and 1251 transitions. [2021-06-10 11:36:15,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 406 transitions, 1111 flow [2021-06-10 11:36:15,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 406 transitions, 901 flow, removed 105 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:15,046 INFO L241 Difference]: Finished difference. Result has 395 places, 406 transitions, 899 flow [2021-06-10 11:36:15,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=395, PETRI_TRANSITIONS=406} [2021-06-10 11:36:15,047 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -16 predicate places. [2021-06-10 11:36:15,047 INFO L480 AbstractCegarLoop]: Abstraction has has 395 places, 406 transitions, 899 flow [2021-06-10 11:36:15,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,047 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-06-10 11:36:15,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-06-10 11:36:15,047 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1641670004, now seen corresponding path program 1 times [2021-06-10 11:36:15,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509436308] [2021-06-10 11:36:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:15,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:15,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509436308] [2021-06-10 11:36:15,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149674698] [2021-06-10 11:36:15,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:15,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 406 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:15,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,127 INFO L129 PetriNetUnfolder]: 43/455 cut-off events. [2021-06-10 11:36:15,128 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:15,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 455 events. 43/455 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1730 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 500. Up to 16 conditions per place. [2021-06-10 11:36:15,141 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/407 dead transitions. [2021-06-10 11:36:15,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 407 transitions, 925 flow [2021-06-10 11:36:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:15,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:15,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,143 INFO L185 Difference]: Start difference. First operand has 395 places, 406 transitions, 899 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 407 transitions, 925 flow [2021-06-10 11:36:15,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 407 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,147 INFO L241 Difference]: Finished difference. Result has 398 places, 407 transitions, 915 flow [2021-06-10 11:36:15,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=915, PETRI_PLACES=398, PETRI_TRANSITIONS=407} [2021-06-10 11:36:15,147 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -13 predicate places. [2021-06-10 11:36:15,147 INFO L480 AbstractCegarLoop]: Abstraction has has 398 places, 407 transitions, 915 flow [2021-06-10 11:36:15,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,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] [2021-06-10 11:36:15,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-06-10 11:36:15,152 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1640716692, now seen corresponding path program 1 times [2021-06-10 11:36:15,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523552710] [2021-06-10 11:36:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:15,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:15,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523552710] [2021-06-10 11:36:15,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168815100] [2021-06-10 11:36:15,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:15,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 407 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:15,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,236 INFO L129 PetriNetUnfolder]: 42/451 cut-off events. [2021-06-10 11:36:15,236 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:15,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 451 events. 42/451 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1708 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 492. Up to 16 conditions per place. [2021-06-10 11:36:15,249 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/404 dead transitions. [2021-06-10 11:36:15,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 404 transitions, 912 flow [2021-06-10 11:36:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:15,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:15,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,252 INFO L185 Difference]: Start difference. First operand has 398 places, 407 transitions, 915 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:15,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 404 transitions, 912 flow [2021-06-10 11:36:15,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 404 transitions, 904 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:15,256 INFO L241 Difference]: Finished difference. Result has 397 places, 404 transitions, 894 flow [2021-06-10 11:36:15,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=397, PETRI_TRANSITIONS=404} [2021-06-10 11:36:15,256 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -14 predicate places. [2021-06-10 11:36:15,256 INFO L480 AbstractCegarLoop]: Abstraction has has 397 places, 404 transitions, 894 flow [2021-06-10 11:36:15,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,256 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-06-10 11:36:15,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2021-06-10 11:36:15,256 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1640715669, now seen corresponding path program 1 times [2021-06-10 11:36:15,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781348729] [2021-06-10 11:36:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:15,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:15,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781348729] [2021-06-10 11:36:15,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465551098] [2021-06-10 11:36:15,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:15,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 404 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:15,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,334 INFO L129 PetriNetUnfolder]: 42/449 cut-off events. [2021-06-10 11:36:15,334 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-10 11:36:15,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 449 events. 42/449 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1694 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 500. Up to 16 conditions per place. [2021-06-10 11:36:15,348 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2021-06-10 11:36:15,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 402 transitions, 907 flow [2021-06-10 11:36:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:15,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:15,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,350 INFO L185 Difference]: Start difference. First operand has 397 places, 404 transitions, 894 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:15,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 402 transitions, 907 flow [2021-06-10 11:36:15,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 402 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,354 INFO L241 Difference]: Finished difference. Result has 396 places, 402 transitions, 890 flow [2021-06-10 11:36:15,354 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=396, PETRI_TRANSITIONS=402} [2021-06-10 11:36:15,354 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -15 predicate places. [2021-06-10 11:36:15,354 INFO L480 AbstractCegarLoop]: Abstraction has has 396 places, 402 transitions, 890 flow [2021-06-10 11:36:15,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,355 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-06-10 11:36:15,355 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash 428343199, now seen corresponding path program 1 times [2021-06-10 11:36:15,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650014691] [2021-06-10 11:36:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:15,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:15,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650014691] [2021-06-10 11:36:15,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811440180] [2021-06-10 11:36:15,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,366 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:15,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 402 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:15,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,443 INFO L129 PetriNetUnfolder]: 41/457 cut-off events. [2021-06-10 11:36:15,444 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:15,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 457 events. 41/457 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1764 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2021-06-10 11:36:15,457 INFO L132 encePairwiseOnDemand]: 436/441 looper letters, 10 selfloop transitions, 3 changer transitions 0/404 dead transitions. [2021-06-10 11:36:15,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 404 transitions, 920 flow [2021-06-10 11:36:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2021-06-10 11:36:15,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2021-06-10 11:36:15,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2021-06-10 11:36:15,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2021-06-10 11:36:15,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2021-06-10 11:36:15,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 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-06-10 11:36:15,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,460 INFO L185 Difference]: Start difference. First operand has 396 places, 402 transitions, 890 flow. Second operand 3 states and 1209 transitions. [2021-06-10 11:36:15,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 404 transitions, 920 flow [2021-06-10 11:36:15,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 404 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,463 INFO L241 Difference]: Finished difference. Result has 399 places, 404 transitions, 913 flow [2021-06-10 11:36:15,463 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=399, PETRI_TRANSITIONS=404} [2021-06-10 11:36:15,464 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -12 predicate places. [2021-06-10 11:36:15,464 INFO L480 AbstractCegarLoop]: Abstraction has has 399 places, 404 transitions, 913 flow [2021-06-10 11:36:15,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,464 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-06-10 11:36:15,464 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash 428344222, now seen corresponding path program 1 times [2021-06-10 11:36:15,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220585498] [2021-06-10 11:36:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:15,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:15,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220585498] [2021-06-10 11:36:15,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230576131] [2021-06-10 11:36:15,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:15,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 404 transitions, 913 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:15,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,544 INFO L129 PetriNetUnfolder]: 40/455 cut-off events. [2021-06-10 11:36:15,545 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:15,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 455 events. 40/455 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1751 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 508. Up to 16 conditions per place. [2021-06-10 11:36:15,558 INFO L132 encePairwiseOnDemand]: 438/441 looper letters, 5 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2021-06-10 11:36:15,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 404 transitions, 925 flow [2021-06-10 11:36:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:15,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:15,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,560 INFO L185 Difference]: Start difference. First operand has 399 places, 404 transitions, 913 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:15,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 404 transitions, 925 flow [2021-06-10 11:36:15,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 404 transitions, 920 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,564 INFO L241 Difference]: Finished difference. Result has 402 places, 404 transitions, 918 flow [2021-06-10 11:36:15,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=402, PETRI_TRANSITIONS=404} [2021-06-10 11:36:15,564 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -9 predicate places. [2021-06-10 11:36:15,564 INFO L480 AbstractCegarLoop]: Abstraction has has 402 places, 404 transitions, 918 flow [2021-06-10 11:36:15,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,564 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-06-10 11:36:15,565 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 429296511, now seen corresponding path program 1 times [2021-06-10 11:36:15,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146336141] [2021-06-10 11:36:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:15,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:15,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146336141] [2021-06-10 11:36:15,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066725640] [2021-06-10 11:36:15,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:15,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 404 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:15,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,647 INFO L129 PetriNetUnfolder]: 39/451 cut-off events. [2021-06-10 11:36:15,647 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:15,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 451 events. 39/451 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1728 event pairs, 0 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 506. Up to 16 conditions per place. [2021-06-10 11:36:15,659 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/401 dead transitions. [2021-06-10 11:36:15,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 401 transitions, 915 flow [2021-06-10 11:36:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:15,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:15,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:15,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,662 INFO L185 Difference]: Start difference. First operand has 402 places, 404 transitions, 918 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:15,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 401 transitions, 915 flow [2021-06-10 11:36:15,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 401 transitions, 908 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:15,666 INFO L241 Difference]: Finished difference. Result has 401 places, 401 transitions, 898 flow [2021-06-10 11:36:15,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=401, PETRI_TRANSITIONS=401} [2021-06-10 11:36:15,666 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -10 predicate places. [2021-06-10 11:36:15,666 INFO L480 AbstractCegarLoop]: Abstraction has has 401 places, 401 transitions, 898 flow [2021-06-10 11:36:15,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,666 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-06-10 11:36:15,667 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 429297534, now seen corresponding path program 1 times [2021-06-10 11:36:15,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68021869] [2021-06-10 11:36:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:15,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:15,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68021869] [2021-06-10 11:36:15,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754602031] [2021-06-10 11:36:15,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:15,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 401 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:15,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,752 INFO L129 PetriNetUnfolder]: 39/449 cut-off events. [2021-06-10 11:36:15,752 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:15,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 449 events. 39/449 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1712 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 507. Up to 16 conditions per place. [2021-06-10 11:36:15,765 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/399 dead transitions. [2021-06-10 11:36:15,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 399 transitions, 911 flow [2021-06-10 11:36:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:15,766 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:15,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:15,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,768 INFO L185 Difference]: Start difference. First operand has 401 places, 401 transitions, 898 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 399 transitions, 911 flow [2021-06-10 11:36:15,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 399 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,771 INFO L241 Difference]: Finished difference. Result has 400 places, 399 transitions, 894 flow [2021-06-10 11:36:15,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=400, PETRI_TRANSITIONS=399} [2021-06-10 11:36:15,771 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -11 predicate places. [2021-06-10 11:36:15,771 INFO L480 AbstractCegarLoop]: Abstraction has has 400 places, 399 transitions, 894 flow [2021-06-10 11:36:15,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,772 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,772 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-06-10 11:36:15,772 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -979229165, now seen corresponding path program 1 times [2021-06-10 11:36:15,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248879285] [2021-06-10 11:36:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:15,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:15,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248879285] [2021-06-10 11:36:15,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784730204] [2021-06-10 11:36:15,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:15,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 399 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:15,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,858 INFO L129 PetriNetUnfolder]: 38/456 cut-off events. [2021-06-10 11:36:15,858 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:15,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 456 events. 38/456 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1773 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2021-06-10 11:36:15,870 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2021-06-10 11:36:15,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 910 flow [2021-06-10 11:36:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:15,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:15,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:15,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,873 INFO L185 Difference]: Start difference. First operand has 400 places, 399 transitions, 894 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 910 flow [2021-06-10 11:36:15,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 400 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,877 INFO L241 Difference]: Finished difference. Result has 402 places, 399 transitions, 898 flow [2021-06-10 11:36:15,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=402, PETRI_TRANSITIONS=399} [2021-06-10 11:36:15,877 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -9 predicate places. [2021-06-10 11:36:15,877 INFO L480 AbstractCegarLoop]: Abstraction has has 402 places, 399 transitions, 898 flow [2021-06-10 11:36:15,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,877 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2021-06-10 11:36:15,877 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -979228142, now seen corresponding path program 1 times [2021-06-10 11:36:15,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976120495] [2021-06-10 11:36:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:15,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:15,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976120495] [2021-06-10 11:36:15,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124509321] [2021-06-10 11:36:15,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:15,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:15,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:15,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 399 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:15,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:15,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:15,971 INFO L129 PetriNetUnfolder]: 36/458 cut-off events. [2021-06-10 11:36:15,971 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:15,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 458 events. 36/458 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1803 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 523. Up to 16 conditions per place. [2021-06-10 11:36:15,982 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2021-06-10 11:36:15,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 924 flow [2021-06-10 11:36:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:15,983 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:15,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:15,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:15,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,985 INFO L185 Difference]: Start difference. First operand has 402 places, 399 transitions, 898 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:15,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 924 flow [2021-06-10 11:36:15,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 400 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:15,989 INFO L241 Difference]: Finished difference. Result has 405 places, 400 transitions, 915 flow [2021-06-10 11:36:15,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=915, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2021-06-10 11:36:15,989 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -6 predicate places. [2021-06-10 11:36:15,989 INFO L480 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 915 flow [2021-06-10 11:36:15,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:15,989 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:15,989 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:15,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-06-10 11:36:15,989 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash -980181454, now seen corresponding path program 1 times [2021-06-10 11:36:15,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:15,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466865828] [2021-06-10 11:36:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:15,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:15,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:15,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:15,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466865828] [2021-06-10 11:36:15,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:15,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:15,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533433757] [2021-06-10 11:36:16,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:16,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:16,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,068 INFO L129 PetriNetUnfolder]: 36/451 cut-off events. [2021-06-10 11:36:16,068 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:16,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 451 events. 36/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1745 event pairs, 0 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 508. Up to 16 conditions per place. [2021-06-10 11:36:16,080 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2021-06-10 11:36:16,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 398 transitions, 917 flow [2021-06-10 11:36:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:16,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:16,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,083 INFO L185 Difference]: Start difference. First operand has 405 places, 400 transitions, 915 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:16,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 398 transitions, 917 flow [2021-06-10 11:36:16,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 398 transitions, 909 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:16,086 INFO L241 Difference]: Finished difference. Result has 405 places, 398 transitions, 902 flow [2021-06-10 11:36:16,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2021-06-10 11:36:16,087 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -6 predicate places. [2021-06-10 11:36:16,087 INFO L480 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 902 flow [2021-06-10 11:36:16,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,087 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-06-10 11:36:16,087 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash -980182477, now seen corresponding path program 1 times [2021-06-10 11:36:16,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916987192] [2021-06-10 11:36:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:16,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:16,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916987192] [2021-06-10 11:36:16,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945411288] [2021-06-10 11:36:16,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:16,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:16,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,173 INFO L129 PetriNetUnfolder]: 36/449 cut-off events. [2021-06-10 11:36:16,173 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:16,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 449 events. 36/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1729 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 513. Up to 16 conditions per place. [2021-06-10 11:36:16,185 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2021-06-10 11:36:16,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 396 transitions, 915 flow [2021-06-10 11:36:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:16,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:16,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,187 INFO L185 Difference]: Start difference. First operand has 405 places, 398 transitions, 902 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:16,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 396 transitions, 915 flow [2021-06-10 11:36:16,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 396 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,191 INFO L241 Difference]: Finished difference. Result has 404 places, 396 transitions, 898 flow [2021-06-10 11:36:16,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2021-06-10 11:36:16,191 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -7 predicate places. [2021-06-10 11:36:16,191 INFO L480 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 898 flow [2021-06-10 11:36:16,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,191 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-06-10 11:36:16,191 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1838387367, now seen corresponding path program 1 times [2021-06-10 11:36:16,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055106810] [2021-06-10 11:36:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:16,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:16,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055106810] [2021-06-10 11:36:16,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250589352] [2021-06-10 11:36:16,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:16,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:16,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,289 INFO L129 PetriNetUnfolder]: 35/457 cut-off events. [2021-06-10 11:36:16,289 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:16,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 457 events. 35/457 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1799 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2021-06-10 11:36:16,302 INFO L132 encePairwiseOnDemand]: 436/441 looper letters, 10 selfloop transitions, 3 changer transitions 0/398 dead transitions. [2021-06-10 11:36:16,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 398 transitions, 928 flow [2021-06-10 11:36:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2021-06-10 11:36:16,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2021-06-10 11:36:16,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 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-06-10 11:36:16,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,304 INFO L185 Difference]: Start difference. First operand has 404 places, 396 transitions, 898 flow. Second operand 3 states and 1209 transitions. [2021-06-10 11:36:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 398 transitions, 928 flow [2021-06-10 11:36:16,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 398 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,308 INFO L241 Difference]: Finished difference. Result has 407 places, 398 transitions, 921 flow [2021-06-10 11:36:16,308 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=407, PETRI_TRANSITIONS=398} [2021-06-10 11:36:16,308 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -4 predicate places. [2021-06-10 11:36:16,308 INFO L480 AbstractCegarLoop]: Abstraction has has 407 places, 398 transitions, 921 flow [2021-06-10 11:36:16,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,308 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2021-06-10 11:36:16,308 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1838386344, now seen corresponding path program 1 times [2021-06-10 11:36:16,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109930560] [2021-06-10 11:36:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:16,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:16,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109930560] [2021-06-10 11:36:16,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583897125] [2021-06-10 11:36:16,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:16,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 398 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:16,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,398 INFO L129 PetriNetUnfolder]: 33/458 cut-off events. [2021-06-10 11:36:16,398 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:16,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 458 events. 33/458 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1818 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2021-06-10 11:36:16,410 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2021-06-10 11:36:16,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 398 transitions, 933 flow [2021-06-10 11:36:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:16,411 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:16,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,413 INFO L185 Difference]: Start difference. First operand has 407 places, 398 transitions, 921 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:16,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 398 transitions, 933 flow [2021-06-10 11:36:16,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 398 transitions, 928 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,417 INFO L241 Difference]: Finished difference. Result has 409 places, 397 transitions, 917 flow [2021-06-10 11:36:16,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=409, PETRI_TRANSITIONS=397} [2021-06-10 11:36:16,417 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -2 predicate places. [2021-06-10 11:36:16,417 INFO L480 AbstractCegarLoop]: Abstraction has has 409 places, 397 transitions, 917 flow [2021-06-10 11:36:16,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,417 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2021-06-10 11:36:16,418 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1837434055, now seen corresponding path program 1 times [2021-06-10 11:36:16,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670423552] [2021-06-10 11:36:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:16,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:16,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670423552] [2021-06-10 11:36:16,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496652285] [2021-06-10 11:36:16,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,429 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:16,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 397 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:16,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,500 INFO L129 PetriNetUnfolder]: 33/451 cut-off events. [2021-06-10 11:36:16,500 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:16,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 451 events. 33/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1764 event pairs, 0 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2021-06-10 11:36:16,512 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/395 dead transitions. [2021-06-10 11:36:16,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 395 transitions, 920 flow [2021-06-10 11:36:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:16,525 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:16,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,527 INFO L185 Difference]: Start difference. First operand has 409 places, 397 transitions, 917 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:16,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 395 transitions, 920 flow [2021-06-10 11:36:16,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 395 transitions, 913 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:16,531 INFO L241 Difference]: Finished difference. Result has 409 places, 395 transitions, 906 flow [2021-06-10 11:36:16,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=409, PETRI_TRANSITIONS=395} [2021-06-10 11:36:16,531 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -2 predicate places. [2021-06-10 11:36:16,531 INFO L480 AbstractCegarLoop]: Abstraction has has 409 places, 395 transitions, 906 flow [2021-06-10 11:36:16,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,531 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,531 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2021-06-10 11:36:16,532 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1837433032, now seen corresponding path program 1 times [2021-06-10 11:36:16,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673477554] [2021-06-10 11:36:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:16,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:16,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673477554] [2021-06-10 11:36:16,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904935381] [2021-06-10 11:36:16,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,544 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:16,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 395 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:16,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,616 INFO L129 PetriNetUnfolder]: 33/449 cut-off events. [2021-06-10 11:36:16,616 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:16,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 449 events. 33/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1746 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2021-06-10 11:36:16,628 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2021-06-10 11:36:16,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 393 transitions, 919 flow [2021-06-10 11:36:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:16,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:16,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:16,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,631 INFO L185 Difference]: Start difference. First operand has 409 places, 395 transitions, 906 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:16,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 393 transitions, 919 flow [2021-06-10 11:36:16,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 393 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,634 INFO L241 Difference]: Finished difference. Result has 408 places, 393 transitions, 902 flow [2021-06-10 11:36:16,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=408, PETRI_TRANSITIONS=393} [2021-06-10 11:36:16,634 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, -3 predicate places. [2021-06-10 11:36:16,634 INFO L480 AbstractCegarLoop]: Abstraction has has 408 places, 393 transitions, 902 flow [2021-06-10 11:36:16,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,635 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2021-06-10 11:36:16,635 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash 926126525, now seen corresponding path program 1 times [2021-06-10 11:36:16,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573877721] [2021-06-10 11:36:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:16,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:16,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573877721] [2021-06-10 11:36:16,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281780864] [2021-06-10 11:36:16,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:16,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 393 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:16,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,725 INFO L129 PetriNetUnfolder]: 32/457 cut-off events. [2021-06-10 11:36:16,725 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:16,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 457 events. 32/457 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1817 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 531. Up to 16 conditions per place. [2021-06-10 11:36:16,738 INFO L132 encePairwiseOnDemand]: 436/441 looper letters, 10 selfloop transitions, 3 changer transitions 0/395 dead transitions. [2021-06-10 11:36:16,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 395 transitions, 932 flow [2021-06-10 11:36:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2021-06-10 11:36:16,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2021-06-10 11:36:16,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2021-06-10 11:36:16,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 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-06-10 11:36:16,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,741 INFO L185 Difference]: Start difference. First operand has 408 places, 393 transitions, 902 flow. Second operand 3 states and 1209 transitions. [2021-06-10 11:36:16,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 395 transitions, 932 flow [2021-06-10 11:36:16,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 395 transitions, 931 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,745 INFO L241 Difference]: Finished difference. Result has 411 places, 395 transitions, 925 flow [2021-06-10 11:36:16,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=411, PETRI_TRANSITIONS=395} [2021-06-10 11:36:16,745 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 0 predicate places. [2021-06-10 11:36:16,745 INFO L480 AbstractCegarLoop]: Abstraction has has 411 places, 395 transitions, 925 flow [2021-06-10 11:36:16,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,746 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-06-10 11:36:16,746 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash 926125502, now seen corresponding path program 1 times [2021-06-10 11:36:16,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850120325] [2021-06-10 11:36:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:16,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:16,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850120325] [2021-06-10 11:36:16,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031443238] [2021-06-10 11:36:16,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,758 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:16,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 395 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:16,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,846 INFO L129 PetriNetUnfolder]: 30/458 cut-off events. [2021-06-10 11:36:16,846 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:16,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 458 events. 30/458 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1837 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 531. Up to 16 conditions per place. [2021-06-10 11:36:16,859 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/395 dead transitions. [2021-06-10 11:36:16,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 395 transitions, 937 flow [2021-06-10 11:36:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:16,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:16,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:16,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,862 INFO L185 Difference]: Start difference. First operand has 411 places, 395 transitions, 925 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:16,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 395 transitions, 937 flow [2021-06-10 11:36:16,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 395 transitions, 932 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:16,866 INFO L241 Difference]: Finished difference. Result has 413 places, 394 transitions, 921 flow [2021-06-10 11:36:16,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=413, PETRI_TRANSITIONS=394} [2021-06-10 11:36:16,866 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 2 predicate places. [2021-06-10 11:36:16,866 INFO L480 AbstractCegarLoop]: Abstraction has has 413 places, 394 transitions, 921 flow [2021-06-10 11:36:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,866 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2021-06-10 11:36:16,866 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,867 INFO L82 PathProgramCache]: Analyzing trace with hash 925173213, now seen corresponding path program 1 times [2021-06-10 11:36:16,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950518199] [2021-06-10 11:36:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:16,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:16,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950518199] [2021-06-10 11:36:16,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071408763] [2021-06-10 11:36:16,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:16,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 394 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:16,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:16,955 INFO L129 PetriNetUnfolder]: 30/451 cut-off events. [2021-06-10 11:36:16,955 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:16,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 451 events. 30/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1780 event pairs, 0 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2021-06-10 11:36:16,967 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/392 dead transitions. [2021-06-10 11:36:16,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 392 transitions, 924 flow [2021-06-10 11:36:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:16,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:16,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:16,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:16,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,970 INFO L185 Difference]: Start difference. First operand has 413 places, 394 transitions, 921 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 392 transitions, 924 flow [2021-06-10 11:36:16,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 392 transitions, 917 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:16,974 INFO L241 Difference]: Finished difference. Result has 413 places, 392 transitions, 910 flow [2021-06-10 11:36:16,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=413, PETRI_TRANSITIONS=392} [2021-06-10 11:36:16,974 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 2 predicate places. [2021-06-10 11:36:16,974 INFO L480 AbstractCegarLoop]: Abstraction has has 413 places, 392 transitions, 910 flow [2021-06-10 11:36:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:16,975 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:16,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2021-06-10 11:36:16,975 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 925172190, now seen corresponding path program 1 times [2021-06-10 11:36:16,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:16,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286300848] [2021-06-10 11:36:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:16,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:16,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:16,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:16,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286300848] [2021-06-10 11:36:16,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:16,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:16,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803593831] [2021-06-10 11:36:16,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:16,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:16,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:16,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 392 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:16,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:16,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:16,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,063 INFO L129 PetriNetUnfolder]: 30/449 cut-off events. [2021-06-10 11:36:17,063 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:17,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 449 events. 30/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1764 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 525. Up to 16 conditions per place. [2021-06-10 11:36:17,078 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2021-06-10 11:36:17,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 390 transitions, 923 flow [2021-06-10 11:36:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:17,079 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:17,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,081 INFO L185 Difference]: Start difference. First operand has 413 places, 392 transitions, 910 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 390 transitions, 923 flow [2021-06-10 11:36:17,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 390 transitions, 922 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,085 INFO L241 Difference]: Finished difference. Result has 412 places, 390 transitions, 906 flow [2021-06-10 11:36:17,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=412, PETRI_TRANSITIONS=390} [2021-06-10 11:36:17,085 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 1 predicate places. [2021-06-10 11:36:17,085 INFO L480 AbstractCegarLoop]: Abstraction has has 412 places, 390 transitions, 906 flow [2021-06-10 11:36:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,085 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2021-06-10 11:36:17,085 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash -167545131, now seen corresponding path program 1 times [2021-06-10 11:36:17,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849597522] [2021-06-10 11:36:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:17,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:17,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849597522] [2021-06-10 11:36:17,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399639030] [2021-06-10 11:36:17,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:17,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 390 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:17,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,192 INFO L129 PetriNetUnfolder]: 29/456 cut-off events. [2021-06-10 11:36:17,192 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:17,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 456 events. 29/456 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1824 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 530. Up to 16 conditions per place. [2021-06-10 11:36:17,202 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/391 dead transitions. [2021-06-10 11:36:17,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 391 transitions, 922 flow [2021-06-10 11:36:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:17,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:17,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,205 INFO L185 Difference]: Start difference. First operand has 412 places, 390 transitions, 906 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 391 transitions, 922 flow [2021-06-10 11:36:17,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 391 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,208 INFO L241 Difference]: Finished difference. Result has 414 places, 390 transitions, 910 flow [2021-06-10 11:36:17,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=414, PETRI_TRANSITIONS=390} [2021-06-10 11:36:17,208 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 3 predicate places. [2021-06-10 11:36:17,208 INFO L480 AbstractCegarLoop]: Abstraction has has 414 places, 390 transitions, 910 flow [2021-06-10 11:36:17,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,209 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2021-06-10 11:36:17,209 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash -167544108, now seen corresponding path program 1 times [2021-06-10 11:36:17,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106901874] [2021-06-10 11:36:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:17,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:17,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106901874] [2021-06-10 11:36:17,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127402604] [2021-06-10 11:36:17,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:17,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 390 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:17,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,300 INFO L129 PetriNetUnfolder]: 27/458 cut-off events. [2021-06-10 11:36:17,301 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:17,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 458 events. 27/458 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1855 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 541. Up to 16 conditions per place. [2021-06-10 11:36:17,312 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/391 dead transitions. [2021-06-10 11:36:17,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 391 transitions, 936 flow [2021-06-10 11:36:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:17,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:17,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,314 INFO L185 Difference]: Start difference. First operand has 414 places, 390 transitions, 910 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 391 transitions, 936 flow [2021-06-10 11:36:17,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 391 transitions, 935 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,318 INFO L241 Difference]: Finished difference. Result has 417 places, 391 transitions, 927 flow [2021-06-10 11:36:17,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=927, PETRI_PLACES=417, PETRI_TRANSITIONS=391} [2021-06-10 11:36:17,318 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 6 predicate places. [2021-06-10 11:36:17,318 INFO L480 AbstractCegarLoop]: Abstraction has has 417 places, 391 transitions, 927 flow [2021-06-10 11:36:17,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,318 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-06-10 11:36:17,319 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash -168497420, now seen corresponding path program 1 times [2021-06-10 11:36:17,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637457314] [2021-06-10 11:36:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:17,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:17,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637457314] [2021-06-10 11:36:17,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852593658] [2021-06-10 11:36:17,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:17,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 391 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:17,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,402 INFO L129 PetriNetUnfolder]: 27/451 cut-off events. [2021-06-10 11:36:17,402 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:17,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 451 events. 27/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1799 event pairs, 0 based on Foata normal form. 1/411 useless extension candidates. Maximal degree in co-relation 527. Up to 16 conditions per place. [2021-06-10 11:36:17,413 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2021-06-10 11:36:17,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 389 transitions, 929 flow [2021-06-10 11:36:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:17,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:17,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,415 INFO L185 Difference]: Start difference. First operand has 417 places, 391 transitions, 927 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:17,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 389 transitions, 929 flow [2021-06-10 11:36:17,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 389 transitions, 921 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:17,419 INFO L241 Difference]: Finished difference. Result has 417 places, 389 transitions, 914 flow [2021-06-10 11:36:17,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=417, PETRI_TRANSITIONS=389} [2021-06-10 11:36:17,419 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 6 predicate places. [2021-06-10 11:36:17,419 INFO L480 AbstractCegarLoop]: Abstraction has has 417 places, 389 transitions, 914 flow [2021-06-10 11:36:17,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,419 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2021-06-10 11:36:17,420 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash -168498443, now seen corresponding path program 1 times [2021-06-10 11:36:17,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126139599] [2021-06-10 11:36:17,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:17,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:17,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126139599] [2021-06-10 11:36:17,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711291794] [2021-06-10 11:36:17,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:17,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 389 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:17,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,505 INFO L129 PetriNetUnfolder]: 27/449 cut-off events. [2021-06-10 11:36:17,505 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:17,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 449 events. 27/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1781 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 531. Up to 16 conditions per place. [2021-06-10 11:36:17,517 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/387 dead transitions. [2021-06-10 11:36:17,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 387 transitions, 927 flow [2021-06-10 11:36:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:17,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:17,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,519 INFO L185 Difference]: Start difference. First operand has 417 places, 389 transitions, 914 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:17,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 387 transitions, 927 flow [2021-06-10 11:36:17,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 387 transitions, 926 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,523 INFO L241 Difference]: Finished difference. Result has 416 places, 387 transitions, 910 flow [2021-06-10 11:36:17,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=416, PETRI_TRANSITIONS=387} [2021-06-10 11:36:17,523 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 5 predicate places. [2021-06-10 11:36:17,523 INFO L480 AbstractCegarLoop]: Abstraction has has 416 places, 387 transitions, 910 flow [2021-06-10 11:36:17,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,523 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2021-06-10 11:36:17,523 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,524 INFO L82 PathProgramCache]: Analyzing trace with hash 324924269, now seen corresponding path program 1 times [2021-06-10 11:36:17,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128084513] [2021-06-10 11:36:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:17,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:17,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128084513] [2021-06-10 11:36:17,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871714256] [2021-06-10 11:36:17,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:17,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 387 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:17,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,613 INFO L129 PetriNetUnfolder]: 26/456 cut-off events. [2021-06-10 11:36:17,613 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:17,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 456 events. 26/456 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1842 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 536. Up to 16 conditions per place. [2021-06-10 11:36:17,626 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2021-06-10 11:36:17,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 388 transitions, 926 flow [2021-06-10 11:36:17,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:17,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:17,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:17,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,628 INFO L185 Difference]: Start difference. First operand has 416 places, 387 transitions, 910 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:17,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 388 transitions, 926 flow [2021-06-10 11:36:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 388 transitions, 925 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,632 INFO L241 Difference]: Finished difference. Result has 418 places, 387 transitions, 914 flow [2021-06-10 11:36:17,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=418, PETRI_TRANSITIONS=387} [2021-06-10 11:36:17,632 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 7 predicate places. [2021-06-10 11:36:17,632 INFO L480 AbstractCegarLoop]: Abstraction has has 418 places, 387 transitions, 914 flow [2021-06-10 11:36:17,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,632 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2021-06-10 11:36:17,633 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash 324925292, now seen corresponding path program 1 times [2021-06-10 11:36:17,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203248002] [2021-06-10 11:36:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:17,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:17,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203248002] [2021-06-10 11:36:17,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142370823] [2021-06-10 11:36:17,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:17,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 387 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:17,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,731 INFO L129 PetriNetUnfolder]: 24/458 cut-off events. [2021-06-10 11:36:17,731 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:17,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 458 events. 24/458 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1872 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 547. Up to 16 conditions per place. [2021-06-10 11:36:17,743 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/388 dead transitions. [2021-06-10 11:36:17,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 388 transitions, 940 flow [2021-06-10 11:36:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:17,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:17,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:17,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,745 INFO L185 Difference]: Start difference. First operand has 418 places, 387 transitions, 914 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:17,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 388 transitions, 940 flow [2021-06-10 11:36:17,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 388 transitions, 939 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,749 INFO L241 Difference]: Finished difference. Result has 421 places, 388 transitions, 931 flow [2021-06-10 11:36:17,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=931, PETRI_PLACES=421, PETRI_TRANSITIONS=388} [2021-06-10 11:36:17,749 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 10 predicate places. [2021-06-10 11:36:17,749 INFO L480 AbstractCegarLoop]: Abstraction has has 421 places, 388 transitions, 931 flow [2021-06-10 11:36:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,750 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2021-06-10 11:36:17,750 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 323971980, now seen corresponding path program 1 times [2021-06-10 11:36:17,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202332971] [2021-06-10 11:36:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:17,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:17,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202332971] [2021-06-10 11:36:17,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999034947] [2021-06-10 11:36:17,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:17,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 388 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:17,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,838 INFO L129 PetriNetUnfolder]: 24/451 cut-off events. [2021-06-10 11:36:17,839 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:17,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 451 events. 24/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1815 event pairs, 0 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 533. Up to 16 conditions per place. [2021-06-10 11:36:17,850 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2021-06-10 11:36:17,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 386 transitions, 933 flow [2021-06-10 11:36:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:17,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:17,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:17,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,852 INFO L185 Difference]: Start difference. First operand has 421 places, 388 transitions, 931 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:17,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 386 transitions, 933 flow [2021-06-10 11:36:17,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 386 transitions, 925 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:17,856 INFO L241 Difference]: Finished difference. Result has 421 places, 386 transitions, 918 flow [2021-06-10 11:36:17,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=421, PETRI_TRANSITIONS=386} [2021-06-10 11:36:17,856 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 10 predicate places. [2021-06-10 11:36:17,856 INFO L480 AbstractCegarLoop]: Abstraction has has 421 places, 386 transitions, 918 flow [2021-06-10 11:36:17,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,856 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,856 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-06-10 11:36:17,856 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash 323970957, now seen corresponding path program 1 times [2021-06-10 11:36:17,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636304468] [2021-06-10 11:36:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:17,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:17,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636304468] [2021-06-10 11:36:17,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963971466] [2021-06-10 11:36:17,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:17,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 386 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:17,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:17,949 INFO L129 PetriNetUnfolder]: 24/449 cut-off events. [2021-06-10 11:36:17,949 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:17,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 449 events. 24/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1798 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 537. Up to 16 conditions per place. [2021-06-10 11:36:17,960 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/384 dead transitions. [2021-06-10 11:36:17,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 384 transitions, 931 flow [2021-06-10 11:36:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:17,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:17,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:17,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:17,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,962 INFO L185 Difference]: Start difference. First operand has 421 places, 386 transitions, 918 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:17,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 384 transitions, 931 flow [2021-06-10 11:36:17,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 384 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:17,965 INFO L241 Difference]: Finished difference. Result has 420 places, 384 transitions, 914 flow [2021-06-10 11:36:17,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=420, PETRI_TRANSITIONS=384} [2021-06-10 11:36:17,966 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 9 predicate places. [2021-06-10 11:36:17,966 INFO L480 AbstractCegarLoop]: Abstraction has has 420 places, 384 transitions, 914 flow [2021-06-10 11:36:17,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:17,966 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:17,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2021-06-10 11:36:17,966 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash -563308506, now seen corresponding path program 1 times [2021-06-10 11:36:17,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:17,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142450672] [2021-06-10 11:36:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:17,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:17,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:17,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:17,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142450672] [2021-06-10 11:36:17,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:17,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:17,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872186916] [2021-06-10 11:36:17,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:17,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:17,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:17,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 384 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:17,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:17,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:17,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,064 INFO L129 PetriNetUnfolder]: 23/457 cut-off events. [2021-06-10 11:36:18,064 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:18,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 457 events. 23/457 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1869 event pairs, 0 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 549. Up to 16 conditions per place. [2021-06-10 11:36:18,076 INFO L132 encePairwiseOnDemand]: 436/441 looper letters, 10 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2021-06-10 11:36:18,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 386 transitions, 944 flow [2021-06-10 11:36:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2021-06-10 11:36:18,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2021-06-10 11:36:18,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 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-06-10 11:36:18,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,078 INFO L185 Difference]: Start difference. First operand has 420 places, 384 transitions, 914 flow. Second operand 3 states and 1209 transitions. [2021-06-10 11:36:18,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 386 transitions, 944 flow [2021-06-10 11:36:18,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 386 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,082 INFO L241 Difference]: Finished difference. Result has 423 places, 386 transitions, 937 flow [2021-06-10 11:36:18,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=423, PETRI_TRANSITIONS=386} [2021-06-10 11:36:18,082 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 12 predicate places. [2021-06-10 11:36:18,082 INFO L480 AbstractCegarLoop]: Abstraction has has 423 places, 386 transitions, 937 flow [2021-06-10 11:36:18,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,082 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2021-06-10 11:36:18,082 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash -563307483, now seen corresponding path program 1 times [2021-06-10 11:36:18,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560775906] [2021-06-10 11:36:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:18,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:18,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560775906] [2021-06-10 11:36:18,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37097450] [2021-06-10 11:36:18,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:18,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 386 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:18,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,173 INFO L129 PetriNetUnfolder]: 22/455 cut-off events. [2021-06-10 11:36:18,173 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:18,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 455 events. 22/455 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1857 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 546. Up to 16 conditions per place. [2021-06-10 11:36:18,184 INFO L132 encePairwiseOnDemand]: 438/441 looper letters, 5 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2021-06-10 11:36:18,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 386 transitions, 949 flow [2021-06-10 11:36:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:18,185 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:18,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,187 INFO L185 Difference]: Start difference. First operand has 423 places, 386 transitions, 937 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:18,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 386 transitions, 949 flow [2021-06-10 11:36:18,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 386 transitions, 944 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,190 INFO L241 Difference]: Finished difference. Result has 426 places, 386 transitions, 942 flow [2021-06-10 11:36:18,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=942, PETRI_PLACES=426, PETRI_TRANSITIONS=386} [2021-06-10 11:36:18,190 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 15 predicate places. [2021-06-10 11:36:18,191 INFO L480 AbstractCegarLoop]: Abstraction has has 426 places, 386 transitions, 942 flow [2021-06-10 11:36:18,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,191 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2021-06-10 11:36:18,191 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -562355194, now seen corresponding path program 1 times [2021-06-10 11:36:18,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780899292] [2021-06-10 11:36:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:18,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:18,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780899292] [2021-06-10 11:36:18,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790461529] [2021-06-10 11:36:18,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:18,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 386 transitions, 942 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:18,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,289 INFO L129 PetriNetUnfolder]: 21/451 cut-off events. [2021-06-10 11:36:18,289 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:18,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 451 events. 21/451 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1834 event pairs, 0 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 543. Up to 16 conditions per place. [2021-06-10 11:36:18,300 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2021-06-10 11:36:18,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 383 transitions, 939 flow [2021-06-10 11:36:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:18,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:18,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,303 INFO L185 Difference]: Start difference. First operand has 426 places, 386 transitions, 942 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:18,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 383 transitions, 939 flow [2021-06-10 11:36:18,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 383 transitions, 932 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:18,326 INFO L241 Difference]: Finished difference. Result has 425 places, 383 transitions, 922 flow [2021-06-10 11:36:18,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=425, PETRI_TRANSITIONS=383} [2021-06-10 11:36:18,326 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 14 predicate places. [2021-06-10 11:36:18,326 INFO L480 AbstractCegarLoop]: Abstraction has has 425 places, 383 transitions, 922 flow [2021-06-10 11:36:18,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,327 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2021-06-10 11:36:18,327 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash -562354171, now seen corresponding path program 1 times [2021-06-10 11:36:18,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454547875] [2021-06-10 11:36:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:18,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:18,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454547875] [2021-06-10 11:36:18,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111479153] [2021-06-10 11:36:18,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:18,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 383 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:18,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,418 INFO L129 PetriNetUnfolder]: 21/449 cut-off events. [2021-06-10 11:36:18,419 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:18,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 449 events. 21/449 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1816 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 544. Up to 16 conditions per place. [2021-06-10 11:36:18,429 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2021-06-10 11:36:18,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 381 transitions, 935 flow [2021-06-10 11:36:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:18,433 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:18,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,435 INFO L185 Difference]: Start difference. First operand has 425 places, 383 transitions, 922 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:18,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 381 transitions, 935 flow [2021-06-10 11:36:18,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 381 transitions, 934 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,438 INFO L241 Difference]: Finished difference. Result has 424 places, 381 transitions, 918 flow [2021-06-10 11:36:18,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=424, PETRI_TRANSITIONS=381} [2021-06-10 11:36:18,438 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 13 predicate places. [2021-06-10 11:36:18,438 INFO L480 AbstractCegarLoop]: Abstraction has has 424 places, 381 transitions, 918 flow [2021-06-10 11:36:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,439 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-06-10 11:36:18,439 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash -892182497, now seen corresponding path program 1 times [2021-06-10 11:36:18,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76111395] [2021-06-10 11:36:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:18,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:18,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76111395] [2021-06-10 11:36:18,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335633580] [2021-06-10 11:36:18,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,452 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:18,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 381 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:18,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,553 INFO L129 PetriNetUnfolder]: 20/457 cut-off events. [2021-06-10 11:36:18,553 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:18,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 457 events. 20/457 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1888 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 556. Up to 16 conditions per place. [2021-06-10 11:36:18,564 INFO L132 encePairwiseOnDemand]: 436/441 looper letters, 10 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2021-06-10 11:36:18,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 383 transitions, 948 flow [2021-06-10 11:36:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2021-06-10 11:36:18,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138321995464853 [2021-06-10 11:36:18,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2021-06-10 11:36:18,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 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-06-10 11:36:18,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,567 INFO L185 Difference]: Start difference. First operand has 424 places, 381 transitions, 918 flow. Second operand 3 states and 1209 transitions. [2021-06-10 11:36:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 383 transitions, 948 flow [2021-06-10 11:36:18,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 383 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,570 INFO L241 Difference]: Finished difference. Result has 427 places, 383 transitions, 941 flow [2021-06-10 11:36:18,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=427, PETRI_TRANSITIONS=383} [2021-06-10 11:36:18,571 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 16 predicate places. [2021-06-10 11:36:18,571 INFO L480 AbstractCegarLoop]: Abstraction has has 427 places, 383 transitions, 941 flow [2021-06-10 11:36:18,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,571 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2021-06-10 11:36:18,571 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash -892183520, now seen corresponding path program 1 times [2021-06-10 11:36:18,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257181660] [2021-06-10 11:36:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:18,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:18,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257181660] [2021-06-10 11:36:18,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209611877] [2021-06-10 11:36:18,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:18,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 383 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:18,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,666 INFO L129 PetriNetUnfolder]: 18/458 cut-off events. [2021-06-10 11:36:18,666 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:18,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 458 events. 18/458 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1909 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 556. Up to 16 conditions per place. [2021-06-10 11:36:18,677 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2021-06-10 11:36:18,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 383 transitions, 953 flow [2021-06-10 11:36:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:18,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:18,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:18,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,680 INFO L185 Difference]: Start difference. First operand has 427 places, 383 transitions, 941 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 383 transitions, 953 flow [2021-06-10 11:36:18,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 383 transitions, 948 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,683 INFO L241 Difference]: Finished difference. Result has 429 places, 382 transitions, 937 flow [2021-06-10 11:36:18,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=429, PETRI_TRANSITIONS=382} [2021-06-10 11:36:18,683 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 18 predicate places. [2021-06-10 11:36:18,683 INFO L480 AbstractCegarLoop]: Abstraction has has 429 places, 382 transitions, 937 flow [2021-06-10 11:36:18,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,684 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2021-06-10 11:36:18,684 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash -893135809, now seen corresponding path program 1 times [2021-06-10 11:36:18,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361016836] [2021-06-10 11:36:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:18,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:18,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361016836] [2021-06-10 11:36:18,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722984909] [2021-06-10 11:36:18,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:18,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 382 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:18,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,778 INFO L129 PetriNetUnfolder]: 18/451 cut-off events. [2021-06-10 11:36:18,779 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:18,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 451 events. 18/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1851 event pairs, 0 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 550. Up to 16 conditions per place. [2021-06-10 11:36:18,789 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2021-06-10 11:36:18,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 380 transitions, 940 flow [2021-06-10 11:36:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:18,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:18,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:18,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,792 INFO L185 Difference]: Start difference. First operand has 429 places, 382 transitions, 937 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:18,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 380 transitions, 940 flow [2021-06-10 11:36:18,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 380 transitions, 933 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:18,795 INFO L241 Difference]: Finished difference. Result has 429 places, 380 transitions, 926 flow [2021-06-10 11:36:18,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=429, PETRI_TRANSITIONS=380} [2021-06-10 11:36:18,796 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 18 predicate places. [2021-06-10 11:36:18,796 INFO L480 AbstractCegarLoop]: Abstraction has has 429 places, 380 transitions, 926 flow [2021-06-10 11:36:18,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,796 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-06-10 11:36:18,796 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash -893136832, now seen corresponding path program 1 times [2021-06-10 11:36:18,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290700381] [2021-06-10 11:36:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:18,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:18,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290700381] [2021-06-10 11:36:18,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222936993] [2021-06-10 11:36:18,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:18,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 380 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:18,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:18,888 INFO L129 PetriNetUnfolder]: 18/449 cut-off events. [2021-06-10 11:36:18,888 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:18,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 449 events. 18/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1835 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 550. Up to 16 conditions per place. [2021-06-10 11:36:18,898 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2021-06-10 11:36:18,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 378 transitions, 939 flow [2021-06-10 11:36:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:18,899 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:18,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:18,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:18,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,901 INFO L185 Difference]: Start difference. First operand has 429 places, 380 transitions, 926 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 378 transitions, 939 flow [2021-06-10 11:36:18,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 378 transitions, 938 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:18,904 INFO L241 Difference]: Finished difference. Result has 428 places, 378 transitions, 922 flow [2021-06-10 11:36:18,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=428, PETRI_TRANSITIONS=378} [2021-06-10 11:36:18,905 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 17 predicate places. [2021-06-10 11:36:18,905 INFO L480 AbstractCegarLoop]: Abstraction has has 428 places, 378 transitions, 922 flow [2021-06-10 11:36:18,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:18,905 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:18,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-06-10 11:36:18,905 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -945103045, now seen corresponding path program 1 times [2021-06-10 11:36:18,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:18,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727369933] [2021-06-10 11:36:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:18,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:18,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:18,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:18,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727369933] [2021-06-10 11:36:18,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:18,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:18,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133264722] [2021-06-10 11:36:18,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:18,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:18,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:18,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:18,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 378 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:18,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:18,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:18,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,001 INFO L129 PetriNetUnfolder]: 17/456 cut-off events. [2021-06-10 11:36:19,001 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:19,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 456 events. 17/456 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1896 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 555. Up to 16 conditions per place. [2021-06-10 11:36:19,012 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2021-06-10 11:36:19,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 379 transitions, 938 flow [2021-06-10 11:36:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:19,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:19,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,015 INFO L185 Difference]: Start difference. First operand has 428 places, 378 transitions, 922 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:19,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 379 transitions, 938 flow [2021-06-10 11:36:19,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 379 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,018 INFO L241 Difference]: Finished difference. Result has 430 places, 378 transitions, 926 flow [2021-06-10 11:36:19,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=430, PETRI_TRANSITIONS=378} [2021-06-10 11:36:19,018 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 19 predicate places. [2021-06-10 11:36:19,018 INFO L480 AbstractCegarLoop]: Abstraction has has 430 places, 378 transitions, 926 flow [2021-06-10 11:36:19,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,019 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-06-10 11:36:19,019 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash -945102022, now seen corresponding path program 1 times [2021-06-10 11:36:19,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682825600] [2021-06-10 11:36:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:19,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:19,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682825600] [2021-06-10 11:36:19,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852505965] [2021-06-10 11:36:19,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:19,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 378 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:19,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,119 INFO L129 PetriNetUnfolder]: 15/458 cut-off events. [2021-06-10 11:36:19,119 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:19,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 458 events. 15/458 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1928 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 566. Up to 16 conditions per place. [2021-06-10 11:36:19,130 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2021-06-10 11:36:19,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 379 transitions, 952 flow [2021-06-10 11:36:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:19,131 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:19,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,133 INFO L185 Difference]: Start difference. First operand has 430 places, 378 transitions, 926 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:19,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 379 transitions, 952 flow [2021-06-10 11:36:19,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 379 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,136 INFO L241 Difference]: Finished difference. Result has 433 places, 379 transitions, 943 flow [2021-06-10 11:36:19,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=433, PETRI_TRANSITIONS=379} [2021-06-10 11:36:19,136 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 22 predicate places. [2021-06-10 11:36:19,136 INFO L480 AbstractCegarLoop]: Abstraction has has 433 places, 379 transitions, 943 flow [2021-06-10 11:36:19,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,136 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,137 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-06-10 11:36:19,137 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash -946055334, now seen corresponding path program 1 times [2021-06-10 11:36:19,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922299220] [2021-06-10 11:36:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:19,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:19,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922299220] [2021-06-10 11:36:19,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395190395] [2021-06-10 11:36:19,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:19,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 379 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:19,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,229 INFO L129 PetriNetUnfolder]: 15/451 cut-off events. [2021-06-10 11:36:19,230 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:19,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 451 events. 15/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1871 event pairs, 0 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 552. Up to 16 conditions per place. [2021-06-10 11:36:19,240 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2021-06-10 11:36:19,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 377 transitions, 945 flow [2021-06-10 11:36:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:19,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:19,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,243 INFO L185 Difference]: Start difference. First operand has 433 places, 379 transitions, 943 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:19,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 377 transitions, 945 flow [2021-06-10 11:36:19,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 377 transitions, 937 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:19,246 INFO L241 Difference]: Finished difference. Result has 433 places, 377 transitions, 930 flow [2021-06-10 11:36:19,246 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=433, PETRI_TRANSITIONS=377} [2021-06-10 11:36:19,246 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 22 predicate places. [2021-06-10 11:36:19,246 INFO L480 AbstractCegarLoop]: Abstraction has has 433 places, 377 transitions, 930 flow [2021-06-10 11:36:19,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,247 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2021-06-10 11:36:19,247 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash -946056357, now seen corresponding path program 1 times [2021-06-10 11:36:19,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17349319] [2021-06-10 11:36:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:19,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:19,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17349319] [2021-06-10 11:36:19,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256514033] [2021-06-10 11:36:19,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:19,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 377 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:19,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,341 INFO L129 PetriNetUnfolder]: 15/449 cut-off events. [2021-06-10 11:36:19,342 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:19,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 449 events. 15/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1856 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 556. Up to 16 conditions per place. [2021-06-10 11:36:19,352 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2021-06-10 11:36:19,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 375 transitions, 943 flow [2021-06-10 11:36:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:19,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:19,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,354 INFO L185 Difference]: Start difference. First operand has 433 places, 377 transitions, 930 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 375 transitions, 943 flow [2021-06-10 11:36:19,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 375 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,358 INFO L241 Difference]: Finished difference. Result has 432 places, 375 transitions, 926 flow [2021-06-10 11:36:19,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=432, PETRI_TRANSITIONS=375} [2021-06-10 11:36:19,358 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 21 predicate places. [2021-06-10 11:36:19,358 INFO L480 AbstractCegarLoop]: Abstraction has has 432 places, 375 transitions, 926 flow [2021-06-10 11:36:19,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,358 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-06-10 11:36:19,358 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1543705303, now seen corresponding path program 1 times [2021-06-10 11:36:19,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326411299] [2021-06-10 11:36:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:19,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:19,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326411299] [2021-06-10 11:36:19,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333698324] [2021-06-10 11:36:19,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:19,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 375 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:19,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,459 INFO L129 PetriNetUnfolder]: 14/456 cut-off events. [2021-06-10 11:36:19,459 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-06-10 11:36:19,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 456 events. 14/456 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1911 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 561. Up to 16 conditions per place. [2021-06-10 11:36:19,495 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 6 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2021-06-10 11:36:19,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 376 transitions, 942 flow [2021-06-10 11:36:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2021-06-10 11:36:19,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198790627362056 [2021-06-10 11:36:19,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2021-06-10 11:36:19,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,498 INFO L185 Difference]: Start difference. First operand has 432 places, 375 transitions, 926 flow. Second operand 3 states and 1217 transitions. [2021-06-10 11:36:19,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 376 transitions, 942 flow [2021-06-10 11:36:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 376 transitions, 941 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,501 INFO L241 Difference]: Finished difference. Result has 434 places, 375 transitions, 930 flow [2021-06-10 11:36:19,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=434, PETRI_TRANSITIONS=375} [2021-06-10 11:36:19,502 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 23 predicate places. [2021-06-10 11:36:19,502 INFO L480 AbstractCegarLoop]: Abstraction has has 434 places, 375 transitions, 930 flow [2021-06-10 11:36:19,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,502 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-06-10 11:36:19,502 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1543706326, now seen corresponding path program 1 times [2021-06-10 11:36:19,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931884311] [2021-06-10 11:36:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:19,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:19,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931884311] [2021-06-10 11:36:19,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504645239] [2021-06-10 11:36:19,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:19,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 375 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:19,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,634 INFO L129 PetriNetUnfolder]: 12/458 cut-off events. [2021-06-10 11:36:19,634 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:19,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 458 events. 12/458 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1945 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 572. Up to 16 conditions per place. [2021-06-10 11:36:19,646 INFO L132 encePairwiseOnDemand]: 437/441 looper letters, 9 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2021-06-10 11:36:19,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 376 transitions, 956 flow [2021-06-10 11:36:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2021-06-10 11:36:19,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9123204837490552 [2021-06-10 11:36:19,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2021-06-10 11:36:19,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,649 INFO L185 Difference]: Start difference. First operand has 434 places, 375 transitions, 930 flow. Second operand 3 states and 1207 transitions. [2021-06-10 11:36:19,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 376 transitions, 956 flow [2021-06-10 11:36:19,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 376 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,653 INFO L241 Difference]: Finished difference. Result has 437 places, 376 transitions, 947 flow [2021-06-10 11:36:19,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=947, PETRI_PLACES=437, PETRI_TRANSITIONS=376} [2021-06-10 11:36:19,653 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 26 predicate places. [2021-06-10 11:36:19,653 INFO L480 AbstractCegarLoop]: Abstraction has has 437 places, 376 transitions, 947 flow [2021-06-10 11:36:19,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,654 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-06-10 11:36:19,654 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1542753014, now seen corresponding path program 1 times [2021-06-10 11:36:19,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067032356] [2021-06-10 11:36:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:19,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:19,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067032356] [2021-06-10 11:36:19,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919745179] [2021-06-10 11:36:19,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 441 [2021-06-10 11:36:19,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 376 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 441 [2021-06-10 11:36:19,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,775 INFO L129 PetriNetUnfolder]: 12/451 cut-off events. [2021-06-10 11:36:19,775 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:19,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 451 events. 12/451 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1886 event pairs, 0 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 558. Up to 16 conditions per place. [2021-06-10 11:36:19,787 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 5 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2021-06-10 11:36:19,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 374 transitions, 949 flow [2021-06-10 11:36:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2021-06-10 11:36:19,788 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191232048374905 [2021-06-10 11:36:19,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2021-06-10 11:36:19,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,790 INFO L185 Difference]: Start difference. First operand has 437 places, 376 transitions, 947 flow. Second operand 3 states and 1216 transitions. [2021-06-10 11:36:19,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 374 transitions, 949 flow [2021-06-10 11:36:19,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 374 transitions, 941 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:19,794 INFO L241 Difference]: Finished difference. Result has 437 places, 374 transitions, 934 flow [2021-06-10 11:36:19,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=437, PETRI_TRANSITIONS=374} [2021-06-10 11:36:19,794 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 26 predicate places. [2021-06-10 11:36:19,794 INFO L480 AbstractCegarLoop]: Abstraction has has 437 places, 374 transitions, 934 flow [2021-06-10 11:36:19,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,794 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:19,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-06-10 11:36:19,795 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1542751991, now seen corresponding path program 1 times [2021-06-10 11:36:19,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697427776] [2021-06-10 11:36:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:19,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:19,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:19,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:19,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697427776] [2021-06-10 11:36:19,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:19,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:19,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402277823] [2021-06-10 11:36:19,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:19,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:19,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 441 [2021-06-10 11:36:19,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 374 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:19,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 441 [2021-06-10 11:36:19,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:19,914 INFO L129 PetriNetUnfolder]: 12/449 cut-off events. [2021-06-10 11:36:19,914 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:19,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 449 events. 12/449 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1870 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 562. Up to 16 conditions per place. [2021-06-10 11:36:19,925 INFO L132 encePairwiseOnDemand]: 439/441 looper letters, 8 selfloop transitions, 1 changer transitions 0/372 dead transitions. [2021-06-10 11:36:19,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 372 transitions, 947 flow [2021-06-10 11:36:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2021-06-10 11:36:19,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-06-10 11:36:19,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:19,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2021-06-10 11:36:19,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,928 INFO L185 Difference]: Start difference. First operand has 437 places, 374 transitions, 934 flow. Second operand 3 states and 1204 transitions. [2021-06-10 11:36:19,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 372 transitions, 947 flow [2021-06-10 11:36:19,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 372 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:19,932 INFO L241 Difference]: Finished difference. Result has 436 places, 372 transitions, 930 flow [2021-06-10 11:36:19,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=436, PETRI_TRANSITIONS=372} [2021-06-10 11:36:19,932 INFO L343 CegarLoopForPetriNet]: 411 programPoint places, 25 predicate places. [2021-06-10 11:36:19,932 INFO L480 AbstractCegarLoop]: Abstraction has has 436 places, 372 transitions, 930 flow [2021-06-10 11:36:19,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:19,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:19,932 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 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-06-10 11:36:19,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2021-06-10 11:36:19,932 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1504967094, now seen corresponding path program 1 times [2021-06-10 11:36:19,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:19,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233952357] [2021-06-10 11:36:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:19,941 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:19,945 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:19,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:19,953 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:19,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2021-06-10 11:36:19,953 WARN L342 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:19,953 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2021-06-10 11:36:19,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:19,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of16ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of16ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:20,043 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:20,043 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-06-10 11:36:20,043 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:20,043 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:20,043 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:20,043 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:20,043 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:20,043 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:20,043 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:20,043 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:20,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 437 places, 469 transitions, 1258 flow [2021-06-10 11:36:20,139 INFO L129 PetriNetUnfolder]: 81/612 cut-off events. [2021-06-10 11:36:20,139 INFO L130 PetriNetUnfolder]: For 800/800 co-relation queries the response was YES. [2021-06-10 11:36:20,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 612 events. 81/612 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2489 event pairs, 0 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 731. Up to 34 conditions per place. [2021-06-10 11:36:20,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 469 transitions, 1258 flow [2021-06-10 11:36:20,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 437 places, 469 transitions, 1258 flow [2021-06-10 11:36:20,166 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2021-06-10 11:36:20,166 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:20,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,166 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-06-10 11:36:20,166 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1939647206, now seen corresponding path program 1 times [2021-06-10 11:36:20,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651057529] [2021-06-10 11:36:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:20,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:20,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651057529] [2021-06-10 11:36:20,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198105124] [2021-06-10 11:36:20,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:20,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 469 transitions, 1258 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:20,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,268 INFO L129 PetriNetUnfolder]: 47/486 cut-off events. [2021-06-10 11:36:20,268 INFO L130 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2021-06-10 11:36:20,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 486 events. 47/486 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1850 event pairs, 0 based on Foata normal form. 72/493 useless extension candidates. Maximal degree in co-relation 618. Up to 17 conditions per place. [2021-06-10 11:36:20,284 INFO L132 encePairwiseOnDemand]: 446/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/433 dead transitions. [2021-06-10 11:36:20,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 433 transitions, 1212 flow [2021-06-10 11:36:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1323 transitions. [2021-06-10 11:36:20,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2021-06-10 11:36:20,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1323 transitions. [2021-06-10 11:36:20,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1323 transitions. [2021-06-10 11:36:20,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1323 transitions. [2021-06-10 11:36:20,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 441.0) internal successors, (1323), 3 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,287 INFO L185 Difference]: Start difference. First operand has 437 places, 469 transitions, 1258 flow. Second operand 3 states and 1323 transitions. [2021-06-10 11:36:20,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 433 transitions, 1212 flow [2021-06-10 11:36:20,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 433 transitions, 972 flow, removed 120 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:20,291 INFO L241 Difference]: Finished difference. Result has 420 places, 433 transitions, 966 flow [2021-06-10 11:36:20,292 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=966, PETRI_PLACES=420, PETRI_TRANSITIONS=433} [2021-06-10 11:36:20,292 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -17 predicate places. [2021-06-10 11:36:20,292 INFO L480 AbstractCegarLoop]: Abstraction has has 420 places, 433 transitions, 966 flow [2021-06-10 11:36:20,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,292 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,292 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-06-10 11:36:20,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-06-10 11:36:20,292 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1938693894, now seen corresponding path program 1 times [2021-06-10 11:36:20,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008401591] [2021-06-10 11:36:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:20,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:20,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008401591] [2021-06-10 11:36:20,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851713445] [2021-06-10 11:36:20,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:20,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 433 transitions, 966 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:20,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,381 INFO L129 PetriNetUnfolder]: 46/482 cut-off events. [2021-06-10 11:36:20,381 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:20,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 482 events. 46/482 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1828 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 524. Up to 17 conditions per place. [2021-06-10 11:36:20,395 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2021-06-10 11:36:20,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 432 transitions, 972 flow [2021-06-10 11:36:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:20,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:20,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,398 INFO L185 Difference]: Start difference. First operand has 420 places, 433 transitions, 966 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:20,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 432 transitions, 972 flow [2021-06-10 11:36:20,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 432 transitions, 968 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:20,402 INFO L241 Difference]: Finished difference. Result has 423 places, 432 transitions, 966 flow [2021-06-10 11:36:20,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=966, PETRI_PLACES=423, PETRI_TRANSITIONS=432} [2021-06-10 11:36:20,402 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -14 predicate places. [2021-06-10 11:36:20,402 INFO L480 AbstractCegarLoop]: Abstraction has has 423 places, 432 transitions, 966 flow [2021-06-10 11:36:20,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,402 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-06-10 11:36:20,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2021-06-10 11:36:20,403 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1938692871, now seen corresponding path program 1 times [2021-06-10 11:36:20,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384464139] [2021-06-10 11:36:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:20,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:20,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384464139] [2021-06-10 11:36:20,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52497420] [2021-06-10 11:36:20,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:20,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 432 transitions, 966 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:20,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,495 INFO L129 PetriNetUnfolder]: 45/481 cut-off events. [2021-06-10 11:36:20,495 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:20,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 481 events. 45/481 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1823 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 531. Up to 17 conditions per place. [2021-06-10 11:36:20,509 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 9 selfloop transitions, 1 changer transitions 0/431 dead transitions. [2021-06-10 11:36:20,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 431 transitions, 981 flow [2021-06-10 11:36:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2021-06-10 11:36:20,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9118692253020612 [2021-06-10 11:36:20,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2021-06-10 11:36:20,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2021-06-10 11:36:20,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2021-06-10 11:36:20,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,511 INFO L185 Difference]: Start difference. First operand has 423 places, 432 transitions, 966 flow. Second operand 3 states and 1283 transitions. [2021-06-10 11:36:20,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 431 transitions, 981 flow [2021-06-10 11:36:20,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 431 transitions, 979 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:20,515 INFO L241 Difference]: Finished difference. Result has 424 places, 431 transitions, 961 flow [2021-06-10 11:36:20,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=424, PETRI_TRANSITIONS=431} [2021-06-10 11:36:20,515 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -13 predicate places. [2021-06-10 11:36:20,516 INFO L480 AbstractCegarLoop]: Abstraction has has 424 places, 431 transitions, 961 flow [2021-06-10 11:36:20,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,516 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,516 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-06-10 11:36:20,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2021-06-10 11:36:20,516 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1939646183, now seen corresponding path program 1 times [2021-06-10 11:36:20,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188673658] [2021-06-10 11:36:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:20,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:20,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188673658] [2021-06-10 11:36:20,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213681035] [2021-06-10 11:36:20,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:20,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 431 transitions, 961 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:20,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,607 INFO L129 PetriNetUnfolder]: 45/478 cut-off events. [2021-06-10 11:36:20,607 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:20,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 478 events. 45/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1807 event pairs, 0 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 526. Up to 17 conditions per place. [2021-06-10 11:36:20,621 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2021-06-10 11:36:20,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 428 transitions, 962 flow [2021-06-10 11:36:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:20,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:20,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,624 INFO L185 Difference]: Start difference. First operand has 424 places, 431 transitions, 961 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:20,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 428 transitions, 962 flow [2021-06-10 11:36:20,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 428 transitions, 958 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:36:20,628 INFO L241 Difference]: Finished difference. Result has 422 places, 428 transitions, 948 flow [2021-06-10 11:36:20,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=422, PETRI_TRANSITIONS=428} [2021-06-10 11:36:20,628 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -15 predicate places. [2021-06-10 11:36:20,628 INFO L480 AbstractCegarLoop]: Abstraction has has 422 places, 428 transitions, 948 flow [2021-06-10 11:36:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,628 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:20,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2021-06-10 11:36:20,628 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -927145228, now seen corresponding path program 1 times [2021-06-10 11:36:20,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110779508] [2021-06-10 11:36:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:20,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:20,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110779508] [2021-06-10 11:36:20,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864186271] [2021-06-10 11:36:20,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,640 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:20,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 428 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:20,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,717 INFO L129 PetriNetUnfolder]: 43/483 cut-off events. [2021-06-10 11:36:20,718 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:20,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 483 events. 43/483 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1856 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 538. Up to 17 conditions per place. [2021-06-10 11:36:20,731 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2021-06-10 11:36:20,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 429 transitions, 964 flow [2021-06-10 11:36:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:20,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:20,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:20,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,734 INFO L185 Difference]: Start difference. First operand has 422 places, 428 transitions, 948 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:20,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 429 transitions, 964 flow [2021-06-10 11:36:20,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 429 transitions, 963 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:20,738 INFO L241 Difference]: Finished difference. Result has 425 places, 429 transitions, 961 flow [2021-06-10 11:36:20,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=425, PETRI_TRANSITIONS=429} [2021-06-10 11:36:20,738 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -12 predicate places. [2021-06-10 11:36:20,738 INFO L480 AbstractCegarLoop]: Abstraction has has 425 places, 429 transitions, 961 flow [2021-06-10 11:36:20,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,738 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,738 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:20,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2021-06-10 11:36:20,739 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash -927146251, now seen corresponding path program 1 times [2021-06-10 11:36:20,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945801225] [2021-06-10 11:36:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:20,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:20,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945801225] [2021-06-10 11:36:20,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987714693] [2021-06-10 11:36:20,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:20,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 429 transitions, 961 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:20,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,833 INFO L129 PetriNetUnfolder]: 43/484 cut-off events. [2021-06-10 11:36:20,834 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:20,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 484 events. 43/484 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1866 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 543. Up to 17 conditions per place. [2021-06-10 11:36:20,848 INFO L132 encePairwiseOnDemand]: 465/469 looper letters, 9 selfloop transitions, 3 changer transitions 0/430 dead transitions. [2021-06-10 11:36:20,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 430 transitions, 987 flow [2021-06-10 11:36:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2021-06-10 11:36:20,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9132906894100924 [2021-06-10 11:36:20,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2021-06-10 11:36:20,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2021-06-10 11:36:20,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2021-06-10 11:36:20,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,851 INFO L185 Difference]: Start difference. First operand has 425 places, 429 transitions, 961 flow. Second operand 3 states and 1285 transitions. [2021-06-10 11:36:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 430 transitions, 987 flow [2021-06-10 11:36:20,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 430 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:20,855 INFO L241 Difference]: Finished difference. Result has 428 places, 430 transitions, 977 flow [2021-06-10 11:36:20,855 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=428, PETRI_TRANSITIONS=430} [2021-06-10 11:36:20,855 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -9 predicate places. [2021-06-10 11:36:20,855 INFO L480 AbstractCegarLoop]: Abstraction has has 428 places, 430 transitions, 977 flow [2021-06-10 11:36:20,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,855 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:20,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2021-06-10 11:36:20,855 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash -926192939, now seen corresponding path program 1 times [2021-06-10 11:36:20,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615543231] [2021-06-10 11:36:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:20,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:20,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615543231] [2021-06-10 11:36:20,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727048602] [2021-06-10 11:36:20,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,867 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:20,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 430 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:20,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:20,945 INFO L129 PetriNetUnfolder]: 42/480 cut-off events. [2021-06-10 11:36:20,945 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:20,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 480 events. 42/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1837 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 536. Up to 17 conditions per place. [2021-06-10 11:36:20,959 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/427 dead transitions. [2021-06-10 11:36:20,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 427 transitions, 974 flow [2021-06-10 11:36:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:20,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:20,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:20,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:20,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,962 INFO L185 Difference]: Start difference. First operand has 428 places, 430 transitions, 977 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:20,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 427 transitions, 974 flow [2021-06-10 11:36:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 427 transitions, 966 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:20,966 INFO L241 Difference]: Finished difference. Result has 427 places, 427 transitions, 956 flow [2021-06-10 11:36:20,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=427, PETRI_TRANSITIONS=427} [2021-06-10 11:36:20,966 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -10 predicate places. [2021-06-10 11:36:20,966 INFO L480 AbstractCegarLoop]: Abstraction has has 427 places, 427 transitions, 956 flow [2021-06-10 11:36:20,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:20,966 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:20,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2021-06-10 11:36:20,966 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -926191916, now seen corresponding path program 1 times [2021-06-10 11:36:20,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:20,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013258796] [2021-06-10 11:36:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:20,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:20,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:20,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:20,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013258796] [2021-06-10 11:36:20,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:20,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:20,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571316739] [2021-06-10 11:36:20,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:20,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:20,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:20,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 427 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:20,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:20,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:20,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,069 INFO L129 PetriNetUnfolder]: 42/478 cut-off events. [2021-06-10 11:36:21,069 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:21,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 478 events. 42/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1820 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 540. Up to 17 conditions per place. [2021-06-10 11:36:21,082 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2021-06-10 11:36:21,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 425 transitions, 969 flow [2021-06-10 11:36:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:21,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:21,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,085 INFO L185 Difference]: Start difference. First operand has 427 places, 427 transitions, 956 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 425 transitions, 969 flow [2021-06-10 11:36:21,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 425 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,088 INFO L241 Difference]: Finished difference. Result has 426 places, 425 transitions, 952 flow [2021-06-10 11:36:21,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=426, PETRI_TRANSITIONS=425} [2021-06-10 11:36:21,088 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -11 predicate places. [2021-06-10 11:36:21,089 INFO L480 AbstractCegarLoop]: Abstraction has has 426 places, 425 transitions, 952 flow [2021-06-10 11:36:21,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,089 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,089 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2021-06-10 11:36:21,089 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash -104066844, now seen corresponding path program 1 times [2021-06-10 11:36:21,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222664367] [2021-06-10 11:36:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:21,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:21,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222664367] [2021-06-10 11:36:21,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459485600] [2021-06-10 11:36:21,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:21,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 425 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:21,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,187 INFO L129 PetriNetUnfolder]: 41/486 cut-off events. [2021-06-10 11:36:21,188 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:21,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 486 events. 41/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1895 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 552. Up to 17 conditions per place. [2021-06-10 11:36:21,202 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/427 dead transitions. [2021-06-10 11:36:21,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 427 transitions, 982 flow [2021-06-10 11:36:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:21,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:21,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,205 INFO L185 Difference]: Start difference. First operand has 426 places, 425 transitions, 952 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:21,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 427 transitions, 982 flow [2021-06-10 11:36:21,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 427 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,208 INFO L241 Difference]: Finished difference. Result has 429 places, 427 transitions, 975 flow [2021-06-10 11:36:21,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=429, PETRI_TRANSITIONS=427} [2021-06-10 11:36:21,209 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -8 predicate places. [2021-06-10 11:36:21,209 INFO L480 AbstractCegarLoop]: Abstraction has has 429 places, 427 transitions, 975 flow [2021-06-10 11:36:21,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,209 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2021-06-10 11:36:21,209 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash -104065821, now seen corresponding path program 1 times [2021-06-10 11:36:21,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451218672] [2021-06-10 11:36:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:21,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:21,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451218672] [2021-06-10 11:36:21,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621297431] [2021-06-10 11:36:21,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:21,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 427 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:21,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,302 INFO L129 PetriNetUnfolder]: 40/484 cut-off events. [2021-06-10 11:36:21,302 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:21,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 484 events. 40/484 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1882 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 548. Up to 17 conditions per place. [2021-06-10 11:36:21,316 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2021-06-10 11:36:21,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 427 transitions, 987 flow [2021-06-10 11:36:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:21,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:21,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,319 INFO L185 Difference]: Start difference. First operand has 429 places, 427 transitions, 975 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 427 transitions, 987 flow [2021-06-10 11:36:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 982 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,323 INFO L241 Difference]: Finished difference. Result has 432 places, 427 transitions, 980 flow [2021-06-10 11:36:21,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=432, PETRI_TRANSITIONS=427} [2021-06-10 11:36:21,323 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -5 predicate places. [2021-06-10 11:36:21,323 INFO L480 AbstractCegarLoop]: Abstraction has has 432 places, 427 transitions, 980 flow [2021-06-10 11:36:21,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,323 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2021-06-10 11:36:21,323 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash -103113532, now seen corresponding path program 1 times [2021-06-10 11:36:21,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697411856] [2021-06-10 11:36:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:21,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:21,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697411856] [2021-06-10 11:36:21,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310235759] [2021-06-10 11:36:21,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,335 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:21,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 427 transitions, 980 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:21,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,414 INFO L129 PetriNetUnfolder]: 39/480 cut-off events. [2021-06-10 11:36:21,414 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:21,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 480 events. 39/480 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1856 event pairs, 0 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 546. Up to 17 conditions per place. [2021-06-10 11:36:21,428 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/424 dead transitions. [2021-06-10 11:36:21,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 424 transitions, 977 flow [2021-06-10 11:36:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:21,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:21,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,430 INFO L185 Difference]: Start difference. First operand has 432 places, 427 transitions, 980 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:21,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 424 transitions, 977 flow [2021-06-10 11:36:21,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 970 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:21,434 INFO L241 Difference]: Finished difference. Result has 431 places, 424 transitions, 960 flow [2021-06-10 11:36:21,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=431, PETRI_TRANSITIONS=424} [2021-06-10 11:36:21,434 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -6 predicate places. [2021-06-10 11:36:21,435 INFO L480 AbstractCegarLoop]: Abstraction has has 431 places, 424 transitions, 960 flow [2021-06-10 11:36:21,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,435 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,435 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2021-06-10 11:36:21,435 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash -103112509, now seen corresponding path program 1 times [2021-06-10 11:36:21,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362067719] [2021-06-10 11:36:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:21,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:21,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362067719] [2021-06-10 11:36:21,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537924252] [2021-06-10 11:36:21,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:21,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 424 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:21,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,526 INFO L129 PetriNetUnfolder]: 39/478 cut-off events. [2021-06-10 11:36:21,527 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:21,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 478 events. 39/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1842 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 547. Up to 17 conditions per place. [2021-06-10 11:36:21,540 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/422 dead transitions. [2021-06-10 11:36:21,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 422 transitions, 973 flow [2021-06-10 11:36:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:21,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:21,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:21,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,543 INFO L185 Difference]: Start difference. First operand has 431 places, 424 transitions, 960 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:21,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 422 transitions, 973 flow [2021-06-10 11:36:21,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 422 transitions, 972 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,547 INFO L241 Difference]: Finished difference. Result has 430 places, 422 transitions, 956 flow [2021-06-10 11:36:21,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=956, PETRI_PLACES=430, PETRI_TRANSITIONS=422} [2021-06-10 11:36:21,547 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -7 predicate places. [2021-06-10 11:36:21,547 INFO L480 AbstractCegarLoop]: Abstraction has has 430 places, 422 transitions, 956 flow [2021-06-10 11:36:21,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,547 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2021-06-10 11:36:21,547 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash 61009492, now seen corresponding path program 1 times [2021-06-10 11:36:21,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728767081] [2021-06-10 11:36:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:21,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:21,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728767081] [2021-06-10 11:36:21,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959129187] [2021-06-10 11:36:21,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:21,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 422 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:21,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,649 INFO L129 PetriNetUnfolder]: 38/486 cut-off events. [2021-06-10 11:36:21,649 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:21,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 486 events. 38/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1909 event pairs, 0 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 559. Up to 17 conditions per place. [2021-06-10 11:36:21,665 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/424 dead transitions. [2021-06-10 11:36:21,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 424 transitions, 986 flow [2021-06-10 11:36:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:21,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:21,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:21,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,671 INFO L185 Difference]: Start difference. First operand has 430 places, 422 transitions, 956 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:21,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 424 transitions, 986 flow [2021-06-10 11:36:21,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,675 INFO L241 Difference]: Finished difference. Result has 433 places, 424 transitions, 979 flow [2021-06-10 11:36:21,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=979, PETRI_PLACES=433, PETRI_TRANSITIONS=424} [2021-06-10 11:36:21,675 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -4 predicate places. [2021-06-10 11:36:21,675 INFO L480 AbstractCegarLoop]: Abstraction has has 433 places, 424 transitions, 979 flow [2021-06-10 11:36:21,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,676 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2021-06-10 11:36:21,676 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 61010515, now seen corresponding path program 1 times [2021-06-10 11:36:21,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976980884] [2021-06-10 11:36:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:21,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:21,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976980884] [2021-06-10 11:36:21,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128428320] [2021-06-10 11:36:21,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,746 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:21,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 424 transitions, 979 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:21,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,839 INFO L129 PetriNetUnfolder]: 37/484 cut-off events. [2021-06-10 11:36:21,839 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:21,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 484 events. 37/484 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1897 event pairs, 0 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 555. Up to 17 conditions per place. [2021-06-10 11:36:21,855 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2021-06-10 11:36:21,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 424 transitions, 991 flow [2021-06-10 11:36:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:21,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:21,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:21,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,858 INFO L185 Difference]: Start difference. First operand has 433 places, 424 transitions, 979 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:21,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 424 transitions, 991 flow [2021-06-10 11:36:21,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 424 transitions, 986 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:21,862 INFO L241 Difference]: Finished difference. Result has 436 places, 424 transitions, 984 flow [2021-06-10 11:36:21,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=436, PETRI_TRANSITIONS=424} [2021-06-10 11:36:21,862 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -1 predicate places. [2021-06-10 11:36:21,862 INFO L480 AbstractCegarLoop]: Abstraction has has 436 places, 424 transitions, 984 flow [2021-06-10 11:36:21,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,862 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2021-06-10 11:36:21,862 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 61962804, now seen corresponding path program 1 times [2021-06-10 11:36:21,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760358012] [2021-06-10 11:36:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:21,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:21,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:21,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:21,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760358012] [2021-06-10 11:36:21,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:21,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:21,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956847190] [2021-06-10 11:36:21,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:21,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:21,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:21,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:21,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:21,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 424 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:21,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:21,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:21,969 INFO L129 PetriNetUnfolder]: 36/480 cut-off events. [2021-06-10 11:36:21,969 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:21,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 480 events. 36/480 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1873 event pairs, 0 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 553. Up to 17 conditions per place. [2021-06-10 11:36:21,985 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/421 dead transitions. [2021-06-10 11:36:21,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 421 transitions, 981 flow [2021-06-10 11:36:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:21,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:21,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:21,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,988 INFO L185 Difference]: Start difference. First operand has 436 places, 424 transitions, 984 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 421 transitions, 981 flow [2021-06-10 11:36:21,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 421 transitions, 974 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:21,992 INFO L241 Difference]: Finished difference. Result has 435 places, 421 transitions, 964 flow [2021-06-10 11:36:21,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=435, PETRI_TRANSITIONS=421} [2021-06-10 11:36:21,992 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -2 predicate places. [2021-06-10 11:36:21,992 INFO L480 AbstractCegarLoop]: Abstraction has has 435 places, 421 transitions, 964 flow [2021-06-10 11:36:21,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:21,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:21,992 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:21,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2021-06-10 11:36:21,992 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 61963827, now seen corresponding path program 1 times [2021-06-10 11:36:21,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:21,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672817502] [2021-06-10 11:36:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:22,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:22,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672817502] [2021-06-10 11:36:22,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977596451] [2021-06-10 11:36:22,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:22,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 421 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:22,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,096 INFO L129 PetriNetUnfolder]: 36/478 cut-off events. [2021-06-10 11:36:22,096 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:22,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 478 events. 36/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1859 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 554. Up to 17 conditions per place. [2021-06-10 11:36:22,112 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/419 dead transitions. [2021-06-10 11:36:22,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 419 transitions, 977 flow [2021-06-10 11:36:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:22,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:22,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,119 INFO L185 Difference]: Start difference. First operand has 435 places, 421 transitions, 964 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:22,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 419 transitions, 977 flow [2021-06-10 11:36:22,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 419 transitions, 976 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,123 INFO L241 Difference]: Finished difference. Result has 434 places, 419 transitions, 960 flow [2021-06-10 11:36:22,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=434, PETRI_TRANSITIONS=419} [2021-06-10 11:36:22,123 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, -3 predicate places. [2021-06-10 11:36:22,123 INFO L480 AbstractCegarLoop]: Abstraction has has 434 places, 419 transitions, 960 flow [2021-06-10 11:36:22,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,123 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,124 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2021-06-10 11:36:22,124 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 772159652, now seen corresponding path program 1 times [2021-06-10 11:36:22,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119659350] [2021-06-10 11:36:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:22,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:22,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119659350] [2021-06-10 11:36:22,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176737785] [2021-06-10 11:36:22,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:22,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 419 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:22,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,303 INFO L129 PetriNetUnfolder]: 35/486 cut-off events. [2021-06-10 11:36:22,303 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:22,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 486 events. 35/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1929 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 566. Up to 17 conditions per place. [2021-06-10 11:36:22,318 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/421 dead transitions. [2021-06-10 11:36:22,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 421 transitions, 990 flow [2021-06-10 11:36:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:22,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:22,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:22,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:22,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:22,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,320 INFO L185 Difference]: Start difference. First operand has 434 places, 419 transitions, 960 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:22,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 421 transitions, 990 flow [2021-06-10 11:36:22,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 421 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,324 INFO L241 Difference]: Finished difference. Result has 437 places, 421 transitions, 983 flow [2021-06-10 11:36:22,324 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=983, PETRI_PLACES=437, PETRI_TRANSITIONS=421} [2021-06-10 11:36:22,325 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 0 predicate places. [2021-06-10 11:36:22,325 INFO L480 AbstractCegarLoop]: Abstraction has has 437 places, 421 transitions, 983 flow [2021-06-10 11:36:22,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,325 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-06-10 11:36:22,325 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 772158629, now seen corresponding path program 1 times [2021-06-10 11:36:22,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584356378] [2021-06-10 11:36:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:22,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:22,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584356378] [2021-06-10 11:36:22,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640189685] [2021-06-10 11:36:22,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:22,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 421 transitions, 983 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:22,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,426 INFO L129 PetriNetUnfolder]: 33/487 cut-off events. [2021-06-10 11:36:22,426 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:22,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 487 events. 33/487 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1954 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 565. Up to 17 conditions per place. [2021-06-10 11:36:22,441 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 6 selfloop transitions, 1 changer transitions 0/421 dead transitions. [2021-06-10 11:36:22,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 421 transitions, 995 flow [2021-06-10 11:36:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:22,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:22,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,443 INFO L185 Difference]: Start difference. First operand has 437 places, 421 transitions, 983 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:22,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 421 transitions, 995 flow [2021-06-10 11:36:22,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 421 transitions, 990 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,447 INFO L241 Difference]: Finished difference. Result has 439 places, 420 transitions, 979 flow [2021-06-10 11:36:22,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=979, PETRI_PLACES=439, PETRI_TRANSITIONS=420} [2021-06-10 11:36:22,448 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 2 predicate places. [2021-06-10 11:36:22,448 INFO L480 AbstractCegarLoop]: Abstraction has has 439 places, 420 transitions, 979 flow [2021-06-10 11:36:22,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,448 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-06-10 11:36:22,448 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 771206340, now seen corresponding path program 1 times [2021-06-10 11:36:22,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710973804] [2021-06-10 11:36:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:22,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:22,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710973804] [2021-06-10 11:36:22,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244978571] [2021-06-10 11:36:22,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:22,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 420 transitions, 979 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:22,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,546 INFO L129 PetriNetUnfolder]: 33/480 cut-off events. [2021-06-10 11:36:22,546 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:22,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 480 events. 33/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1892 event pairs, 0 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 560. Up to 17 conditions per place. [2021-06-10 11:36:22,561 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/418 dead transitions. [2021-06-10 11:36:22,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 418 transitions, 982 flow [2021-06-10 11:36:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:22,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:22,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:22,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:22,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:22,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,564 INFO L185 Difference]: Start difference. First operand has 439 places, 420 transitions, 979 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:22,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 418 transitions, 982 flow [2021-06-10 11:36:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 418 transitions, 975 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:22,568 INFO L241 Difference]: Finished difference. Result has 439 places, 418 transitions, 968 flow [2021-06-10 11:36:22,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=439, PETRI_TRANSITIONS=418} [2021-06-10 11:36:22,568 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 2 predicate places. [2021-06-10 11:36:22,568 INFO L480 AbstractCegarLoop]: Abstraction has has 439 places, 418 transitions, 968 flow [2021-06-10 11:36:22,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,568 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-06-10 11:36:22,569 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash 771205317, now seen corresponding path program 1 times [2021-06-10 11:36:22,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073238809] [2021-06-10 11:36:22,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:22,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:22,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073238809] [2021-06-10 11:36:22,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388612588] [2021-06-10 11:36:22,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:22,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 418 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:22,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,689 INFO L129 PetriNetUnfolder]: 33/478 cut-off events. [2021-06-10 11:36:22,689 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:22,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 478 events. 33/478 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1877 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 560. Up to 17 conditions per place. [2021-06-10 11:36:22,702 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/416 dead transitions. [2021-06-10 11:36:22,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 416 transitions, 981 flow [2021-06-10 11:36:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:22,703 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:22,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:22,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,705 INFO L185 Difference]: Start difference. First operand has 439 places, 418 transitions, 968 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:22,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 416 transitions, 981 flow [2021-06-10 11:36:22,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 416 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,708 INFO L241 Difference]: Finished difference. Result has 438 places, 416 transitions, 964 flow [2021-06-10 11:36:22,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=438, PETRI_TRANSITIONS=416} [2021-06-10 11:36:22,709 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 1 predicate places. [2021-06-10 11:36:22,709 INFO L480 AbstractCegarLoop]: Abstraction has has 438 places, 416 transitions, 964 flow [2021-06-10 11:36:22,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,709 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2021-06-10 11:36:22,709 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1576535401, now seen corresponding path program 1 times [2021-06-10 11:36:22,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903760283] [2021-06-10 11:36:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:22,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:22,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903760283] [2021-06-10 11:36:22,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198447276] [2021-06-10 11:36:22,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:22,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 416 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:22,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,809 INFO L129 PetriNetUnfolder]: 32/485 cut-off events. [2021-06-10 11:36:22,809 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:22,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 485 events. 32/485 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1934 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 565. Up to 17 conditions per place. [2021-06-10 11:36:22,823 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 6 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2021-06-10 11:36:22,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 417 transitions, 980 flow [2021-06-10 11:36:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:22,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:22,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:22,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,826 INFO L185 Difference]: Start difference. First operand has 438 places, 416 transitions, 964 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 417 transitions, 980 flow [2021-06-10 11:36:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 417 transitions, 979 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,830 INFO L241 Difference]: Finished difference. Result has 440 places, 416 transitions, 968 flow [2021-06-10 11:36:22,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=440, PETRI_TRANSITIONS=416} [2021-06-10 11:36:22,830 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 3 predicate places. [2021-06-10 11:36:22,830 INFO L480 AbstractCegarLoop]: Abstraction has has 440 places, 416 transitions, 968 flow [2021-06-10 11:36:22,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,830 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2021-06-10 11:36:22,831 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1576534378, now seen corresponding path program 1 times [2021-06-10 11:36:22,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705623383] [2021-06-10 11:36:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:22,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:22,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705623383] [2021-06-10 11:36:22,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697738312] [2021-06-10 11:36:22,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:22,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 416 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:22,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:22,937 INFO L129 PetriNetUnfolder]: 30/487 cut-off events. [2021-06-10 11:36:22,937 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:22,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 487 events. 30/487 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1968 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 576. Up to 17 conditions per place. [2021-06-10 11:36:22,952 INFO L132 encePairwiseOnDemand]: 465/469 looper letters, 9 selfloop transitions, 3 changer transitions 0/417 dead transitions. [2021-06-10 11:36:22,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 417 transitions, 994 flow [2021-06-10 11:36:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2021-06-10 11:36:22,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9132906894100924 [2021-06-10 11:36:22,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2021-06-10 11:36:22,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2021-06-10 11:36:22,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:22,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2021-06-10 11:36:22,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,955 INFO L185 Difference]: Start difference. First operand has 440 places, 416 transitions, 968 flow. Second operand 3 states and 1285 transitions. [2021-06-10 11:36:22,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 417 transitions, 994 flow [2021-06-10 11:36:22,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 417 transitions, 993 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:22,959 INFO L241 Difference]: Finished difference. Result has 443 places, 417 transitions, 985 flow [2021-06-10 11:36:22,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=985, PETRI_PLACES=443, PETRI_TRANSITIONS=417} [2021-06-10 11:36:22,959 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 6 predicate places. [2021-06-10 11:36:22,959 INFO L480 AbstractCegarLoop]: Abstraction has has 443 places, 417 transitions, 985 flow [2021-06-10 11:36:22,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:22,959 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:22,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-06-10 11:36:22,959 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1577487690, now seen corresponding path program 1 times [2021-06-10 11:36:22,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:22,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926868106] [2021-06-10 11:36:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:22,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:22,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:22,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:22,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926868106] [2021-06-10 11:36:22,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:22,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:22,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783648428] [2021-06-10 11:36:22,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:22,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:22,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:22,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 417 transitions, 985 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:22,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:22,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:22,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,060 INFO L129 PetriNetUnfolder]: 30/480 cut-off events. [2021-06-10 11:36:23,060 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:23,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 480 events. 30/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1907 event pairs, 0 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 562. Up to 17 conditions per place. [2021-06-10 11:36:23,074 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/415 dead transitions. [2021-06-10 11:36:23,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 415 transitions, 987 flow [2021-06-10 11:36:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:23,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:23,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,077 INFO L185 Difference]: Start difference. First operand has 443 places, 417 transitions, 985 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:23,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 415 transitions, 987 flow [2021-06-10 11:36:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 415 transitions, 979 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:23,081 INFO L241 Difference]: Finished difference. Result has 443 places, 415 transitions, 972 flow [2021-06-10 11:36:23,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=443, PETRI_TRANSITIONS=415} [2021-06-10 11:36:23,081 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 6 predicate places. [2021-06-10 11:36:23,081 INFO L480 AbstractCegarLoop]: Abstraction has has 443 places, 415 transitions, 972 flow [2021-06-10 11:36:23,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,081 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2021-06-10 11:36:23,081 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1577488713, now seen corresponding path program 1 times [2021-06-10 11:36:23,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688128256] [2021-06-10 11:36:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:23,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:23,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688128256] [2021-06-10 11:36:23,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486243930] [2021-06-10 11:36:23,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:23,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 415 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:23,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,181 INFO L129 PetriNetUnfolder]: 30/478 cut-off events. [2021-06-10 11:36:23,182 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:23,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 478 events. 30/478 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1893 event pairs, 0 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 566. Up to 17 conditions per place. [2021-06-10 11:36:23,195 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/413 dead transitions. [2021-06-10 11:36:23,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 413 transitions, 985 flow [2021-06-10 11:36:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:23,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:23,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,198 INFO L185 Difference]: Start difference. First operand has 443 places, 415 transitions, 972 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:23,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 413 transitions, 985 flow [2021-06-10 11:36:23,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 413 transitions, 984 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,202 INFO L241 Difference]: Finished difference. Result has 442 places, 413 transitions, 968 flow [2021-06-10 11:36:23,202 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=442, PETRI_TRANSITIONS=413} [2021-06-10 11:36:23,202 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 5 predicate places. [2021-06-10 11:36:23,202 INFO L480 AbstractCegarLoop]: Abstraction has has 442 places, 413 transitions, 968 flow [2021-06-10 11:36:23,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,202 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,202 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-06-10 11:36:23,202 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1523323991, now seen corresponding path program 1 times [2021-06-10 11:36:23,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389985189] [2021-06-10 11:36:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:23,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:23,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389985189] [2021-06-10 11:36:23,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378103953] [2021-06-10 11:36:23,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:23,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 413 transitions, 968 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:23,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,308 INFO L129 PetriNetUnfolder]: 28/483 cut-off events. [2021-06-10 11:36:23,308 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:23,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 483 events. 28/483 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1945 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 569. Up to 17 conditions per place. [2021-06-10 11:36:23,322 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2021-06-10 11:36:23,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 414 transitions, 984 flow [2021-06-10 11:36:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:23,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:23,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,325 INFO L185 Difference]: Start difference. First operand has 442 places, 413 transitions, 968 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:23,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 414 transitions, 984 flow [2021-06-10 11:36:23,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 414 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,329 INFO L241 Difference]: Finished difference. Result has 445 places, 414 transitions, 981 flow [2021-06-10 11:36:23,329 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=445, PETRI_TRANSITIONS=414} [2021-06-10 11:36:23,329 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 8 predicate places. [2021-06-10 11:36:23,329 INFO L480 AbstractCegarLoop]: Abstraction has has 445 places, 414 transitions, 981 flow [2021-06-10 11:36:23,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,329 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,329 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2021-06-10 11:36:23,329 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1523325014, now seen corresponding path program 1 times [2021-06-10 11:36:23,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714730277] [2021-06-10 11:36:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:23,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:23,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714730277] [2021-06-10 11:36:23,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619072962] [2021-06-10 11:36:23,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:23,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 414 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:23,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,435 INFO L129 PetriNetUnfolder]: 28/484 cut-off events. [2021-06-10 11:36:23,435 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:23,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 484 events. 28/484 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1951 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 577. Up to 17 conditions per place. [2021-06-10 11:36:23,449 INFO L132 encePairwiseOnDemand]: 465/469 looper letters, 9 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2021-06-10 11:36:23,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 415 transitions, 1007 flow [2021-06-10 11:36:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2021-06-10 11:36:23,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9132906894100924 [2021-06-10 11:36:23,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,452 INFO L185 Difference]: Start difference. First operand has 445 places, 414 transitions, 981 flow. Second operand 3 states and 1285 transitions. [2021-06-10 11:36:23,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 415 transitions, 1007 flow [2021-06-10 11:36:23,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 415 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,456 INFO L241 Difference]: Finished difference. Result has 448 places, 415 transitions, 997 flow [2021-06-10 11:36:23,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=997, PETRI_PLACES=448, PETRI_TRANSITIONS=415} [2021-06-10 11:36:23,456 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 11 predicate places. [2021-06-10 11:36:23,456 INFO L480 AbstractCegarLoop]: Abstraction has has 448 places, 415 transitions, 997 flow [2021-06-10 11:36:23,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,456 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2021-06-10 11:36:23,457 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1522371702, now seen corresponding path program 1 times [2021-06-10 11:36:23,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181596508] [2021-06-10 11:36:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:23,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:23,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181596508] [2021-06-10 11:36:23,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53499516] [2021-06-10 11:36:23,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,472 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:23,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 415 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:23,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,560 INFO L129 PetriNetUnfolder]: 27/480 cut-off events. [2021-06-10 11:36:23,560 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:23,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 480 events. 27/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1924 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 570. Up to 17 conditions per place. [2021-06-10 11:36:23,574 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/412 dead transitions. [2021-06-10 11:36:23,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 412 transitions, 994 flow [2021-06-10 11:36:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:23,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:23,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:23,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,577 INFO L185 Difference]: Start difference. First operand has 448 places, 415 transitions, 997 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 412 transitions, 994 flow [2021-06-10 11:36:23,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 412 transitions, 986 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:23,580 INFO L241 Difference]: Finished difference. Result has 447 places, 412 transitions, 976 flow [2021-06-10 11:36:23,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=447, PETRI_TRANSITIONS=412} [2021-06-10 11:36:23,581 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 10 predicate places. [2021-06-10 11:36:23,581 INFO L480 AbstractCegarLoop]: Abstraction has has 447 places, 412 transitions, 976 flow [2021-06-10 11:36:23,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,581 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-06-10 11:36:23,581 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1522370679, now seen corresponding path program 1 times [2021-06-10 11:36:23,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485485346] [2021-06-10 11:36:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:23,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:23,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485485346] [2021-06-10 11:36:23,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204435356] [2021-06-10 11:36:23,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,598 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:23,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 412 transitions, 976 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:23,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,687 INFO L129 PetriNetUnfolder]: 27/478 cut-off events. [2021-06-10 11:36:23,687 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:23,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 478 events. 27/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1911 event pairs, 0 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 573. Up to 17 conditions per place. [2021-06-10 11:36:23,701 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/410 dead transitions. [2021-06-10 11:36:23,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 410 transitions, 989 flow [2021-06-10 11:36:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:23,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:23,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:23,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,704 INFO L185 Difference]: Start difference. First operand has 447 places, 412 transitions, 976 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:23,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 410 transitions, 989 flow [2021-06-10 11:36:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 410 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,708 INFO L241 Difference]: Finished difference. Result has 446 places, 410 transitions, 972 flow [2021-06-10 11:36:23,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=446, PETRI_TRANSITIONS=410} [2021-06-10 11:36:23,708 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 9 predicate places. [2021-06-10 11:36:23,708 INFO L480 AbstractCegarLoop]: Abstraction has has 446 places, 410 transitions, 972 flow [2021-06-10 11:36:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,708 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2021-06-10 11:36:23,708 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1257086462, now seen corresponding path program 1 times [2021-06-10 11:36:23,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772020045] [2021-06-10 11:36:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:23,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:23,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772020045] [2021-06-10 11:36:23,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084778350] [2021-06-10 11:36:23,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:23,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 410 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:23,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,812 INFO L129 PetriNetUnfolder]: 26/485 cut-off events. [2021-06-10 11:36:23,812 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:23,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 485 events. 26/485 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1971 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 578. Up to 17 conditions per place. [2021-06-10 11:36:23,826 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 6 selfloop transitions, 1 changer transitions 0/411 dead transitions. [2021-06-10 11:36:23,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 411 transitions, 988 flow [2021-06-10 11:36:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:23,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:23,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:23,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,829 INFO L185 Difference]: Start difference. First operand has 446 places, 410 transitions, 972 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:23,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 411 transitions, 988 flow [2021-06-10 11:36:23,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 411 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,832 INFO L241 Difference]: Finished difference. Result has 448 places, 410 transitions, 976 flow [2021-06-10 11:36:23,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=448, PETRI_TRANSITIONS=410} [2021-06-10 11:36:23,833 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 11 predicate places. [2021-06-10 11:36:23,833 INFO L480 AbstractCegarLoop]: Abstraction has has 448 places, 410 transitions, 976 flow [2021-06-10 11:36:23,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,833 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2021-06-10 11:36:23,833 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1257087485, now seen corresponding path program 1 times [2021-06-10 11:36:23,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222165135] [2021-06-10 11:36:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:23,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:23,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222165135] [2021-06-10 11:36:23,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518111516] [2021-06-10 11:36:23,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:23,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 410 transitions, 976 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:23,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:23,951 INFO L129 PetriNetUnfolder]: 24/487 cut-off events. [2021-06-10 11:36:23,951 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:23,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 487 events. 24/487 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2006 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 589. Up to 17 conditions per place. [2021-06-10 11:36:23,965 INFO L132 encePairwiseOnDemand]: 465/469 looper letters, 9 selfloop transitions, 3 changer transitions 0/411 dead transitions. [2021-06-10 11:36:23,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 411 transitions, 1002 flow [2021-06-10 11:36:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2021-06-10 11:36:23,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9132906894100924 [2021-06-10 11:36:23,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:23,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2021-06-10 11:36:23,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,968 INFO L185 Difference]: Start difference. First operand has 448 places, 410 transitions, 976 flow. Second operand 3 states and 1285 transitions. [2021-06-10 11:36:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 411 transitions, 1002 flow [2021-06-10 11:36:23,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 411 transitions, 1001 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:23,972 INFO L241 Difference]: Finished difference. Result has 451 places, 411 transitions, 993 flow [2021-06-10 11:36:23,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=993, PETRI_PLACES=451, PETRI_TRANSITIONS=411} [2021-06-10 11:36:23,973 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 14 predicate places. [2021-06-10 11:36:23,973 INFO L480 AbstractCegarLoop]: Abstraction has has 451 places, 411 transitions, 993 flow [2021-06-10 11:36:23,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,973 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:23,973 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:23,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2021-06-10 11:36:23,973 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1256134173, now seen corresponding path program 1 times [2021-06-10 11:36:23,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:23,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984645543] [2021-06-10 11:36:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:23,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:23,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:23,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:23,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984645543] [2021-06-10 11:36:23,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:23,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:23,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112640405] [2021-06-10 11:36:23,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:23,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:23,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:23,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 411 transitions, 993 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:23,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:23,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:23,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,088 INFO L129 PetriNetUnfolder]: 24/480 cut-off events. [2021-06-10 11:36:24,088 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:24,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 480 events. 24/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1941 event pairs, 0 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 575. Up to 17 conditions per place. [2021-06-10 11:36:24,098 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/409 dead transitions. [2021-06-10 11:36:24,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 409 transitions, 995 flow [2021-06-10 11:36:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:24,099 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:24,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,100 INFO L185 Difference]: Start difference. First operand has 451 places, 411 transitions, 993 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:24,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 409 transitions, 995 flow [2021-06-10 11:36:24,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 409 transitions, 987 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:24,104 INFO L241 Difference]: Finished difference. Result has 451 places, 409 transitions, 980 flow [2021-06-10 11:36:24,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=451, PETRI_TRANSITIONS=409} [2021-06-10 11:36:24,104 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 14 predicate places. [2021-06-10 11:36:24,104 INFO L480 AbstractCegarLoop]: Abstraction has has 451 places, 409 transitions, 980 flow [2021-06-10 11:36:24,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,105 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-06-10 11:36:24,105 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1256133150, now seen corresponding path program 1 times [2021-06-10 11:36:24,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285964118] [2021-06-10 11:36:24,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:24,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:24,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285964118] [2021-06-10 11:36:24,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214827533] [2021-06-10 11:36:24,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:24,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 409 transitions, 980 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:24,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,209 INFO L129 PetriNetUnfolder]: 24/478 cut-off events. [2021-06-10 11:36:24,209 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:24,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 478 events. 24/478 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1929 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 579. Up to 17 conditions per place. [2021-06-10 11:36:24,222 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/407 dead transitions. [2021-06-10 11:36:24,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 407 transitions, 993 flow [2021-06-10 11:36:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:24,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:24,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,225 INFO L185 Difference]: Start difference. First operand has 451 places, 409 transitions, 980 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:24,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 407 transitions, 993 flow [2021-06-10 11:36:24,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 407 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:24,229 INFO L241 Difference]: Finished difference. Result has 450 places, 407 transitions, 976 flow [2021-06-10 11:36:24,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=976, PETRI_PLACES=450, PETRI_TRANSITIONS=407} [2021-06-10 11:36:24,229 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 13 predicate places. [2021-06-10 11:36:24,229 INFO L480 AbstractCegarLoop]: Abstraction has has 450 places, 407 transitions, 976 flow [2021-06-10 11:36:24,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,229 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-06-10 11:36:24,230 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -55749262, now seen corresponding path program 1 times [2021-06-10 11:36:24,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134700137] [2021-06-10 11:36:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:24,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:24,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134700137] [2021-06-10 11:36:24,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409330364] [2021-06-10 11:36:24,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:24,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 407 transitions, 976 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:24,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,341 INFO L129 PetriNetUnfolder]: 23/486 cut-off events. [2021-06-10 11:36:24,342 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:24,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 486 events. 23/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2000 event pairs, 0 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 591. Up to 17 conditions per place. [2021-06-10 11:36:24,356 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2021-06-10 11:36:24,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 409 transitions, 1006 flow [2021-06-10 11:36:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:24,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:24,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,358 INFO L185 Difference]: Start difference. First operand has 450 places, 407 transitions, 976 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:24,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 409 transitions, 1006 flow [2021-06-10 11:36:24,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 409 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:24,362 INFO L241 Difference]: Finished difference. Result has 453 places, 409 transitions, 999 flow [2021-06-10 11:36:24,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=999, PETRI_PLACES=453, PETRI_TRANSITIONS=409} [2021-06-10 11:36:24,362 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 16 predicate places. [2021-06-10 11:36:24,362 INFO L480 AbstractCegarLoop]: Abstraction has has 453 places, 409 transitions, 999 flow [2021-06-10 11:36:24,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,363 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-06-10 11:36:24,363 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash -55750285, now seen corresponding path program 1 times [2021-06-10 11:36:24,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539934672] [2021-06-10 11:36:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:24,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:24,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539934672] [2021-06-10 11:36:24,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970965696] [2021-06-10 11:36:24,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:24,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 409 transitions, 999 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:24,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,479 INFO L129 PetriNetUnfolder]: 21/487 cut-off events. [2021-06-10 11:36:24,479 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:24,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 487 events. 21/487 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2021 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 591. Up to 17 conditions per place. [2021-06-10 11:36:24,493 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 6 selfloop transitions, 1 changer transitions 0/409 dead transitions. [2021-06-10 11:36:24,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 409 transitions, 1011 flow [2021-06-10 11:36:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:24,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:24,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:24,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:24,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:24,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,496 INFO L185 Difference]: Start difference. First operand has 453 places, 409 transitions, 999 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:24,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 409 transitions, 1011 flow [2021-06-10 11:36:24,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 409 transitions, 1006 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:24,500 INFO L241 Difference]: Finished difference. Result has 455 places, 408 transitions, 995 flow [2021-06-10 11:36:24,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=995, PETRI_PLACES=455, PETRI_TRANSITIONS=408} [2021-06-10 11:36:24,500 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 18 predicate places. [2021-06-10 11:36:24,500 INFO L480 AbstractCegarLoop]: Abstraction has has 455 places, 408 transitions, 995 flow [2021-06-10 11:36:24,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,501 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2021-06-10 11:36:24,501 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,501 INFO L82 PathProgramCache]: Analyzing trace with hash -56702574, now seen corresponding path program 1 times [2021-06-10 11:36:24,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106889467] [2021-06-10 11:36:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:24,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:24,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106889467] [2021-06-10 11:36:24,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688741665] [2021-06-10 11:36:24,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:24,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 408 transitions, 995 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:24,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,613 INFO L129 PetriNetUnfolder]: 21/480 cut-off events. [2021-06-10 11:36:24,613 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:24,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 480 events. 21/480 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1963 event pairs, 0 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 585. Up to 17 conditions per place. [2021-06-10 11:36:24,627 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2021-06-10 11:36:24,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 406 transitions, 998 flow [2021-06-10 11:36:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:24,628 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:24,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:24,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,629 INFO L185 Difference]: Start difference. First operand has 455 places, 408 transitions, 995 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:24,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 406 transitions, 998 flow [2021-06-10 11:36:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 406 transitions, 991 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:24,633 INFO L241 Difference]: Finished difference. Result has 455 places, 406 transitions, 984 flow [2021-06-10 11:36:24,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=455, PETRI_TRANSITIONS=406} [2021-06-10 11:36:24,634 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 18 predicate places. [2021-06-10 11:36:24,634 INFO L480 AbstractCegarLoop]: Abstraction has has 455 places, 406 transitions, 984 flow [2021-06-10 11:36:24,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,634 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2021-06-10 11:36:24,634 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -56703597, now seen corresponding path program 1 times [2021-06-10 11:36:24,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71381979] [2021-06-10 11:36:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:24,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:24,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71381979] [2021-06-10 11:36:24,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497149824] [2021-06-10 11:36:24,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:24,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 406 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:24,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,745 INFO L129 PetriNetUnfolder]: 21/478 cut-off events. [2021-06-10 11:36:24,745 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:24,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 478 events. 21/478 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1948 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 585. Up to 17 conditions per place. [2021-06-10 11:36:24,759 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/404 dead transitions. [2021-06-10 11:36:24,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 404 transitions, 997 flow [2021-06-10 11:36:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:24,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:24,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:24,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,761 INFO L185 Difference]: Start difference. First operand has 455 places, 406 transitions, 984 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:24,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 404 transitions, 997 flow [2021-06-10 11:36:24,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 404 transitions, 996 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:24,765 INFO L241 Difference]: Finished difference. Result has 454 places, 404 transitions, 980 flow [2021-06-10 11:36:24,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=454, PETRI_TRANSITIONS=404} [2021-06-10 11:36:24,765 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 17 predicate places. [2021-06-10 11:36:24,765 INFO L480 AbstractCegarLoop]: Abstraction has has 454 places, 404 transitions, 980 flow [2021-06-10 11:36:24,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,766 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,766 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2021-06-10 11:36:24,766 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1502712969, now seen corresponding path program 1 times [2021-06-10 11:36:24,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463862786] [2021-06-10 11:36:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:24,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:24,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463862786] [2021-06-10 11:36:24,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752786203] [2021-06-10 11:36:24,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:24,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 404 transitions, 980 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:24,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:24,882 INFO L129 PetriNetUnfolder]: 20/486 cut-off events. [2021-06-10 11:36:24,882 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:24,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 486 events. 20/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2017 event pairs, 0 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 597. Up to 17 conditions per place. [2021-06-10 11:36:24,897 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2021-06-10 11:36:24,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 406 transitions, 1010 flow [2021-06-10 11:36:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:24,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:24,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:24,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:24,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,899 INFO L185 Difference]: Start difference. First operand has 454 places, 404 transitions, 980 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:24,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 406 transitions, 1010 flow [2021-06-10 11:36:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 406 transitions, 1009 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:24,903 INFO L241 Difference]: Finished difference. Result has 457 places, 406 transitions, 1003 flow [2021-06-10 11:36:24,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1003, PETRI_PLACES=457, PETRI_TRANSITIONS=406} [2021-06-10 11:36:24,904 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 20 predicate places. [2021-06-10 11:36:24,904 INFO L480 AbstractCegarLoop]: Abstraction has has 457 places, 406 transitions, 1003 flow [2021-06-10 11:36:24,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:24,904 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:24,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-06-10 11:36:24,904 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1502713992, now seen corresponding path program 1 times [2021-06-10 11:36:24,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:24,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758694313] [2021-06-10 11:36:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:24,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:24,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:24,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:24,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758694313] [2021-06-10 11:36:24,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:24,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:24,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519440226] [2021-06-10 11:36:24,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:24,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:24,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:24,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 406 transitions, 1003 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:24,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:24,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:24,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,014 INFO L129 PetriNetUnfolder]: 19/484 cut-off events. [2021-06-10 11:36:25,014 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:25,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 484 events. 19/484 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2007 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 594. Up to 17 conditions per place. [2021-06-10 11:36:25,028 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2021-06-10 11:36:25,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 406 transitions, 1015 flow [2021-06-10 11:36:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:25,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:25,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,030 INFO L185 Difference]: Start difference. First operand has 457 places, 406 transitions, 1003 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:25,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 406 transitions, 1015 flow [2021-06-10 11:36:25,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 406 transitions, 1010 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,034 INFO L241 Difference]: Finished difference. Result has 460 places, 406 transitions, 1008 flow [2021-06-10 11:36:25,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=460, PETRI_TRANSITIONS=406} [2021-06-10 11:36:25,035 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 23 predicate places. [2021-06-10 11:36:25,035 INFO L480 AbstractCegarLoop]: Abstraction has has 460 places, 406 transitions, 1008 flow [2021-06-10 11:36:25,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,035 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2021-06-10 11:36:25,035 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1503666281, now seen corresponding path program 1 times [2021-06-10 11:36:25,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104884258] [2021-06-10 11:36:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:25,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:25,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104884258] [2021-06-10 11:36:25,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496466411] [2021-06-10 11:36:25,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:25,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 406 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:25,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,147 INFO L129 PetriNetUnfolder]: 18/480 cut-off events. [2021-06-10 11:36:25,147 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:25,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 480 events. 18/480 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1979 event pairs, 0 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 591. Up to 17 conditions per place. [2021-06-10 11:36:25,161 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/403 dead transitions. [2021-06-10 11:36:25,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 403 transitions, 1005 flow [2021-06-10 11:36:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:25,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:25,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,164 INFO L185 Difference]: Start difference. First operand has 460 places, 406 transitions, 1008 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:25,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 403 transitions, 1005 flow [2021-06-10 11:36:25,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 403 transitions, 998 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:25,168 INFO L241 Difference]: Finished difference. Result has 459 places, 403 transitions, 988 flow [2021-06-10 11:36:25,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=988, PETRI_PLACES=459, PETRI_TRANSITIONS=403} [2021-06-10 11:36:25,168 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 22 predicate places. [2021-06-10 11:36:25,168 INFO L480 AbstractCegarLoop]: Abstraction has has 459 places, 403 transitions, 988 flow [2021-06-10 11:36:25,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,168 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2021-06-10 11:36:25,168 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1503667304, now seen corresponding path program 1 times [2021-06-10 11:36:25,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076910239] [2021-06-10 11:36:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:25,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:25,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076910239] [2021-06-10 11:36:25,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340593923] [2021-06-10 11:36:25,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:25,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 403 transitions, 988 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:25,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,279 INFO L129 PetriNetUnfolder]: 18/478 cut-off events. [2021-06-10 11:36:25,279 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:25,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 478 events. 18/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1965 event pairs, 0 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 592. Up to 17 conditions per place. [2021-06-10 11:36:25,293 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/401 dead transitions. [2021-06-10 11:36:25,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 401 transitions, 1001 flow [2021-06-10 11:36:25,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:25,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:25,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,296 INFO L185 Difference]: Start difference. First operand has 459 places, 403 transitions, 988 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:25,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 401 transitions, 1001 flow [2021-06-10 11:36:25,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 401 transitions, 1000 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,300 INFO L241 Difference]: Finished difference. Result has 458 places, 401 transitions, 984 flow [2021-06-10 11:36:25,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=458, PETRI_TRANSITIONS=401} [2021-06-10 11:36:25,300 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 21 predicate places. [2021-06-10 11:36:25,300 INFO L480 AbstractCegarLoop]: Abstraction has has 458 places, 401 transitions, 984 flow [2021-06-10 11:36:25,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,300 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2021-06-10 11:36:25,300 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2127052160, now seen corresponding path program 1 times [2021-06-10 11:36:25,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28061139] [2021-06-10 11:36:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:25,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:25,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28061139] [2021-06-10 11:36:25,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168187933] [2021-06-10 11:36:25,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:25,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 401 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:25,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,419 INFO L129 PetriNetUnfolder]: 17/486 cut-off events. [2021-06-10 11:36:25,419 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:25,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 486 events. 17/486 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2035 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 604. Up to 17 conditions per place. [2021-06-10 11:36:25,433 INFO L132 encePairwiseOnDemand]: 464/469 looper letters, 10 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2021-06-10 11:36:25,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 403 transitions, 1014 flow [2021-06-10 11:36:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2021-06-10 11:36:25,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9147121535181236 [2021-06-10 11:36:25,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2021-06-10 11:36:25,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2021-06-10 11:36:25,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2021-06-10 11:36:25,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,436 INFO L185 Difference]: Start difference. First operand has 458 places, 401 transitions, 984 flow. Second operand 3 states and 1287 transitions. [2021-06-10 11:36:25,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 403 transitions, 1014 flow [2021-06-10 11:36:25,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 403 transitions, 1013 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,445 INFO L241 Difference]: Finished difference. Result has 461 places, 403 transitions, 1007 flow [2021-06-10 11:36:25,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1007, PETRI_PLACES=461, PETRI_TRANSITIONS=403} [2021-06-10 11:36:25,446 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 24 predicate places. [2021-06-10 11:36:25,446 INFO L480 AbstractCegarLoop]: Abstraction has has 461 places, 403 transitions, 1007 flow [2021-06-10 11:36:25,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,446 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2021-06-10 11:36:25,446 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2127053183, now seen corresponding path program 1 times [2021-06-10 11:36:25,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736548248] [2021-06-10 11:36:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:25,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:25,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736548248] [2021-06-10 11:36:25,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216537506] [2021-06-10 11:36:25,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:25,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 403 transitions, 1007 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:25,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,572 INFO L129 PetriNetUnfolder]: 16/484 cut-off events. [2021-06-10 11:36:25,572 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:25,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 484 events. 16/484 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2022 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 601. Up to 17 conditions per place. [2021-06-10 11:36:25,584 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2021-06-10 11:36:25,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 403 transitions, 1019 flow [2021-06-10 11:36:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:25,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:25,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,587 INFO L185 Difference]: Start difference. First operand has 461 places, 403 transitions, 1007 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:25,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 403 transitions, 1019 flow [2021-06-10 11:36:25,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 403 transitions, 1014 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,591 INFO L241 Difference]: Finished difference. Result has 464 places, 403 transitions, 1012 flow [2021-06-10 11:36:25,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=464, PETRI_TRANSITIONS=403} [2021-06-10 11:36:25,591 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 27 predicate places. [2021-06-10 11:36:25,591 INFO L480 AbstractCegarLoop]: Abstraction has has 464 places, 403 transitions, 1012 flow [2021-06-10 11:36:25,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,591 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2021-06-10 11:36:25,591 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2128005472, now seen corresponding path program 1 times [2021-06-10 11:36:25,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272953816] [2021-06-10 11:36:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:25,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:25,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272953816] [2021-06-10 11:36:25,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743145713] [2021-06-10 11:36:25,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:25,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 403 transitions, 1012 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:25,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,706 INFO L129 PetriNetUnfolder]: 15/480 cut-off events. [2021-06-10 11:36:25,707 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:25,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 480 events. 15/480 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1996 event pairs, 0 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 598. Up to 17 conditions per place. [2021-06-10 11:36:25,721 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2021-06-10 11:36:25,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 400 transitions, 1009 flow [2021-06-10 11:36:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:25,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:25,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:25,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,723 INFO L185 Difference]: Start difference. First operand has 464 places, 403 transitions, 1012 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:25,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 400 transitions, 1009 flow [2021-06-10 11:36:25,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 400 transitions, 1002 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:25,727 INFO L241 Difference]: Finished difference. Result has 463 places, 400 transitions, 992 flow [2021-06-10 11:36:25,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=992, PETRI_PLACES=463, PETRI_TRANSITIONS=400} [2021-06-10 11:36:25,728 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 26 predicate places. [2021-06-10 11:36:25,728 INFO L480 AbstractCegarLoop]: Abstraction has has 463 places, 400 transitions, 992 flow [2021-06-10 11:36:25,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,728 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2021-06-10 11:36:25,728 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2128006495, now seen corresponding path program 1 times [2021-06-10 11:36:25,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201813935] [2021-06-10 11:36:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:25,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:25,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201813935] [2021-06-10 11:36:25,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049369573] [2021-06-10 11:36:25,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,742 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:25,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 400 transitions, 992 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:25,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,839 INFO L129 PetriNetUnfolder]: 15/478 cut-off events. [2021-06-10 11:36:25,840 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:25,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 478 events. 15/478 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1983 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 599. Up to 17 conditions per place. [2021-06-10 11:36:25,853 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 8 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2021-06-10 11:36:25,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 398 transitions, 1005 flow [2021-06-10 11:36:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2021-06-10 11:36:25,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9111584932480455 [2021-06-10 11:36:25,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1282 transitions. [2021-06-10 11:36:25,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,856 INFO L185 Difference]: Start difference. First operand has 463 places, 400 transitions, 992 flow. Second operand 3 states and 1282 transitions. [2021-06-10 11:36:25,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 398 transitions, 1005 flow [2021-06-10 11:36:25,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 398 transitions, 1004 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,860 INFO L241 Difference]: Finished difference. Result has 462 places, 398 transitions, 988 flow [2021-06-10 11:36:25,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=988, PETRI_PLACES=462, PETRI_TRANSITIONS=398} [2021-06-10 11:36:25,860 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 25 predicate places. [2021-06-10 11:36:25,860 INFO L480 AbstractCegarLoop]: Abstraction has has 462 places, 398 transitions, 988 flow [2021-06-10 11:36:25,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,860 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,860 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2021-06-10 11:36:25,860 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -188696329, now seen corresponding path program 1 times [2021-06-10 11:36:25,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458920600] [2021-06-10 11:36:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:25,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:25,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:25,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:25,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458920600] [2021-06-10 11:36:25,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:25,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:25,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750654680] [2021-06-10 11:36:25,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:25,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:25,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:25,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 398 transitions, 988 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:25,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:25,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:25,973 INFO L129 PetriNetUnfolder]: 13/483 cut-off events. [2021-06-10 11:36:25,973 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:25,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 483 events. 13/483 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2032 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 602. Up to 17 conditions per place. [2021-06-10 11:36:25,986 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 5 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2021-06-10 11:36:25,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 399 transitions, 1004 flow [2021-06-10 11:36:25,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2021-06-10 11:36:25,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2021-06-10 11:36:25,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:25,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2021-06-10 11:36:25,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,989 INFO L185 Difference]: Start difference. First operand has 462 places, 398 transitions, 988 flow. Second operand 3 states and 1295 transitions. [2021-06-10 11:36:25,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 399 transitions, 1004 flow [2021-06-10 11:36:25,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 399 transitions, 1003 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:25,993 INFO L241 Difference]: Finished difference. Result has 465 places, 399 transitions, 1001 flow [2021-06-10 11:36:25,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1001, PETRI_PLACES=465, PETRI_TRANSITIONS=399} [2021-06-10 11:36:25,993 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 28 predicate places. [2021-06-10 11:36:25,993 INFO L480 AbstractCegarLoop]: Abstraction has has 465 places, 399 transitions, 1001 flow [2021-06-10 11:36:25,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:25,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:25,993 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:25,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2021-06-10 11:36:25,993 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -188697352, now seen corresponding path program 1 times [2021-06-10 11:36:25,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:25,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528371122] [2021-06-10 11:36:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:26,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:26,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528371122] [2021-06-10 11:36:26,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222095875] [2021-06-10 11:36:26,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,008 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:26,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 399 transitions, 1001 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:26,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:26,116 INFO L129 PetriNetUnfolder]: 13/484 cut-off events. [2021-06-10 11:36:26,116 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:26,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 484 events. 13/484 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2039 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 610. Up to 17 conditions per place. [2021-06-10 11:36:26,130 INFO L132 encePairwiseOnDemand]: 465/469 looper letters, 9 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2021-06-10 11:36:26,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 400 transitions, 1027 flow [2021-06-10 11:36:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2021-06-10 11:36:26,131 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9132906894100924 [2021-06-10 11:36:26,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2021-06-10 11:36:26,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2021-06-10 11:36:26,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:26,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2021-06-10 11:36:26,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,133 INFO L185 Difference]: Start difference. First operand has 465 places, 399 transitions, 1001 flow. Second operand 3 states and 1285 transitions. [2021-06-10 11:36:26,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 400 transitions, 1027 flow [2021-06-10 11:36:26,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 400 transitions, 1025 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:26,137 INFO L241 Difference]: Finished difference. Result has 468 places, 400 transitions, 1017 flow [2021-06-10 11:36:26,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=468, PETRI_TRANSITIONS=400} [2021-06-10 11:36:26,137 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 31 predicate places. [2021-06-10 11:36:26,137 INFO L480 AbstractCegarLoop]: Abstraction has has 468 places, 400 transitions, 1017 flow [2021-06-10 11:36:26,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,137 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:26,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2021-06-10 11:36:26,137 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash -187743017, now seen corresponding path program 1 times [2021-06-10 11:36:26,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370629041] [2021-06-10 11:36:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:26,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:26,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370629041] [2021-06-10 11:36:26,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308707480] [2021-06-10 11:36:26,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 469 [2021-06-10 11:36:26,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 400 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 469 [2021-06-10 11:36:26,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:26,254 INFO L129 PetriNetUnfolder]: 12/481 cut-off events. [2021-06-10 11:36:26,255 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:36:26,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 481 events. 12/481 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2021 event pairs, 0 based on Foata normal form. 2/455 useless extension candidates. Maximal degree in co-relation 609. Up to 17 conditions per place. [2021-06-10 11:36:26,268 INFO L132 encePairwiseOnDemand]: 466/469 looper letters, 9 selfloop transitions, 1 changer transitions 0/398 dead transitions. [2021-06-10 11:36:26,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 398 transitions, 1025 flow [2021-06-10 11:36:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2021-06-10 11:36:26,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9125799573560768 [2021-06-10 11:36:26,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2021-06-10 11:36:26,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2021-06-10 11:36:26,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:26,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2021-06-10 11:36:26,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,271 INFO L185 Difference]: Start difference. First operand has 468 places, 400 transitions, 1017 flow. Second operand 3 states and 1284 transitions. [2021-06-10 11:36:26,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 398 transitions, 1025 flow [2021-06-10 11:36:26,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 398 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:26,275 INFO L241 Difference]: Finished difference. Result has 469 places, 398 transitions, 1006 flow [2021-06-10 11:36:26,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1006, PETRI_PLACES=469, PETRI_TRANSITIONS=398} [2021-06-10 11:36:26,275 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 32 predicate places. [2021-06-10 11:36:26,275 INFO L480 AbstractCegarLoop]: Abstraction has has 469 places, 398 transitions, 1006 flow [2021-06-10 11:36:26,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,275 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:26,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2021-06-10 11:36:26,275 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash -187744040, now seen corresponding path program 1 times [2021-06-10 11:36:26,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86246738] [2021-06-10 11:36:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:26,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:26,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86246738] [2021-06-10 11:36:26,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086721338] [2021-06-10 11:36:26,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 469 [2021-06-10 11:36:26,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 398 transitions, 1006 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 469 [2021-06-10 11:36:26,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:26,387 INFO L129 PetriNetUnfolder]: 12/478 cut-off events. [2021-06-10 11:36:26,387 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:26,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 478 events. 12/478 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2000 event pairs, 0 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 603. Up to 17 conditions per place. [2021-06-10 11:36:26,400 INFO L132 encePairwiseOnDemand]: 467/469 looper letters, 5 selfloop transitions, 1 changer transitions 0/395 dead transitions. [2021-06-10 11:36:26,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 395 transitions, 1007 flow [2021-06-10 11:36:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2021-06-10 11:36:26,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196872778962332 [2021-06-10 11:36:26,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2021-06-10 11:36:26,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2021-06-10 11:36:26,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:26,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2021-06-10 11:36:26,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,403 INFO L185 Difference]: Start difference. First operand has 469 places, 398 transitions, 1006 flow. Second operand 3 states and 1294 transitions. [2021-06-10 11:36:26,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 395 transitions, 1007 flow [2021-06-10 11:36:26,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 395 transitions, 1002 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:26,407 INFO L241 Difference]: Finished difference. Result has 466 places, 395 transitions, 992 flow [2021-06-10 11:36:26,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=992, PETRI_PLACES=466, PETRI_TRANSITIONS=395} [2021-06-10 11:36:26,407 INFO L343 CegarLoopForPetriNet]: 437 programPoint places, 29 predicate places. [2021-06-10 11:36:26,407 INFO L480 AbstractCegarLoop]: Abstraction has has 466 places, 395 transitions, 992 flow [2021-06-10 11:36:26,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,407 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 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-06-10 11:36:26,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2021-06-10 11:36:26,407 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956414, now seen corresponding path program 1 times [2021-06-10 11:36:26,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942789194] [2021-06-10 11:36:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:26,415 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:26,419 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:26,426 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:26,426 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:26,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2021-06-10 11:36:26,426 WARN L342 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:26,427 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,477 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,482 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,484 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,485 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,486 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,490 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,493 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,496 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,497 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,498 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,499 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of17ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of17ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:26,521 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:26,521 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-06-10 11:36:26,521 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:26,521 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:26,521 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:26,521 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:26,521 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:26,521 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:26,521 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:26,521 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:26,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 463 places, 497 transitions, 1351 flow [2021-06-10 11:36:26,629 INFO L129 PetriNetUnfolder]: 86/649 cut-off events. [2021-06-10 11:36:26,630 INFO L130 PetriNetUnfolder]: For 952/952 co-relation queries the response was YES. [2021-06-10 11:36:26,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 649 events. 86/649 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2652 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 787. Up to 36 conditions per place. [2021-06-10 11:36:26,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 463 places, 497 transitions, 1351 flow [2021-06-10 11:36:26,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 463 places, 497 transitions, 1351 flow [2021-06-10 11:36:26,661 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2021-06-10 11:36:26,661 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:26,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,662 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-06-10 11:36:26,662 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2064366849, now seen corresponding path program 1 times [2021-06-10 11:36:26,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381955340] [2021-06-10 11:36:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:26,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:26,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381955340] [2021-06-10 11:36:26,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368543431] [2021-06-10 11:36:26,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:26,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 497 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:26,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:26,765 INFO L129 PetriNetUnfolder]: 49/512 cut-off events. [2021-06-10 11:36:26,766 INFO L130 PetriNetUnfolder]: For 953/953 co-relation queries the response was YES. [2021-06-10 11:36:26,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 512 events. 49/512 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1960 event pairs, 0 based on Foata normal form. 70/514 useless extension candidates. Maximal degree in co-relation 662. Up to 18 conditions per place. [2021-06-10 11:36:26,784 INFO L132 encePairwiseOnDemand]: 475/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/458 dead transitions. [2021-06-10 11:36:26,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 458 transitions, 1287 flow [2021-06-10 11:36:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2021-06-10 11:36:26,785 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9463447350771295 [2021-06-10 11:36:26,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1411 transitions. [2021-06-10 11:36:26,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1411 transitions. [2021-06-10 11:36:26,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:26,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1411 transitions. [2021-06-10 11:36:26,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 470.3333333333333) internal successors, (1411), 3 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,787 INFO L185 Difference]: Start difference. First operand has 463 places, 497 transitions, 1351 flow. Second operand 3 states and 1411 transitions. [2021-06-10 11:36:26,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 458 transitions, 1287 flow [2021-06-10 11:36:26,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 458 transitions, 1015 flow, removed 136 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:26,792 INFO L241 Difference]: Finished difference. Result has 445 places, 458 transitions, 1013 flow [2021-06-10 11:36:26,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=445, PETRI_TRANSITIONS=458} [2021-06-10 11:36:26,792 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -18 predicate places. [2021-06-10 11:36:26,792 INFO L480 AbstractCegarLoop]: Abstraction has has 445 places, 458 transitions, 1013 flow [2021-06-10 11:36:26,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,792 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,792 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-06-10 11:36:26,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2021-06-10 11:36:26,792 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2065320161, now seen corresponding path program 1 times [2021-06-10 11:36:26,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661178288] [2021-06-10 11:36:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:26,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:26,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661178288] [2021-06-10 11:36:26,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385192436] [2021-06-10 11:36:26,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,804 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:26,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 458 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:26,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:26,899 INFO L129 PetriNetUnfolder]: 49/511 cut-off events. [2021-06-10 11:36:26,899 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:26,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 511 events. 49/511 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1953 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 561. Up to 18 conditions per place. [2021-06-10 11:36:26,917 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 2 changer transitions 0/458 dead transitions. [2021-06-10 11:36:26,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 458 transitions, 1035 flow [2021-06-10 11:36:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:26,918 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:26,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:26,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:26,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:26,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:26,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,920 INFO L185 Difference]: Start difference. First operand has 445 places, 458 transitions, 1013 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:26,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 458 transitions, 1035 flow [2021-06-10 11:36:26,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 458 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:26,924 INFO L241 Difference]: Finished difference. Result has 448 places, 458 transitions, 1023 flow [2021-06-10 11:36:26,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=448, PETRI_TRANSITIONS=458} [2021-06-10 11:36:26,924 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -15 predicate places. [2021-06-10 11:36:26,924 INFO L480 AbstractCegarLoop]: Abstraction has has 448 places, 458 transitions, 1023 flow [2021-06-10 11:36:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:26,924 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-06-10 11:36:26,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2021-06-10 11:36:26,925 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2065319138, now seen corresponding path program 1 times [2021-06-10 11:36:26,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:26,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561621671] [2021-06-10 11:36:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:26,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:26,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:26,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:26,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561621671] [2021-06-10 11:36:26,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:26,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:26,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66475658] [2021-06-10 11:36:26,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:26,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:26,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:26,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 458 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:26,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:26,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:26,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,040 INFO L129 PetriNetUnfolder]: 48/509 cut-off events. [2021-06-10 11:36:27,041 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:27,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 509 events. 48/509 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1944 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 559. Up to 18 conditions per place. [2021-06-10 11:36:27,055 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/456 dead transitions. [2021-06-10 11:36:27,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 456 transitions, 1026 flow [2021-06-10 11:36:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:27,056 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:27,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,058 INFO L185 Difference]: Start difference. First operand has 448 places, 458 transitions, 1023 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:27,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 456 transitions, 1026 flow [2021-06-10 11:36:27,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 456 transitions, 1020 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:36:27,061 INFO L241 Difference]: Finished difference. Result has 448 places, 456 transitions, 1010 flow [2021-06-10 11:36:27,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1010, PETRI_PLACES=448, PETRI_TRANSITIONS=456} [2021-06-10 11:36:27,062 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -15 predicate places. [2021-06-10 11:36:27,062 INFO L480 AbstractCegarLoop]: Abstraction has has 448 places, 456 transitions, 1010 flow [2021-06-10 11:36:27,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,062 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-06-10 11:36:27,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-06-10 11:36:27,062 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2064365826, now seen corresponding path program 1 times [2021-06-10 11:36:27,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574194766] [2021-06-10 11:36:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:27,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:27,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574194766] [2021-06-10 11:36:27,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112320989] [2021-06-10 11:36:27,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:27,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 456 transitions, 1010 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:27,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,162 INFO L129 PetriNetUnfolder]: 48/507 cut-off events. [2021-06-10 11:36:27,163 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 11:36:27,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 507 events. 48/507 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1931 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 565. Up to 18 conditions per place. [2021-06-10 11:36:27,179 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/454 dead transitions. [2021-06-10 11:36:27,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 454 transitions, 1022 flow [2021-06-10 11:36:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:27,180 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:27,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,182 INFO L185 Difference]: Start difference. First operand has 448 places, 456 transitions, 1010 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:27,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 454 transitions, 1022 flow [2021-06-10 11:36:27,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 454 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,186 INFO L241 Difference]: Finished difference. Result has 447 places, 454 transitions, 1005 flow [2021-06-10 11:36:27,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1005, PETRI_PLACES=447, PETRI_TRANSITIONS=454} [2021-06-10 11:36:27,186 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -16 predicate places. [2021-06-10 11:36:27,186 INFO L480 AbstractCegarLoop]: Abstraction has has 447 places, 454 transitions, 1005 flow [2021-06-10 11:36:27,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,187 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2021-06-10 11:36:27,187 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1612405045, now seen corresponding path program 1 times [2021-06-10 11:36:27,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548948867] [2021-06-10 11:36:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:27,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:27,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548948867] [2021-06-10 11:36:27,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211973223] [2021-06-10 11:36:27,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:27,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 454 transitions, 1005 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:27,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,297 INFO L129 PetriNetUnfolder]: 47/515 cut-off events. [2021-06-10 11:36:27,297 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:27,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 515 events. 47/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2001 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 576. Up to 18 conditions per place. [2021-06-10 11:36:27,315 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/456 dead transitions. [2021-06-10 11:36:27,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 456 transitions, 1035 flow [2021-06-10 11:36:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:27,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:27,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:27,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:27,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:27,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,318 INFO L185 Difference]: Start difference. First operand has 447 places, 454 transitions, 1005 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:27,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 456 transitions, 1035 flow [2021-06-10 11:36:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 456 transitions, 1034 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,322 INFO L241 Difference]: Finished difference. Result has 450 places, 456 transitions, 1028 flow [2021-06-10 11:36:27,322 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=450, PETRI_TRANSITIONS=456} [2021-06-10 11:36:27,322 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -13 predicate places. [2021-06-10 11:36:27,323 INFO L480 AbstractCegarLoop]: Abstraction has has 450 places, 456 transitions, 1028 flow [2021-06-10 11:36:27,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,323 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2021-06-10 11:36:27,323 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1612404022, now seen corresponding path program 1 times [2021-06-10 11:36:27,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105047917] [2021-06-10 11:36:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:27,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:27,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105047917] [2021-06-10 11:36:27,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307809055] [2021-06-10 11:36:27,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,335 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:27,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 456 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:27,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,429 INFO L129 PetriNetUnfolder]: 46/513 cut-off events. [2021-06-10 11:36:27,430 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:27,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 513 events. 46/513 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1990 event pairs, 0 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 573. Up to 18 conditions per place. [2021-06-10 11:36:27,448 INFO L132 encePairwiseOnDemand]: 494/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2021-06-10 11:36:27,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 456 transitions, 1040 flow [2021-06-10 11:36:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:27,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:27,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,451 INFO L185 Difference]: Start difference. First operand has 450 places, 456 transitions, 1028 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:27,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 456 transitions, 1040 flow [2021-06-10 11:36:27,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 456 transitions, 1035 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,455 INFO L241 Difference]: Finished difference. Result has 453 places, 456 transitions, 1033 flow [2021-06-10 11:36:27,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2021-06-10 11:36:27,455 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -10 predicate places. [2021-06-10 11:36:27,455 INFO L480 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 1033 flow [2021-06-10 11:36:27,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,456 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2021-06-10 11:36:27,456 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1611451733, now seen corresponding path program 1 times [2021-06-10 11:36:27,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572989130] [2021-06-10 11:36:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:27,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:27,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572989130] [2021-06-10 11:36:27,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829858007] [2021-06-10 11:36:27,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:27,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:27,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,562 INFO L129 PetriNetUnfolder]: 45/509 cut-off events. [2021-06-10 11:36:27,562 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:27,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 509 events. 45/509 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1965 event pairs, 0 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 571. Up to 18 conditions per place. [2021-06-10 11:36:27,580 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2021-06-10 11:36:27,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 1030 flow [2021-06-10 11:36:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:27,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:27,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:27,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,583 INFO L185 Difference]: Start difference. First operand has 453 places, 456 transitions, 1033 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:27,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 1030 flow [2021-06-10 11:36:27,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 453 transitions, 1023 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:27,587 INFO L241 Difference]: Finished difference. Result has 452 places, 453 transitions, 1013 flow [2021-06-10 11:36:27,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=452, PETRI_TRANSITIONS=453} [2021-06-10 11:36:27,587 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -11 predicate places. [2021-06-10 11:36:27,587 INFO L480 AbstractCegarLoop]: Abstraction has has 452 places, 453 transitions, 1013 flow [2021-06-10 11:36:27,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,588 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2021-06-10 11:36:27,588 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1611450710, now seen corresponding path program 1 times [2021-06-10 11:36:27,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170517178] [2021-06-10 11:36:27,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:27,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:27,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170517178] [2021-06-10 11:36:27,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011550177] [2021-06-10 11:36:27,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:27,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 453 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:27,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,693 INFO L129 PetriNetUnfolder]: 45/507 cut-off events. [2021-06-10 11:36:27,693 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:27,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 45/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1949 event pairs, 0 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 572. Up to 18 conditions per place. [2021-06-10 11:36:27,710 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2021-06-10 11:36:27,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 451 transitions, 1026 flow [2021-06-10 11:36:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:27,711 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:27,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:27,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,713 INFO L185 Difference]: Start difference. First operand has 452 places, 453 transitions, 1013 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:27,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 451 transitions, 1026 flow [2021-06-10 11:36:27,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 451 transitions, 1025 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,717 INFO L241 Difference]: Finished difference. Result has 451 places, 451 transitions, 1009 flow [2021-06-10 11:36:27,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=451, PETRI_TRANSITIONS=451} [2021-06-10 11:36:27,717 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -12 predicate places. [2021-06-10 11:36:27,717 INFO L480 AbstractCegarLoop]: Abstraction has has 451 places, 451 transitions, 1009 flow [2021-06-10 11:36:27,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,717 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2021-06-10 11:36:27,717 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 198161909, now seen corresponding path program 1 times [2021-06-10 11:36:27,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877592839] [2021-06-10 11:36:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:27,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:27,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877592839] [2021-06-10 11:36:27,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274256613] [2021-06-10 11:36:27,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:27,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 451 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:27,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,822 INFO L129 PetriNetUnfolder]: 44/514 cut-off events. [2021-06-10 11:36:27,823 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:27,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 514 events. 44/514 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2009 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 577. Up to 18 conditions per place. [2021-06-10 11:36:27,839 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/452 dead transitions. [2021-06-10 11:36:27,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 452 transitions, 1025 flow [2021-06-10 11:36:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:27,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:27,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:27,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,842 INFO L185 Difference]: Start difference. First operand has 451 places, 451 transitions, 1009 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:27,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 452 transitions, 1025 flow [2021-06-10 11:36:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 452 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,846 INFO L241 Difference]: Finished difference. Result has 453 places, 451 transitions, 1013 flow [2021-06-10 11:36:27,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=453, PETRI_TRANSITIONS=451} [2021-06-10 11:36:27,846 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -10 predicate places. [2021-06-10 11:36:27,846 INFO L480 AbstractCegarLoop]: Abstraction has has 453 places, 451 transitions, 1013 flow [2021-06-10 11:36:27,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,847 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2021-06-10 11:36:27,847 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 198162932, now seen corresponding path program 1 times [2021-06-10 11:36:27,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014818919] [2021-06-10 11:36:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:27,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:27,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014818919] [2021-06-10 11:36:27,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527613533] [2021-06-10 11:36:27,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:27,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 451 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:27,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:27,956 INFO L129 PetriNetUnfolder]: 42/516 cut-off events. [2021-06-10 11:36:27,957 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:27,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 516 events. 42/516 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2038 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 588. Up to 18 conditions per place. [2021-06-10 11:36:27,973 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2021-06-10 11:36:27,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 452 transitions, 1039 flow [2021-06-10 11:36:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:27,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:27,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:27,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:27,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:27,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:27,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,976 INFO L185 Difference]: Start difference. First operand has 453 places, 451 transitions, 1013 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:27,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 452 transitions, 1039 flow [2021-06-10 11:36:27,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 452 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:27,980 INFO L241 Difference]: Finished difference. Result has 456 places, 452 transitions, 1030 flow [2021-06-10 11:36:27,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1030, PETRI_PLACES=456, PETRI_TRANSITIONS=452} [2021-06-10 11:36:27,980 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -7 predicate places. [2021-06-10 11:36:27,980 INFO L480 AbstractCegarLoop]: Abstraction has has 456 places, 452 transitions, 1030 flow [2021-06-10 11:36:27,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:27,980 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:27,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2021-06-10 11:36:27,980 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 197209620, now seen corresponding path program 1 times [2021-06-10 11:36:27,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:27,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241841324] [2021-06-10 11:36:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:27,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:27,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:27,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:27,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241841324] [2021-06-10 11:36:27,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:27,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:27,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139954465] [2021-06-10 11:36:27,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:27,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:27,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:27,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 452 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:27,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:27,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:27,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,083 INFO L129 PetriNetUnfolder]: 42/509 cut-off events. [2021-06-10 11:36:28,083 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:28,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 509 events. 42/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1981 event pairs, 0 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 573. Up to 18 conditions per place. [2021-06-10 11:36:28,099 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/450 dead transitions. [2021-06-10 11:36:28,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1032 flow [2021-06-10 11:36:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:28,100 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:28,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,102 INFO L185 Difference]: Start difference. First operand has 456 places, 452 transitions, 1030 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:28,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1032 flow [2021-06-10 11:36:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 450 transitions, 1024 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:28,106 INFO L241 Difference]: Finished difference. Result has 456 places, 450 transitions, 1017 flow [2021-06-10 11:36:28,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=456, PETRI_TRANSITIONS=450} [2021-06-10 11:36:28,106 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -7 predicate places. [2021-06-10 11:36:28,106 INFO L480 AbstractCegarLoop]: Abstraction has has 456 places, 450 transitions, 1017 flow [2021-06-10 11:36:28,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,106 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,106 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2021-06-10 11:36:28,107 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash 197208597, now seen corresponding path program 1 times [2021-06-10 11:36:28,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287181198] [2021-06-10 11:36:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:28,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:28,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287181198] [2021-06-10 11:36:28,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909462200] [2021-06-10 11:36:28,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:28,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 450 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:28,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,212 INFO L129 PetriNetUnfolder]: 42/507 cut-off events. [2021-06-10 11:36:28,212 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:28,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 507 events. 42/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1965 event pairs, 0 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 578. Up to 18 conditions per place. [2021-06-10 11:36:28,228 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2021-06-10 11:36:28,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 448 transitions, 1030 flow [2021-06-10 11:36:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:28,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:28,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,231 INFO L185 Difference]: Start difference. First operand has 456 places, 450 transitions, 1017 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:28,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 448 transitions, 1030 flow [2021-06-10 11:36:28,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 448 transitions, 1029 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:28,235 INFO L241 Difference]: Finished difference. Result has 455 places, 448 transitions, 1013 flow [2021-06-10 11:36:28,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1013, PETRI_PLACES=455, PETRI_TRANSITIONS=448} [2021-06-10 11:36:28,236 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -8 predicate places. [2021-06-10 11:36:28,236 INFO L480 AbstractCegarLoop]: Abstraction has has 455 places, 448 transitions, 1013 flow [2021-06-10 11:36:28,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,236 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2021-06-10 11:36:28,236 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1859768001, now seen corresponding path program 1 times [2021-06-10 11:36:28,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337693352] [2021-06-10 11:36:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:28,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:28,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337693352] [2021-06-10 11:36:28,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933238810] [2021-06-10 11:36:28,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:28,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 448 transitions, 1013 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:28,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,355 INFO L129 PetriNetUnfolder]: 41/515 cut-off events. [2021-06-10 11:36:28,355 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:28,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 515 events. 41/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2037 event pairs, 0 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 590. Up to 18 conditions per place. [2021-06-10 11:36:28,372 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/450 dead transitions. [2021-06-10 11:36:28,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 450 transitions, 1043 flow [2021-06-10 11:36:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:28,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:28,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:28,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:28,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:28,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,374 INFO L185 Difference]: Start difference. First operand has 455 places, 448 transitions, 1013 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:28,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 450 transitions, 1043 flow [2021-06-10 11:36:28,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 450 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:28,379 INFO L241 Difference]: Finished difference. Result has 458 places, 450 transitions, 1036 flow [2021-06-10 11:36:28,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=458, PETRI_TRANSITIONS=450} [2021-06-10 11:36:28,379 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -5 predicate places. [2021-06-10 11:36:28,379 INFO L480 AbstractCegarLoop]: Abstraction has has 458 places, 450 transitions, 1036 flow [2021-06-10 11:36:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,379 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2021-06-10 11:36:28,379 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1859769024, now seen corresponding path program 1 times [2021-06-10 11:36:28,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5399998] [2021-06-10 11:36:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:28,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:28,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5399998] [2021-06-10 11:36:28,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931256575] [2021-06-10 11:36:28,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,391 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:28,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 450 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:28,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,504 INFO L129 PetriNetUnfolder]: 39/516 cut-off events. [2021-06-10 11:36:28,504 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:28,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 516 events. 39/516 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2059 event pairs, 0 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 590. Up to 18 conditions per place. [2021-06-10 11:36:28,517 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/450 dead transitions. [2021-06-10 11:36:28,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 450 transitions, 1048 flow [2021-06-10 11:36:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:28,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:28,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,520 INFO L185 Difference]: Start difference. First operand has 458 places, 450 transitions, 1036 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:28,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 450 transitions, 1048 flow [2021-06-10 11:36:28,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 450 transitions, 1043 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:28,523 INFO L241 Difference]: Finished difference. Result has 460 places, 449 transitions, 1032 flow [2021-06-10 11:36:28,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1032, PETRI_PLACES=460, PETRI_TRANSITIONS=449} [2021-06-10 11:36:28,524 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -3 predicate places. [2021-06-10 11:36:28,524 INFO L480 AbstractCegarLoop]: Abstraction has has 460 places, 449 transitions, 1032 flow [2021-06-10 11:36:28,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,524 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2021-06-10 11:36:28,524 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1860721313, now seen corresponding path program 1 times [2021-06-10 11:36:28,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107264650] [2021-06-10 11:36:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:28,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:28,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107264650] [2021-06-10 11:36:28,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770700123] [2021-06-10 11:36:28,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,539 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:28,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 449 transitions, 1032 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:28,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,631 INFO L129 PetriNetUnfolder]: 39/509 cut-off events. [2021-06-10 11:36:28,631 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:28,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 509 events. 39/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2002 event pairs, 0 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 584. Up to 18 conditions per place. [2021-06-10 11:36:28,648 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/447 dead transitions. [2021-06-10 11:36:28,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 447 transitions, 1035 flow [2021-06-10 11:36:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:28,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:28,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:28,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,652 INFO L185 Difference]: Start difference. First operand has 460 places, 449 transitions, 1032 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:28,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 447 transitions, 1035 flow [2021-06-10 11:36:28,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 447 transitions, 1028 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:28,656 INFO L241 Difference]: Finished difference. Result has 460 places, 447 transitions, 1021 flow [2021-06-10 11:36:28,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=460, PETRI_TRANSITIONS=447} [2021-06-10 11:36:28,656 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -3 predicate places. [2021-06-10 11:36:28,656 INFO L480 AbstractCegarLoop]: Abstraction has has 460 places, 447 transitions, 1021 flow [2021-06-10 11:36:28,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,656 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2021-06-10 11:36:28,656 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1860722336, now seen corresponding path program 1 times [2021-06-10 11:36:28,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632548006] [2021-06-10 11:36:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:28,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:28,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632548006] [2021-06-10 11:36:28,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531210995] [2021-06-10 11:36:28,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:28,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 447 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:28,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,766 INFO L129 PetriNetUnfolder]: 39/507 cut-off events. [2021-06-10 11:36:28,767 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:28,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 507 events. 39/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1984 event pairs, 0 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 584. Up to 18 conditions per place. [2021-06-10 11:36:28,782 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/445 dead transitions. [2021-06-10 11:36:28,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 445 transitions, 1034 flow [2021-06-10 11:36:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:28,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:28,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:28,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,785 INFO L185 Difference]: Start difference. First operand has 460 places, 447 transitions, 1021 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:28,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 445 transitions, 1034 flow [2021-06-10 11:36:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 445 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:28,789 INFO L241 Difference]: Finished difference. Result has 459 places, 445 transitions, 1017 flow [2021-06-10 11:36:28,789 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=459, PETRI_TRANSITIONS=445} [2021-06-10 11:36:28,789 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -4 predicate places. [2021-06-10 11:36:28,789 INFO L480 AbstractCegarLoop]: Abstraction has has 459 places, 445 transitions, 1017 flow [2021-06-10 11:36:28,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,790 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2021-06-10 11:36:28,790 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1687638516, now seen corresponding path program 1 times [2021-06-10 11:36:28,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019159900] [2021-06-10 11:36:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:28,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:28,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019159900] [2021-06-10 11:36:28,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602992032] [2021-06-10 11:36:28,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:28,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 445 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:28,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:28,898 INFO L129 PetriNetUnfolder]: 38/514 cut-off events. [2021-06-10 11:36:28,899 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:28,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 514 events. 38/514 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2043 event pairs, 0 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 589. Up to 18 conditions per place. [2021-06-10 11:36:28,915 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/446 dead transitions. [2021-06-10 11:36:28,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 446 transitions, 1033 flow [2021-06-10 11:36:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:28,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:28,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:28,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:28,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,918 INFO L185 Difference]: Start difference. First operand has 459 places, 445 transitions, 1017 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:28,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 446 transitions, 1033 flow [2021-06-10 11:36:28,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 446 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:28,922 INFO L241 Difference]: Finished difference. Result has 461 places, 445 transitions, 1021 flow [2021-06-10 11:36:28,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=461, PETRI_TRANSITIONS=445} [2021-06-10 11:36:28,922 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, -2 predicate places. [2021-06-10 11:36:28,922 INFO L480 AbstractCegarLoop]: Abstraction has has 461 places, 445 transitions, 1021 flow [2021-06-10 11:36:28,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:28,922 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:28,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2021-06-10 11:36:28,922 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1687637493, now seen corresponding path program 1 times [2021-06-10 11:36:28,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:28,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553061684] [2021-06-10 11:36:28,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:28,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:28,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:28,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:28,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553061684] [2021-06-10 11:36:28,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:28,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:28,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271243009] [2021-06-10 11:36:28,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:28,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:28,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:28,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 445 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:28,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:28,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:28,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,036 INFO L129 PetriNetUnfolder]: 36/516 cut-off events. [2021-06-10 11:36:29,036 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:29,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 516 events. 36/516 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2075 event pairs, 0 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 600. Up to 18 conditions per place. [2021-06-10 11:36:29,052 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 3 changer transitions 0/446 dead transitions. [2021-06-10 11:36:29,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 446 transitions, 1047 flow [2021-06-10 11:36:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:29,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:29,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:29,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:29,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:29,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,055 INFO L185 Difference]: Start difference. First operand has 461 places, 445 transitions, 1021 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:29,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 446 transitions, 1047 flow [2021-06-10 11:36:29,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 446 transitions, 1046 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:29,059 INFO L241 Difference]: Finished difference. Result has 464 places, 446 transitions, 1038 flow [2021-06-10 11:36:29,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=464, PETRI_TRANSITIONS=446} [2021-06-10 11:36:29,059 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 1 predicate places. [2021-06-10 11:36:29,059 INFO L480 AbstractCegarLoop]: Abstraction has has 464 places, 446 transitions, 1038 flow [2021-06-10 11:36:29,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,060 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2021-06-10 11:36:29,060 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1688590805, now seen corresponding path program 1 times [2021-06-10 11:36:29,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772973978] [2021-06-10 11:36:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:29,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:29,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772973978] [2021-06-10 11:36:29,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52538531] [2021-06-10 11:36:29,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,071 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:29,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 446 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:29,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,166 INFO L129 PetriNetUnfolder]: 36/509 cut-off events. [2021-06-10 11:36:29,166 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:29,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 509 events. 36/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2017 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 586. Up to 18 conditions per place. [2021-06-10 11:36:29,182 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2021-06-10 11:36:29,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 444 transitions, 1040 flow [2021-06-10 11:36:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:29,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:29,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,185 INFO L185 Difference]: Start difference. First operand has 464 places, 446 transitions, 1038 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:29,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 444 transitions, 1040 flow [2021-06-10 11:36:29,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 444 transitions, 1032 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:29,189 INFO L241 Difference]: Finished difference. Result has 464 places, 444 transitions, 1025 flow [2021-06-10 11:36:29,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=464, PETRI_TRANSITIONS=444} [2021-06-10 11:36:29,189 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 1 predicate places. [2021-06-10 11:36:29,189 INFO L480 AbstractCegarLoop]: Abstraction has has 464 places, 444 transitions, 1025 flow [2021-06-10 11:36:29,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,189 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,189 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2021-06-10 11:36:29,189 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1688591828, now seen corresponding path program 1 times [2021-06-10 11:36:29,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728608012] [2021-06-10 11:36:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:29,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:29,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728608012] [2021-06-10 11:36:29,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046005344] [2021-06-10 11:36:29,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:29,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 444 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:29,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,298 INFO L129 PetriNetUnfolder]: 36/507 cut-off events. [2021-06-10 11:36:29,298 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:29,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 507 events. 36/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2005 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 590. Up to 18 conditions per place. [2021-06-10 11:36:29,314 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/442 dead transitions. [2021-06-10 11:36:29,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 442 transitions, 1038 flow [2021-06-10 11:36:29,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:29,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:29,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,317 INFO L185 Difference]: Start difference. First operand has 464 places, 444 transitions, 1025 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:29,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 442 transitions, 1038 flow [2021-06-10 11:36:29,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 442 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:29,321 INFO L241 Difference]: Finished difference. Result has 463 places, 442 transitions, 1021 flow [2021-06-10 11:36:29,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=463, PETRI_TRANSITIONS=442} [2021-06-10 11:36:29,321 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 0 predicate places. [2021-06-10 11:36:29,321 INFO L480 AbstractCegarLoop]: Abstraction has has 463 places, 442 transitions, 1021 flow [2021-06-10 11:36:29,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,321 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,321 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2021-06-10 11:36:29,321 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1280606457, now seen corresponding path program 1 times [2021-06-10 11:36:29,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127714194] [2021-06-10 11:36:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:29,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:29,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127714194] [2021-06-10 11:36:29,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572894971] [2021-06-10 11:36:29,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,334 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:29,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 442 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:29,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,437 INFO L129 PetriNetUnfolder]: 35/515 cut-off events. [2021-06-10 11:36:29,437 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:29,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 515 events. 35/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2072 event pairs, 0 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 602. Up to 18 conditions per place. [2021-06-10 11:36:29,454 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2021-06-10 11:36:29,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 444 transitions, 1051 flow [2021-06-10 11:36:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:29,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:29,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:29,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:29,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:29,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,456 INFO L185 Difference]: Start difference. First operand has 463 places, 442 transitions, 1021 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:29,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 444 transitions, 1051 flow [2021-06-10 11:36:29,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 444 transitions, 1050 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:29,460 INFO L241 Difference]: Finished difference. Result has 466 places, 444 transitions, 1044 flow [2021-06-10 11:36:29,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=466, PETRI_TRANSITIONS=444} [2021-06-10 11:36:29,461 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 3 predicate places. [2021-06-10 11:36:29,461 INFO L480 AbstractCegarLoop]: Abstraction has has 466 places, 444 transitions, 1044 flow [2021-06-10 11:36:29,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,461 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2021-06-10 11:36:29,461 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1280607480, now seen corresponding path program 1 times [2021-06-10 11:36:29,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135481329] [2021-06-10 11:36:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:29,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:29,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135481329] [2021-06-10 11:36:29,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854453824] [2021-06-10 11:36:29,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:29,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 444 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:29,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,572 INFO L129 PetriNetUnfolder]: 34/513 cut-off events. [2021-06-10 11:36:29,572 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:29,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 513 events. 34/513 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2064 event pairs, 0 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 599. Up to 18 conditions per place. [2021-06-10 11:36:29,588 INFO L132 encePairwiseOnDemand]: 494/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2021-06-10 11:36:29,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 444 transitions, 1056 flow [2021-06-10 11:36:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:29,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:29,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:29,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:29,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:29,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,591 INFO L185 Difference]: Start difference. First operand has 466 places, 444 transitions, 1044 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:29,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 444 transitions, 1056 flow [2021-06-10 11:36:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 444 transitions, 1051 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:29,595 INFO L241 Difference]: Finished difference. Result has 469 places, 444 transitions, 1049 flow [2021-06-10 11:36:29,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=469, PETRI_TRANSITIONS=444} [2021-06-10 11:36:29,595 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 6 predicate places. [2021-06-10 11:36:29,595 INFO L480 AbstractCegarLoop]: Abstraction has has 469 places, 444 transitions, 1049 flow [2021-06-10 11:36:29,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,596 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2021-06-10 11:36:29,596 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1281559769, now seen corresponding path program 1 times [2021-06-10 11:36:29,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704279384] [2021-06-10 11:36:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:29,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:29,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704279384] [2021-06-10 11:36:29,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565245283] [2021-06-10 11:36:29,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:29,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 444 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:29,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,708 INFO L129 PetriNetUnfolder]: 33/509 cut-off events. [2021-06-10 11:36:29,708 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:29,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 509 events. 33/509 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2036 event pairs, 0 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 596. Up to 18 conditions per place. [2021-06-10 11:36:29,724 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/441 dead transitions. [2021-06-10 11:36:29,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 441 transitions, 1046 flow [2021-06-10 11:36:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:29,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:29,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:29,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,727 INFO L185 Difference]: Start difference. First operand has 469 places, 444 transitions, 1049 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:29,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 441 transitions, 1046 flow [2021-06-10 11:36:29,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 441 transitions, 1039 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:29,731 INFO L241 Difference]: Finished difference. Result has 468 places, 441 transitions, 1029 flow [2021-06-10 11:36:29,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=468, PETRI_TRANSITIONS=441} [2021-06-10 11:36:29,731 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 5 predicate places. [2021-06-10 11:36:29,731 INFO L480 AbstractCegarLoop]: Abstraction has has 468 places, 441 transitions, 1029 flow [2021-06-10 11:36:29,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,731 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2021-06-10 11:36:29,731 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1281560792, now seen corresponding path program 1 times [2021-06-10 11:36:29,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450793100] [2021-06-10 11:36:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:29,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:29,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450793100] [2021-06-10 11:36:29,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130352877] [2021-06-10 11:36:29,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:29,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 441 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:29,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,843 INFO L129 PetriNetUnfolder]: 33/507 cut-off events. [2021-06-10 11:36:29,844 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:29,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 507 events. 33/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2022 event pairs, 0 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 597. Up to 18 conditions per place. [2021-06-10 11:36:29,859 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2021-06-10 11:36:29,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 439 transitions, 1042 flow [2021-06-10 11:36:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:29,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:29,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:29,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:29,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,862 INFO L185 Difference]: Start difference. First operand has 468 places, 441 transitions, 1029 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:29,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 439 transitions, 1042 flow [2021-06-10 11:36:29,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 439 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:29,865 INFO L241 Difference]: Finished difference. Result has 467 places, 439 transitions, 1025 flow [2021-06-10 11:36:29,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=467, PETRI_TRANSITIONS=439} [2021-06-10 11:36:29,866 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 4 predicate places. [2021-06-10 11:36:29,866 INFO L480 AbstractCegarLoop]: Abstraction has has 467 places, 439 transitions, 1025 flow [2021-06-10 11:36:29,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:29,866 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:29,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2021-06-10 11:36:29,866 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1872077274, now seen corresponding path program 1 times [2021-06-10 11:36:29,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:29,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107314933] [2021-06-10 11:36:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:29,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:29,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:29,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:29,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107314933] [2021-06-10 11:36:29,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:29,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:29,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571377166] [2021-06-10 11:36:29,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:29,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:29,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:29,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 439 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:29,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:29,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:29,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:29,990 INFO L129 PetriNetUnfolder]: 32/515 cut-off events. [2021-06-10 11:36:29,991 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:30,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 515 events. 32/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2090 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 609. Up to 18 conditions per place. [2021-06-10 11:36:30,009 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/441 dead transitions. [2021-06-10 11:36:30,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 441 transitions, 1055 flow [2021-06-10 11:36:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:30,010 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:30,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:30,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:30,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:30,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,012 INFO L185 Difference]: Start difference. First operand has 467 places, 439 transitions, 1025 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:30,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 441 transitions, 1055 flow [2021-06-10 11:36:30,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 441 transitions, 1054 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:30,016 INFO L241 Difference]: Finished difference. Result has 470 places, 441 transitions, 1048 flow [2021-06-10 11:36:30,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=470, PETRI_TRANSITIONS=441} [2021-06-10 11:36:30,016 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 7 predicate places. [2021-06-10 11:36:30,017 INFO L480 AbstractCegarLoop]: Abstraction has has 470 places, 441 transitions, 1048 flow [2021-06-10 11:36:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,017 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2021-06-10 11:36:30,017 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1872078297, now seen corresponding path program 1 times [2021-06-10 11:36:30,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315859178] [2021-06-10 11:36:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:30,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:30,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315859178] [2021-06-10 11:36:30,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058344078] [2021-06-10 11:36:30,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:30,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 441 transitions, 1048 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:30,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,143 INFO L129 PetriNetUnfolder]: 30/516 cut-off events. [2021-06-10 11:36:30,143 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:30,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 516 events. 30/516 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2114 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 609. Up to 18 conditions per place. [2021-06-10 11:36:30,159 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/441 dead transitions. [2021-06-10 11:36:30,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 441 transitions, 1060 flow [2021-06-10 11:36:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:30,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:30,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,161 INFO L185 Difference]: Start difference. First operand has 470 places, 441 transitions, 1048 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:30,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 441 transitions, 1060 flow [2021-06-10 11:36:30,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 441 transitions, 1055 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:30,165 INFO L241 Difference]: Finished difference. Result has 472 places, 440 transitions, 1044 flow [2021-06-10 11:36:30,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=472, PETRI_TRANSITIONS=440} [2021-06-10 11:36:30,165 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 9 predicate places. [2021-06-10 11:36:30,166 INFO L480 AbstractCegarLoop]: Abstraction has has 472 places, 440 transitions, 1044 flow [2021-06-10 11:36:30,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,166 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2021-06-10 11:36:30,166 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1873030586, now seen corresponding path program 1 times [2021-06-10 11:36:30,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493113375] [2021-06-10 11:36:30,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:30,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:30,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493113375] [2021-06-10 11:36:30,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010418088] [2021-06-10 11:36:30,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:30,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 440 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:30,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,277 INFO L129 PetriNetUnfolder]: 30/509 cut-off events. [2021-06-10 11:36:30,277 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:30,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 30/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2050 event pairs, 0 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 603. Up to 18 conditions per place. [2021-06-10 11:36:30,292 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2021-06-10 11:36:30,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 438 transitions, 1047 flow [2021-06-10 11:36:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:30,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:30,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,295 INFO L185 Difference]: Start difference. First operand has 472 places, 440 transitions, 1044 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 438 transitions, 1047 flow [2021-06-10 11:36:30,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 438 transitions, 1040 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:30,299 INFO L241 Difference]: Finished difference. Result has 472 places, 438 transitions, 1033 flow [2021-06-10 11:36:30,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=472, PETRI_TRANSITIONS=438} [2021-06-10 11:36:30,299 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 9 predicate places. [2021-06-10 11:36:30,299 INFO L480 AbstractCegarLoop]: Abstraction has has 472 places, 438 transitions, 1033 flow [2021-06-10 11:36:30,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,300 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2021-06-10 11:36:30,300 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1873031609, now seen corresponding path program 1 times [2021-06-10 11:36:30,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852479029] [2021-06-10 11:36:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:30,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:30,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852479029] [2021-06-10 11:36:30,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418696451] [2021-06-10 11:36:30,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:30,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 438 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:30,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,413 INFO L129 PetriNetUnfolder]: 30/507 cut-off events. [2021-06-10 11:36:30,413 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:30,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 507 events. 30/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2036 event pairs, 0 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 603. Up to 18 conditions per place. [2021-06-10 11:36:30,428 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/436 dead transitions. [2021-06-10 11:36:30,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 436 transitions, 1046 flow [2021-06-10 11:36:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:30,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:30,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:30,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:30,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:30,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,431 INFO L185 Difference]: Start difference. First operand has 472 places, 438 transitions, 1033 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:30,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 436 transitions, 1046 flow [2021-06-10 11:36:30,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 436 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:30,435 INFO L241 Difference]: Finished difference. Result has 471 places, 436 transitions, 1029 flow [2021-06-10 11:36:30,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=471, PETRI_TRANSITIONS=436} [2021-06-10 11:36:30,435 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 8 predicate places. [2021-06-10 11:36:30,435 INFO L480 AbstractCegarLoop]: Abstraction has has 471 places, 436 transitions, 1029 flow [2021-06-10 11:36:30,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,436 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2021-06-10 11:36:30,436 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1962033259, now seen corresponding path program 1 times [2021-06-10 11:36:30,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045001674] [2021-06-10 11:36:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:30,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:30,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045001674] [2021-06-10 11:36:30,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949165614] [2021-06-10 11:36:30,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:30,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 436 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:30,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,559 INFO L129 PetriNetUnfolder]: 28/512 cut-off events. [2021-06-10 11:36:30,560 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:30,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 512 events. 28/512 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2090 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 606. Up to 18 conditions per place. [2021-06-10 11:36:30,576 INFO L132 encePairwiseOnDemand]: 494/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2021-06-10 11:36:30,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 437 transitions, 1045 flow [2021-06-10 11:36:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:30,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:30,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:30,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,578 INFO L185 Difference]: Start difference. First operand has 471 places, 436 transitions, 1029 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:30,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 437 transitions, 1045 flow [2021-06-10 11:36:30,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 437 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:30,583 INFO L241 Difference]: Finished difference. Result has 474 places, 437 transitions, 1042 flow [2021-06-10 11:36:30,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=474, PETRI_TRANSITIONS=437} [2021-06-10 11:36:30,583 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 11 predicate places. [2021-06-10 11:36:30,583 INFO L480 AbstractCegarLoop]: Abstraction has has 474 places, 437 transitions, 1042 flow [2021-06-10 11:36:30,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,583 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2021-06-10 11:36:30,583 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1962034282, now seen corresponding path program 1 times [2021-06-10 11:36:30,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135807473] [2021-06-10 11:36:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:30,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:30,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135807473] [2021-06-10 11:36:30,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430994997] [2021-06-10 11:36:30,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:30,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 437 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:30,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,706 INFO L129 PetriNetUnfolder]: 28/513 cut-off events. [2021-06-10 11:36:30,707 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:30,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 513 events. 28/513 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2099 event pairs, 0 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 614. Up to 18 conditions per place. [2021-06-10 11:36:30,724 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 3 changer transitions 0/438 dead transitions. [2021-06-10 11:36:30,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 438 transitions, 1068 flow [2021-06-10 11:36:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:30,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:30,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:30,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:30,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:30,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,727 INFO L185 Difference]: Start difference. First operand has 474 places, 437 transitions, 1042 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:30,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 438 transitions, 1068 flow [2021-06-10 11:36:30,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 438 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:30,731 INFO L241 Difference]: Finished difference. Result has 477 places, 438 transitions, 1058 flow [2021-06-10 11:36:30,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=477, PETRI_TRANSITIONS=438} [2021-06-10 11:36:30,731 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 14 predicate places. [2021-06-10 11:36:30,731 INFO L480 AbstractCegarLoop]: Abstraction has has 477 places, 438 transitions, 1058 flow [2021-06-10 11:36:30,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,732 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2021-06-10 11:36:30,732 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1961080970, now seen corresponding path program 1 times [2021-06-10 11:36:30,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118903682] [2021-06-10 11:36:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:30,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:30,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118903682] [2021-06-10 11:36:30,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554179773] [2021-06-10 11:36:30,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,748 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:30,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 438 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:30,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,851 INFO L129 PetriNetUnfolder]: 27/509 cut-off events. [2021-06-10 11:36:30,851 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:30,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 509 events. 27/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2071 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 607. Up to 18 conditions per place. [2021-06-10 11:36:30,867 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2021-06-10 11:36:30,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 435 transitions, 1055 flow [2021-06-10 11:36:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:30,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:30,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:30,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:30,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,870 INFO L185 Difference]: Start difference. First operand has 477 places, 438 transitions, 1058 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:30,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 435 transitions, 1055 flow [2021-06-10 11:36:30,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 435 transitions, 1047 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:30,874 INFO L241 Difference]: Finished difference. Result has 476 places, 435 transitions, 1037 flow [2021-06-10 11:36:30,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=476, PETRI_TRANSITIONS=435} [2021-06-10 11:36:30,874 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 13 predicate places. [2021-06-10 11:36:30,874 INFO L480 AbstractCegarLoop]: Abstraction has has 476 places, 435 transitions, 1037 flow [2021-06-10 11:36:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:30,875 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:30,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2021-06-10 11:36:30,875 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1961079947, now seen corresponding path program 1 times [2021-06-10 11:36:30,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:30,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554330155] [2021-06-10 11:36:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:30,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:30,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:30,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:30,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554330155] [2021-06-10 11:36:30,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:30,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:30,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598179583] [2021-06-10 11:36:30,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:30,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:30,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:30,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 435 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:30,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:30,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:30,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:30,990 INFO L129 PetriNetUnfolder]: 27/507 cut-off events. [2021-06-10 11:36:30,990 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:31,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 507 events. 27/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2054 event pairs, 0 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 610. Up to 18 conditions per place. [2021-06-10 11:36:31,005 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/433 dead transitions. [2021-06-10 11:36:31,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 433 transitions, 1050 flow [2021-06-10 11:36:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:31,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:31,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,007 INFO L185 Difference]: Start difference. First operand has 476 places, 435 transitions, 1037 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:31,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 433 transitions, 1050 flow [2021-06-10 11:36:31,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 433 transitions, 1049 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,011 INFO L241 Difference]: Finished difference. Result has 475 places, 433 transitions, 1033 flow [2021-06-10 11:36:31,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=475, PETRI_TRANSITIONS=433} [2021-06-10 11:36:31,012 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 12 predicate places. [2021-06-10 11:36:31,012 INFO L480 AbstractCegarLoop]: Abstraction has has 475 places, 433 transitions, 1033 flow [2021-06-10 11:36:31,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,012 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2021-06-10 11:36:31,012 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash -60370843, now seen corresponding path program 1 times [2021-06-10 11:36:31,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581717567] [2021-06-10 11:36:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:31,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:31,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581717567] [2021-06-10 11:36:31,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411616233] [2021-06-10 11:36:31,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:31,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 433 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:31,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,126 INFO L129 PetriNetUnfolder]: 25/512 cut-off events. [2021-06-10 11:36:31,126 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:31,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 512 events. 25/512 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2106 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 613. Up to 18 conditions per place. [2021-06-10 11:36:31,141 INFO L132 encePairwiseOnDemand]: 494/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2021-06-10 11:36:31,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 434 transitions, 1049 flow [2021-06-10 11:36:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:31,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:31,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,144 INFO L185 Difference]: Start difference. First operand has 475 places, 433 transitions, 1033 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:31,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 434 transitions, 1049 flow [2021-06-10 11:36:31,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 434 transitions, 1048 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,148 INFO L241 Difference]: Finished difference. Result has 478 places, 434 transitions, 1046 flow [2021-06-10 11:36:31,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=478, PETRI_TRANSITIONS=434} [2021-06-10 11:36:31,148 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 15 predicate places. [2021-06-10 11:36:31,148 INFO L480 AbstractCegarLoop]: Abstraction has has 478 places, 434 transitions, 1046 flow [2021-06-10 11:36:31,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,148 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-06-10 11:36:31,148 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -60371866, now seen corresponding path program 1 times [2021-06-10 11:36:31,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204899781] [2021-06-10 11:36:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:31,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:31,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204899781] [2021-06-10 11:36:31,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500956863] [2021-06-10 11:36:31,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,161 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:31,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 434 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:31,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,269 INFO L129 PetriNetUnfolder]: 25/513 cut-off events. [2021-06-10 11:36:31,270 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:31,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 513 events. 25/513 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2116 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 621. Up to 18 conditions per place. [2021-06-10 11:36:31,285 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 3 changer transitions 0/435 dead transitions. [2021-06-10 11:36:31,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 435 transitions, 1072 flow [2021-06-10 11:36:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:31,286 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:31,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:31,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:31,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:31,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,288 INFO L185 Difference]: Start difference. First operand has 478 places, 434 transitions, 1046 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 435 transitions, 1072 flow [2021-06-10 11:36:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,292 INFO L241 Difference]: Finished difference. Result has 481 places, 435 transitions, 1062 flow [2021-06-10 11:36:31,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=481, PETRI_TRANSITIONS=435} [2021-06-10 11:36:31,293 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 18 predicate places. [2021-06-10 11:36:31,293 INFO L480 AbstractCegarLoop]: Abstraction has has 481 places, 435 transitions, 1062 flow [2021-06-10 11:36:31,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,293 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2021-06-10 11:36:31,293 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash -59418554, now seen corresponding path program 1 times [2021-06-10 11:36:31,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453934871] [2021-06-10 11:36:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:31,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:31,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453934871] [2021-06-10 11:36:31,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517003533] [2021-06-10 11:36:31,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:31,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 435 transitions, 1062 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:31,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,420 INFO L129 PetriNetUnfolder]: 24/509 cut-off events. [2021-06-10 11:36:31,420 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:31,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 509 events. 24/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2087 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 614. Up to 18 conditions per place. [2021-06-10 11:36:31,434 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/432 dead transitions. [2021-06-10 11:36:31,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 432 transitions, 1059 flow [2021-06-10 11:36:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:31,435 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:31,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:31,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:31,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:31,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,437 INFO L185 Difference]: Start difference. First operand has 481 places, 435 transitions, 1062 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:31,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 432 transitions, 1059 flow [2021-06-10 11:36:31,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 432 transitions, 1051 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:31,441 INFO L241 Difference]: Finished difference. Result has 480 places, 432 transitions, 1041 flow [2021-06-10 11:36:31,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=480, PETRI_TRANSITIONS=432} [2021-06-10 11:36:31,441 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 17 predicate places. [2021-06-10 11:36:31,441 INFO L480 AbstractCegarLoop]: Abstraction has has 480 places, 432 transitions, 1041 flow [2021-06-10 11:36:31,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,441 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2021-06-10 11:36:31,441 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash -59417531, now seen corresponding path program 1 times [2021-06-10 11:36:31,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747273665] [2021-06-10 11:36:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:31,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:31,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747273665] [2021-06-10 11:36:31,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339639161] [2021-06-10 11:36:31,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,454 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:31,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 432 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:31,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,558 INFO L129 PetriNetUnfolder]: 24/507 cut-off events. [2021-06-10 11:36:31,558 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:31,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 507 events. 24/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2077 event pairs, 0 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 617. Up to 18 conditions per place. [2021-06-10 11:36:31,573 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2021-06-10 11:36:31,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 430 transitions, 1054 flow [2021-06-10 11:36:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:31,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:31,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:31,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,576 INFO L185 Difference]: Start difference. First operand has 480 places, 432 transitions, 1041 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 430 transitions, 1054 flow [2021-06-10 11:36:31,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 430 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,580 INFO L241 Difference]: Finished difference. Result has 479 places, 430 transitions, 1037 flow [2021-06-10 11:36:31,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=479, PETRI_TRANSITIONS=430} [2021-06-10 11:36:31,580 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 16 predicate places. [2021-06-10 11:36:31,580 INFO L480 AbstractCegarLoop]: Abstraction has has 479 places, 430 transitions, 1037 flow [2021-06-10 11:36:31,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,580 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2021-06-10 11:36:31,580 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,581 INFO L82 PathProgramCache]: Analyzing trace with hash 897713174, now seen corresponding path program 1 times [2021-06-10 11:36:31,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945848718] [2021-06-10 11:36:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:31,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:31,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945848718] [2021-06-10 11:36:31,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9272199] [2021-06-10 11:36:31,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:31,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 430 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:31,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,706 INFO L129 PetriNetUnfolder]: 23/515 cut-off events. [2021-06-10 11:36:31,707 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:31,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 515 events. 23/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2143 event pairs, 0 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 629. Up to 18 conditions per place. [2021-06-10 11:36:31,723 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2021-06-10 11:36:31,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 432 transitions, 1067 flow [2021-06-10 11:36:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:31,724 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:31,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:31,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:31,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:31,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,725 INFO L185 Difference]: Start difference. First operand has 479 places, 430 transitions, 1037 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 432 transitions, 1067 flow [2021-06-10 11:36:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 432 transitions, 1066 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,730 INFO L241 Difference]: Finished difference. Result has 482 places, 432 transitions, 1060 flow [2021-06-10 11:36:31,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=482, PETRI_TRANSITIONS=432} [2021-06-10 11:36:31,730 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 19 predicate places. [2021-06-10 11:36:31,730 INFO L480 AbstractCegarLoop]: Abstraction has has 482 places, 432 transitions, 1060 flow [2021-06-10 11:36:31,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,730 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2021-06-10 11:36:31,730 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash 897712151, now seen corresponding path program 1 times [2021-06-10 11:36:31,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455823789] [2021-06-10 11:36:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:31,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:31,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455823789] [2021-06-10 11:36:31,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996484546] [2021-06-10 11:36:31,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:31,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 432 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:31,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:31,853 INFO L129 PetriNetUnfolder]: 21/516 cut-off events. [2021-06-10 11:36:31,853 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:31,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 516 events. 21/516 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2170 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 629. Up to 18 conditions per place. [2021-06-10 11:36:31,869 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/432 dead transitions. [2021-06-10 11:36:31,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 432 transitions, 1072 flow [2021-06-10 11:36:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:31,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:31,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:31,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:31,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,872 INFO L185 Difference]: Start difference. First operand has 482 places, 432 transitions, 1060 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:31,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 432 transitions, 1072 flow [2021-06-10 11:36:31,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 432 transitions, 1067 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:31,877 INFO L241 Difference]: Finished difference. Result has 484 places, 431 transitions, 1056 flow [2021-06-10 11:36:31,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=484, PETRI_TRANSITIONS=431} [2021-06-10 11:36:31,877 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 21 predicate places. [2021-06-10 11:36:31,877 INFO L480 AbstractCegarLoop]: Abstraction has has 484 places, 431 transitions, 1056 flow [2021-06-10 11:36:31,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:31,877 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:31,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2021-06-10 11:36:31,877 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash 896759862, now seen corresponding path program 1 times [2021-06-10 11:36:31,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:31,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530310738] [2021-06-10 11:36:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:31,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:31,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:31,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:31,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530310738] [2021-06-10 11:36:31,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:31,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:31,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017449085] [2021-06-10 11:36:31,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:31,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:31,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:31,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:31,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:31,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 431 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:31,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:31,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:31,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,002 INFO L129 PetriNetUnfolder]: 21/509 cut-off events. [2021-06-10 11:36:32,002 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:32,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 509 events. 21/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2108 event pairs, 0 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 623. Up to 18 conditions per place. [2021-06-10 11:36:32,018 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/429 dead transitions. [2021-06-10 11:36:32,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 429 transitions, 1059 flow [2021-06-10 11:36:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:32,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:32,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,021 INFO L185 Difference]: Start difference. First operand has 484 places, 431 transitions, 1056 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 429 transitions, 1059 flow [2021-06-10 11:36:32,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 429 transitions, 1052 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:32,025 INFO L241 Difference]: Finished difference. Result has 484 places, 429 transitions, 1045 flow [2021-06-10 11:36:32,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=484, PETRI_TRANSITIONS=429} [2021-06-10 11:36:32,026 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 21 predicate places. [2021-06-10 11:36:32,026 INFO L480 AbstractCegarLoop]: Abstraction has has 484 places, 429 transitions, 1045 flow [2021-06-10 11:36:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,026 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,026 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2021-06-10 11:36:32,026 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 896758839, now seen corresponding path program 1 times [2021-06-10 11:36:32,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275963694] [2021-06-10 11:36:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:32,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:32,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275963694] [2021-06-10 11:36:32,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926104691] [2021-06-10 11:36:32,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:32,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 429 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:32,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,151 INFO L129 PetriNetUnfolder]: 21/507 cut-off events. [2021-06-10 11:36:32,151 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:32,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 507 events. 21/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2091 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 623. Up to 18 conditions per place. [2021-06-10 11:36:32,167 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/427 dead transitions. [2021-06-10 11:36:32,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 427 transitions, 1058 flow [2021-06-10 11:36:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:32,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:32,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,170 INFO L185 Difference]: Start difference. First operand has 484 places, 429 transitions, 1045 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 427 transitions, 1058 flow [2021-06-10 11:36:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 427 transitions, 1057 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:32,174 INFO L241 Difference]: Finished difference. Result has 483 places, 427 transitions, 1041 flow [2021-06-10 11:36:32,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=483, PETRI_TRANSITIONS=427} [2021-06-10 11:36:32,174 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 20 predicate places. [2021-06-10 11:36:32,174 INFO L480 AbstractCegarLoop]: Abstraction has has 483 places, 427 transitions, 1041 flow [2021-06-10 11:36:32,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,175 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,175 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2021-06-10 11:36:32,175 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash -371616920, now seen corresponding path program 1 times [2021-06-10 11:36:32,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678120090] [2021-06-10 11:36:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:32,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:32,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678120090] [2021-06-10 11:36:32,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968793845] [2021-06-10 11:36:32,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:32,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 427 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:32,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,319 INFO L129 PetriNetUnfolder]: 20/515 cut-off events. [2021-06-10 11:36:32,319 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:32,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 515 events. 20/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2164 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 635. Up to 18 conditions per place. [2021-06-10 11:36:32,335 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/429 dead transitions. [2021-06-10 11:36:32,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 429 transitions, 1071 flow [2021-06-10 11:36:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:32,336 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:32,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:32,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:32,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:32,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,338 INFO L185 Difference]: Start difference. First operand has 483 places, 427 transitions, 1041 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:32,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 429 transitions, 1071 flow [2021-06-10 11:36:32,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 429 transitions, 1070 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:32,342 INFO L241 Difference]: Finished difference. Result has 486 places, 429 transitions, 1064 flow [2021-06-10 11:36:32,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=486, PETRI_TRANSITIONS=429} [2021-06-10 11:36:32,343 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 23 predicate places. [2021-06-10 11:36:32,343 INFO L480 AbstractCegarLoop]: Abstraction has has 486 places, 429 transitions, 1064 flow [2021-06-10 11:36:32,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,343 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2021-06-10 11:36:32,343 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash -371617943, now seen corresponding path program 1 times [2021-06-10 11:36:32,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863594083] [2021-06-10 11:36:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:32,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:32,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863594083] [2021-06-10 11:36:32,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026854254] [2021-06-10 11:36:32,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:32,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 429 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:32,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,468 INFO L129 PetriNetUnfolder]: 18/516 cut-off events. [2021-06-10 11:36:32,469 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:32,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 516 events. 18/516 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2187 event pairs, 0 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 635. Up to 18 conditions per place. [2021-06-10 11:36:32,485 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/429 dead transitions. [2021-06-10 11:36:32,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 429 transitions, 1076 flow [2021-06-10 11:36:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:32,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:32,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,487 INFO L185 Difference]: Start difference. First operand has 486 places, 429 transitions, 1064 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:32,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 429 transitions, 1076 flow [2021-06-10 11:36:32,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 429 transitions, 1071 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:32,492 INFO L241 Difference]: Finished difference. Result has 488 places, 428 transitions, 1060 flow [2021-06-10 11:36:32,492 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=488, PETRI_TRANSITIONS=428} [2021-06-10 11:36:32,492 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 25 predicate places. [2021-06-10 11:36:32,492 INFO L480 AbstractCegarLoop]: Abstraction has has 488 places, 428 transitions, 1060 flow [2021-06-10 11:36:32,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,492 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2021-06-10 11:36:32,492 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -372570232, now seen corresponding path program 1 times [2021-06-10 11:36:32,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816423657] [2021-06-10 11:36:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:32,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:32,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816423657] [2021-06-10 11:36:32,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810917055] [2021-06-10 11:36:32,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:32,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 428 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:32,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,612 INFO L129 PetriNetUnfolder]: 18/509 cut-off events. [2021-06-10 11:36:32,613 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:32,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 509 events. 18/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2125 event pairs, 0 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 629. Up to 18 conditions per place. [2021-06-10 11:36:32,628 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2021-06-10 11:36:32,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 426 transitions, 1063 flow [2021-06-10 11:36:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:32,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:32,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:32,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,631 INFO L185 Difference]: Start difference. First operand has 488 places, 428 transitions, 1060 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:32,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 426 transitions, 1063 flow [2021-06-10 11:36:32,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 426 transitions, 1056 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:32,635 INFO L241 Difference]: Finished difference. Result has 488 places, 426 transitions, 1049 flow [2021-06-10 11:36:32,635 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=488, PETRI_TRANSITIONS=426} [2021-06-10 11:36:32,635 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 25 predicate places. [2021-06-10 11:36:32,635 INFO L480 AbstractCegarLoop]: Abstraction has has 488 places, 426 transitions, 1049 flow [2021-06-10 11:36:32,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,636 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2021-06-10 11:36:32,636 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash -372571255, now seen corresponding path program 1 times [2021-06-10 11:36:32,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349222523] [2021-06-10 11:36:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:32,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:32,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349222523] [2021-06-10 11:36:32,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853052312] [2021-06-10 11:36:32,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:32,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 426 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:32,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,757 INFO L129 PetriNetUnfolder]: 18/507 cut-off events. [2021-06-10 11:36:32,758 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:32,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 507 events. 18/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2111 event pairs, 0 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 629. Up to 18 conditions per place. [2021-06-10 11:36:32,772 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/424 dead transitions. [2021-06-10 11:36:32,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 424 transitions, 1062 flow [2021-06-10 11:36:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:32,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:32,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:32,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,775 INFO L185 Difference]: Start difference. First operand has 488 places, 426 transitions, 1049 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:32,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 424 transitions, 1062 flow [2021-06-10 11:36:32,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 424 transitions, 1061 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:32,779 INFO L241 Difference]: Finished difference. Result has 487 places, 424 transitions, 1045 flow [2021-06-10 11:36:32,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=487, PETRI_TRANSITIONS=424} [2021-06-10 11:36:32,779 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 24 predicate places. [2021-06-10 11:36:32,779 INFO L480 AbstractCegarLoop]: Abstraction has has 487 places, 424 transitions, 1045 flow [2021-06-10 11:36:32,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,780 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2021-06-10 11:36:32,780 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -815220036, now seen corresponding path program 1 times [2021-06-10 11:36:32,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917288792] [2021-06-10 11:36:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:32,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:32,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917288792] [2021-06-10 11:36:32,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941693090] [2021-06-10 11:36:32,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:32,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 424 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:32,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:32,924 INFO L129 PetriNetUnfolder]: 17/514 cut-off events. [2021-06-10 11:36:32,924 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:32,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 514 events. 17/514 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2170 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 634. Up to 18 conditions per place. [2021-06-10 11:36:32,939 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 6 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2021-06-10 11:36:32,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 425 transitions, 1061 flow [2021-06-10 11:36:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:32,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:32,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:32,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:32,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,942 INFO L185 Difference]: Start difference. First operand has 487 places, 424 transitions, 1045 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:32,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 425 transitions, 1061 flow [2021-06-10 11:36:32,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 425 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:32,946 INFO L241 Difference]: Finished difference. Result has 489 places, 424 transitions, 1049 flow [2021-06-10 11:36:32,946 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=489, PETRI_TRANSITIONS=424} [2021-06-10 11:36:32,946 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 26 predicate places. [2021-06-10 11:36:32,946 INFO L480 AbstractCegarLoop]: Abstraction has has 489 places, 424 transitions, 1049 flow [2021-06-10 11:36:32,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:32,946 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:32,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2021-06-10 11:36:32,947 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -815219013, now seen corresponding path program 1 times [2021-06-10 11:36:32,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:32,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381278128] [2021-06-10 11:36:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:32,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:32,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:32,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:32,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381278128] [2021-06-10 11:36:32,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:32,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:32,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739869421] [2021-06-10 11:36:32,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:32,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:32,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:32,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 424 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:32,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:32,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:32,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,075 INFO L129 PetriNetUnfolder]: 15/516 cut-off events. [2021-06-10 11:36:33,075 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:33,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 516 events. 15/516 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2205 event pairs, 0 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 645. Up to 18 conditions per place. [2021-06-10 11:36:33,090 INFO L132 encePairwiseOnDemand]: 493/497 looper letters, 9 selfloop transitions, 3 changer transitions 0/425 dead transitions. [2021-06-10 11:36:33,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 425 transitions, 1075 flow [2021-06-10 11:36:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2021-06-10 11:36:33,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9141515761234071 [2021-06-10 11:36:33,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2021-06-10 11:36:33,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2021-06-10 11:36:33,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2021-06-10 11:36:33,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,093 INFO L185 Difference]: Start difference. First operand has 489 places, 424 transitions, 1049 flow. Second operand 3 states and 1363 transitions. [2021-06-10 11:36:33,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 425 transitions, 1075 flow [2021-06-10 11:36:33,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 425 transitions, 1074 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:33,097 INFO L241 Difference]: Finished difference. Result has 492 places, 425 transitions, 1066 flow [2021-06-10 11:36:33,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=492, PETRI_TRANSITIONS=425} [2021-06-10 11:36:33,097 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 29 predicate places. [2021-06-10 11:36:33,097 INFO L480 AbstractCegarLoop]: Abstraction has has 492 places, 425 transitions, 1066 flow [2021-06-10 11:36:33,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,098 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2021-06-10 11:36:33,098 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -816172325, now seen corresponding path program 1 times [2021-06-10 11:36:33,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079172704] [2021-06-10 11:36:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:33,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:33,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079172704] [2021-06-10 11:36:33,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580992879] [2021-06-10 11:36:33,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:33,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 425 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:33,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,222 INFO L129 PetriNetUnfolder]: 15/509 cut-off events. [2021-06-10 11:36:33,222 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:33,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 509 events. 15/509 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2144 event pairs, 0 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 631. Up to 18 conditions per place. [2021-06-10 11:36:33,237 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/423 dead transitions. [2021-06-10 11:36:33,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 423 transitions, 1068 flow [2021-06-10 11:36:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:33,238 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:33,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,240 INFO L185 Difference]: Start difference. First operand has 492 places, 425 transitions, 1066 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 423 transitions, 1068 flow [2021-06-10 11:36:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 423 transitions, 1060 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:33,244 INFO L241 Difference]: Finished difference. Result has 492 places, 423 transitions, 1053 flow [2021-06-10 11:36:33,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=492, PETRI_TRANSITIONS=423} [2021-06-10 11:36:33,244 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 29 predicate places. [2021-06-10 11:36:33,244 INFO L480 AbstractCegarLoop]: Abstraction has has 492 places, 423 transitions, 1053 flow [2021-06-10 11:36:33,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,245 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2021-06-10 11:36:33,245 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash -816173348, now seen corresponding path program 1 times [2021-06-10 11:36:33,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143403301] [2021-06-10 11:36:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:33,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:33,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143403301] [2021-06-10 11:36:33,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407814847] [2021-06-10 11:36:33,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:33,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 423 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:33,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,378 INFO L129 PetriNetUnfolder]: 15/507 cut-off events. [2021-06-10 11:36:33,378 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:33,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 507 events. 15/507 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2130 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 635. Up to 18 conditions per place. [2021-06-10 11:36:33,394 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/421 dead transitions. [2021-06-10 11:36:33,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 421 transitions, 1066 flow [2021-06-10 11:36:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:33,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:33,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:33,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:33,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:33,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,399 INFO L185 Difference]: Start difference. First operand has 492 places, 423 transitions, 1053 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:33,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 421 transitions, 1066 flow [2021-06-10 11:36:33,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 421 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:33,404 INFO L241 Difference]: Finished difference. Result has 491 places, 421 transitions, 1049 flow [2021-06-10 11:36:33,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=491, PETRI_TRANSITIONS=421} [2021-06-10 11:36:33,404 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 28 predicate places. [2021-06-10 11:36:33,404 INFO L480 AbstractCegarLoop]: Abstraction has has 491 places, 421 transitions, 1049 flow [2021-06-10 11:36:33,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,405 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2021-06-10 11:36:33,405 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,405 INFO L82 PathProgramCache]: Analyzing trace with hash -611875152, now seen corresponding path program 1 times [2021-06-10 11:36:33,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809177280] [2021-06-10 11:36:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:33,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:33,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809177280] [2021-06-10 11:36:33,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444663598] [2021-06-10 11:36:33,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,419 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:33,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 421 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:33,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,542 INFO L129 PetriNetUnfolder]: 14/515 cut-off events. [2021-06-10 11:36:33,542 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:33,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 515 events. 14/515 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2201 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 647. Up to 18 conditions per place. [2021-06-10 11:36:33,558 INFO L132 encePairwiseOnDemand]: 492/497 looper letters, 10 selfloop transitions, 3 changer transitions 0/423 dead transitions. [2021-06-10 11:36:33,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 423 transitions, 1079 flow [2021-06-10 11:36:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2021-06-10 11:36:33,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2021-06-10 11:36:33,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1365 transitions. [2021-06-10 11:36:33,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1365 transitions. [2021-06-10 11:36:33,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1365 transitions. [2021-06-10 11:36:33,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,560 INFO L185 Difference]: Start difference. First operand has 491 places, 421 transitions, 1049 flow. Second operand 3 states and 1365 transitions. [2021-06-10 11:36:33,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 423 transitions, 1079 flow [2021-06-10 11:36:33,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 423 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:33,565 INFO L241 Difference]: Finished difference. Result has 494 places, 423 transitions, 1072 flow [2021-06-10 11:36:33,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=494, PETRI_TRANSITIONS=423} [2021-06-10 11:36:33,565 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 31 predicate places. [2021-06-10 11:36:33,565 INFO L480 AbstractCegarLoop]: Abstraction has has 494 places, 423 transitions, 1072 flow [2021-06-10 11:36:33,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,565 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2021-06-10 11:36:33,565 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash -611874129, now seen corresponding path program 1 times [2021-06-10 11:36:33,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843885579] [2021-06-10 11:36:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:33,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:33,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843885579] [2021-06-10 11:36:33,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098010914] [2021-06-10 11:36:33,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:33,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 423 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:33,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,692 INFO L129 PetriNetUnfolder]: 13/513 cut-off events. [2021-06-10 11:36:33,693 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:33,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 513 events. 13/513 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2189 event pairs, 0 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 644. Up to 18 conditions per place. [2021-06-10 11:36:33,708 INFO L132 encePairwiseOnDemand]: 494/497 looper letters, 5 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2021-06-10 11:36:33,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 423 transitions, 1084 flow [2021-06-10 11:36:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2021-06-10 11:36:33,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208584842387659 [2021-06-10 11:36:33,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1373 transitions. [2021-06-10 11:36:33,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1373 transitions. [2021-06-10 11:36:33,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1373 transitions. [2021-06-10 11:36:33,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.6666666666667) internal successors, (1373), 3 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,711 INFO L185 Difference]: Start difference. First operand has 494 places, 423 transitions, 1072 flow. Second operand 3 states and 1373 transitions. [2021-06-10 11:36:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 423 transitions, 1084 flow [2021-06-10 11:36:33,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 423 transitions, 1079 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:33,715 INFO L241 Difference]: Finished difference. Result has 497 places, 423 transitions, 1077 flow [2021-06-10 11:36:33,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=497, PETRI_TRANSITIONS=423} [2021-06-10 11:36:33,716 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 34 predicate places. [2021-06-10 11:36:33,716 INFO L480 AbstractCegarLoop]: Abstraction has has 497 places, 423 transitions, 1077 flow [2021-06-10 11:36:33,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,716 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2021-06-10 11:36:33,716 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,716 INFO L82 PathProgramCache]: Analyzing trace with hash -610921840, now seen corresponding path program 1 times [2021-06-10 11:36:33,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629355843] [2021-06-10 11:36:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:33,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:33,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629355843] [2021-06-10 11:36:33,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169219273] [2021-06-10 11:36:33,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 497 [2021-06-10 11:36:33,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 423 transitions, 1077 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 497 [2021-06-10 11:36:33,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:33,863 INFO L129 PetriNetUnfolder]: 12/509 cut-off events. [2021-06-10 11:36:33,864 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:33,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 509 events. 12/509 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2164 event pairs, 0 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 641. Up to 18 conditions per place. [2021-06-10 11:36:33,879 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 5 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2021-06-10 11:36:33,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 420 transitions, 1074 flow [2021-06-10 11:36:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2021-06-10 11:36:33,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92018779342723 [2021-06-10 11:36:33,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:33,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1372 transitions. [2021-06-10 11:36:33,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,881 INFO L185 Difference]: Start difference. First operand has 497 places, 423 transitions, 1077 flow. Second operand 3 states and 1372 transitions. [2021-06-10 11:36:33,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 420 transitions, 1074 flow [2021-06-10 11:36:33,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 420 transitions, 1067 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:33,886 INFO L241 Difference]: Finished difference. Result has 496 places, 420 transitions, 1057 flow [2021-06-10 11:36:33,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=496, PETRI_TRANSITIONS=420} [2021-06-10 11:36:33,886 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 33 predicate places. [2021-06-10 11:36:33,886 INFO L480 AbstractCegarLoop]: Abstraction has has 496 places, 420 transitions, 1057 flow [2021-06-10 11:36:33,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:33,886 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:33,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2021-06-10 11:36:33,886 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -610920817, now seen corresponding path program 1 times [2021-06-10 11:36:33,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:33,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870259115] [2021-06-10 11:36:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:33,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:33,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:33,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:33,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870259115] [2021-06-10 11:36:33,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:33,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:33,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234911960] [2021-06-10 11:36:33,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:33,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:33,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:33,900 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 497 [2021-06-10 11:36:33,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 420 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:33,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:33,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 497 [2021-06-10 11:36:33,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:34,012 INFO L129 PetriNetUnfolder]: 12/507 cut-off events. [2021-06-10 11:36:34,012 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-06-10 11:36:34,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 507 events. 12/507 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2149 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 642. Up to 18 conditions per place. [2021-06-10 11:36:34,027 INFO L132 encePairwiseOnDemand]: 495/497 looper letters, 8 selfloop transitions, 1 changer transitions 0/418 dead transitions. [2021-06-10 11:36:34,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 418 transitions, 1070 flow [2021-06-10 11:36:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2021-06-10 11:36:34,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9121395036887995 [2021-06-10 11:36:34,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1360 transitions. [2021-06-10 11:36:34,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1360 transitions. [2021-06-10 11:36:34,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:34,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1360 transitions. [2021-06-10 11:36:34,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 497.0) internal successors, (1988), 4 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,030 INFO L185 Difference]: Start difference. First operand has 496 places, 420 transitions, 1057 flow. Second operand 3 states and 1360 transitions. [2021-06-10 11:36:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 418 transitions, 1070 flow [2021-06-10 11:36:34,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 418 transitions, 1069 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:34,034 INFO L241 Difference]: Finished difference. Result has 495 places, 418 transitions, 1053 flow [2021-06-10 11:36:34,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=497, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=495, PETRI_TRANSITIONS=418} [2021-06-10 11:36:34,034 INFO L343 CegarLoopForPetriNet]: 463 programPoint places, 32 predicate places. [2021-06-10 11:36:34,034 INFO L480 AbstractCegarLoop]: Abstraction has has 495 places, 418 transitions, 1053 flow [2021-06-10 11:36:34,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,035 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 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-06-10 11:36:34,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2021-06-10 11:36:34,035 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash -620321659, now seen corresponding path program 1 times [2021-06-10 11:36:34,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56131827] [2021-06-10 11:36:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:34,043 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:34,047 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:34,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:34,055 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:34,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2021-06-10 11:36:34,055 WARN L342 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:34,055 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of18ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of18ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:34,151 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:34,151 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-06-10 11:36:34,151 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:34,151 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:34,151 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:34,151 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:34,151 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:34,151 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:34,151 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:34,151 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:34,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 489 places, 525 transitions, 1446 flow [2021-06-10 11:36:34,292 INFO L129 PetriNetUnfolder]: 91/686 cut-off events. [2021-06-10 11:36:34,292 INFO L130 PetriNetUnfolder]: For 1122/1122 co-relation queries the response was YES. [2021-06-10 11:36:34,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 686 events. 91/686 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2854 event pairs, 0 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 844. Up to 38 conditions per place. [2021-06-10 11:36:34,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 525 transitions, 1446 flow [2021-06-10 11:36:34,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 489 places, 525 transitions, 1446 flow [2021-06-10 11:36:34,316 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2021-06-10 11:36:34,316 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:34,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,316 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-06-10 11:36:34,316 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 645586301, now seen corresponding path program 1 times [2021-06-10 11:36:34,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951938845] [2021-06-10 11:36:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:34,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:34,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:34,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951938845] [2021-06-10 11:36:34,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:34,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:34,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206514452] [2021-06-10 11:36:34,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:34,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:34,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:34,328 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:34,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 525 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:34,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:34,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:34,438 INFO L129 PetriNetUnfolder]: 53/544 cut-off events. [2021-06-10 11:36:34,438 INFO L130 PetriNetUnfolder]: For 1123/1123 co-relation queries the response was YES. [2021-06-10 11:36:34,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 544 events. 53/544 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2106 event pairs, 0 based on Foata normal form. 80/551 useless extension candidates. Maximal degree in co-relation 715. Up to 19 conditions per place. [2021-06-10 11:36:34,459 INFO L132 encePairwiseOnDemand]: 500/525 looper letters, 10 selfloop transitions, 3 changer transitions 0/485 dead transitions. [2021-06-10 11:36:34,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 485 transitions, 1392 flow [2021-06-10 11:36:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1483 transitions. [2021-06-10 11:36:34,460 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9415873015873016 [2021-06-10 11:36:34,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1483 transitions. [2021-06-10 11:36:34,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1483 transitions. [2021-06-10 11:36:34,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:34,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1483 transitions. [2021-06-10 11:36:34,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 494.3333333333333) internal successors, (1483), 3 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,462 INFO L185 Difference]: Start difference. First operand has 489 places, 525 transitions, 1446 flow. Second operand 3 states and 1483 transitions. [2021-06-10 11:36:34,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 485 transitions, 1392 flow [2021-06-10 11:36:34,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 485 transitions, 1086 flow, removed 153 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:34,467 INFO L241 Difference]: Finished difference. Result has 470 places, 485 transitions, 1080 flow [2021-06-10 11:36:34,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1080, PETRI_PLACES=470, PETRI_TRANSITIONS=485} [2021-06-10 11:36:34,467 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -19 predicate places. [2021-06-10 11:36:34,467 INFO L480 AbstractCegarLoop]: Abstraction has has 470 places, 485 transitions, 1080 flow [2021-06-10 11:36:34,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,468 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-06-10 11:36:34,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2021-06-10 11:36:34,468 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 645587324, now seen corresponding path program 1 times [2021-06-10 11:36:34,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453025908] [2021-06-10 11:36:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:34,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:34,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:34,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453025908] [2021-06-10 11:36:34,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:34,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:34,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509916752] [2021-06-10 11:36:34,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:34,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:34,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:34,480 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:34,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 485 transitions, 1080 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:34,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:34,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:34,580 INFO L129 PetriNetUnfolder]: 52/542 cut-off events. [2021-06-10 11:36:34,580 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:34,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 542 events. 52/542 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2095 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 593. Up to 19 conditions per place. [2021-06-10 11:36:34,600 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 5 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2021-06-10 11:36:34,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 485 transitions, 1092 flow [2021-06-10 11:36:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:34,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:34,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:34,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:34,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:34,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:34,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,602 INFO L185 Difference]: Start difference. First operand has 470 places, 485 transitions, 1080 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:34,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 485 transitions, 1092 flow [2021-06-10 11:36:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 485 transitions, 1087 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:34,607 INFO L241 Difference]: Finished difference. Result has 473 places, 485 transitions, 1085 flow [2021-06-10 11:36:34,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1085, PETRI_PLACES=473, PETRI_TRANSITIONS=485} [2021-06-10 11:36:34,607 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -16 predicate places. [2021-06-10 11:36:34,607 INFO L480 AbstractCegarLoop]: Abstraction has has 473 places, 485 transitions, 1085 flow [2021-06-10 11:36:34,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,607 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-06-10 11:36:34,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2021-06-10 11:36:34,607 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash 646540636, now seen corresponding path program 1 times [2021-06-10 11:36:34,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713571746] [2021-06-10 11:36:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:34,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:34,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713571746] [2021-06-10 11:36:34,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:34,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:34,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964756265] [2021-06-10 11:36:34,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:34,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:34,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:34,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:34,619 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:34,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 485 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:34,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:34,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:34,720 INFO L129 PetriNetUnfolder]: 51/539 cut-off events. [2021-06-10 11:36:34,720 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:34,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 539 events. 51/539 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2080 event pairs, 0 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 595. Up to 19 conditions per place. [2021-06-10 11:36:34,740 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 9 selfloop transitions, 1 changer transitions 0/483 dead transitions. [2021-06-10 11:36:34,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 483 transitions, 1095 flow [2021-06-10 11:36:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2021-06-10 11:36:34,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2021-06-10 11:36:34,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2021-06-10 11:36:34,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2021-06-10 11:36:34,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:34,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2021-06-10 11:36:34,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.0) internal successors, (1440), 3 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,742 INFO L185 Difference]: Start difference. First operand has 473 places, 485 transitions, 1085 flow. Second operand 3 states and 1440 transitions. [2021-06-10 11:36:34,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 483 transitions, 1095 flow [2021-06-10 11:36:34,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 483 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:34,747 INFO L241 Difference]: Finished difference. Result has 474 places, 483 transitions, 1075 flow [2021-06-10 11:36:34,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1075, PETRI_PLACES=474, PETRI_TRANSITIONS=483} [2021-06-10 11:36:34,747 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -15 predicate places. [2021-06-10 11:36:34,747 INFO L480 AbstractCegarLoop]: Abstraction has has 474 places, 483 transitions, 1075 flow [2021-06-10 11:36:34,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,747 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,747 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-06-10 11:36:34,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2021-06-10 11:36:34,747 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,748 INFO L82 PathProgramCache]: Analyzing trace with hash 646539613, now seen corresponding path program 1 times [2021-06-10 11:36:34,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064162426] [2021-06-10 11:36:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:34,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:34,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:34,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064162426] [2021-06-10 11:36:34,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:34,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:34,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819669679] [2021-06-10 11:36:34,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:34,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:34,765 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:34,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 483 transitions, 1075 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:34,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:34,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:34,863 INFO L129 PetriNetUnfolder]: 51/536 cut-off events. [2021-06-10 11:36:34,863 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:34,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 536 events. 51/536 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2063 event pairs, 0 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 593. Up to 19 conditions per place. [2021-06-10 11:36:34,882 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/480 dead transitions. [2021-06-10 11:36:34,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 480 transitions, 1076 flow [2021-06-10 11:36:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:34,883 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:34,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:34,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:34,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:34,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:34,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,884 INFO L185 Difference]: Start difference. First operand has 474 places, 483 transitions, 1075 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:34,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 480 transitions, 1076 flow [2021-06-10 11:36:34,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 480 transitions, 1071 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:34,888 INFO L241 Difference]: Finished difference. Result has 471 places, 480 transitions, 1061 flow [2021-06-10 11:36:34,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=471, PETRI_TRANSITIONS=480} [2021-06-10 11:36:34,889 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -18 predicate places. [2021-06-10 11:36:34,889 INFO L480 AbstractCegarLoop]: Abstraction has has 471 places, 480 transitions, 1061 flow [2021-06-10 11:36:34,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,889 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:34,889 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:34,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2021-06-10 11:36:34,889 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:34,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1536684543, now seen corresponding path program 1 times [2021-06-10 11:36:34,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:34,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175284297] [2021-06-10 11:36:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:34,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:34,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:34,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:34,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175284297] [2021-06-10 11:36:34,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:34,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:34,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528101923] [2021-06-10 11:36:34,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:34,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:34,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:34,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 480 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:34,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:34,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:34,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,000 INFO L129 PetriNetUnfolder]: 50/543 cut-off events. [2021-06-10 11:36:35,001 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:35,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 543 events. 50/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2118 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 603. Up to 19 conditions per place. [2021-06-10 11:36:35,020 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/481 dead transitions. [2021-06-10 11:36:35,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 481 transitions, 1077 flow [2021-06-10 11:36:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:35,021 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:35,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,023 INFO L185 Difference]: Start difference. First operand has 471 places, 480 transitions, 1061 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:35,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 481 transitions, 1077 flow [2021-06-10 11:36:35,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 481 transitions, 1076 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:35,027 INFO L241 Difference]: Finished difference. Result has 473 places, 480 transitions, 1065 flow [2021-06-10 11:36:35,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=473, PETRI_TRANSITIONS=480} [2021-06-10 11:36:35,027 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -16 predicate places. [2021-06-10 11:36:35,027 INFO L480 AbstractCegarLoop]: Abstraction has has 473 places, 480 transitions, 1065 flow [2021-06-10 11:36:35,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,028 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2021-06-10 11:36:35,028 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1536683520, now seen corresponding path program 1 times [2021-06-10 11:36:35,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585287919] [2021-06-10 11:36:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:35,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:35,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585287919] [2021-06-10 11:36:35,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257940941] [2021-06-10 11:36:35,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:35,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 480 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:35,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,144 INFO L129 PetriNetUnfolder]: 48/545 cut-off events. [2021-06-10 11:36:35,144 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:35,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 545 events. 48/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2154 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 612. Up to 19 conditions per place. [2021-06-10 11:36:35,163 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/481 dead transitions. [2021-06-10 11:36:35,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 481 transitions, 1091 flow [2021-06-10 11:36:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:35,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:35,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,166 INFO L185 Difference]: Start difference. First operand has 473 places, 480 transitions, 1065 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:35,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 481 transitions, 1091 flow [2021-06-10 11:36:35,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 481 transitions, 1090 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:35,170 INFO L241 Difference]: Finished difference. Result has 476 places, 481 transitions, 1082 flow [2021-06-10 11:36:35,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=476, PETRI_TRANSITIONS=481} [2021-06-10 11:36:35,170 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -13 predicate places. [2021-06-10 11:36:35,170 INFO L480 AbstractCegarLoop]: Abstraction has has 476 places, 481 transitions, 1082 flow [2021-06-10 11:36:35,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,170 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,170 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2021-06-10 11:36:35,171 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1537636832, now seen corresponding path program 1 times [2021-06-10 11:36:35,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153295553] [2021-06-10 11:36:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:35,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:35,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153295553] [2021-06-10 11:36:35,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755288163] [2021-06-10 11:36:35,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:35,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 481 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:35,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,281 INFO L129 PetriNetUnfolder]: 48/538 cut-off events. [2021-06-10 11:36:35,281 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:35,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 538 events. 48/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2093 event pairs, 0 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 597. Up to 19 conditions per place. [2021-06-10 11:36:35,300 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/479 dead transitions. [2021-06-10 11:36:35,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 479 transitions, 1084 flow [2021-06-10 11:36:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:35,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:35,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,303 INFO L185 Difference]: Start difference. First operand has 476 places, 481 transitions, 1082 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:35,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 479 transitions, 1084 flow [2021-06-10 11:36:35,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 479 transitions, 1076 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:35,307 INFO L241 Difference]: Finished difference. Result has 476 places, 479 transitions, 1069 flow [2021-06-10 11:36:35,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=476, PETRI_TRANSITIONS=479} [2021-06-10 11:36:35,308 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -13 predicate places. [2021-06-10 11:36:35,308 INFO L480 AbstractCegarLoop]: Abstraction has has 476 places, 479 transitions, 1069 flow [2021-06-10 11:36:35,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,308 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2021-06-10 11:36:35,308 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1537637855, now seen corresponding path program 1 times [2021-06-10 11:36:35,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733277167] [2021-06-10 11:36:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:35,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:35,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733277167] [2021-06-10 11:36:35,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893820612] [2021-06-10 11:36:35,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:35,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 479 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:35,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,422 INFO L129 PetriNetUnfolder]: 48/536 cut-off events. [2021-06-10 11:36:35,422 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:35,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 536 events. 48/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2078 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 602. Up to 19 conditions per place. [2021-06-10 11:36:35,441 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/477 dead transitions. [2021-06-10 11:36:35,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 477 transitions, 1082 flow [2021-06-10 11:36:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:35,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:35,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:35,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:35,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:35,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,444 INFO L185 Difference]: Start difference. First operand has 476 places, 479 transitions, 1069 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:35,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 477 transitions, 1082 flow [2021-06-10 11:36:35,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 477 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:35,448 INFO L241 Difference]: Finished difference. Result has 475 places, 477 transitions, 1065 flow [2021-06-10 11:36:35,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=475, PETRI_TRANSITIONS=477} [2021-06-10 11:36:35,448 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -14 predicate places. [2021-06-10 11:36:35,448 INFO L480 AbstractCegarLoop]: Abstraction has has 475 places, 477 transitions, 1065 flow [2021-06-10 11:36:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,448 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2021-06-10 11:36:35,449 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -870312794, now seen corresponding path program 1 times [2021-06-10 11:36:35,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720476447] [2021-06-10 11:36:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:35,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:35,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720476447] [2021-06-10 11:36:35,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116059783] [2021-06-10 11:36:35,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:35,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 477 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:35,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,562 INFO L129 PetriNetUnfolder]: 47/543 cut-off events. [2021-06-10 11:36:35,562 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:35,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 543 events. 47/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2138 event pairs, 0 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 607. Up to 19 conditions per place. [2021-06-10 11:36:35,582 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/478 dead transitions. [2021-06-10 11:36:35,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 478 transitions, 1081 flow [2021-06-10 11:36:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:35,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:35,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:35,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,584 INFO L185 Difference]: Start difference. First operand has 475 places, 477 transitions, 1065 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:35,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 478 transitions, 1081 flow [2021-06-10 11:36:35,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 478 transitions, 1080 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:35,589 INFO L241 Difference]: Finished difference. Result has 477 places, 477 transitions, 1069 flow [2021-06-10 11:36:35,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=477, PETRI_TRANSITIONS=477} [2021-06-10 11:36:35,589 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -12 predicate places. [2021-06-10 11:36:35,589 INFO L480 AbstractCegarLoop]: Abstraction has has 477 places, 477 transitions, 1069 flow [2021-06-10 11:36:35,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,589 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2021-06-10 11:36:35,589 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -870311771, now seen corresponding path program 1 times [2021-06-10 11:36:35,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627925377] [2021-06-10 11:36:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:35,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:35,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627925377] [2021-06-10 11:36:35,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838972847] [2021-06-10 11:36:35,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:35,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 477 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:35,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,710 INFO L129 PetriNetUnfolder]: 45/545 cut-off events. [2021-06-10 11:36:35,711 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:35,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 545 events. 45/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2169 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 618. Up to 19 conditions per place. [2021-06-10 11:36:35,746 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/478 dead transitions. [2021-06-10 11:36:35,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 478 transitions, 1095 flow [2021-06-10 11:36:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:35,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:35,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:35,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,749 INFO L185 Difference]: Start difference. First operand has 477 places, 477 transitions, 1069 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:35,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 478 transitions, 1095 flow [2021-06-10 11:36:35,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 478 transitions, 1094 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:35,753 INFO L241 Difference]: Finished difference. Result has 480 places, 478 transitions, 1086 flow [2021-06-10 11:36:35,753 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1086, PETRI_PLACES=480, PETRI_TRANSITIONS=478} [2021-06-10 11:36:35,753 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -9 predicate places. [2021-06-10 11:36:35,753 INFO L480 AbstractCegarLoop]: Abstraction has has 480 places, 478 transitions, 1086 flow [2021-06-10 11:36:35,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,753 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2021-06-10 11:36:35,753 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -871265083, now seen corresponding path program 1 times [2021-06-10 11:36:35,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978866791] [2021-06-10 11:36:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:35,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:35,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978866791] [2021-06-10 11:36:35,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181635696] [2021-06-10 11:36:35,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:35,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 478 transitions, 1086 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:35,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:35,868 INFO L129 PetriNetUnfolder]: 45/538 cut-off events. [2021-06-10 11:36:35,869 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:35,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 538 events. 45/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2109 event pairs, 0 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 604. Up to 19 conditions per place. [2021-06-10 11:36:35,887 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/476 dead transitions. [2021-06-10 11:36:35,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 476 transitions, 1088 flow [2021-06-10 11:36:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:35,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:35,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:35,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:35,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,890 INFO L185 Difference]: Start difference. First operand has 480 places, 478 transitions, 1086 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:35,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 476 transitions, 1088 flow [2021-06-10 11:36:35,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 476 transitions, 1080 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:35,894 INFO L241 Difference]: Finished difference. Result has 480 places, 476 transitions, 1073 flow [2021-06-10 11:36:35,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=480, PETRI_TRANSITIONS=476} [2021-06-10 11:36:35,895 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -9 predicate places. [2021-06-10 11:36:35,895 INFO L480 AbstractCegarLoop]: Abstraction has has 480 places, 476 transitions, 1073 flow [2021-06-10 11:36:35,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:35,895 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:35,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2021-06-10 11:36:35,895 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash -871266106, now seen corresponding path program 1 times [2021-06-10 11:36:35,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:35,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696034730] [2021-06-10 11:36:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:35,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:35,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:35,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:35,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696034730] [2021-06-10 11:36:35,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:35,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:35,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43230467] [2021-06-10 11:36:35,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:35,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:35,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:35,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 476 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:35,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:35,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:35,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,011 INFO L129 PetriNetUnfolder]: 45/536 cut-off events. [2021-06-10 11:36:36,011 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:36,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 536 events. 45/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2093 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 608. Up to 19 conditions per place. [2021-06-10 11:36:36,031 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/474 dead transitions. [2021-06-10 11:36:36,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 474 transitions, 1086 flow [2021-06-10 11:36:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:36,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:36,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,034 INFO L185 Difference]: Start difference. First operand has 480 places, 476 transitions, 1073 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:36,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 474 transitions, 1086 flow [2021-06-10 11:36:36,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 474 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,038 INFO L241 Difference]: Finished difference. Result has 479 places, 474 transitions, 1069 flow [2021-06-10 11:36:36,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=479, PETRI_TRANSITIONS=474} [2021-06-10 11:36:36,038 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -10 predicate places. [2021-06-10 11:36:36,038 INFO L480 AbstractCegarLoop]: Abstraction has has 479 places, 474 transitions, 1069 flow [2021-06-10 11:36:36,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,039 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2021-06-10 11:36:36,039 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash 752855244, now seen corresponding path program 1 times [2021-06-10 11:36:36,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379113147] [2021-06-10 11:36:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:36,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:36,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379113147] [2021-06-10 11:36:36,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781835094] [2021-06-10 11:36:36,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:36,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 474 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:36,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,155 INFO L129 PetriNetUnfolder]: 44/543 cut-off events. [2021-06-10 11:36:36,155 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:36,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 543 events. 44/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2154 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 613. Up to 19 conditions per place. [2021-06-10 11:36:36,174 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2021-06-10 11:36:36,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 475 transitions, 1085 flow [2021-06-10 11:36:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:36,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:36,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,177 INFO L185 Difference]: Start difference. First operand has 479 places, 474 transitions, 1069 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:36,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 475 transitions, 1085 flow [2021-06-10 11:36:36,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 475 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,182 INFO L241 Difference]: Finished difference. Result has 481 places, 474 transitions, 1073 flow [2021-06-10 11:36:36,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=481, PETRI_TRANSITIONS=474} [2021-06-10 11:36:36,182 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -8 predicate places. [2021-06-10 11:36:36,182 INFO L480 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 1073 flow [2021-06-10 11:36:36,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,182 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2021-06-10 11:36:36,182 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash 752856267, now seen corresponding path program 1 times [2021-06-10 11:36:36,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643824968] [2021-06-10 11:36:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:36,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:36,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643824968] [2021-06-10 11:36:36,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141615117] [2021-06-10 11:36:36,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:36,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 474 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:36,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,305 INFO L129 PetriNetUnfolder]: 42/545 cut-off events. [2021-06-10 11:36:36,305 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:36,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 545 events. 42/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2188 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 624. Up to 19 conditions per place. [2021-06-10 11:36:36,324 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/475 dead transitions. [2021-06-10 11:36:36,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 475 transitions, 1099 flow [2021-06-10 11:36:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:36,325 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:36,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,327 INFO L185 Difference]: Start difference. First operand has 481 places, 474 transitions, 1073 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:36,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 475 transitions, 1099 flow [2021-06-10 11:36:36,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 475 transitions, 1098 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,331 INFO L241 Difference]: Finished difference. Result has 484 places, 475 transitions, 1090 flow [2021-06-10 11:36:36,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=484, PETRI_TRANSITIONS=475} [2021-06-10 11:36:36,331 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -5 predicate places. [2021-06-10 11:36:36,331 INFO L480 AbstractCegarLoop]: Abstraction has has 484 places, 475 transitions, 1090 flow [2021-06-10 11:36:36,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,331 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-06-10 11:36:36,332 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 751902955, now seen corresponding path program 1 times [2021-06-10 11:36:36,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054521210] [2021-06-10 11:36:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:36,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:36,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054521210] [2021-06-10 11:36:36,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782550197] [2021-06-10 11:36:36,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:36,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 475 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:36,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,446 INFO L129 PetriNetUnfolder]: 42/538 cut-off events. [2021-06-10 11:36:36,446 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:36,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 538 events. 42/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2131 event pairs, 0 based on Foata normal form. 1/480 useless extension candidates. Maximal degree in co-relation 610. Up to 19 conditions per place. [2021-06-10 11:36:36,464 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/473 dead transitions. [2021-06-10 11:36:36,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 473 transitions, 1092 flow [2021-06-10 11:36:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:36,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:36,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:36,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:36,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:36,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,467 INFO L185 Difference]: Start difference. First operand has 484 places, 475 transitions, 1090 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:36,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 473 transitions, 1092 flow [2021-06-10 11:36:36,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 473 transitions, 1084 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:36,471 INFO L241 Difference]: Finished difference. Result has 484 places, 473 transitions, 1077 flow [2021-06-10 11:36:36,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=484, PETRI_TRANSITIONS=473} [2021-06-10 11:36:36,471 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -5 predicate places. [2021-06-10 11:36:36,471 INFO L480 AbstractCegarLoop]: Abstraction has has 484 places, 473 transitions, 1077 flow [2021-06-10 11:36:36,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,471 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2021-06-10 11:36:36,471 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 751901932, now seen corresponding path program 1 times [2021-06-10 11:36:36,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545138724] [2021-06-10 11:36:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:36,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:36,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545138724] [2021-06-10 11:36:36,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243158971] [2021-06-10 11:36:36,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:36,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 473 transitions, 1077 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:36,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,590 INFO L129 PetriNetUnfolder]: 42/536 cut-off events. [2021-06-10 11:36:36,590 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:36,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 536 events. 42/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2113 event pairs, 0 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 614. Up to 19 conditions per place. [2021-06-10 11:36:36,608 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2021-06-10 11:36:36,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 471 transitions, 1090 flow [2021-06-10 11:36:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:36,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:36,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:36,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,611 INFO L185 Difference]: Start difference. First operand has 484 places, 473 transitions, 1077 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:36,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 471 transitions, 1090 flow [2021-06-10 11:36:36,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 471 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,615 INFO L241 Difference]: Finished difference. Result has 483 places, 471 transitions, 1073 flow [2021-06-10 11:36:36,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=483, PETRI_TRANSITIONS=471} [2021-06-10 11:36:36,615 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -6 predicate places. [2021-06-10 11:36:36,615 INFO L480 AbstractCegarLoop]: Abstraction has has 483 places, 471 transitions, 1073 flow [2021-06-10 11:36:36,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,615 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2021-06-10 11:36:36,615 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2045921042, now seen corresponding path program 1 times [2021-06-10 11:36:36,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323173176] [2021-06-10 11:36:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:36,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:36,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323173176] [2021-06-10 11:36:36,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034983233] [2021-06-10 11:36:36,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:36,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 471 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:36,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,731 INFO L129 PetriNetUnfolder]: 40/541 cut-off events. [2021-06-10 11:36:36,731 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:36,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 541 events. 40/541 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2164 event pairs, 0 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 617. Up to 19 conditions per place. [2021-06-10 11:36:36,750 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 5 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2021-06-10 11:36:36,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 472 transitions, 1089 flow [2021-06-10 11:36:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:36,753 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:36,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:36,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,755 INFO L185 Difference]: Start difference. First operand has 483 places, 471 transitions, 1073 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:36,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 472 transitions, 1089 flow [2021-06-10 11:36:36,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 472 transitions, 1088 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,759 INFO L241 Difference]: Finished difference. Result has 486 places, 472 transitions, 1086 flow [2021-06-10 11:36:36,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1086, PETRI_PLACES=486, PETRI_TRANSITIONS=472} [2021-06-10 11:36:36,759 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -3 predicate places. [2021-06-10 11:36:36,759 INFO L480 AbstractCegarLoop]: Abstraction has has 486 places, 472 transitions, 1086 flow [2021-06-10 11:36:36,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,760 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-06-10 11:36:36,760 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2045920019, now seen corresponding path program 1 times [2021-06-10 11:36:36,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968975928] [2021-06-10 11:36:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:36,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:36,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968975928] [2021-06-10 11:36:36,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410369810] [2021-06-10 11:36:36,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:36,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 472 transitions, 1086 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:36,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:36,883 INFO L129 PetriNetUnfolder]: 40/542 cut-off events. [2021-06-10 11:36:36,883 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:36,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 542 events. 40/542 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2175 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 625. Up to 19 conditions per place. [2021-06-10 11:36:36,902 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/473 dead transitions. [2021-06-10 11:36:36,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 473 transitions, 1112 flow [2021-06-10 11:36:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:36,903 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:36,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:36,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:36,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,905 INFO L185 Difference]: Start difference. First operand has 486 places, 472 transitions, 1086 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:36,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 473 transitions, 1112 flow [2021-06-10 11:36:36,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 473 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:36,909 INFO L241 Difference]: Finished difference. Result has 489 places, 473 transitions, 1102 flow [2021-06-10 11:36:36,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=489, PETRI_TRANSITIONS=473} [2021-06-10 11:36:36,909 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 0 predicate places. [2021-06-10 11:36:36,909 INFO L480 AbstractCegarLoop]: Abstraction has has 489 places, 473 transitions, 1102 flow [2021-06-10 11:36:36,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:36,910 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:36,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2021-06-10 11:36:36,910 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2046873331, now seen corresponding path program 1 times [2021-06-10 11:36:36,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:36,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066941835] [2021-06-10 11:36:36,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:36,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:36,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:36,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:36,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066941835] [2021-06-10 11:36:36,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:36,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:36,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316606220] [2021-06-10 11:36:36,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:36,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:36,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:36,932 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:36,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 473 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:36,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:36,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:36,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,038 INFO L129 PetriNetUnfolder]: 39/538 cut-off events. [2021-06-10 11:36:37,038 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:37,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 538 events. 39/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2149 event pairs, 0 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 618. Up to 19 conditions per place. [2021-06-10 11:36:37,056 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/470 dead transitions. [2021-06-10 11:36:37,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 470 transitions, 1099 flow [2021-06-10 11:36:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:37,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:37,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,064 INFO L185 Difference]: Start difference. First operand has 489 places, 473 transitions, 1102 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:37,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 470 transitions, 1099 flow [2021-06-10 11:36:37,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 470 transitions, 1091 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:37,068 INFO L241 Difference]: Finished difference. Result has 488 places, 470 transitions, 1081 flow [2021-06-10 11:36:37,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=488, PETRI_TRANSITIONS=470} [2021-06-10 11:36:37,068 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -1 predicate places. [2021-06-10 11:36:37,068 INFO L480 AbstractCegarLoop]: Abstraction has has 488 places, 470 transitions, 1081 flow [2021-06-10 11:36:37,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,068 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2021-06-10 11:36:37,069 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2046874354, now seen corresponding path program 1 times [2021-06-10 11:36:37,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274879394] [2021-06-10 11:36:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:37,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:37,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274879394] [2021-06-10 11:36:37,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108232498] [2021-06-10 11:36:37,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:37,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 470 transitions, 1081 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:37,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,202 INFO L129 PetriNetUnfolder]: 39/536 cut-off events. [2021-06-10 11:36:37,202 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:37,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 536 events. 39/536 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2132 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 621. Up to 19 conditions per place. [2021-06-10 11:36:37,215 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/468 dead transitions. [2021-06-10 11:36:37,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 468 transitions, 1094 flow [2021-06-10 11:36:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:37,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:37,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:37,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:37,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:37,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,218 INFO L185 Difference]: Start difference. First operand has 488 places, 470 transitions, 1081 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:37,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 468 transitions, 1094 flow [2021-06-10 11:36:37,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 468 transitions, 1093 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:37,221 INFO L241 Difference]: Finished difference. Result has 487 places, 468 transitions, 1077 flow [2021-06-10 11:36:37,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=487, PETRI_TRANSITIONS=468} [2021-06-10 11:36:37,222 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, -2 predicate places. [2021-06-10 11:36:37,222 INFO L480 AbstractCegarLoop]: Abstraction has has 487 places, 468 transitions, 1077 flow [2021-06-10 11:36:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,222 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-06-10 11:36:37,222 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 200550586, now seen corresponding path program 1 times [2021-06-10 11:36:37,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725914793] [2021-06-10 11:36:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:37,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:37,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725914793] [2021-06-10 11:36:37,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364222535] [2021-06-10 11:36:37,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:37,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 468 transitions, 1077 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:37,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,344 INFO L129 PetriNetUnfolder]: 37/541 cut-off events. [2021-06-10 11:36:37,344 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:37,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 541 events. 37/541 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2184 event pairs, 0 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 624. Up to 19 conditions per place. [2021-06-10 11:36:37,363 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 5 selfloop transitions, 2 changer transitions 0/469 dead transitions. [2021-06-10 11:36:37,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 469 transitions, 1093 flow [2021-06-10 11:36:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:37,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:37,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:37,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:37,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:37,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,366 INFO L185 Difference]: Start difference. First operand has 487 places, 468 transitions, 1077 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:37,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 469 transitions, 1093 flow [2021-06-10 11:36:37,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 469 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:37,371 INFO L241 Difference]: Finished difference. Result has 490 places, 469 transitions, 1090 flow [2021-06-10 11:36:37,371 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=490, PETRI_TRANSITIONS=469} [2021-06-10 11:36:37,371 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 1 predicate places. [2021-06-10 11:36:37,371 INFO L480 AbstractCegarLoop]: Abstraction has has 490 places, 469 transitions, 1090 flow [2021-06-10 11:36:37,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,371 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2021-06-10 11:36:37,371 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash 200549563, now seen corresponding path program 1 times [2021-06-10 11:36:37,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287186801] [2021-06-10 11:36:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:37,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:37,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287186801] [2021-06-10 11:36:37,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421836620] [2021-06-10 11:36:37,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:37,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 469 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:37,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,505 INFO L129 PetriNetUnfolder]: 37/542 cut-off events. [2021-06-10 11:36:37,506 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:37,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 542 events. 37/542 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2189 event pairs, 0 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 632. Up to 19 conditions per place. [2021-06-10 11:36:37,524 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/470 dead transitions. [2021-06-10 11:36:37,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 470 transitions, 1116 flow [2021-06-10 11:36:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:37,525 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:37,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:37,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:37,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:37,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,527 INFO L185 Difference]: Start difference. First operand has 490 places, 469 transitions, 1090 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:37,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 470 transitions, 1116 flow [2021-06-10 11:36:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 470 transitions, 1114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:37,531 INFO L241 Difference]: Finished difference. Result has 493 places, 470 transitions, 1106 flow [2021-06-10 11:36:37,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=493, PETRI_TRANSITIONS=470} [2021-06-10 11:36:37,532 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 4 predicate places. [2021-06-10 11:36:37,532 INFO L480 AbstractCegarLoop]: Abstraction has has 493 places, 470 transitions, 1106 flow [2021-06-10 11:36:37,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,532 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2021-06-10 11:36:37,532 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash 201503898, now seen corresponding path program 1 times [2021-06-10 11:36:37,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167951673] [2021-06-10 11:36:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:37,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:37,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167951673] [2021-06-10 11:36:37,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718680192] [2021-06-10 11:36:37,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:37,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 470 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:37,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,657 INFO L129 PetriNetUnfolder]: 36/539 cut-off events. [2021-06-10 11:36:37,657 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:36:37,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 539 events. 36/539 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2173 event pairs, 0 based on Foata normal form. 2/487 useless extension candidates. Maximal degree in co-relation 631. Up to 19 conditions per place. [2021-06-10 11:36:37,676 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 9 selfloop transitions, 1 changer transitions 0/468 dead transitions. [2021-06-10 11:36:37,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 468 transitions, 1114 flow [2021-06-10 11:36:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2021-06-10 11:36:37,677 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2021-06-10 11:36:37,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1440 transitions. [2021-06-10 11:36:37,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1440 transitions. [2021-06-10 11:36:37,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1440 transitions. [2021-06-10 11:36:37,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.0) internal successors, (1440), 3 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,679 INFO L185 Difference]: Start difference. First operand has 493 places, 470 transitions, 1106 flow. Second operand 3 states and 1440 transitions. [2021-06-10 11:36:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 468 transitions, 1114 flow [2021-06-10 11:36:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 468 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:37,684 INFO L241 Difference]: Finished difference. Result has 494 places, 468 transitions, 1095 flow [2021-06-10 11:36:37,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=494, PETRI_TRANSITIONS=468} [2021-06-10 11:36:37,684 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 5 predicate places. [2021-06-10 11:36:37,684 INFO L480 AbstractCegarLoop]: Abstraction has has 494 places, 468 transitions, 1095 flow [2021-06-10 11:36:37,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,685 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,685 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2021-06-10 11:36:37,685 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 201502875, now seen corresponding path program 1 times [2021-06-10 11:36:37,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923478049] [2021-06-10 11:36:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:37,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:37,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923478049] [2021-06-10 11:36:37,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865259392] [2021-06-10 11:36:37,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:37,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 468 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:37,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,814 INFO L129 PetriNetUnfolder]: 36/536 cut-off events. [2021-06-10 11:36:37,814 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:37,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 536 events. 36/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2149 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 625. Up to 19 conditions per place. [2021-06-10 11:36:37,833 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/465 dead transitions. [2021-06-10 11:36:37,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 465 transitions, 1096 flow [2021-06-10 11:36:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:37,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:37,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:37,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:37,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,836 INFO L185 Difference]: Start difference. First operand has 494 places, 468 transitions, 1095 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:37,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 465 transitions, 1096 flow [2021-06-10 11:36:37,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 465 transitions, 1091 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:37,840 INFO L241 Difference]: Finished difference. Result has 491 places, 465 transitions, 1081 flow [2021-06-10 11:36:37,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=491, PETRI_TRANSITIONS=465} [2021-06-10 11:36:37,841 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 2 predicate places. [2021-06-10 11:36:37,841 INFO L480 AbstractCegarLoop]: Abstraction has has 491 places, 465 transitions, 1081 flow [2021-06-10 11:36:37,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:37,841 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:37,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2021-06-10 11:36:37,841 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1429309117, now seen corresponding path program 1 times [2021-06-10 11:36:37,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:37,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099075558] [2021-06-10 11:36:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:37,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:37,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:37,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:37,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099075558] [2021-06-10 11:36:37,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:37,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:37,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342233960] [2021-06-10 11:36:37,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:37,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:37,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:37,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 465 transitions, 1081 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:37,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:37,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:37,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:37,985 INFO L129 PetriNetUnfolder]: 35/544 cut-off events. [2021-06-10 11:36:37,985 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:38,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 544 events. 35/544 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2219 event pairs, 0 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 642. Up to 19 conditions per place. [2021-06-10 11:36:38,004 INFO L132 encePairwiseOnDemand]: 520/525 looper letters, 10 selfloop transitions, 3 changer transitions 0/467 dead transitions. [2021-06-10 11:36:38,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 467 transitions, 1111 flow [2021-06-10 11:36:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1443 transitions. [2021-06-10 11:36:38,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9161904761904762 [2021-06-10 11:36:38,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1443 transitions. [2021-06-10 11:36:38,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1443 transitions. [2021-06-10 11:36:38,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1443 transitions. [2021-06-10 11:36:38,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 481.0) internal successors, (1443), 3 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,007 INFO L185 Difference]: Start difference. First operand has 491 places, 465 transitions, 1081 flow. Second operand 3 states and 1443 transitions. [2021-06-10 11:36:38,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 467 transitions, 1111 flow [2021-06-10 11:36:38,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 467 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:38,012 INFO L241 Difference]: Finished difference. Result has 494 places, 467 transitions, 1104 flow [2021-06-10 11:36:38,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=494, PETRI_TRANSITIONS=467} [2021-06-10 11:36:38,012 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 5 predicate places. [2021-06-10 11:36:38,012 INFO L480 AbstractCegarLoop]: Abstraction has has 494 places, 467 transitions, 1104 flow [2021-06-10 11:36:38,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,012 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2021-06-10 11:36:38,012 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1429310140, now seen corresponding path program 1 times [2021-06-10 11:36:38,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826275263] [2021-06-10 11:36:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:38,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:38,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826275263] [2021-06-10 11:36:38,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860890957] [2021-06-10 11:36:38,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,026 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:38,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 467 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:38,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,137 INFO L129 PetriNetUnfolder]: 33/545 cut-off events. [2021-06-10 11:36:38,138 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:38,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 545 events. 33/545 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2237 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 640. Up to 19 conditions per place. [2021-06-10 11:36:38,156 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/467 dead transitions. [2021-06-10 11:36:38,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 467 transitions, 1116 flow [2021-06-10 11:36:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:38,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:38,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,159 INFO L185 Difference]: Start difference. First operand has 494 places, 467 transitions, 1104 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:38,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 467 transitions, 1116 flow [2021-06-10 11:36:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 467 transitions, 1111 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:38,163 INFO L241 Difference]: Finished difference. Result has 496 places, 466 transitions, 1100 flow [2021-06-10 11:36:38,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=496, PETRI_TRANSITIONS=466} [2021-06-10 11:36:38,163 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 7 predicate places. [2021-06-10 11:36:38,163 INFO L480 AbstractCegarLoop]: Abstraction has has 496 places, 466 transitions, 1100 flow [2021-06-10 11:36:38,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,164 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2021-06-10 11:36:38,164 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1430262429, now seen corresponding path program 1 times [2021-06-10 11:36:38,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151413354] [2021-06-10 11:36:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:38,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:38,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151413354] [2021-06-10 11:36:38,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801102446] [2021-06-10 11:36:38,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,176 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:38,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 466 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:38,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,284 INFO L129 PetriNetUnfolder]: 33/538 cut-off events. [2021-06-10 11:36:38,284 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:38,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 538 events. 33/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2182 event pairs, 0 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 634. Up to 19 conditions per place. [2021-06-10 11:36:38,301 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2021-06-10 11:36:38,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 464 transitions, 1103 flow [2021-06-10 11:36:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:38,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:38,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,304 INFO L185 Difference]: Start difference. First operand has 496 places, 466 transitions, 1100 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:38,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 464 transitions, 1103 flow [2021-06-10 11:36:38,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 464 transitions, 1096 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:38,309 INFO L241 Difference]: Finished difference. Result has 496 places, 464 transitions, 1089 flow [2021-06-10 11:36:38,309 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=496, PETRI_TRANSITIONS=464} [2021-06-10 11:36:38,309 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 7 predicate places. [2021-06-10 11:36:38,309 INFO L480 AbstractCegarLoop]: Abstraction has has 496 places, 464 transitions, 1089 flow [2021-06-10 11:36:38,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,309 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,309 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2021-06-10 11:36:38,309 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1430263452, now seen corresponding path program 1 times [2021-06-10 11:36:38,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187580223] [2021-06-10 11:36:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:38,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:38,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187580223] [2021-06-10 11:36:38,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904118472] [2021-06-10 11:36:38,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,323 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:38,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 464 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:38,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,432 INFO L129 PetriNetUnfolder]: 33/536 cut-off events. [2021-06-10 11:36:38,432 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:38,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 536 events. 33/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2166 event pairs, 0 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 634. Up to 19 conditions per place. [2021-06-10 11:36:38,449 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/462 dead transitions. [2021-06-10 11:36:38,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 462 transitions, 1102 flow [2021-06-10 11:36:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:38,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:38,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:38,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:38,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:38,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,452 INFO L185 Difference]: Start difference. First operand has 496 places, 464 transitions, 1089 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:38,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 462 transitions, 1102 flow [2021-06-10 11:36:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 462 transitions, 1101 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:38,456 INFO L241 Difference]: Finished difference. Result has 495 places, 462 transitions, 1085 flow [2021-06-10 11:36:38,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1085, PETRI_PLACES=495, PETRI_TRANSITIONS=462} [2021-06-10 11:36:38,456 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 6 predicate places. [2021-06-10 11:36:38,456 INFO L480 AbstractCegarLoop]: Abstraction has has 495 places, 462 transitions, 1085 flow [2021-06-10 11:36:38,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,456 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2021-06-10 11:36:38,456 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash -332004754, now seen corresponding path program 1 times [2021-06-10 11:36:38,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508466000] [2021-06-10 11:36:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:38,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:38,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508466000] [2021-06-10 11:36:38,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052499641] [2021-06-10 11:36:38,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,469 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:38,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 462 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:38,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,578 INFO L129 PetriNetUnfolder]: 32/543 cut-off events. [2021-06-10 11:36:38,579 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:38,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 543 events. 32/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2230 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 639. Up to 19 conditions per place. [2021-06-10 11:36:38,596 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/463 dead transitions. [2021-06-10 11:36:38,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 463 transitions, 1101 flow [2021-06-10 11:36:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:38,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:38,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:38,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,599 INFO L185 Difference]: Start difference. First operand has 495 places, 462 transitions, 1085 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:38,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 463 transitions, 1101 flow [2021-06-10 11:36:38,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 463 transitions, 1100 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:38,603 INFO L241 Difference]: Finished difference. Result has 497 places, 462 transitions, 1089 flow [2021-06-10 11:36:38,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=497, PETRI_TRANSITIONS=462} [2021-06-10 11:36:38,603 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 8 predicate places. [2021-06-10 11:36:38,603 INFO L480 AbstractCegarLoop]: Abstraction has has 497 places, 462 transitions, 1089 flow [2021-06-10 11:36:38,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,604 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2021-06-10 11:36:38,604 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -332003731, now seen corresponding path program 1 times [2021-06-10 11:36:38,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194965206] [2021-06-10 11:36:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:38,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:38,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194965206] [2021-06-10 11:36:38,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120239254] [2021-06-10 11:36:38,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,617 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:38,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 462 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:38,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,741 INFO L129 PetriNetUnfolder]: 30/545 cut-off events. [2021-06-10 11:36:38,741 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:38,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 545 events. 30/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2259 event pairs, 0 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 650. Up to 19 conditions per place. [2021-06-10 11:36:38,758 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/463 dead transitions. [2021-06-10 11:36:38,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 463 transitions, 1115 flow [2021-06-10 11:36:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:38,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:38,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:38,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:38,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:38,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,761 INFO L185 Difference]: Start difference. First operand has 497 places, 462 transitions, 1089 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:38,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 463 transitions, 1115 flow [2021-06-10 11:36:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 463 transitions, 1114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:38,765 INFO L241 Difference]: Finished difference. Result has 500 places, 463 transitions, 1106 flow [2021-06-10 11:36:38,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=500, PETRI_TRANSITIONS=463} [2021-06-10 11:36:38,765 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 11 predicate places. [2021-06-10 11:36:38,765 INFO L480 AbstractCegarLoop]: Abstraction has has 500 places, 463 transitions, 1106 flow [2021-06-10 11:36:38,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,766 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,766 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2021-06-10 11:36:38,766 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash -332957043, now seen corresponding path program 1 times [2021-06-10 11:36:38,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328476764] [2021-06-10 11:36:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:38,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:38,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328476764] [2021-06-10 11:36:38,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905272928] [2021-06-10 11:36:38,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,779 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:38,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 463 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:38,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:38,886 INFO L129 PetriNetUnfolder]: 30/538 cut-off events. [2021-06-10 11:36:38,887 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:38,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 538 events. 30/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2203 event pairs, 0 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 636. Up to 19 conditions per place. [2021-06-10 11:36:38,904 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/461 dead transitions. [2021-06-10 11:36:38,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 461 transitions, 1108 flow [2021-06-10 11:36:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:38,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:38,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:38,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:38,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,906 INFO L185 Difference]: Start difference. First operand has 500 places, 463 transitions, 1106 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:38,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 461 transitions, 1108 flow [2021-06-10 11:36:38,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 461 transitions, 1100 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:38,911 INFO L241 Difference]: Finished difference. Result has 500 places, 461 transitions, 1093 flow [2021-06-10 11:36:38,911 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=500, PETRI_TRANSITIONS=461} [2021-06-10 11:36:38,911 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 11 predicate places. [2021-06-10 11:36:38,911 INFO L480 AbstractCegarLoop]: Abstraction has has 500 places, 461 transitions, 1093 flow [2021-06-10 11:36:38,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:38,911 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:38,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2021-06-10 11:36:38,911 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:38,911 INFO L82 PathProgramCache]: Analyzing trace with hash -332958066, now seen corresponding path program 1 times [2021-06-10 11:36:38,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:38,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653717120] [2021-06-10 11:36:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:38,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:38,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:38,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:38,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653717120] [2021-06-10 11:36:38,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:38,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:38,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854487178] [2021-06-10 11:36:38,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:38,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:38,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:38,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:38,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 461 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:38,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:38,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:38,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,035 INFO L129 PetriNetUnfolder]: 30/536 cut-off events. [2021-06-10 11:36:39,035 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:39,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 536 events. 30/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2185 event pairs, 0 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 640. Up to 19 conditions per place. [2021-06-10 11:36:39,052 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/459 dead transitions. [2021-06-10 11:36:39,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 459 transitions, 1106 flow [2021-06-10 11:36:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:39,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:39,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,055 INFO L185 Difference]: Start difference. First operand has 500 places, 461 transitions, 1093 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:39,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 459 transitions, 1106 flow [2021-06-10 11:36:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 459 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:39,059 INFO L241 Difference]: Finished difference. Result has 499 places, 459 transitions, 1089 flow [2021-06-10 11:36:39,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=499, PETRI_TRANSITIONS=459} [2021-06-10 11:36:39,059 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 10 predicate places. [2021-06-10 11:36:39,060 INFO L480 AbstractCegarLoop]: Abstraction has has 499 places, 459 transitions, 1089 flow [2021-06-10 11:36:39,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,060 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2021-06-10 11:36:39,060 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 891738009, now seen corresponding path program 1 times [2021-06-10 11:36:39,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659333585] [2021-06-10 11:36:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:39,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:39,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659333585] [2021-06-10 11:36:39,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798576451] [2021-06-10 11:36:39,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:39,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 459 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:39,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,185 INFO L129 PetriNetUnfolder]: 29/543 cut-off events. [2021-06-10 11:36:39,185 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:39,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 543 events. 29/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2245 event pairs, 0 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 645. Up to 19 conditions per place. [2021-06-10 11:36:39,203 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2021-06-10 11:36:39,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 460 transitions, 1105 flow [2021-06-10 11:36:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:39,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:39,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,206 INFO L185 Difference]: Start difference. First operand has 499 places, 459 transitions, 1089 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:39,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 460 transitions, 1105 flow [2021-06-10 11:36:39,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 460 transitions, 1104 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:39,210 INFO L241 Difference]: Finished difference. Result has 501 places, 459 transitions, 1093 flow [2021-06-10 11:36:39,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=501, PETRI_TRANSITIONS=459} [2021-06-10 11:36:39,210 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 12 predicate places. [2021-06-10 11:36:39,210 INFO L480 AbstractCegarLoop]: Abstraction has has 501 places, 459 transitions, 1093 flow [2021-06-10 11:36:39,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,210 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2021-06-10 11:36:39,210 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash 891739032, now seen corresponding path program 1 times [2021-06-10 11:36:39,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570844664] [2021-06-10 11:36:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:39,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:39,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570844664] [2021-06-10 11:36:39,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412339966] [2021-06-10 11:36:39,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:39,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 459 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:39,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,342 INFO L129 PetriNetUnfolder]: 27/545 cut-off events. [2021-06-10 11:36:39,342 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:39,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 545 events. 27/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2280 event pairs, 0 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 656. Up to 19 conditions per place. [2021-06-10 11:36:39,360 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2021-06-10 11:36:39,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 460 transitions, 1119 flow [2021-06-10 11:36:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:39,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:39,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:39,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:39,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:39,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,363 INFO L185 Difference]: Start difference. First operand has 501 places, 459 transitions, 1093 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:39,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 460 transitions, 1119 flow [2021-06-10 11:36:39,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 460 transitions, 1118 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:39,367 INFO L241 Difference]: Finished difference. Result has 504 places, 460 transitions, 1110 flow [2021-06-10 11:36:39,367 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=504, PETRI_TRANSITIONS=460} [2021-06-10 11:36:39,367 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 15 predicate places. [2021-06-10 11:36:39,367 INFO L480 AbstractCegarLoop]: Abstraction has has 504 places, 460 transitions, 1110 flow [2021-06-10 11:36:39,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,368 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2021-06-10 11:36:39,368 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 890785720, now seen corresponding path program 1 times [2021-06-10 11:36:39,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504651347] [2021-06-10 11:36:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:39,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:39,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504651347] [2021-06-10 11:36:39,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018087860] [2021-06-10 11:36:39,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:39,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 460 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:39,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,500 INFO L129 PetriNetUnfolder]: 27/538 cut-off events. [2021-06-10 11:36:39,500 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:39,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 538 events. 27/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2218 event pairs, 0 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 642. Up to 19 conditions per place. [2021-06-10 11:36:39,517 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2021-06-10 11:36:39,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 458 transitions, 1112 flow [2021-06-10 11:36:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:39,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:39,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:39,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:39,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:39,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,520 INFO L185 Difference]: Start difference. First operand has 504 places, 460 transitions, 1110 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:39,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 458 transitions, 1112 flow [2021-06-10 11:36:39,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 458 transitions, 1104 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:39,524 INFO L241 Difference]: Finished difference. Result has 504 places, 458 transitions, 1097 flow [2021-06-10 11:36:39,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=504, PETRI_TRANSITIONS=458} [2021-06-10 11:36:39,525 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 15 predicate places. [2021-06-10 11:36:39,525 INFO L480 AbstractCegarLoop]: Abstraction has has 504 places, 458 transitions, 1097 flow [2021-06-10 11:36:39,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,525 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,525 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2021-06-10 11:36:39,525 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 890784697, now seen corresponding path program 1 times [2021-06-10 11:36:39,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203739507] [2021-06-10 11:36:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:39,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:39,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203739507] [2021-06-10 11:36:39,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916584783] [2021-06-10 11:36:39,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,539 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:39,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 458 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:39,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,652 INFO L129 PetriNetUnfolder]: 27/536 cut-off events. [2021-06-10 11:36:39,652 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:39,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 536 events. 27/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2202 event pairs, 0 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 646. Up to 19 conditions per place. [2021-06-10 11:36:39,670 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/456 dead transitions. [2021-06-10 11:36:39,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 456 transitions, 1110 flow [2021-06-10 11:36:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:39,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:39,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:39,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,672 INFO L185 Difference]: Start difference. First operand has 504 places, 458 transitions, 1097 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:39,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 456 transitions, 1110 flow [2021-06-10 11:36:39,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 456 transitions, 1109 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:39,677 INFO L241 Difference]: Finished difference. Result has 503 places, 456 transitions, 1093 flow [2021-06-10 11:36:39,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=503, PETRI_TRANSITIONS=456} [2021-06-10 11:36:39,677 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 14 predicate places. [2021-06-10 11:36:39,677 INFO L480 AbstractCegarLoop]: Abstraction has has 503 places, 456 transitions, 1093 flow [2021-06-10 11:36:39,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,677 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2021-06-10 11:36:39,677 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1352412228, now seen corresponding path program 1 times [2021-06-10 11:36:39,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209147642] [2021-06-10 11:36:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:39,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:39,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209147642] [2021-06-10 11:36:39,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55676980] [2021-06-10 11:36:39,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:39,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 456 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:39,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,820 INFO L129 PetriNetUnfolder]: 26/544 cut-off events. [2021-06-10 11:36:39,821 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:39,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 544 events. 26/544 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2273 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 658. Up to 19 conditions per place. [2021-06-10 11:36:39,839 INFO L132 encePairwiseOnDemand]: 520/525 looper letters, 10 selfloop transitions, 3 changer transitions 0/458 dead transitions. [2021-06-10 11:36:39,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 458 transitions, 1123 flow [2021-06-10 11:36:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1443 transitions. [2021-06-10 11:36:39,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9161904761904762 [2021-06-10 11:36:39,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1443 transitions. [2021-06-10 11:36:39,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1443 transitions. [2021-06-10 11:36:39,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1443 transitions. [2021-06-10 11:36:39,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 481.0) internal successors, (1443), 3 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,841 INFO L185 Difference]: Start difference. First operand has 503 places, 456 transitions, 1093 flow. Second operand 3 states and 1443 transitions. [2021-06-10 11:36:39,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 458 transitions, 1123 flow [2021-06-10 11:36:39,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 458 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:39,846 INFO L241 Difference]: Finished difference. Result has 506 places, 458 transitions, 1116 flow [2021-06-10 11:36:39,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=506, PETRI_TRANSITIONS=458} [2021-06-10 11:36:39,846 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 17 predicate places. [2021-06-10 11:36:39,846 INFO L480 AbstractCegarLoop]: Abstraction has has 506 places, 458 transitions, 1116 flow [2021-06-10 11:36:39,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:39,846 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:39,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2021-06-10 11:36:39,847 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1352411205, now seen corresponding path program 1 times [2021-06-10 11:36:39,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:39,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369916200] [2021-06-10 11:36:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:39,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:39,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:39,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:39,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369916200] [2021-06-10 11:36:39,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:39,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:39,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089258872] [2021-06-10 11:36:39,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:39,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:39,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:39,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 458 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:39,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:39,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:39,976 INFO L129 PetriNetUnfolder]: 24/545 cut-off events. [2021-06-10 11:36:39,976 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:39,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 545 events. 24/545 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2292 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 658. Up to 19 conditions per place. [2021-06-10 11:36:39,994 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2021-06-10 11:36:39,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 458 transitions, 1128 flow [2021-06-10 11:36:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:39,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:39,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:39,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:39,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:39,996 INFO L185 Difference]: Start difference. First operand has 506 places, 458 transitions, 1116 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:39,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 458 transitions, 1128 flow [2021-06-10 11:36:39,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 458 transitions, 1123 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:40,001 INFO L241 Difference]: Finished difference. Result has 508 places, 457 transitions, 1112 flow [2021-06-10 11:36:40,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=508, PETRI_TRANSITIONS=457} [2021-06-10 11:36:40,001 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 19 predicate places. [2021-06-10 11:36:40,001 INFO L480 AbstractCegarLoop]: Abstraction has has 508 places, 457 transitions, 1112 flow [2021-06-10 11:36:40,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,001 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2021-06-10 11:36:40,001 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1351458916, now seen corresponding path program 1 times [2021-06-10 11:36:40,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615431894] [2021-06-10 11:36:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:40,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:40,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615431894] [2021-06-10 11:36:40,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133802975] [2021-06-10 11:36:40,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,015 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:40,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 457 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:40,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,133 INFO L129 PetriNetUnfolder]: 24/538 cut-off events. [2021-06-10 11:36:40,133 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:40,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 538 events. 24/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2238 event pairs, 0 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 652. Up to 19 conditions per place. [2021-06-10 11:36:40,149 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2021-06-10 11:36:40,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 455 transitions, 1115 flow [2021-06-10 11:36:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:40,150 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:40,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,151 INFO L185 Difference]: Start difference. First operand has 508 places, 457 transitions, 1112 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:40,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 455 transitions, 1115 flow [2021-06-10 11:36:40,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 455 transitions, 1108 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:40,156 INFO L241 Difference]: Finished difference. Result has 508 places, 455 transitions, 1101 flow [2021-06-10 11:36:40,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1101, PETRI_PLACES=508, PETRI_TRANSITIONS=455} [2021-06-10 11:36:40,156 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 19 predicate places. [2021-06-10 11:36:40,156 INFO L480 AbstractCegarLoop]: Abstraction has has 508 places, 455 transitions, 1101 flow [2021-06-10 11:36:40,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,156 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2021-06-10 11:36:40,156 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1351457893, now seen corresponding path program 1 times [2021-06-10 11:36:40,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434927587] [2021-06-10 11:36:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:40,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:40,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434927587] [2021-06-10 11:36:40,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136179138] [2021-06-10 11:36:40,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:40,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 455 transitions, 1101 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:40,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,293 INFO L129 PetriNetUnfolder]: 24/536 cut-off events. [2021-06-10 11:36:40,293 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:40,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 536 events. 24/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2220 event pairs, 0 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 652. Up to 19 conditions per place. [2021-06-10 11:36:40,310 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2021-06-10 11:36:40,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 453 transitions, 1114 flow [2021-06-10 11:36:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:40,311 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:40,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,313 INFO L185 Difference]: Start difference. First operand has 508 places, 455 transitions, 1101 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:40,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 453 transitions, 1114 flow [2021-06-10 11:36:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 453 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:40,317 INFO L241 Difference]: Finished difference. Result has 507 places, 453 transitions, 1097 flow [2021-06-10 11:36:40,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=507, PETRI_TRANSITIONS=453} [2021-06-10 11:36:40,318 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 18 predicate places. [2021-06-10 11:36:40,318 INFO L480 AbstractCegarLoop]: Abstraction has has 507 places, 453 transitions, 1097 flow [2021-06-10 11:36:40,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,318 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2021-06-10 11:36:40,318 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash 660253681, now seen corresponding path program 1 times [2021-06-10 11:36:40,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343418375] [2021-06-10 11:36:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:40,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:40,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343418375] [2021-06-10 11:36:40,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65744531] [2021-06-10 11:36:40,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:40,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 453 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:40,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,454 INFO L129 PetriNetUnfolder]: 23/544 cut-off events. [2021-06-10 11:36:40,454 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:40,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 544 events. 23/544 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2290 event pairs, 0 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 664. Up to 19 conditions per place. [2021-06-10 11:36:40,471 INFO L132 encePairwiseOnDemand]: 520/525 looper letters, 10 selfloop transitions, 3 changer transitions 0/455 dead transitions. [2021-06-10 11:36:40,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 455 transitions, 1127 flow [2021-06-10 11:36:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1443 transitions. [2021-06-10 11:36:40,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9161904761904762 [2021-06-10 11:36:40,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1443 transitions. [2021-06-10 11:36:40,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1443 transitions. [2021-06-10 11:36:40,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1443 transitions. [2021-06-10 11:36:40,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 481.0) internal successors, (1443), 3 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,474 INFO L185 Difference]: Start difference. First operand has 507 places, 453 transitions, 1097 flow. Second operand 3 states and 1443 transitions. [2021-06-10 11:36:40,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 455 transitions, 1127 flow [2021-06-10 11:36:40,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 455 transitions, 1126 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:40,478 INFO L241 Difference]: Finished difference. Result has 510 places, 455 transitions, 1120 flow [2021-06-10 11:36:40,478 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=510, PETRI_TRANSITIONS=455} [2021-06-10 11:36:40,478 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 21 predicate places. [2021-06-10 11:36:40,478 INFO L480 AbstractCegarLoop]: Abstraction has has 510 places, 455 transitions, 1120 flow [2021-06-10 11:36:40,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,479 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,479 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2021-06-10 11:36:40,479 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 660252658, now seen corresponding path program 1 times [2021-06-10 11:36:40,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747730004] [2021-06-10 11:36:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:40,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:40,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747730004] [2021-06-10 11:36:40,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92649426] [2021-06-10 11:36:40,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:40,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 455 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:40,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,609 INFO L129 PetriNetUnfolder]: 21/545 cut-off events. [2021-06-10 11:36:40,609 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:40,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 545 events. 21/545 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2309 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 664. Up to 19 conditions per place. [2021-06-10 11:36:40,626 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2021-06-10 11:36:40,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 455 transitions, 1132 flow [2021-06-10 11:36:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:40,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:40,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:40,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:40,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:40,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,629 INFO L185 Difference]: Start difference. First operand has 510 places, 455 transitions, 1120 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:40,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 455 transitions, 1132 flow [2021-06-10 11:36:40,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 455 transitions, 1127 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:40,633 INFO L241 Difference]: Finished difference. Result has 512 places, 454 transitions, 1116 flow [2021-06-10 11:36:40,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=512, PETRI_TRANSITIONS=454} [2021-06-10 11:36:40,633 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 23 predicate places. [2021-06-10 11:36:40,633 INFO L480 AbstractCegarLoop]: Abstraction has has 512 places, 454 transitions, 1116 flow [2021-06-10 11:36:40,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,634 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2021-06-10 11:36:40,634 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 659300369, now seen corresponding path program 1 times [2021-06-10 11:36:40,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124491116] [2021-06-10 11:36:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:40,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:40,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124491116] [2021-06-10 11:36:40,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66112032] [2021-06-10 11:36:40,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:40,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 454 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:40,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,763 INFO L129 PetriNetUnfolder]: 21/538 cut-off events. [2021-06-10 11:36:40,763 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:40,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 538 events. 21/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2253 event pairs, 0 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 658. Up to 19 conditions per place. [2021-06-10 11:36:40,780 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/452 dead transitions. [2021-06-10 11:36:40,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 452 transitions, 1119 flow [2021-06-10 11:36:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:40,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:40,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:40,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,783 INFO L185 Difference]: Start difference. First operand has 512 places, 454 transitions, 1116 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:40,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 452 transitions, 1119 flow [2021-06-10 11:36:40,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 452 transitions, 1112 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:40,787 INFO L241 Difference]: Finished difference. Result has 512 places, 452 transitions, 1105 flow [2021-06-10 11:36:40,787 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=512, PETRI_TRANSITIONS=452} [2021-06-10 11:36:40,788 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 23 predicate places. [2021-06-10 11:36:40,788 INFO L480 AbstractCegarLoop]: Abstraction has has 512 places, 452 transitions, 1105 flow [2021-06-10 11:36:40,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,788 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2021-06-10 11:36:40,788 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 659299346, now seen corresponding path program 1 times [2021-06-10 11:36:40,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912257563] [2021-06-10 11:36:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:40,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:40,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912257563] [2021-06-10 11:36:40,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115140512] [2021-06-10 11:36:40,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,802 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:40,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 452 transitions, 1105 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:40,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:40,918 INFO L129 PetriNetUnfolder]: 21/536 cut-off events. [2021-06-10 11:36:40,919 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:40,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 536 events. 21/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2237 event pairs, 0 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 658. Up to 19 conditions per place. [2021-06-10 11:36:40,935 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/450 dead transitions. [2021-06-10 11:36:40,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 450 transitions, 1118 flow [2021-06-10 11:36:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:40,937 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:40,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:40,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:40,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,938 INFO L185 Difference]: Start difference. First operand has 512 places, 452 transitions, 1105 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:40,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 450 transitions, 1118 flow [2021-06-10 11:36:40,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 450 transitions, 1117 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:40,943 INFO L241 Difference]: Finished difference. Result has 511 places, 450 transitions, 1101 flow [2021-06-10 11:36:40,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1101, PETRI_PLACES=511, PETRI_TRANSITIONS=450} [2021-06-10 11:36:40,943 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 22 predicate places. [2021-06-10 11:36:40,943 INFO L480 AbstractCegarLoop]: Abstraction has has 511 places, 450 transitions, 1101 flow [2021-06-10 11:36:40,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,943 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:40,943 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:40,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2021-06-10 11:36:40,944 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1533320224, now seen corresponding path program 1 times [2021-06-10 11:36:40,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:40,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626983632] [2021-06-10 11:36:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:40,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:40,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:40,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:40,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626983632] [2021-06-10 11:36:40,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:40,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:40,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678077006] [2021-06-10 11:36:40,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:40,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:40,960 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:40,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 450 transitions, 1101 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:40,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:40,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:40,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,077 INFO L129 PetriNetUnfolder]: 20/543 cut-off events. [2021-06-10 11:36:41,077 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:41,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 543 events. 20/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2296 event pairs, 0 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 663. Up to 19 conditions per place. [2021-06-10 11:36:41,095 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 6 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2021-06-10 11:36:41,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 451 transitions, 1117 flow [2021-06-10 11:36:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:41,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:41,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,098 INFO L185 Difference]: Start difference. First operand has 511 places, 450 transitions, 1101 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 451 transitions, 1117 flow [2021-06-10 11:36:41,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 451 transitions, 1116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:41,102 INFO L241 Difference]: Finished difference. Result has 513 places, 450 transitions, 1105 flow [2021-06-10 11:36:41,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=513, PETRI_TRANSITIONS=450} [2021-06-10 11:36:41,102 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 24 predicate places. [2021-06-10 11:36:41,102 INFO L480 AbstractCegarLoop]: Abstraction has has 513 places, 450 transitions, 1105 flow [2021-06-10 11:36:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,103 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2021-06-10 11:36:41,103 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1533321247, now seen corresponding path program 1 times [2021-06-10 11:36:41,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60881419] [2021-06-10 11:36:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:41,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:41,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60881419] [2021-06-10 11:36:41,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972653719] [2021-06-10 11:36:41,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:41,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 450 transitions, 1105 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:41,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,241 INFO L129 PetriNetUnfolder]: 18/545 cut-off events. [2021-06-10 11:36:41,241 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:41,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 545 events. 18/545 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2329 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 674. Up to 19 conditions per place. [2021-06-10 11:36:41,258 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/451 dead transitions. [2021-06-10 11:36:41,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 451 transitions, 1131 flow [2021-06-10 11:36:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:41,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:41,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,261 INFO L185 Difference]: Start difference. First operand has 513 places, 450 transitions, 1105 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:41,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 451 transitions, 1131 flow [2021-06-10 11:36:41,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 451 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:41,265 INFO L241 Difference]: Finished difference. Result has 516 places, 451 transitions, 1122 flow [2021-06-10 11:36:41,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=516, PETRI_TRANSITIONS=451} [2021-06-10 11:36:41,265 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 27 predicate places. [2021-06-10 11:36:41,266 INFO L480 AbstractCegarLoop]: Abstraction has has 516 places, 451 transitions, 1122 flow [2021-06-10 11:36:41,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,266 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2021-06-10 11:36:41,266 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1532367935, now seen corresponding path program 1 times [2021-06-10 11:36:41,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653421211] [2021-06-10 11:36:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:41,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:41,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653421211] [2021-06-10 11:36:41,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50716383] [2021-06-10 11:36:41,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,284 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:41,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 451 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:41,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,400 INFO L129 PetriNetUnfolder]: 18/538 cut-off events. [2021-06-10 11:36:41,400 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:41,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 538 events. 18/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2273 event pairs, 0 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 660. Up to 19 conditions per place. [2021-06-10 11:36:41,418 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2021-06-10 11:36:41,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 449 transitions, 1124 flow [2021-06-10 11:36:41,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:41,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:41,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:41,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:41,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:41,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,420 INFO L185 Difference]: Start difference. First operand has 516 places, 451 transitions, 1122 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:41,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 449 transitions, 1124 flow [2021-06-10 11:36:41,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 449 transitions, 1116 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:41,425 INFO L241 Difference]: Finished difference. Result has 516 places, 449 transitions, 1109 flow [2021-06-10 11:36:41,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=516, PETRI_TRANSITIONS=449} [2021-06-10 11:36:41,425 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 27 predicate places. [2021-06-10 11:36:41,425 INFO L480 AbstractCegarLoop]: Abstraction has has 516 places, 449 transitions, 1109 flow [2021-06-10 11:36:41,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,425 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2021-06-10 11:36:41,426 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1532366912, now seen corresponding path program 1 times [2021-06-10 11:36:41,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680033253] [2021-06-10 11:36:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:41,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:41,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680033253] [2021-06-10 11:36:41,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642639905] [2021-06-10 11:36:41,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,440 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:41,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 449 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:41,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,565 INFO L129 PetriNetUnfolder]: 18/536 cut-off events. [2021-06-10 11:36:41,565 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:41,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 536 events. 18/536 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2255 event pairs, 0 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 664. Up to 19 conditions per place. [2021-06-10 11:36:41,581 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/447 dead transitions. [2021-06-10 11:36:41,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 447 transitions, 1122 flow [2021-06-10 11:36:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:41,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:41,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:41,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:41,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:41,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,584 INFO L185 Difference]: Start difference. First operand has 516 places, 449 transitions, 1109 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:41,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 447 transitions, 1122 flow [2021-06-10 11:36:41,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 447 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:41,588 INFO L241 Difference]: Finished difference. Result has 515 places, 447 transitions, 1105 flow [2021-06-10 11:36:41,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1105, PETRI_PLACES=515, PETRI_TRANSITIONS=447} [2021-06-10 11:36:41,589 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 26 predicate places. [2021-06-10 11:36:41,589 INFO L480 AbstractCegarLoop]: Abstraction has has 515 places, 447 transitions, 1105 flow [2021-06-10 11:36:41,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,589 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2021-06-10 11:36:41,589 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1261676910, now seen corresponding path program 1 times [2021-06-10 11:36:41,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545918452] [2021-06-10 11:36:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:41,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:41,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545918452] [2021-06-10 11:36:41,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767487938] [2021-06-10 11:36:41,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,603 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:41,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 447 transitions, 1105 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:41,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,721 INFO L129 PetriNetUnfolder]: 16/541 cut-off events. [2021-06-10 11:36:41,722 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:41,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 541 events. 16/541 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2305 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 667. Up to 19 conditions per place. [2021-06-10 11:36:41,739 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 5 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2021-06-10 11:36:41,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 448 transitions, 1121 flow [2021-06-10 11:36:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:41,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:41,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:41,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,741 INFO L185 Difference]: Start difference. First operand has 515 places, 447 transitions, 1105 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:41,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 448 transitions, 1121 flow [2021-06-10 11:36:41,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 448 transitions, 1120 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:41,746 INFO L241 Difference]: Finished difference. Result has 518 places, 448 transitions, 1118 flow [2021-06-10 11:36:41,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=518, PETRI_TRANSITIONS=448} [2021-06-10 11:36:41,746 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 29 predicate places. [2021-06-10 11:36:41,746 INFO L480 AbstractCegarLoop]: Abstraction has has 518 places, 448 transitions, 1118 flow [2021-06-10 11:36:41,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,746 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2021-06-10 11:36:41,746 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1261675887, now seen corresponding path program 1 times [2021-06-10 11:36:41,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622567255] [2021-06-10 11:36:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:41,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:41,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622567255] [2021-06-10 11:36:41,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197142404] [2021-06-10 11:36:41,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:41,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 448 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:41,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:41,889 INFO L129 PetriNetUnfolder]: 16/542 cut-off events. [2021-06-10 11:36:41,889 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:41,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 542 events. 16/542 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2316 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 675. Up to 19 conditions per place. [2021-06-10 11:36:41,906 INFO L132 encePairwiseOnDemand]: 521/525 looper letters, 9 selfloop transitions, 3 changer transitions 0/449 dead transitions. [2021-06-10 11:36:41,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 449 transitions, 1144 flow [2021-06-10 11:36:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1441 transitions. [2021-06-10 11:36:41,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149206349206349 [2021-06-10 11:36:41,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:41,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1441 transitions. [2021-06-10 11:36:41,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,910 INFO L185 Difference]: Start difference. First operand has 518 places, 448 transitions, 1118 flow. Second operand 3 states and 1441 transitions. [2021-06-10 11:36:41,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 449 transitions, 1144 flow [2021-06-10 11:36:41,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 449 transitions, 1142 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:41,914 INFO L241 Difference]: Finished difference. Result has 521 places, 449 transitions, 1134 flow [2021-06-10 11:36:41,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=521, PETRI_TRANSITIONS=449} [2021-06-10 11:36:41,914 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 32 predicate places. [2021-06-10 11:36:41,914 INFO L480 AbstractCegarLoop]: Abstraction has has 521 places, 449 transitions, 1134 flow [2021-06-10 11:36:41,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:41,915 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:41,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-06-10 11:36:41,915 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1262629199, now seen corresponding path program 1 times [2021-06-10 11:36:41,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:41,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155976381] [2021-06-10 11:36:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:41,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:41,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:41,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:41,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155976381] [2021-06-10 11:36:41,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:41,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:41,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341598129] [2021-06-10 11:36:41,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:41,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:41,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:41,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 449 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:41,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:41,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:41,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,047 INFO L129 PetriNetUnfolder]: 15/538 cut-off events. [2021-06-10 11:36:42,047 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:42,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 538 events. 15/538 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2290 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 668. Up to 19 conditions per place. [2021-06-10 11:36:42,064 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/446 dead transitions. [2021-06-10 11:36:42,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 446 transitions, 1131 flow [2021-06-10 11:36:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:42,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:42,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,067 INFO L185 Difference]: Start difference. First operand has 521 places, 449 transitions, 1134 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:42,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 446 transitions, 1131 flow [2021-06-10 11:36:42,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 446 transitions, 1123 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:42,071 INFO L241 Difference]: Finished difference. Result has 520 places, 446 transitions, 1113 flow [2021-06-10 11:36:42,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=520, PETRI_TRANSITIONS=446} [2021-06-10 11:36:42,072 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 31 predicate places. [2021-06-10 11:36:42,072 INFO L480 AbstractCegarLoop]: Abstraction has has 520 places, 446 transitions, 1113 flow [2021-06-10 11:36:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,072 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2021-06-10 11:36:42,072 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1262630222, now seen corresponding path program 1 times [2021-06-10 11:36:42,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046533201] [2021-06-10 11:36:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:42,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:42,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:42,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046533201] [2021-06-10 11:36:42,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:42,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:42,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691261166] [2021-06-10 11:36:42,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:42,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:42,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:42,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 446 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:42,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:42,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,208 INFO L129 PetriNetUnfolder]: 15/536 cut-off events. [2021-06-10 11:36:42,208 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:42,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 536 events. 15/536 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2273 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 671. Up to 19 conditions per place. [2021-06-10 11:36:42,226 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2021-06-10 11:36:42,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 444 transitions, 1126 flow [2021-06-10 11:36:42,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:42,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:42,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,229 INFO L185 Difference]: Start difference. First operand has 520 places, 446 transitions, 1113 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:42,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 444 transitions, 1126 flow [2021-06-10 11:36:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 444 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:42,233 INFO L241 Difference]: Finished difference. Result has 519 places, 444 transitions, 1109 flow [2021-06-10 11:36:42,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=519, PETRI_TRANSITIONS=444} [2021-06-10 11:36:42,233 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 30 predicate places. [2021-06-10 11:36:42,233 INFO L480 AbstractCegarLoop]: Abstraction has has 519 places, 444 transitions, 1109 flow [2021-06-10 11:36:42,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,234 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2021-06-10 11:36:42,234 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash -708060641, now seen corresponding path program 1 times [2021-06-10 11:36:42,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269636197] [2021-06-10 11:36:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:42,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:42,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:42,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269636197] [2021-06-10 11:36:42,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:42,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:42,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967008488] [2021-06-10 11:36:42,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:42,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:42,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:42,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 444 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:42,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:42,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,379 INFO L129 PetriNetUnfolder]: 14/544 cut-off events. [2021-06-10 11:36:42,380 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:42,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 544 events. 14/544 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2343 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 683. Up to 19 conditions per place. [2021-06-10 11:36:42,397 INFO L132 encePairwiseOnDemand]: 520/525 looper letters, 10 selfloop transitions, 3 changer transitions 0/446 dead transitions. [2021-06-10 11:36:42,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 446 transitions, 1139 flow [2021-06-10 11:36:42,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1443 transitions. [2021-06-10 11:36:42,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9161904761904762 [2021-06-10 11:36:42,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1443 transitions. [2021-06-10 11:36:42,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1443 transitions. [2021-06-10 11:36:42,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1443 transitions. [2021-06-10 11:36:42,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 481.0) internal successors, (1443), 3 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,400 INFO L185 Difference]: Start difference. First operand has 519 places, 444 transitions, 1109 flow. Second operand 3 states and 1443 transitions. [2021-06-10 11:36:42,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 446 transitions, 1139 flow [2021-06-10 11:36:42,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 446 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:42,404 INFO L241 Difference]: Finished difference. Result has 522 places, 446 transitions, 1132 flow [2021-06-10 11:36:42,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=522, PETRI_TRANSITIONS=446} [2021-06-10 11:36:42,404 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 33 predicate places. [2021-06-10 11:36:42,405 INFO L480 AbstractCegarLoop]: Abstraction has has 522 places, 446 transitions, 1132 flow [2021-06-10 11:36:42,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,405 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2021-06-10 11:36:42,405 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -708059618, now seen corresponding path program 1 times [2021-06-10 11:36:42,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506686157] [2021-06-10 11:36:42,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:42,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:42,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:42,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506686157] [2021-06-10 11:36:42,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:42,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:42,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655817885] [2021-06-10 11:36:42,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:42,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:42,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:42,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 446 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:42,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:42,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,559 INFO L129 PetriNetUnfolder]: 13/542 cut-off events. [2021-06-10 11:36:42,559 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:42,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 542 events. 13/542 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2331 event pairs, 0 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 680. Up to 19 conditions per place. [2021-06-10 11:36:42,576 INFO L132 encePairwiseOnDemand]: 522/525 looper letters, 5 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2021-06-10 11:36:42,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 446 transitions, 1144 flow [2021-06-10 11:36:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2021-06-10 11:36:42,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212698412698412 [2021-06-10 11:36:42,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1451 transitions. [2021-06-10 11:36:42,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1451 transitions. [2021-06-10 11:36:42,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1451 transitions. [2021-06-10 11:36:42,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,579 INFO L185 Difference]: Start difference. First operand has 522 places, 446 transitions, 1132 flow. Second operand 3 states and 1451 transitions. [2021-06-10 11:36:42,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 446 transitions, 1144 flow [2021-06-10 11:36:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 446 transitions, 1139 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:42,583 INFO L241 Difference]: Finished difference. Result has 525 places, 446 transitions, 1137 flow [2021-06-10 11:36:42,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=525, PETRI_TRANSITIONS=446} [2021-06-10 11:36:42,583 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 36 predicate places. [2021-06-10 11:36:42,583 INFO L480 AbstractCegarLoop]: Abstraction has has 525 places, 446 transitions, 1137 flow [2021-06-10 11:36:42,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,584 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2021-06-10 11:36:42,584 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash -707107329, now seen corresponding path program 1 times [2021-06-10 11:36:42,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032175688] [2021-06-10 11:36:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:42,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:42,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:42,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032175688] [2021-06-10 11:36:42,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:42,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:42,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692280629] [2021-06-10 11:36:42,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:42,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:42,598 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 525 [2021-06-10 11:36:42,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 446 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:42,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 525 [2021-06-10 11:36:42,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,725 INFO L129 PetriNetUnfolder]: 12/538 cut-off events. [2021-06-10 11:36:42,726 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:42,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 538 events. 12/538 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2308 event pairs, 0 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 677. Up to 19 conditions per place. [2021-06-10 11:36:42,742 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 5 selfloop transitions, 1 changer transitions 0/443 dead transitions. [2021-06-10 11:36:42,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 443 transitions, 1134 flow [2021-06-10 11:36:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1450 transitions. [2021-06-10 11:36:42,743 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:36:42,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1450 transitions. [2021-06-10 11:36:42,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,745 INFO L185 Difference]: Start difference. First operand has 525 places, 446 transitions, 1137 flow. Second operand 3 states and 1450 transitions. [2021-06-10 11:36:42,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 443 transitions, 1134 flow [2021-06-10 11:36:42,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 443 transitions, 1127 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:42,749 INFO L241 Difference]: Finished difference. Result has 524 places, 443 transitions, 1117 flow [2021-06-10 11:36:42,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1117, PETRI_PLACES=524, PETRI_TRANSITIONS=443} [2021-06-10 11:36:42,749 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 35 predicate places. [2021-06-10 11:36:42,749 INFO L480 AbstractCegarLoop]: Abstraction has has 524 places, 443 transitions, 1117 flow [2021-06-10 11:36:42,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,750 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2021-06-10 11:36:42,750 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash -707106306, now seen corresponding path program 1 times [2021-06-10 11:36:42,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017360041] [2021-06-10 11:36:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:42,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:42,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:42,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:42,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017360041] [2021-06-10 11:36:42,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:42,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:42,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852281639] [2021-06-10 11:36:42,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:42,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:42,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 525 [2021-06-10 11:36:42,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 443 transitions, 1117 flow. Second operand has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:42,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 525 [2021-06-10 11:36:42,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:42,904 INFO L129 PetriNetUnfolder]: 12/536 cut-off events. [2021-06-10 11:36:42,904 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-06-10 11:36:42,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 536 events. 12/536 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2290 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 678. Up to 19 conditions per place. [2021-06-10 11:36:42,915 INFO L132 encePairwiseOnDemand]: 523/525 looper letters, 8 selfloop transitions, 1 changer transitions 0/441 dead transitions. [2021-06-10 11:36:42,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 441 transitions, 1130 flow [2021-06-10 11:36:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1438 transitions. [2021-06-10 11:36:42,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9130158730158731 [2021-06-10 11:36:42,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:42,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1438 transitions. [2021-06-10 11:36:42,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 525.0) internal successors, (2100), 4 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,918 INFO L185 Difference]: Start difference. First operand has 524 places, 443 transitions, 1117 flow. Second operand 3 states and 1438 transitions. [2021-06-10 11:36:42,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 441 transitions, 1130 flow [2021-06-10 11:36:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 441 transitions, 1129 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:42,922 INFO L241 Difference]: Finished difference. Result has 523 places, 441 transitions, 1113 flow [2021-06-10 11:36:42,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=523, PETRI_TRANSITIONS=441} [2021-06-10 11:36:42,922 INFO L343 CegarLoopForPetriNet]: 489 programPoint places, 34 predicate places. [2021-06-10 11:36:42,922 INFO L480 AbstractCegarLoop]: Abstraction has has 523 places, 441 transitions, 1113 flow [2021-06-10 11:36:42,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 478.3333333333333) internal successors, (1435), 3 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:42,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:42,922 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:42,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2021-06-10 11:36:42,922 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash 411114303, now seen corresponding path program 1 times [2021-06-10 11:36:42,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:42,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732123192] [2021-06-10 11:36:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:42,931 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:42,935 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:42,943 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:42,944 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:42,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2021-06-10 11:36:42,944 WARN L342 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:42,944 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2021-06-10 11:36:42,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:42,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of19ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of19ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:43,041 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:43,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-06-10 11:36:43,042 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:43,042 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:43,042 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:43,042 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:43,042 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:43,042 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:43,042 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:43,042 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:43,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 515 places, 553 transitions, 1543 flow [2021-06-10 11:36:43,174 INFO L129 PetriNetUnfolder]: 96/723 cut-off events. [2021-06-10 11:36:43,174 INFO L130 PetriNetUnfolder]: For 1311/1311 co-relation queries the response was YES. [2021-06-10 11:36:43,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 723 events. 96/723 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3017 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 902. Up to 40 conditions per place. [2021-06-10 11:36:43,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 515 places, 553 transitions, 1543 flow [2021-06-10 11:36:43,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 515 places, 553 transitions, 1543 flow [2021-06-10 11:36:43,213 INFO L129 PetriNetUnfolder]: 10/107 cut-off events. [2021-06-10 11:36:43,214 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:43,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,214 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-06-10 11:36:43,214 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1226880680, now seen corresponding path program 1 times [2021-06-10 11:36:43,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416558092] [2021-06-10 11:36:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:43,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:43,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416558092] [2021-06-10 11:36:43,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820033417] [2021-06-10 11:36:43,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:43,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 553 transitions, 1543 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:43,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:43,342 INFO L129 PetriNetUnfolder]: 56/572 cut-off events. [2021-06-10 11:36:43,342 INFO L130 PetriNetUnfolder]: For 1312/1312 co-relation queries the response was YES. [2021-06-10 11:36:43,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 572 events. 56/572 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2219 event pairs, 0 based on Foata normal form. 79/574 useless extension candidates. Maximal degree in co-relation 761. Up to 20 conditions per place. [2021-06-10 11:36:43,365 INFO L132 encePairwiseOnDemand]: 530/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2021-06-10 11:36:43,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 510 transitions, 1471 flow [2021-06-10 11:36:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1571 transitions. [2021-06-10 11:36:43,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.946955997588909 [2021-06-10 11:36:43,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1571 transitions. [2021-06-10 11:36:43,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1571 transitions. [2021-06-10 11:36:43,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:43,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1571 transitions. [2021-06-10 11:36:43,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 523.6666666666666) internal successors, (1571), 3 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,369 INFO L185 Difference]: Start difference. First operand has 515 places, 553 transitions, 1543 flow. Second operand 3 states and 1571 transitions. [2021-06-10 11:36:43,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 510 transitions, 1471 flow [2021-06-10 11:36:43,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 510 transitions, 1129 flow, removed 171 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:43,374 INFO L241 Difference]: Finished difference. Result has 494 places, 509 transitions, 1118 flow [2021-06-10 11:36:43,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=494, PETRI_TRANSITIONS=509} [2021-06-10 11:36:43,374 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -21 predicate places. [2021-06-10 11:36:43,374 INFO L480 AbstractCegarLoop]: Abstraction has has 494 places, 509 transitions, 1118 flow [2021-06-10 11:36:43,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,374 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-06-10 11:36:43,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2021-06-10 11:36:43,375 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1226879657, now seen corresponding path program 1 times [2021-06-10 11:36:43,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773201715] [2021-06-10 11:36:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:43,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:43,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773201715] [2021-06-10 11:36:43,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894027871] [2021-06-10 11:36:43,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:43,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 509 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:43,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:43,501 INFO L129 PetriNetUnfolder]: 54/574 cut-off events. [2021-06-10 11:36:43,501 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:43,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 574 events. 54/574 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2247 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 637. Up to 20 conditions per place. [2021-06-10 11:36:43,523 INFO L132 encePairwiseOnDemand]: 549/553 looper letters, 9 selfloop transitions, 3 changer transitions 0/510 dead transitions. [2021-06-10 11:36:43,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 510 transitions, 1144 flow [2021-06-10 11:36:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2021-06-10 11:36:43,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2021-06-10 11:36:43,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1519 transitions. [2021-06-10 11:36:43,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1519 transitions. [2021-06-10 11:36:43,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:43,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1519 transitions. [2021-06-10 11:36:43,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,526 INFO L185 Difference]: Start difference. First operand has 494 places, 509 transitions, 1118 flow. Second operand 3 states and 1519 transitions. [2021-06-10 11:36:43,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 510 transitions, 1144 flow [2021-06-10 11:36:43,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 510 transitions, 1143 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:43,530 INFO L241 Difference]: Finished difference. Result has 497 places, 510 transitions, 1135 flow [2021-06-10 11:36:43,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=497, PETRI_TRANSITIONS=510} [2021-06-10 11:36:43,531 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -18 predicate places. [2021-06-10 11:36:43,531 INFO L480 AbstractCegarLoop]: Abstraction has has 497 places, 510 transitions, 1135 flow [2021-06-10 11:36:43,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,531 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,531 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-06-10 11:36:43,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2021-06-10 11:36:43,531 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1227832969, now seen corresponding path program 1 times [2021-06-10 11:36:43,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562012665] [2021-06-10 11:36:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:43,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:43,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562012665] [2021-06-10 11:36:43,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869202552] [2021-06-10 11:36:43,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,543 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:43,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 510 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:43,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:43,648 INFO L129 PetriNetUnfolder]: 54/567 cut-off events. [2021-06-10 11:36:43,648 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:43,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 567 events. 54/567 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2189 event pairs, 0 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 620. Up to 20 conditions per place. [2021-06-10 11:36:43,669 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/508 dead transitions. [2021-06-10 11:36:43,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 508 transitions, 1137 flow [2021-06-10 11:36:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:43,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:43,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:43,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:43,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:43,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:43,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,672 INFO L185 Difference]: Start difference. First operand has 497 places, 510 transitions, 1135 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:43,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 508 transitions, 1137 flow [2021-06-10 11:36:43,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 508 transitions, 1129 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:43,676 INFO L241 Difference]: Finished difference. Result has 497 places, 508 transitions, 1122 flow [2021-06-10 11:36:43,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=497, PETRI_TRANSITIONS=508} [2021-06-10 11:36:43,676 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -18 predicate places. [2021-06-10 11:36:43,676 INFO L480 AbstractCegarLoop]: Abstraction has has 497 places, 508 transitions, 1122 flow [2021-06-10 11:36:43,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,677 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-06-10 11:36:43,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-06-10 11:36:43,677 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1227833992, now seen corresponding path program 1 times [2021-06-10 11:36:43,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435565220] [2021-06-10 11:36:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:43,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:43,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435565220] [2021-06-10 11:36:43,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781456360] [2021-06-10 11:36:43,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:43,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 508 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:43,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:43,794 INFO L129 PetriNetUnfolder]: 54/565 cut-off events. [2021-06-10 11:36:43,794 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:43,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 565 events. 54/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2177 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 627. Up to 20 conditions per place. [2021-06-10 11:36:43,814 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2021-06-10 11:36:43,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 506 transitions, 1135 flow [2021-06-10 11:36:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:43,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:43,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:43,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:43,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:43,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:43,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,817 INFO L185 Difference]: Start difference. First operand has 497 places, 508 transitions, 1122 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:43,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 506 transitions, 1135 flow [2021-06-10 11:36:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 506 transitions, 1134 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:43,821 INFO L241 Difference]: Finished difference. Result has 496 places, 506 transitions, 1118 flow [2021-06-10 11:36:43,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=496, PETRI_TRANSITIONS=506} [2021-06-10 11:36:43,822 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -19 predicate places. [2021-06-10 11:36:43,822 INFO L480 AbstractCegarLoop]: Abstraction has has 496 places, 506 transitions, 1118 flow [2021-06-10 11:36:43,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,822 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:43,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2021-06-10 11:36:43,822 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1997761802, now seen corresponding path program 1 times [2021-06-10 11:36:43,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076949606] [2021-06-10 11:36:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:43,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:43,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076949606] [2021-06-10 11:36:43,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46212527] [2021-06-10 11:36:43,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:43,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 506 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:43,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:43,942 INFO L129 PetriNetUnfolder]: 52/570 cut-off events. [2021-06-10 11:36:43,942 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:43,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 570 events. 52/570 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2226 event pairs, 0 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 630. Up to 20 conditions per place. [2021-06-10 11:36:43,963 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2021-06-10 11:36:43,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 507 transitions, 1134 flow [2021-06-10 11:36:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:43,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:43,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:43,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:43,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:43,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:43,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,966 INFO L185 Difference]: Start difference. First operand has 496 places, 506 transitions, 1118 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:43,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 507 transitions, 1134 flow [2021-06-10 11:36:43,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 507 transitions, 1133 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:43,970 INFO L241 Difference]: Finished difference. Result has 499 places, 507 transitions, 1131 flow [2021-06-10 11:36:43,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1131, PETRI_PLACES=499, PETRI_TRANSITIONS=507} [2021-06-10 11:36:43,970 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -16 predicate places. [2021-06-10 11:36:43,970 INFO L480 AbstractCegarLoop]: Abstraction has has 499 places, 507 transitions, 1131 flow [2021-06-10 11:36:43,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:43,971 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:43,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2021-06-10 11:36:43,971 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1997762825, now seen corresponding path program 1 times [2021-06-10 11:36:43,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:43,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860556301] [2021-06-10 11:36:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:43,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:43,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:43,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:43,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860556301] [2021-06-10 11:36:43,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:43,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:43,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276110460] [2021-06-10 11:36:43,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:43,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:43,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:43,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:43,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:43,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 507 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:43,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:43,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:43,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,109 INFO L129 PetriNetUnfolder]: 52/571 cut-off events. [2021-06-10 11:36:44,109 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:44,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 571 events. 52/571 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2233 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 638. Up to 20 conditions per place. [2021-06-10 11:36:44,131 INFO L132 encePairwiseOnDemand]: 549/553 looper letters, 9 selfloop transitions, 3 changer transitions 0/508 dead transitions. [2021-06-10 11:36:44,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 508 transitions, 1157 flow [2021-06-10 11:36:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2021-06-10 11:36:44,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2021-06-10 11:36:44,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1519 transitions. [2021-06-10 11:36:44,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1519 transitions. [2021-06-10 11:36:44,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1519 transitions. [2021-06-10 11:36:44,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,134 INFO L185 Difference]: Start difference. First operand has 499 places, 507 transitions, 1131 flow. Second operand 3 states and 1519 transitions. [2021-06-10 11:36:44,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 508 transitions, 1157 flow [2021-06-10 11:36:44,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 508 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:44,138 INFO L241 Difference]: Finished difference. Result has 502 places, 508 transitions, 1147 flow [2021-06-10 11:36:44,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=502, PETRI_TRANSITIONS=508} [2021-06-10 11:36:44,139 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -13 predicate places. [2021-06-10 11:36:44,139 INFO L480 AbstractCegarLoop]: Abstraction has has 502 places, 508 transitions, 1147 flow [2021-06-10 11:36:44,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,139 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2021-06-10 11:36:44,139 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1996808490, now seen corresponding path program 1 times [2021-06-10 11:36:44,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699872118] [2021-06-10 11:36:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:44,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:44,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699872118] [2021-06-10 11:36:44,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914993692] [2021-06-10 11:36:44,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:44,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 508 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:44,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,265 INFO L129 PetriNetUnfolder]: 51/568 cut-off events. [2021-06-10 11:36:44,265 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:36:44,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 568 events. 51/568 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2215 event pairs, 0 based on Foata normal form. 2/500 useless extension candidates. Maximal degree in co-relation 637. Up to 20 conditions per place. [2021-06-10 11:36:44,286 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 9 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2021-06-10 11:36:44,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 506 transitions, 1155 flow [2021-06-10 11:36:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2021-06-10 11:36:44,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9150090415913201 [2021-06-10 11:36:44,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2021-06-10 11:36:44,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2021-06-10 11:36:44,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2021-06-10 11:36:44,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,289 INFO L185 Difference]: Start difference. First operand has 502 places, 508 transitions, 1147 flow. Second operand 3 states and 1518 transitions. [2021-06-10 11:36:44,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 506 transitions, 1155 flow [2021-06-10 11:36:44,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 506 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:44,293 INFO L241 Difference]: Finished difference. Result has 503 places, 506 transitions, 1136 flow [2021-06-10 11:36:44,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=503, PETRI_TRANSITIONS=506} [2021-06-10 11:36:44,293 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -12 predicate places. [2021-06-10 11:36:44,293 INFO L480 AbstractCegarLoop]: Abstraction has has 503 places, 506 transitions, 1136 flow [2021-06-10 11:36:44,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,294 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2021-06-10 11:36:44,294 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1996809513, now seen corresponding path program 1 times [2021-06-10 11:36:44,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498289049] [2021-06-10 11:36:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:44,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:44,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498289049] [2021-06-10 11:36:44,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405307999] [2021-06-10 11:36:44,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,306 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:44,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 506 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:44,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,430 INFO L129 PetriNetUnfolder]: 51/565 cut-off events. [2021-06-10 11:36:44,431 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:44,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 565 events. 51/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2194 event pairs, 0 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 631. Up to 20 conditions per place. [2021-06-10 11:36:44,450 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/503 dead transitions. [2021-06-10 11:36:44,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 503 transitions, 1137 flow [2021-06-10 11:36:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:44,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:44,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,453 INFO L185 Difference]: Start difference. First operand has 503 places, 506 transitions, 1136 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 503 transitions, 1137 flow [2021-06-10 11:36:44,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 503 transitions, 1132 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:44,458 INFO L241 Difference]: Finished difference. Result has 500 places, 503 transitions, 1122 flow [2021-06-10 11:36:44,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=500, PETRI_TRANSITIONS=503} [2021-06-10 11:36:44,458 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -15 predicate places. [2021-06-10 11:36:44,458 INFO L480 AbstractCegarLoop]: Abstraction has has 500 places, 503 transitions, 1122 flow [2021-06-10 11:36:44,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,458 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,458 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2021-06-10 11:36:44,458 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 485468151, now seen corresponding path program 1 times [2021-06-10 11:36:44,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195933992] [2021-06-10 11:36:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:44,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:44,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195933992] [2021-06-10 11:36:44,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926424786] [2021-06-10 11:36:44,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:44,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 503 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:44,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,587 INFO L129 PetriNetUnfolder]: 50/573 cut-off events. [2021-06-10 11:36:44,588 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:44,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 573 events. 50/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2263 event pairs, 0 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 648. Up to 20 conditions per place. [2021-06-10 11:36:44,608 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/505 dead transitions. [2021-06-10 11:36:44,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 505 transitions, 1152 flow [2021-06-10 11:36:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:44,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:44,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:44,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:44,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:44,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,611 INFO L185 Difference]: Start difference. First operand has 500 places, 503 transitions, 1122 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:44,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 505 transitions, 1152 flow [2021-06-10 11:36:44,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 505 transitions, 1151 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:44,616 INFO L241 Difference]: Finished difference. Result has 503 places, 505 transitions, 1145 flow [2021-06-10 11:36:44,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1145, PETRI_PLACES=503, PETRI_TRANSITIONS=505} [2021-06-10 11:36:44,616 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -12 predicate places. [2021-06-10 11:36:44,616 INFO L480 AbstractCegarLoop]: Abstraction has has 503 places, 505 transitions, 1145 flow [2021-06-10 11:36:44,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,616 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2021-06-10 11:36:44,616 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash 485469174, now seen corresponding path program 1 times [2021-06-10 11:36:44,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664281599] [2021-06-10 11:36:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:44,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:44,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664281599] [2021-06-10 11:36:44,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537135333] [2021-06-10 11:36:44,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:44,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 505 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:44,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,735 INFO L129 PetriNetUnfolder]: 49/571 cut-off events. [2021-06-10 11:36:44,735 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:44,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 571 events. 49/571 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2250 event pairs, 0 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 643. Up to 20 conditions per place. [2021-06-10 11:36:44,756 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/505 dead transitions. [2021-06-10 11:36:44,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 505 transitions, 1157 flow [2021-06-10 11:36:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:44,757 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:44,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:44,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:44,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:44,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,759 INFO L185 Difference]: Start difference. First operand has 503 places, 505 transitions, 1145 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:44,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 505 transitions, 1157 flow [2021-06-10 11:36:44,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 505 transitions, 1152 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:44,763 INFO L241 Difference]: Finished difference. Result has 506 places, 505 transitions, 1150 flow [2021-06-10 11:36:44,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=506, PETRI_TRANSITIONS=505} [2021-06-10 11:36:44,763 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -9 predicate places. [2021-06-10 11:36:44,763 INFO L480 AbstractCegarLoop]: Abstraction has has 506 places, 505 transitions, 1150 flow [2021-06-10 11:36:44,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,764 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2021-06-10 11:36:44,764 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 486421463, now seen corresponding path program 1 times [2021-06-10 11:36:44,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737240436] [2021-06-10 11:36:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:44,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:44,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737240436] [2021-06-10 11:36:44,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376948550] [2021-06-10 11:36:44,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:44,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 505 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:44,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:44,883 INFO L129 PetriNetUnfolder]: 48/567 cut-off events. [2021-06-10 11:36:44,883 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:44,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 567 events. 48/567 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2225 event pairs, 0 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 640. Up to 20 conditions per place. [2021-06-10 11:36:44,904 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2021-06-10 11:36:44,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 502 transitions, 1147 flow [2021-06-10 11:36:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:44,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:44,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:44,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:44,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,908 INFO L185 Difference]: Start difference. First operand has 506 places, 505 transitions, 1150 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:44,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 502 transitions, 1147 flow [2021-06-10 11:36:44,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 502 transitions, 1140 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:44,912 INFO L241 Difference]: Finished difference. Result has 505 places, 502 transitions, 1130 flow [2021-06-10 11:36:44,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=505, PETRI_TRANSITIONS=502} [2021-06-10 11:36:44,912 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -10 predicate places. [2021-06-10 11:36:44,913 INFO L480 AbstractCegarLoop]: Abstraction has has 505 places, 502 transitions, 1130 flow [2021-06-10 11:36:44,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,913 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:44,913 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:44,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2021-06-10 11:36:44,913 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash 486422486, now seen corresponding path program 1 times [2021-06-10 11:36:44,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:44,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748088400] [2021-06-10 11:36:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:44,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:44,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:44,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:44,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748088400] [2021-06-10 11:36:44,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:44,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:44,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730492073] [2021-06-10 11:36:44,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:44,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:44,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:44,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:44,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:44,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 502 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:44,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:44,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:44,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,115 INFO L129 PetriNetUnfolder]: 48/565 cut-off events. [2021-06-10 11:36:45,115 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:45,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 565 events. 48/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2211 event pairs, 0 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 641. Up to 20 conditions per place. [2021-06-10 11:36:45,135 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/500 dead transitions. [2021-06-10 11:36:45,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 500 transitions, 1143 flow [2021-06-10 11:36:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:45,136 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:45,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,138 INFO L185 Difference]: Start difference. First operand has 505 places, 502 transitions, 1130 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:45,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 500 transitions, 1143 flow [2021-06-10 11:36:45,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 500 transitions, 1142 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:45,142 INFO L241 Difference]: Finished difference. Result has 504 places, 500 transitions, 1126 flow [2021-06-10 11:36:45,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=504, PETRI_TRANSITIONS=500} [2021-06-10 11:36:45,142 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -11 predicate places. [2021-06-10 11:36:45,142 INFO L480 AbstractCegarLoop]: Abstraction has has 504 places, 500 transitions, 1126 flow [2021-06-10 11:36:45,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,142 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2021-06-10 11:36:45,143 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 924283384, now seen corresponding path program 1 times [2021-06-10 11:36:45,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573401175] [2021-06-10 11:36:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:45,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:45,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573401175] [2021-06-10 11:36:45,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655899588] [2021-06-10 11:36:45,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:45,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 500 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:45,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,269 INFO L129 PetriNetUnfolder]: 47/573 cut-off events. [2021-06-10 11:36:45,269 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:45,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 573 events. 47/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2280 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 653. Up to 20 conditions per place. [2021-06-10 11:36:45,290 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/502 dead transitions. [2021-06-10 11:36:45,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 502 transitions, 1156 flow [2021-06-10 11:36:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:45,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:45,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:45,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:45,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:45,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,293 INFO L185 Difference]: Start difference. First operand has 504 places, 500 transitions, 1126 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:45,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 502 transitions, 1156 flow [2021-06-10 11:36:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 502 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:45,297 INFO L241 Difference]: Finished difference. Result has 507 places, 502 transitions, 1149 flow [2021-06-10 11:36:45,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1149, PETRI_PLACES=507, PETRI_TRANSITIONS=502} [2021-06-10 11:36:45,297 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -8 predicate places. [2021-06-10 11:36:45,297 INFO L480 AbstractCegarLoop]: Abstraction has has 507 places, 502 transitions, 1149 flow [2021-06-10 11:36:45,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,297 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2021-06-10 11:36:45,298 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash 924284407, now seen corresponding path program 1 times [2021-06-10 11:36:45,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528147299] [2021-06-10 11:36:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:45,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:45,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528147299] [2021-06-10 11:36:45,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870208919] [2021-06-10 11:36:45,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:45,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 502 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:45,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,426 INFO L129 PetriNetUnfolder]: 46/571 cut-off events. [2021-06-10 11:36:45,426 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:45,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 571 events. 46/571 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2268 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 650. Up to 20 conditions per place. [2021-06-10 11:36:45,447 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/502 dead transitions. [2021-06-10 11:36:45,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 502 transitions, 1161 flow [2021-06-10 11:36:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:45,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:45,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,450 INFO L185 Difference]: Start difference. First operand has 507 places, 502 transitions, 1149 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 502 transitions, 1161 flow [2021-06-10 11:36:45,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 502 transitions, 1156 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:45,454 INFO L241 Difference]: Finished difference. Result has 510 places, 502 transitions, 1154 flow [2021-06-10 11:36:45,454 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=510, PETRI_TRANSITIONS=502} [2021-06-10 11:36:45,455 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -5 predicate places. [2021-06-10 11:36:45,455 INFO L480 AbstractCegarLoop]: Abstraction has has 510 places, 502 transitions, 1154 flow [2021-06-10 11:36:45,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,455 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2021-06-10 11:36:45,455 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 925236696, now seen corresponding path program 1 times [2021-06-10 11:36:45,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971373164] [2021-06-10 11:36:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:45,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:45,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971373164] [2021-06-10 11:36:45,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733811435] [2021-06-10 11:36:45,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:45,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 502 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:45,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,577 INFO L129 PetriNetUnfolder]: 45/567 cut-off events. [2021-06-10 11:36:45,577 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:45,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 567 events. 45/567 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2239 event pairs, 0 based on Foata normal form. 1/505 useless extension candidates. Maximal degree in co-relation 647. Up to 20 conditions per place. [2021-06-10 11:36:45,598 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2021-06-10 11:36:45,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 499 transitions, 1151 flow [2021-06-10 11:36:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:45,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:45,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:45,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:45,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:45,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,601 INFO L185 Difference]: Start difference. First operand has 510 places, 502 transitions, 1154 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:45,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 499 transitions, 1151 flow [2021-06-10 11:36:45,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 499 transitions, 1144 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:45,605 INFO L241 Difference]: Finished difference. Result has 509 places, 499 transitions, 1134 flow [2021-06-10 11:36:45,605 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=509, PETRI_TRANSITIONS=499} [2021-06-10 11:36:45,606 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -6 predicate places. [2021-06-10 11:36:45,606 INFO L480 AbstractCegarLoop]: Abstraction has has 509 places, 499 transitions, 1134 flow [2021-06-10 11:36:45,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,606 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2021-06-10 11:36:45,606 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash 925237719, now seen corresponding path program 1 times [2021-06-10 11:36:45,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143682690] [2021-06-10 11:36:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:45,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:45,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143682690] [2021-06-10 11:36:45,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766128467] [2021-06-10 11:36:45,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,619 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:45,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 499 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:45,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,729 INFO L129 PetriNetUnfolder]: 45/565 cut-off events. [2021-06-10 11:36:45,729 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:45,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 565 events. 45/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2228 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 648. Up to 20 conditions per place. [2021-06-10 11:36:45,750 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2021-06-10 11:36:45,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 497 transitions, 1147 flow [2021-06-10 11:36:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:45,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:45,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:45,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,753 INFO L185 Difference]: Start difference. First operand has 509 places, 499 transitions, 1134 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:45,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 497 transitions, 1147 flow [2021-06-10 11:36:45,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 497 transitions, 1146 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:45,757 INFO L241 Difference]: Finished difference. Result has 508 places, 497 transitions, 1130 flow [2021-06-10 11:36:45,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=508, PETRI_TRANSITIONS=497} [2021-06-10 11:36:45,757 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -7 predicate places. [2021-06-10 11:36:45,757 INFO L480 AbstractCegarLoop]: Abstraction has has 508 places, 497 transitions, 1130 flow [2021-06-10 11:36:45,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,758 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2021-06-10 11:36:45,758 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1474569849, now seen corresponding path program 1 times [2021-06-10 11:36:45,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004437321] [2021-06-10 11:36:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:45,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:45,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004437321] [2021-06-10 11:36:45,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627850808] [2021-06-10 11:36:45,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:45,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 497 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:45,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:45,908 INFO L129 PetriNetUnfolder]: 43/570 cut-off events. [2021-06-10 11:36:45,908 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:45,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 570 events. 43/570 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2280 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 651. Up to 20 conditions per place. [2021-06-10 11:36:45,926 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2021-06-10 11:36:45,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 498 transitions, 1146 flow [2021-06-10 11:36:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:45,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:45,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:45,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:45,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,929 INFO L185 Difference]: Start difference. First operand has 508 places, 497 transitions, 1130 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:45,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 498 transitions, 1146 flow [2021-06-10 11:36:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 498 transitions, 1145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:45,933 INFO L241 Difference]: Finished difference. Result has 511 places, 498 transitions, 1143 flow [2021-06-10 11:36:45,933 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1143, PETRI_PLACES=511, PETRI_TRANSITIONS=498} [2021-06-10 11:36:45,934 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -4 predicate places. [2021-06-10 11:36:45,934 INFO L480 AbstractCegarLoop]: Abstraction has has 511 places, 498 transitions, 1143 flow [2021-06-10 11:36:45,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:45,934 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:45,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2021-06-10 11:36:45,934 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1474568826, now seen corresponding path program 1 times [2021-06-10 11:36:45,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:45,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737688556] [2021-06-10 11:36:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:45,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:45,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:45,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:45,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737688556] [2021-06-10 11:36:45,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:45,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:45,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672156677] [2021-06-10 11:36:45,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:45,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:45,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:45,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:45,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 498 transitions, 1143 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:45,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:45,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:45,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,062 INFO L129 PetriNetUnfolder]: 43/571 cut-off events. [2021-06-10 11:36:46,063 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:46,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 571 events. 43/571 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2286 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 659. Up to 20 conditions per place. [2021-06-10 11:36:46,084 INFO L132 encePairwiseOnDemand]: 549/553 looper letters, 9 selfloop transitions, 3 changer transitions 0/499 dead transitions. [2021-06-10 11:36:46,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 499 transitions, 1169 flow [2021-06-10 11:36:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2021-06-10 11:36:46,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2021-06-10 11:36:46,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1519 transitions. [2021-06-10 11:36:46,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1519 transitions. [2021-06-10 11:36:46,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1519 transitions. [2021-06-10 11:36:46,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,087 INFO L185 Difference]: Start difference. First operand has 511 places, 498 transitions, 1143 flow. Second operand 3 states and 1519 transitions. [2021-06-10 11:36:46,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 499 transitions, 1169 flow [2021-06-10 11:36:46,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 499 transitions, 1167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:46,091 INFO L241 Difference]: Finished difference. Result has 514 places, 499 transitions, 1159 flow [2021-06-10 11:36:46,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=514, PETRI_TRANSITIONS=499} [2021-06-10 11:36:46,091 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -1 predicate places. [2021-06-10 11:36:46,091 INFO L480 AbstractCegarLoop]: Abstraction has has 514 places, 499 transitions, 1159 flow [2021-06-10 11:36:46,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,092 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2021-06-10 11:36:46,092 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1475523161, now seen corresponding path program 1 times [2021-06-10 11:36:46,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197938036] [2021-06-10 11:36:46,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:46,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:46,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197938036] [2021-06-10 11:36:46,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493437839] [2021-06-10 11:36:46,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:46,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 499 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:46,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,223 INFO L129 PetriNetUnfolder]: 42/568 cut-off events. [2021-06-10 11:36:46,223 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:36:46,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 568 events. 42/568 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2267 event pairs, 0 based on Foata normal form. 2/509 useless extension candidates. Maximal degree in co-relation 658. Up to 20 conditions per place. [2021-06-10 11:36:46,244 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 9 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2021-06-10 11:36:46,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 497 transitions, 1167 flow [2021-06-10 11:36:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2021-06-10 11:36:46,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9150090415913201 [2021-06-10 11:36:46,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1518 transitions. [2021-06-10 11:36:46,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1518 transitions. [2021-06-10 11:36:46,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1518 transitions. [2021-06-10 11:36:46,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,247 INFO L185 Difference]: Start difference. First operand has 514 places, 499 transitions, 1159 flow. Second operand 3 states and 1518 transitions. [2021-06-10 11:36:46,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 497 transitions, 1167 flow [2021-06-10 11:36:46,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 497 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:46,251 INFO L241 Difference]: Finished difference. Result has 515 places, 497 transitions, 1148 flow [2021-06-10 11:36:46,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=515, PETRI_TRANSITIONS=497} [2021-06-10 11:36:46,251 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 0 predicate places. [2021-06-10 11:36:46,252 INFO L480 AbstractCegarLoop]: Abstraction has has 515 places, 497 transitions, 1148 flow [2021-06-10 11:36:46,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,252 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2021-06-10 11:36:46,252 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1475522138, now seen corresponding path program 1 times [2021-06-10 11:36:46,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861815822] [2021-06-10 11:36:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:46,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:46,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861815822] [2021-06-10 11:36:46,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390755793] [2021-06-10 11:36:46,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,265 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:46,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 497 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:46,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,376 INFO L129 PetriNetUnfolder]: 42/565 cut-off events. [2021-06-10 11:36:46,376 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:46,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 565 events. 42/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2246 event pairs, 0 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 652. Up to 20 conditions per place. [2021-06-10 11:36:46,397 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/494 dead transitions. [2021-06-10 11:36:46,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 494 transitions, 1149 flow [2021-06-10 11:36:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:46,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:46,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,399 INFO L185 Difference]: Start difference. First operand has 515 places, 497 transitions, 1148 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:46,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 494 transitions, 1149 flow [2021-06-10 11:36:46,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 494 transitions, 1144 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:46,404 INFO L241 Difference]: Finished difference. Result has 512 places, 494 transitions, 1134 flow [2021-06-10 11:36:46,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=512, PETRI_TRANSITIONS=494} [2021-06-10 11:36:46,404 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, -3 predicate places. [2021-06-10 11:36:46,404 INFO L480 AbstractCegarLoop]: Abstraction has has 512 places, 494 transitions, 1134 flow [2021-06-10 11:36:46,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,405 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2021-06-10 11:36:46,405 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 388483292, now seen corresponding path program 1 times [2021-06-10 11:36:46,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067220977] [2021-06-10 11:36:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:46,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:46,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067220977] [2021-06-10 11:36:46,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555692584] [2021-06-10 11:36:46,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:46,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 494 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:46,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,563 INFO L129 PetriNetUnfolder]: 41/573 cut-off events. [2021-06-10 11:36:46,563 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:46,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 573 events. 41/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2315 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 669. Up to 20 conditions per place. [2021-06-10 11:36:46,584 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/496 dead transitions. [2021-06-10 11:36:46,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 496 transitions, 1164 flow [2021-06-10 11:36:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:46,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:46,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:46,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:46,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:46,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,587 INFO L185 Difference]: Start difference. First operand has 512 places, 494 transitions, 1134 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:46,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 496 transitions, 1164 flow [2021-06-10 11:36:46,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 496 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:46,592 INFO L241 Difference]: Finished difference. Result has 515 places, 496 transitions, 1157 flow [2021-06-10 11:36:46,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=515, PETRI_TRANSITIONS=496} [2021-06-10 11:36:46,592 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 0 predicate places. [2021-06-10 11:36:46,592 INFO L480 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1157 flow [2021-06-10 11:36:46,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,592 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2021-06-10 11:36:46,592 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash 388482269, now seen corresponding path program 1 times [2021-06-10 11:36:46,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953880156] [2021-06-10 11:36:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:46,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:46,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953880156] [2021-06-10 11:36:46,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144888860] [2021-06-10 11:36:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:46,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 496 transitions, 1157 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:46,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,719 INFO L129 PetriNetUnfolder]: 39/574 cut-off events. [2021-06-10 11:36:46,719 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:46,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 574 events. 39/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2340 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2021-06-10 11:36:46,740 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2021-06-10 11:36:46,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 496 transitions, 1169 flow [2021-06-10 11:36:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:46,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:46,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:46,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:46,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:46,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,743 INFO L185 Difference]: Start difference. First operand has 515 places, 496 transitions, 1157 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:46,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 496 transitions, 1169 flow [2021-06-10 11:36:46,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 496 transitions, 1164 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:46,747 INFO L241 Difference]: Finished difference. Result has 517 places, 495 transitions, 1153 flow [2021-06-10 11:36:46,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1153, PETRI_PLACES=517, PETRI_TRANSITIONS=495} [2021-06-10 11:36:46,747 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 2 predicate places. [2021-06-10 11:36:46,747 INFO L480 AbstractCegarLoop]: Abstraction has has 517 places, 495 transitions, 1153 flow [2021-06-10 11:36:46,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,748 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2021-06-10 11:36:46,748 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 387529980, now seen corresponding path program 1 times [2021-06-10 11:36:46,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185198664] [2021-06-10 11:36:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:46,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:46,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185198664] [2021-06-10 11:36:46,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202442583] [2021-06-10 11:36:46,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:46,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 495 transitions, 1153 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:46,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:46,873 INFO L129 PetriNetUnfolder]: 39/567 cut-off events. [2021-06-10 11:36:46,873 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:46,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 567 events. 39/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2279 event pairs, 0 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 661. Up to 20 conditions per place. [2021-06-10 11:36:46,893 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/493 dead transitions. [2021-06-10 11:36:46,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 493 transitions, 1156 flow [2021-06-10 11:36:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:46,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:46,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:46,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:46,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,896 INFO L185 Difference]: Start difference. First operand has 517 places, 495 transitions, 1153 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:46,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 493 transitions, 1156 flow [2021-06-10 11:36:46,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 493 transitions, 1149 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:46,901 INFO L241 Difference]: Finished difference. Result has 517 places, 493 transitions, 1142 flow [2021-06-10 11:36:46,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=517, PETRI_TRANSITIONS=493} [2021-06-10 11:36:46,901 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 2 predicate places. [2021-06-10 11:36:46,901 INFO L480 AbstractCegarLoop]: Abstraction has has 517 places, 493 transitions, 1142 flow [2021-06-10 11:36:46,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:46,901 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:46,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2021-06-10 11:36:46,901 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash 387528957, now seen corresponding path program 1 times [2021-06-10 11:36:46,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:46,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717408436] [2021-06-10 11:36:46,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:46,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:46,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:46,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:46,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717408436] [2021-06-10 11:36:46,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:46,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:46,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388457825] [2021-06-10 11:36:46,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:46,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:46,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:46,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 493 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:46,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:46,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:46,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,028 INFO L129 PetriNetUnfolder]: 39/565 cut-off events. [2021-06-10 11:36:47,028 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:47,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 565 events. 39/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2263 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 661. Up to 20 conditions per place. [2021-06-10 11:36:47,048 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/491 dead transitions. [2021-06-10 11:36:47,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 491 transitions, 1155 flow [2021-06-10 11:36:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:47,049 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:47,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,051 INFO L185 Difference]: Start difference. First operand has 517 places, 493 transitions, 1142 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:47,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 491 transitions, 1155 flow [2021-06-10 11:36:47,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 491 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:47,056 INFO L241 Difference]: Finished difference. Result has 516 places, 491 transitions, 1138 flow [2021-06-10 11:36:47,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=516, PETRI_TRANSITIONS=491} [2021-06-10 11:36:47,056 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 1 predicate places. [2021-06-10 11:36:47,056 INFO L480 AbstractCegarLoop]: Abstraction has has 516 places, 491 transitions, 1138 flow [2021-06-10 11:36:47,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,056 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2021-06-10 11:36:47,056 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1194082592, now seen corresponding path program 1 times [2021-06-10 11:36:47,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474979159] [2021-06-10 11:36:47,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:47,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:47,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474979159] [2021-06-10 11:36:47,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446026367] [2021-06-10 11:36:47,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,091 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:47,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 491 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:47,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,213 INFO L129 PetriNetUnfolder]: 38/573 cut-off events. [2021-06-10 11:36:47,213 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:47,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 573 events. 38/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2332 event pairs, 0 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 673. Up to 20 conditions per place. [2021-06-10 11:36:47,233 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/493 dead transitions. [2021-06-10 11:36:47,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 493 transitions, 1168 flow [2021-06-10 11:36:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:47,234 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:47,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,236 INFO L185 Difference]: Start difference. First operand has 516 places, 491 transitions, 1138 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:47,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 493 transitions, 1168 flow [2021-06-10 11:36:47,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 493 transitions, 1167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:47,241 INFO L241 Difference]: Finished difference. Result has 519 places, 493 transitions, 1161 flow [2021-06-10 11:36:47,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1161, PETRI_PLACES=519, PETRI_TRANSITIONS=493} [2021-06-10 11:36:47,241 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 4 predicate places. [2021-06-10 11:36:47,241 INFO L480 AbstractCegarLoop]: Abstraction has has 519 places, 493 transitions, 1161 flow [2021-06-10 11:36:47,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,241 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2021-06-10 11:36:47,241 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1194083615, now seen corresponding path program 1 times [2021-06-10 11:36:47,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567635970] [2021-06-10 11:36:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:47,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:47,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567635970] [2021-06-10 11:36:47,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490644083] [2021-06-10 11:36:47,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:47,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 493 transitions, 1161 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:47,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,379 INFO L129 PetriNetUnfolder]: 36/574 cut-off events. [2021-06-10 11:36:47,379 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:47,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 574 events. 36/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2353 event pairs, 0 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 673. Up to 20 conditions per place. [2021-06-10 11:36:47,399 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/493 dead transitions. [2021-06-10 11:36:47,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 493 transitions, 1173 flow [2021-06-10 11:36:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:47,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:47,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:47,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:47,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:47,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,402 INFO L185 Difference]: Start difference. First operand has 519 places, 493 transitions, 1161 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:47,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 493 transitions, 1173 flow [2021-06-10 11:36:47,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 493 transitions, 1168 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:47,406 INFO L241 Difference]: Finished difference. Result has 521 places, 492 transitions, 1157 flow [2021-06-10 11:36:47,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1157, PETRI_PLACES=521, PETRI_TRANSITIONS=492} [2021-06-10 11:36:47,406 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 6 predicate places. [2021-06-10 11:36:47,407 INFO L480 AbstractCegarLoop]: Abstraction has has 521 places, 492 transitions, 1157 flow [2021-06-10 11:36:47,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,407 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2021-06-10 11:36:47,407 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1195035904, now seen corresponding path program 1 times [2021-06-10 11:36:47,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905699317] [2021-06-10 11:36:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:47,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:47,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905699317] [2021-06-10 11:36:47,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848383503] [2021-06-10 11:36:47,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,420 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:47,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 492 transitions, 1157 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:47,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,534 INFO L129 PetriNetUnfolder]: 36/567 cut-off events. [2021-06-10 11:36:47,534 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:47,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 567 events. 36/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2294 event pairs, 0 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2021-06-10 11:36:47,554 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/490 dead transitions. [2021-06-10 11:36:47,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 490 transitions, 1160 flow [2021-06-10 11:36:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:47,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:47,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:47,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:47,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:47,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,556 INFO L185 Difference]: Start difference. First operand has 521 places, 492 transitions, 1157 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:47,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 490 transitions, 1160 flow [2021-06-10 11:36:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 490 transitions, 1153 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:47,561 INFO L241 Difference]: Finished difference. Result has 521 places, 490 transitions, 1146 flow [2021-06-10 11:36:47,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=521, PETRI_TRANSITIONS=490} [2021-06-10 11:36:47,561 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 6 predicate places. [2021-06-10 11:36:47,561 INFO L480 AbstractCegarLoop]: Abstraction has has 521 places, 490 transitions, 1146 flow [2021-06-10 11:36:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,561 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2021-06-10 11:36:47,562 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1195036927, now seen corresponding path program 1 times [2021-06-10 11:36:47,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992338870] [2021-06-10 11:36:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:47,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:47,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992338870] [2021-06-10 11:36:47,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296538327] [2021-06-10 11:36:47,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:47,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 490 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:47,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,708 INFO L129 PetriNetUnfolder]: 36/565 cut-off events. [2021-06-10 11:36:47,708 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:47,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 565 events. 36/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2280 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 667. Up to 20 conditions per place. [2021-06-10 11:36:47,727 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/488 dead transitions. [2021-06-10 11:36:47,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 488 transitions, 1159 flow [2021-06-10 11:36:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:47,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:47,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:47,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,730 INFO L185 Difference]: Start difference. First operand has 521 places, 490 transitions, 1146 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:47,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 488 transitions, 1159 flow [2021-06-10 11:36:47,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 488 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:47,734 INFO L241 Difference]: Finished difference. Result has 520 places, 488 transitions, 1142 flow [2021-06-10 11:36:47,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=520, PETRI_TRANSITIONS=488} [2021-06-10 11:36:47,735 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 5 predicate places. [2021-06-10 11:36:47,735 INFO L480 AbstractCegarLoop]: Abstraction has has 520 places, 488 transitions, 1142 flow [2021-06-10 11:36:47,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,735 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,735 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2021-06-10 11:36:47,735 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash 54422501, now seen corresponding path program 1 times [2021-06-10 11:36:47,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941767819] [2021-06-10 11:36:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:47,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:47,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941767819] [2021-06-10 11:36:47,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832541605] [2021-06-10 11:36:47,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,748 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:47,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 488 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:47,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:47,869 INFO L129 PetriNetUnfolder]: 35/573 cut-off events. [2021-06-10 11:36:47,869 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:47,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 573 events. 35/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2349 event pairs, 0 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 679. Up to 20 conditions per place. [2021-06-10 11:36:47,889 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/490 dead transitions. [2021-06-10 11:36:47,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 490 transitions, 1172 flow [2021-06-10 11:36:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:47,890 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:47,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:47,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:47,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,892 INFO L185 Difference]: Start difference. First operand has 520 places, 488 transitions, 1142 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:47,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 490 transitions, 1172 flow [2021-06-10 11:36:47,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 490 transitions, 1171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:47,896 INFO L241 Difference]: Finished difference. Result has 523 places, 490 transitions, 1165 flow [2021-06-10 11:36:47,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1165, PETRI_PLACES=523, PETRI_TRANSITIONS=490} [2021-06-10 11:36:47,896 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 8 predicate places. [2021-06-10 11:36:47,896 INFO L480 AbstractCegarLoop]: Abstraction has has 523 places, 490 transitions, 1165 flow [2021-06-10 11:36:47,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:47,897 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:47,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2021-06-10 11:36:47,897 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 54421478, now seen corresponding path program 1 times [2021-06-10 11:36:47,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:47,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459887534] [2021-06-10 11:36:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:47,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:47,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:47,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:47,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459887534] [2021-06-10 11:36:47,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:47,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:47,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756328601] [2021-06-10 11:36:47,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:47,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:47,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:47,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 490 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:47,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:47,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:47,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,027 INFO L129 PetriNetUnfolder]: 33/574 cut-off events. [2021-06-10 11:36:48,027 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:48,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 574 events. 33/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2375 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 679. Up to 20 conditions per place. [2021-06-10 11:36:48,046 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/490 dead transitions. [2021-06-10 11:36:48,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 490 transitions, 1177 flow [2021-06-10 11:36:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:48,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:48,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,049 INFO L185 Difference]: Start difference. First operand has 523 places, 490 transitions, 1165 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:48,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 490 transitions, 1177 flow [2021-06-10 11:36:48,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 490 transitions, 1172 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:48,054 INFO L241 Difference]: Finished difference. Result has 525 places, 489 transitions, 1161 flow [2021-06-10 11:36:48,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1161, PETRI_PLACES=525, PETRI_TRANSITIONS=489} [2021-06-10 11:36:48,054 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 10 predicate places. [2021-06-10 11:36:48,054 INFO L480 AbstractCegarLoop]: Abstraction has has 525 places, 489 transitions, 1161 flow [2021-06-10 11:36:48,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,054 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2021-06-10 11:36:48,054 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 53469189, now seen corresponding path program 1 times [2021-06-10 11:36:48,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561515784] [2021-06-10 11:36:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:48,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:48,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561515784] [2021-06-10 11:36:48,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311214205] [2021-06-10 11:36:48,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:48,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 489 transitions, 1161 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:48,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,181 INFO L129 PetriNetUnfolder]: 33/567 cut-off events. [2021-06-10 11:36:48,181 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:48,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 567 events. 33/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2311 event pairs, 0 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 673. Up to 20 conditions per place. [2021-06-10 11:36:48,200 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2021-06-10 11:36:48,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 487 transitions, 1164 flow [2021-06-10 11:36:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:48,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:48,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,203 INFO L185 Difference]: Start difference. First operand has 525 places, 489 transitions, 1161 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:48,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 487 transitions, 1164 flow [2021-06-10 11:36:48,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 487 transitions, 1157 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:48,207 INFO L241 Difference]: Finished difference. Result has 525 places, 487 transitions, 1150 flow [2021-06-10 11:36:48,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=525, PETRI_TRANSITIONS=487} [2021-06-10 11:36:48,207 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 10 predicate places. [2021-06-10 11:36:48,207 INFO L480 AbstractCegarLoop]: Abstraction has has 525 places, 487 transitions, 1150 flow [2021-06-10 11:36:48,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,207 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,207 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2021-06-10 11:36:48,208 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 53468166, now seen corresponding path program 1 times [2021-06-10 11:36:48,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954827387] [2021-06-10 11:36:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:48,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:48,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954827387] [2021-06-10 11:36:48,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012397585] [2021-06-10 11:36:48,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:48,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 487 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:48,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,356 INFO L129 PetriNetUnfolder]: 33/565 cut-off events. [2021-06-10 11:36:48,356 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:48,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 565 events. 33/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2297 event pairs, 0 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 673. Up to 20 conditions per place. [2021-06-10 11:36:48,376 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/485 dead transitions. [2021-06-10 11:36:48,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 485 transitions, 1163 flow [2021-06-10 11:36:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:48,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:48,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:48,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:48,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:48,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,379 INFO L185 Difference]: Start difference. First operand has 525 places, 487 transitions, 1150 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:48,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 485 transitions, 1163 flow [2021-06-10 11:36:48,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 485 transitions, 1162 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:48,383 INFO L241 Difference]: Finished difference. Result has 524 places, 485 transitions, 1146 flow [2021-06-10 11:36:48,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=524, PETRI_TRANSITIONS=485} [2021-06-10 11:36:48,383 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 9 predicate places. [2021-06-10 11:36:48,384 INFO L480 AbstractCegarLoop]: Abstraction has has 524 places, 485 transitions, 1146 flow [2021-06-10 11:36:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,384 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2021-06-10 11:36:48,384 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -498184820, now seen corresponding path program 1 times [2021-06-10 11:36:48,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980770081] [2021-06-10 11:36:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:48,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:48,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980770081] [2021-06-10 11:36:48,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031381464] [2021-06-10 11:36:48,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:48,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 485 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:48,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,535 INFO L129 PetriNetUnfolder]: 32/573 cut-off events. [2021-06-10 11:36:48,535 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:48,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 573 events. 32/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2365 event pairs, 0 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 685. Up to 20 conditions per place. [2021-06-10 11:36:48,556 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/487 dead transitions. [2021-06-10 11:36:48,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 487 transitions, 1176 flow [2021-06-10 11:36:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:48,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:48,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:48,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:48,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:48,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,561 INFO L185 Difference]: Start difference. First operand has 524 places, 485 transitions, 1146 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:48,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 487 transitions, 1176 flow [2021-06-10 11:36:48,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 487 transitions, 1175 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:48,565 INFO L241 Difference]: Finished difference. Result has 527 places, 487 transitions, 1169 flow [2021-06-10 11:36:48,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1169, PETRI_PLACES=527, PETRI_TRANSITIONS=487} [2021-06-10 11:36:48,566 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 12 predicate places. [2021-06-10 11:36:48,566 INFO L480 AbstractCegarLoop]: Abstraction has has 527 places, 487 transitions, 1169 flow [2021-06-10 11:36:48,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,566 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,566 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2021-06-10 11:36:48,566 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash -498183797, now seen corresponding path program 1 times [2021-06-10 11:36:48,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035288156] [2021-06-10 11:36:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:48,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:48,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035288156] [2021-06-10 11:36:48,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638347651] [2021-06-10 11:36:48,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:48,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 487 transitions, 1169 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:48,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,718 INFO L129 PetriNetUnfolder]: 31/571 cut-off events. [2021-06-10 11:36:48,718 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:48,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 571 events. 31/571 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2352 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 682. Up to 20 conditions per place. [2021-06-10 11:36:48,732 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/487 dead transitions. [2021-06-10 11:36:48,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 487 transitions, 1181 flow [2021-06-10 11:36:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:48,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:48,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:48,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,735 INFO L185 Difference]: Start difference. First operand has 527 places, 487 transitions, 1169 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 487 transitions, 1181 flow [2021-06-10 11:36:48,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 487 transitions, 1176 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:48,739 INFO L241 Difference]: Finished difference. Result has 530 places, 487 transitions, 1174 flow [2021-06-10 11:36:48,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1174, PETRI_PLACES=530, PETRI_TRANSITIONS=487} [2021-06-10 11:36:48,739 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 15 predicate places. [2021-06-10 11:36:48,739 INFO L480 AbstractCegarLoop]: Abstraction has has 530 places, 487 transitions, 1174 flow [2021-06-10 11:36:48,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,740 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2021-06-10 11:36:48,740 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash -497231508, now seen corresponding path program 1 times [2021-06-10 11:36:48,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328970131] [2021-06-10 11:36:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:48,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:48,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328970131] [2021-06-10 11:36:48,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545192798] [2021-06-10 11:36:48,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:48,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 487 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:48,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:48,874 INFO L129 PetriNetUnfolder]: 30/567 cut-off events. [2021-06-10 11:36:48,874 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:48,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 567 events. 30/567 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2328 event pairs, 0 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 679. Up to 20 conditions per place. [2021-06-10 11:36:48,894 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/484 dead transitions. [2021-06-10 11:36:48,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 484 transitions, 1171 flow [2021-06-10 11:36:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:48,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:48,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:48,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:48,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,897 INFO L185 Difference]: Start difference. First operand has 530 places, 487 transitions, 1174 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 484 transitions, 1171 flow [2021-06-10 11:36:48,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 484 transitions, 1164 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:48,902 INFO L241 Difference]: Finished difference. Result has 529 places, 484 transitions, 1154 flow [2021-06-10 11:36:48,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=529, PETRI_TRANSITIONS=484} [2021-06-10 11:36:48,902 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 14 predicate places. [2021-06-10 11:36:48,902 INFO L480 AbstractCegarLoop]: Abstraction has has 529 places, 484 transitions, 1154 flow [2021-06-10 11:36:48,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:48,902 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:48,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2021-06-10 11:36:48,902 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash -497230485, now seen corresponding path program 1 times [2021-06-10 11:36:48,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:48,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813035567] [2021-06-10 11:36:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:48,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:48,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:48,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:48,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813035567] [2021-06-10 11:36:48,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:48,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:48,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561682778] [2021-06-10 11:36:48,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:48,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:48,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:48,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 484 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:48,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:48,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:48,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,066 INFO L129 PetriNetUnfolder]: 30/565 cut-off events. [2021-06-10 11:36:49,066 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:49,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 565 events. 30/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2313 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 680. Up to 20 conditions per place. [2021-06-10 11:36:49,086 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/482 dead transitions. [2021-06-10 11:36:49,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 482 transitions, 1167 flow [2021-06-10 11:36:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:49,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:49,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,088 INFO L185 Difference]: Start difference. First operand has 529 places, 484 transitions, 1154 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:49,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 482 transitions, 1167 flow [2021-06-10 11:36:49,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 482 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:49,093 INFO L241 Difference]: Finished difference. Result has 528 places, 482 transitions, 1150 flow [2021-06-10 11:36:49,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1150, PETRI_PLACES=528, PETRI_TRANSITIONS=482} [2021-06-10 11:36:49,093 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 13 predicate places. [2021-06-10 11:36:49,093 INFO L480 AbstractCegarLoop]: Abstraction has has 528 places, 482 transitions, 1150 flow [2021-06-10 11:36:49,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,094 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2021-06-10 11:36:49,094 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2132318477, now seen corresponding path program 1 times [2021-06-10 11:36:49,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076989854] [2021-06-10 11:36:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:49,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:49,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076989854] [2021-06-10 11:36:49,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916764250] [2021-06-10 11:36:49,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:49,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 482 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:49,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,230 INFO L129 PetriNetUnfolder]: 29/572 cut-off events. [2021-06-10 11:36:49,230 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:49,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 572 events. 29/572 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2373 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 685. Up to 20 conditions per place. [2021-06-10 11:36:49,249 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/483 dead transitions. [2021-06-10 11:36:49,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 483 transitions, 1166 flow [2021-06-10 11:36:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:49,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:49,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:49,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:49,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:49,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,252 INFO L185 Difference]: Start difference. First operand has 528 places, 482 transitions, 1150 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:49,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 483 transitions, 1166 flow [2021-06-10 11:36:49,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 483 transitions, 1165 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:49,257 INFO L241 Difference]: Finished difference. Result has 530 places, 482 transitions, 1154 flow [2021-06-10 11:36:49,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=530, PETRI_TRANSITIONS=482} [2021-06-10 11:36:49,257 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 15 predicate places. [2021-06-10 11:36:49,257 INFO L480 AbstractCegarLoop]: Abstraction has has 530 places, 482 transitions, 1154 flow [2021-06-10 11:36:49,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,257 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,257 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2021-06-10 11:36:49,257 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2132317454, now seen corresponding path program 1 times [2021-06-10 11:36:49,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303940280] [2021-06-10 11:36:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:49,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:49,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303940280] [2021-06-10 11:36:49,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574668996] [2021-06-10 11:36:49,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:49,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 482 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:49,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,396 INFO L129 PetriNetUnfolder]: 27/574 cut-off events. [2021-06-10 11:36:49,396 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:49,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 574 events. 27/574 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2406 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 696. Up to 20 conditions per place. [2021-06-10 11:36:49,416 INFO L132 encePairwiseOnDemand]: 549/553 looper letters, 9 selfloop transitions, 3 changer transitions 0/483 dead transitions. [2021-06-10 11:36:49,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 483 transitions, 1180 flow [2021-06-10 11:36:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2021-06-10 11:36:49,417 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2021-06-10 11:36:49,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1519 transitions. [2021-06-10 11:36:49,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1519 transitions. [2021-06-10 11:36:49,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1519 transitions. [2021-06-10 11:36:49,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,419 INFO L185 Difference]: Start difference. First operand has 530 places, 482 transitions, 1154 flow. Second operand 3 states and 1519 transitions. [2021-06-10 11:36:49,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 483 transitions, 1180 flow [2021-06-10 11:36:49,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 483 transitions, 1179 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:49,423 INFO L241 Difference]: Finished difference. Result has 533 places, 483 transitions, 1171 flow [2021-06-10 11:36:49,423 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=533, PETRI_TRANSITIONS=483} [2021-06-10 11:36:49,423 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 18 predicate places. [2021-06-10 11:36:49,423 INFO L480 AbstractCegarLoop]: Abstraction has has 533 places, 483 transitions, 1171 flow [2021-06-10 11:36:49,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,424 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2021-06-10 11:36:49,424 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2133270766, now seen corresponding path program 1 times [2021-06-10 11:36:49,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674198175] [2021-06-10 11:36:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:49,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:49,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674198175] [2021-06-10 11:36:49,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244116700] [2021-06-10 11:36:49,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:49,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 483 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:49,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,556 INFO L129 PetriNetUnfolder]: 27/567 cut-off events. [2021-06-10 11:36:49,556 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:49,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 567 events. 27/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2343 event pairs, 0 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 682. Up to 20 conditions per place. [2021-06-10 11:36:49,575 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/481 dead transitions. [2021-06-10 11:36:49,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 481 transitions, 1173 flow [2021-06-10 11:36:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:49,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:49,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:49,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:49,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:49,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,578 INFO L185 Difference]: Start difference. First operand has 533 places, 483 transitions, 1171 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:49,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 481 transitions, 1173 flow [2021-06-10 11:36:49,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 481 transitions, 1165 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:49,583 INFO L241 Difference]: Finished difference. Result has 533 places, 481 transitions, 1158 flow [2021-06-10 11:36:49,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=533, PETRI_TRANSITIONS=481} [2021-06-10 11:36:49,583 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 18 predicate places. [2021-06-10 11:36:49,583 INFO L480 AbstractCegarLoop]: Abstraction has has 533 places, 481 transitions, 1158 flow [2021-06-10 11:36:49,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,583 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2021-06-10 11:36:49,583 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2133271789, now seen corresponding path program 1 times [2021-06-10 11:36:49,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392161658] [2021-06-10 11:36:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:49,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:49,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392161658] [2021-06-10 11:36:49,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672536303] [2021-06-10 11:36:49,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:49,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 481 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:49,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,719 INFO L129 PetriNetUnfolder]: 27/565 cut-off events. [2021-06-10 11:36:49,719 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:49,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 565 events. 27/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2331 event pairs, 0 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 686. Up to 20 conditions per place. [2021-06-10 11:36:49,738 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/479 dead transitions. [2021-06-10 11:36:49,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 479 transitions, 1171 flow [2021-06-10 11:36:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:49,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:49,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:49,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,741 INFO L185 Difference]: Start difference. First operand has 533 places, 481 transitions, 1158 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:49,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 479 transitions, 1171 flow [2021-06-10 11:36:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 479 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:49,745 INFO L241 Difference]: Finished difference. Result has 532 places, 479 transitions, 1154 flow [2021-06-10 11:36:49,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=532, PETRI_TRANSITIONS=479} [2021-06-10 11:36:49,746 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 17 predicate places. [2021-06-10 11:36:49,746 INFO L480 AbstractCegarLoop]: Abstraction has has 532 places, 479 transitions, 1154 flow [2021-06-10 11:36:49,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,746 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2021-06-10 11:36:49,746 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1903151610, now seen corresponding path program 1 times [2021-06-10 11:36:49,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620323265] [2021-06-10 11:36:49,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:49,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:49,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620323265] [2021-06-10 11:36:49,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527339625] [2021-06-10 11:36:49,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:49,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 479 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:49,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:49,885 INFO L129 PetriNetUnfolder]: 26/573 cut-off events. [2021-06-10 11:36:49,885 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:49,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 573 events. 26/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2402 event pairs, 0 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 698. Up to 20 conditions per place. [2021-06-10 11:36:49,905 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/481 dead transitions. [2021-06-10 11:36:49,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 481 transitions, 1184 flow [2021-06-10 11:36:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:49,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:49,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:49,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:49,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:49,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:49,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,907 INFO L185 Difference]: Start difference. First operand has 532 places, 479 transitions, 1154 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:49,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 481 transitions, 1184 flow [2021-06-10 11:36:49,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 481 transitions, 1183 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:49,912 INFO L241 Difference]: Finished difference. Result has 535 places, 481 transitions, 1177 flow [2021-06-10 11:36:49,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1177, PETRI_PLACES=535, PETRI_TRANSITIONS=481} [2021-06-10 11:36:49,912 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 20 predicate places. [2021-06-10 11:36:49,912 INFO L480 AbstractCegarLoop]: Abstraction has has 535 places, 481 transitions, 1177 flow [2021-06-10 11:36:49,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:49,912 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:49,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2021-06-10 11:36:49,912 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1903150587, now seen corresponding path program 1 times [2021-06-10 11:36:49,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:49,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011480129] [2021-06-10 11:36:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:49,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:49,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:49,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:49,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011480129] [2021-06-10 11:36:49,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:49,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:49,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491273312] [2021-06-10 11:36:49,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:49,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:49,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:49,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:49,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:49,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 481 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:49,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:49,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:49,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,047 INFO L129 PetriNetUnfolder]: 24/574 cut-off events. [2021-06-10 11:36:50,047 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:50,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 574 events. 24/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2424 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 698. Up to 20 conditions per place. [2021-06-10 11:36:50,066 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/481 dead transitions. [2021-06-10 11:36:50,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 481 transitions, 1189 flow [2021-06-10 11:36:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:50,067 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:50,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,069 INFO L185 Difference]: Start difference. First operand has 535 places, 481 transitions, 1177 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:50,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 481 transitions, 1189 flow [2021-06-10 11:36:50,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 481 transitions, 1184 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:50,073 INFO L241 Difference]: Finished difference. Result has 537 places, 480 transitions, 1173 flow [2021-06-10 11:36:50,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1173, PETRI_PLACES=537, PETRI_TRANSITIONS=480} [2021-06-10 11:36:50,073 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 22 predicate places. [2021-06-10 11:36:50,073 INFO L480 AbstractCegarLoop]: Abstraction has has 537 places, 480 transitions, 1173 flow [2021-06-10 11:36:50,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,074 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2021-06-10 11:36:50,074 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1902198298, now seen corresponding path program 1 times [2021-06-10 11:36:50,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120291757] [2021-06-10 11:36:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:50,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:50,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120291757] [2021-06-10 11:36:50,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806390496] [2021-06-10 11:36:50,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:50,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 480 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:50,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,213 INFO L129 PetriNetUnfolder]: 24/567 cut-off events. [2021-06-10 11:36:50,213 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:50,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 567 events. 24/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2364 event pairs, 0 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 692. Up to 20 conditions per place. [2021-06-10 11:36:50,231 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/478 dead transitions. [2021-06-10 11:36:50,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 478 transitions, 1176 flow [2021-06-10 11:36:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:50,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:50,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,234 INFO L185 Difference]: Start difference. First operand has 537 places, 480 transitions, 1173 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:50,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 478 transitions, 1176 flow [2021-06-10 11:36:50,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 478 transitions, 1169 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:50,238 INFO L241 Difference]: Finished difference. Result has 537 places, 478 transitions, 1162 flow [2021-06-10 11:36:50,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=537, PETRI_TRANSITIONS=478} [2021-06-10 11:36:50,238 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 22 predicate places. [2021-06-10 11:36:50,238 INFO L480 AbstractCegarLoop]: Abstraction has has 537 places, 478 transitions, 1162 flow [2021-06-10 11:36:50,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,239 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2021-06-10 11:36:50,239 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1902197275, now seen corresponding path program 1 times [2021-06-10 11:36:50,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109008201] [2021-06-10 11:36:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:50,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:36:50,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109008201] [2021-06-10 11:36:50,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575346127] [2021-06-10 11:36:50,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:50,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 478 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:50,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,374 INFO L129 PetriNetUnfolder]: 24/565 cut-off events. [2021-06-10 11:36:50,374 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:50,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 565 events. 24/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2350 event pairs, 0 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 692. Up to 20 conditions per place. [2021-06-10 11:36:50,393 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/476 dead transitions. [2021-06-10 11:36:50,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 476 transitions, 1175 flow [2021-06-10 11:36:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:50,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:50,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:50,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:50,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:50,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,396 INFO L185 Difference]: Start difference. First operand has 537 places, 478 transitions, 1162 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 476 transitions, 1175 flow [2021-06-10 11:36:50,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 476 transitions, 1174 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:50,400 INFO L241 Difference]: Finished difference. Result has 536 places, 476 transitions, 1158 flow [2021-06-10 11:36:50,400 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=536, PETRI_TRANSITIONS=476} [2021-06-10 11:36:50,400 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 21 predicate places. [2021-06-10 11:36:50,400 INFO L480 AbstractCegarLoop]: Abstraction has has 536 places, 476 transitions, 1158 flow [2021-06-10 11:36:50,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,401 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2021-06-10 11:36:50,401 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1973106947, now seen corresponding path program 1 times [2021-06-10 11:36:50,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704642737] [2021-06-10 11:36:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:50,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:50,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704642737] [2021-06-10 11:36:50,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620334707] [2021-06-10 11:36:50,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:50,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 476 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:50,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,555 INFO L129 PetriNetUnfolder]: 23/573 cut-off events. [2021-06-10 11:36:50,555 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:50,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 573 events. 23/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2418 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 704. Up to 20 conditions per place. [2021-06-10 11:36:50,574 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/478 dead transitions. [2021-06-10 11:36:50,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 478 transitions, 1188 flow [2021-06-10 11:36:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:50,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:50,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:50,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:50,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:50,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,577 INFO L185 Difference]: Start difference. First operand has 536 places, 476 transitions, 1158 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:50,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 478 transitions, 1188 flow [2021-06-10 11:36:50,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 478 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:50,581 INFO L241 Difference]: Finished difference. Result has 539 places, 478 transitions, 1181 flow [2021-06-10 11:36:50,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=539, PETRI_TRANSITIONS=478} [2021-06-10 11:36:50,581 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 24 predicate places. [2021-06-10 11:36:50,581 INFO L480 AbstractCegarLoop]: Abstraction has has 539 places, 478 transitions, 1181 flow [2021-06-10 11:36:50,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,582 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2021-06-10 11:36:50,582 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1973105924, now seen corresponding path program 1 times [2021-06-10 11:36:50,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114410296] [2021-06-10 11:36:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:50,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:50,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114410296] [2021-06-10 11:36:50,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306654629] [2021-06-10 11:36:50,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:50,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 478 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:50,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,740 INFO L129 PetriNetUnfolder]: 21/574 cut-off events. [2021-06-10 11:36:50,740 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:50,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 574 events. 21/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2443 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 704. Up to 20 conditions per place. [2021-06-10 11:36:50,760 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/478 dead transitions. [2021-06-10 11:36:50,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 478 transitions, 1193 flow [2021-06-10 11:36:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:50,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:50,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:50,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,763 INFO L185 Difference]: Start difference. First operand has 539 places, 478 transitions, 1181 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:50,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 478 transitions, 1193 flow [2021-06-10 11:36:50,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 478 transitions, 1188 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:50,767 INFO L241 Difference]: Finished difference. Result has 541 places, 477 transitions, 1177 flow [2021-06-10 11:36:50,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1177, PETRI_PLACES=541, PETRI_TRANSITIONS=477} [2021-06-10 11:36:50,767 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 26 predicate places. [2021-06-10 11:36:50,767 INFO L480 AbstractCegarLoop]: Abstraction has has 541 places, 477 transitions, 1177 flow [2021-06-10 11:36:50,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,768 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2021-06-10 11:36:50,768 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1972153635, now seen corresponding path program 1 times [2021-06-10 11:36:50,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118590134] [2021-06-10 11:36:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:50,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:50,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118590134] [2021-06-10 11:36:50,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63060998] [2021-06-10 11:36:50,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,782 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:50,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 477 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:50,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:50,902 INFO L129 PetriNetUnfolder]: 21/567 cut-off events. [2021-06-10 11:36:50,902 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:50,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 567 events. 21/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2380 event pairs, 0 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 698. Up to 20 conditions per place. [2021-06-10 11:36:50,920 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2021-06-10 11:36:50,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 475 transitions, 1180 flow [2021-06-10 11:36:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:50,921 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:50,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:50,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:50,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,923 INFO L185 Difference]: Start difference. First operand has 541 places, 477 transitions, 1177 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:50,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 475 transitions, 1180 flow [2021-06-10 11:36:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 475 transitions, 1173 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:50,928 INFO L241 Difference]: Finished difference. Result has 541 places, 475 transitions, 1166 flow [2021-06-10 11:36:50,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=541, PETRI_TRANSITIONS=475} [2021-06-10 11:36:50,928 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 26 predicate places. [2021-06-10 11:36:50,928 INFO L480 AbstractCegarLoop]: Abstraction has has 541 places, 475 transitions, 1166 flow [2021-06-10 11:36:50,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,928 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:50,928 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:50,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2021-06-10 11:36:50,928 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1972152612, now seen corresponding path program 1 times [2021-06-10 11:36:50,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:50,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409421735] [2021-06-10 11:36:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:50,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:50,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:50,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:36:50,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409421735] [2021-06-10 11:36:50,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:50,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:50,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621031293] [2021-06-10 11:36:50,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:50,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:50,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:50,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:50,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 475 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:50,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:50,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:50,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,078 INFO L129 PetriNetUnfolder]: 21/565 cut-off events. [2021-06-10 11:36:51,078 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:51,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 565 events. 21/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2366 event pairs, 0 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 698. Up to 20 conditions per place. [2021-06-10 11:36:51,096 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/473 dead transitions. [2021-06-10 11:36:51,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 473 transitions, 1179 flow [2021-06-10 11:36:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:51,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:51,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,099 INFO L185 Difference]: Start difference. First operand has 541 places, 475 transitions, 1166 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:51,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 473 transitions, 1179 flow [2021-06-10 11:36:51,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 473 transitions, 1178 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:51,104 INFO L241 Difference]: Finished difference. Result has 540 places, 473 transitions, 1162 flow [2021-06-10 11:36:51,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=540, PETRI_TRANSITIONS=473} [2021-06-10 11:36:51,104 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 25 predicate places. [2021-06-10 11:36:51,104 INFO L480 AbstractCegarLoop]: Abstraction has has 540 places, 473 transitions, 1162 flow [2021-06-10 11:36:51,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,104 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2021-06-10 11:36:51,104 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash 457635725, now seen corresponding path program 1 times [2021-06-10 11:36:51,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614698559] [2021-06-10 11:36:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:51,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:51,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614698559] [2021-06-10 11:36:51,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234952505] [2021-06-10 11:36:51,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:51,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 473 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:51,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,250 INFO L129 PetriNetUnfolder]: 20/573 cut-off events. [2021-06-10 11:36:51,251 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:51,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 573 events. 20/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2437 event pairs, 0 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 710. Up to 20 conditions per place. [2021-06-10 11:36:51,270 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/475 dead transitions. [2021-06-10 11:36:51,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 475 transitions, 1192 flow [2021-06-10 11:36:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:51,271 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:51,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,273 INFO L185 Difference]: Start difference. First operand has 540 places, 473 transitions, 1162 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:51,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 475 transitions, 1192 flow [2021-06-10 11:36:51,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 475 transitions, 1191 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:51,277 INFO L241 Difference]: Finished difference. Result has 543 places, 475 transitions, 1185 flow [2021-06-10 11:36:51,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=543, PETRI_TRANSITIONS=475} [2021-06-10 11:36:51,277 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 28 predicate places. [2021-06-10 11:36:51,277 INFO L480 AbstractCegarLoop]: Abstraction has has 543 places, 475 transitions, 1185 flow [2021-06-10 11:36:51,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,278 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2021-06-10 11:36:51,278 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash 457634702, now seen corresponding path program 1 times [2021-06-10 11:36:51,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444751831] [2021-06-10 11:36:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:51,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:51,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444751831] [2021-06-10 11:36:51,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573087322] [2021-06-10 11:36:51,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:51,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 475 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:51,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,417 INFO L129 PetriNetUnfolder]: 18/574 cut-off events. [2021-06-10 11:36:51,417 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:51,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 574 events. 18/574 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2457 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 710. Up to 20 conditions per place. [2021-06-10 11:36:51,436 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 6 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2021-06-10 11:36:51,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 475 transitions, 1197 flow [2021-06-10 11:36:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:51,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:51,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:51,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:51,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:51,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,439 INFO L185 Difference]: Start difference. First operand has 543 places, 475 transitions, 1185 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:51,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 475 transitions, 1197 flow [2021-06-10 11:36:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 475 transitions, 1192 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:51,443 INFO L241 Difference]: Finished difference. Result has 545 places, 474 transitions, 1181 flow [2021-06-10 11:36:51,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=545, PETRI_TRANSITIONS=474} [2021-06-10 11:36:51,444 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 30 predicate places. [2021-06-10 11:36:51,444 INFO L480 AbstractCegarLoop]: Abstraction has has 545 places, 474 transitions, 1181 flow [2021-06-10 11:36:51,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,444 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2021-06-10 11:36:51,444 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash 456682413, now seen corresponding path program 1 times [2021-06-10 11:36:51,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950249353] [2021-06-10 11:36:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:51,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:51,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950249353] [2021-06-10 11:36:51,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035413366] [2021-06-10 11:36:51,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,458 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:51,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 474 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:51,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,592 INFO L129 PetriNetUnfolder]: 18/567 cut-off events. [2021-06-10 11:36:51,593 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:51,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 567 events. 18/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2400 event pairs, 0 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 704. Up to 20 conditions per place. [2021-06-10 11:36:51,611 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/472 dead transitions. [2021-06-10 11:36:51,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 472 transitions, 1184 flow [2021-06-10 11:36:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:51,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:51,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:51,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:51,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,614 INFO L185 Difference]: Start difference. First operand has 545 places, 474 transitions, 1181 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:51,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 472 transitions, 1184 flow [2021-06-10 11:36:51,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 472 transitions, 1177 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:51,618 INFO L241 Difference]: Finished difference. Result has 545 places, 472 transitions, 1170 flow [2021-06-10 11:36:51,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=545, PETRI_TRANSITIONS=472} [2021-06-10 11:36:51,618 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 30 predicate places. [2021-06-10 11:36:51,618 INFO L480 AbstractCegarLoop]: Abstraction has has 545 places, 472 transitions, 1170 flow [2021-06-10 11:36:51,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,619 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2021-06-10 11:36:51,619 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash 456681390, now seen corresponding path program 1 times [2021-06-10 11:36:51,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794866185] [2021-06-10 11:36:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:51,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:36:51,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794866185] [2021-06-10 11:36:51,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420901178] [2021-06-10 11:36:51,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:51,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 472 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:51,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,762 INFO L129 PetriNetUnfolder]: 18/565 cut-off events. [2021-06-10 11:36:51,762 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:51,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 565 events. 18/565 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2385 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 704. Up to 20 conditions per place. [2021-06-10 11:36:51,780 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/470 dead transitions. [2021-06-10 11:36:51,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 470 transitions, 1183 flow [2021-06-10 11:36:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:51,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:51,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:51,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,783 INFO L185 Difference]: Start difference. First operand has 545 places, 472 transitions, 1170 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:51,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 470 transitions, 1183 flow [2021-06-10 11:36:51,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 470 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:51,788 INFO L241 Difference]: Finished difference. Result has 544 places, 470 transitions, 1166 flow [2021-06-10 11:36:51,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=544, PETRI_TRANSITIONS=470} [2021-06-10 11:36:51,788 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 29 predicate places. [2021-06-10 11:36:51,788 INFO L480 AbstractCegarLoop]: Abstraction has has 544 places, 470 transitions, 1166 flow [2021-06-10 11:36:51,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,788 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2021-06-10 11:36:51,789 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash -458680775, now seen corresponding path program 1 times [2021-06-10 11:36:51,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273675943] [2021-06-10 11:36:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:51,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:51,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273675943] [2021-06-10 11:36:51,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668447796] [2021-06-10 11:36:51,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:51,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 470 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:51,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:51,936 INFO L129 PetriNetUnfolder]: 17/573 cut-off events. [2021-06-10 11:36:51,936 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:51,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 573 events. 17/573 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2455 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 716. Up to 20 conditions per place. [2021-06-10 11:36:51,955 INFO L132 encePairwiseOnDemand]: 548/553 looper letters, 10 selfloop transitions, 3 changer transitions 0/472 dead transitions. [2021-06-10 11:36:51,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 472 transitions, 1196 flow [2021-06-10 11:36:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2021-06-10 11:36:51,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168173598553345 [2021-06-10 11:36:51,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:51,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1521 transitions. [2021-06-10 11:36:51,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,958 INFO L185 Difference]: Start difference. First operand has 544 places, 470 transitions, 1166 flow. Second operand 3 states and 1521 transitions. [2021-06-10 11:36:51,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 472 transitions, 1196 flow [2021-06-10 11:36:51,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 472 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:51,963 INFO L241 Difference]: Finished difference. Result has 547 places, 472 transitions, 1189 flow [2021-06-10 11:36:51,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1189, PETRI_PLACES=547, PETRI_TRANSITIONS=472} [2021-06-10 11:36:51,963 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 32 predicate places. [2021-06-10 11:36:51,963 INFO L480 AbstractCegarLoop]: Abstraction has has 547 places, 472 transitions, 1189 flow [2021-06-10 11:36:51,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:51,963 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:51,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2021-06-10 11:36:51,963 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash -458679752, now seen corresponding path program 1 times [2021-06-10 11:36:51,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:51,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349237288] [2021-06-10 11:36:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:51,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:51,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:51,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:51,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349237288] [2021-06-10 11:36:51,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:51,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:51,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706059236] [2021-06-10 11:36:51,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:51,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:51,978 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:51,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 472 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:51,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:51,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:51,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,103 INFO L129 PetriNetUnfolder]: 16/571 cut-off events. [2021-06-10 11:36:52,103 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:52,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 571 events. 16/571 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2445 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 713. Up to 20 conditions per place. [2021-06-10 11:36:52,127 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/472 dead transitions. [2021-06-10 11:36:52,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 472 transitions, 1201 flow [2021-06-10 11:36:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:52,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:52,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,130 INFO L185 Difference]: Start difference. First operand has 547 places, 472 transitions, 1189 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:52,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 472 transitions, 1201 flow [2021-06-10 11:36:52,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 472 transitions, 1196 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:52,134 INFO L241 Difference]: Finished difference. Result has 550 places, 472 transitions, 1194 flow [2021-06-10 11:36:52,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=550, PETRI_TRANSITIONS=472} [2021-06-10 11:36:52,135 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 35 predicate places. [2021-06-10 11:36:52,135 INFO L480 AbstractCegarLoop]: Abstraction has has 550 places, 472 transitions, 1194 flow [2021-06-10 11:36:52,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,135 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:52,135 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:52,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2021-06-10 11:36:52,135 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash -457727463, now seen corresponding path program 1 times [2021-06-10 11:36:52,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:52,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802199213] [2021-06-10 11:36:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:52,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:52,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:52,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802199213] [2021-06-10 11:36:52,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:52,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:52,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65464894] [2021-06-10 11:36:52,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:52,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:52,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:52,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 472 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:52,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:52,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,274 INFO L129 PetriNetUnfolder]: 15/567 cut-off events. [2021-06-10 11:36:52,274 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:52,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 567 events. 15/567 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2419 event pairs, 0 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 710. Up to 20 conditions per place. [2021-06-10 11:36:52,293 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/469 dead transitions. [2021-06-10 11:36:52,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 469 transitions, 1191 flow [2021-06-10 11:36:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:52,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:52,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,296 INFO L185 Difference]: Start difference. First operand has 550 places, 472 transitions, 1194 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:52,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 469 transitions, 1191 flow [2021-06-10 11:36:52,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 469 transitions, 1184 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:52,300 INFO L241 Difference]: Finished difference. Result has 549 places, 469 transitions, 1174 flow [2021-06-10 11:36:52,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1174, PETRI_PLACES=549, PETRI_TRANSITIONS=469} [2021-06-10 11:36:52,300 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 34 predicate places. [2021-06-10 11:36:52,300 INFO L480 AbstractCegarLoop]: Abstraction has has 549 places, 469 transitions, 1174 flow [2021-06-10 11:36:52,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,301 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:52,301 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:52,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2021-06-10 11:36:52,301 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -457726440, now seen corresponding path program 1 times [2021-06-10 11:36:52,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:52,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209885089] [2021-06-10 11:36:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:52,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:52,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:36:52,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209885089] [2021-06-10 11:36:52,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:52,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:52,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827526532] [2021-06-10 11:36:52,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:52,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:52,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:52,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 469 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:52,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:52,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,443 INFO L129 PetriNetUnfolder]: 15/565 cut-off events. [2021-06-10 11:36:52,443 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:52,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 565 events. 15/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2403 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 711. Up to 20 conditions per place. [2021-06-10 11:36:52,463 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/467 dead transitions. [2021-06-10 11:36:52,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 467 transitions, 1187 flow [2021-06-10 11:36:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:52,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:52,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:52,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:52,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,466 INFO L185 Difference]: Start difference. First operand has 549 places, 469 transitions, 1174 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:52,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 467 transitions, 1187 flow [2021-06-10 11:36:52,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 467 transitions, 1186 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:52,471 INFO L241 Difference]: Finished difference. Result has 548 places, 467 transitions, 1170 flow [2021-06-10 11:36:52,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=548, PETRI_TRANSITIONS=467} [2021-06-10 11:36:52,471 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 33 predicate places. [2021-06-10 11:36:52,471 INFO L480 AbstractCegarLoop]: Abstraction has has 548 places, 467 transitions, 1170 flow [2021-06-10 11:36:52,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:52,471 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:52,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2021-06-10 11:36:52,471 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash 800482372, now seen corresponding path program 1 times [2021-06-10 11:36:52,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:52,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194277167] [2021-06-10 11:36:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:52,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:52,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:36:52,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194277167] [2021-06-10 11:36:52,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:52,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:52,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271451147] [2021-06-10 11:36:52,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:52,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:52,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:52,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:52,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:52,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 467 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:52,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:52,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,615 INFO L129 PetriNetUnfolder]: 13/570 cut-off events. [2021-06-10 11:36:52,615 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:52,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 570 events. 13/570 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2453 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 714. Up to 20 conditions per place. [2021-06-10 11:36:52,635 INFO L132 encePairwiseOnDemand]: 550/553 looper letters, 5 selfloop transitions, 2 changer transitions 0/468 dead transitions. [2021-06-10 11:36:52,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 468 transitions, 1186 flow [2021-06-10 11:36:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1529 transitions. [2021-06-10 11:36:52,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216395418927065 [2021-06-10 11:36:52,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1529 transitions. [2021-06-10 11:36:52,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,639 INFO L185 Difference]: Start difference. First operand has 548 places, 467 transitions, 1170 flow. Second operand 3 states and 1529 transitions. [2021-06-10 11:36:52,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 468 transitions, 1186 flow [2021-06-10 11:36:52,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 468 transitions, 1185 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:52,644 INFO L241 Difference]: Finished difference. Result has 551 places, 468 transitions, 1183 flow [2021-06-10 11:36:52,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=551, PETRI_TRANSITIONS=468} [2021-06-10 11:36:52,644 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 36 predicate places. [2021-06-10 11:36:52,644 INFO L480 AbstractCegarLoop]: Abstraction has has 551 places, 468 transitions, 1183 flow [2021-06-10 11:36:52,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:52,644 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:52,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2021-06-10 11:36:52,645 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 800481349, now seen corresponding path program 1 times [2021-06-10 11:36:52,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:52,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352973273] [2021-06-10 11:36:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:52,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:52,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:36:52,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352973273] [2021-06-10 11:36:52,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:52,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:52,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540546491] [2021-06-10 11:36:52,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:52,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:52,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:52,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 468 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:52,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:52,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,797 INFO L129 PetriNetUnfolder]: 13/571 cut-off events. [2021-06-10 11:36:52,797 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:52,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 571 events. 13/571 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2460 event pairs, 0 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 722. Up to 20 conditions per place. [2021-06-10 11:36:52,817 INFO L132 encePairwiseOnDemand]: 549/553 looper letters, 9 selfloop transitions, 3 changer transitions 0/469 dead transitions. [2021-06-10 11:36:52,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 469 transitions, 1209 flow [2021-06-10 11:36:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2021-06-10 11:36:52,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2021-06-10 11:36:52,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1519 transitions. [2021-06-10 11:36:52,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1519 transitions. [2021-06-10 11:36:52,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1519 transitions. [2021-06-10 11:36:52,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,819 INFO L185 Difference]: Start difference. First operand has 551 places, 468 transitions, 1183 flow. Second operand 3 states and 1519 transitions. [2021-06-10 11:36:52,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 469 transitions, 1209 flow [2021-06-10 11:36:52,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 469 transitions, 1207 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:52,824 INFO L241 Difference]: Finished difference. Result has 554 places, 469 transitions, 1199 flow [2021-06-10 11:36:52,824 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=554, PETRI_TRANSITIONS=469} [2021-06-10 11:36:52,824 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 39 predicate places. [2021-06-10 11:36:52,824 INFO L480 AbstractCegarLoop]: Abstraction has has 554 places, 469 transitions, 1199 flow [2021-06-10 11:36:52,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:52,825 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:52,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2021-06-10 11:36:52,825 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 801434661, now seen corresponding path program 1 times [2021-06-10 11:36:52,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:52,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259914361] [2021-06-10 11:36:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:52,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:52,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:52,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:36:52,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259914361] [2021-06-10 11:36:52,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:52,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:52,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965723934] [2021-06-10 11:36:52,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:52,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:52,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 507 out of 553 [2021-06-10 11:36:52,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 469 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:52,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 507 of 553 [2021-06-10 11:36:52,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:52,975 INFO L129 PetriNetUnfolder]: 12/567 cut-off events. [2021-06-10 11:36:52,975 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:52,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 567 events. 12/567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2433 event pairs, 0 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 715. Up to 20 conditions per place. [2021-06-10 11:36:52,993 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 5 selfloop transitions, 1 changer transitions 0/466 dead transitions. [2021-06-10 11:36:52,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 466 transitions, 1196 flow [2021-06-10 11:36:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1528 transitions. [2021-06-10 11:36:52,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921036769138035 [2021-06-10 11:36:52,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:52,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1528 transitions. [2021-06-10 11:36:52,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:52,996 INFO L185 Difference]: Start difference. First operand has 554 places, 469 transitions, 1199 flow. Second operand 3 states and 1528 transitions. [2021-06-10 11:36:52,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 466 transitions, 1196 flow [2021-06-10 11:36:52,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 466 transitions, 1188 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:53,001 INFO L241 Difference]: Finished difference. Result has 553 places, 466 transitions, 1178 flow [2021-06-10 11:36:53,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1178, PETRI_PLACES=553, PETRI_TRANSITIONS=466} [2021-06-10 11:36:53,001 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 38 predicate places. [2021-06-10 11:36:53,001 INFO L480 AbstractCegarLoop]: Abstraction has has 553 places, 466 transitions, 1178 flow [2021-06-10 11:36:53,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,001 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:53,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2021-06-10 11:36:53,001 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,001 INFO L82 PathProgramCache]: Analyzing trace with hash 801435684, now seen corresponding path program 1 times [2021-06-10 11:36:53,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406870405] [2021-06-10 11:36:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:53,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:53,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:36:53,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406870405] [2021-06-10 11:36:53,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:53,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:53,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332571280] [2021-06-10 11:36:53,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:53,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:53,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 553 [2021-06-10 11:36:53,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 466 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:53,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 553 [2021-06-10 11:36:53,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:53,145 INFO L129 PetriNetUnfolder]: 12/565 cut-off events. [2021-06-10 11:36:53,145 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:53,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 565 events. 12/565 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2420 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 718. Up to 20 conditions per place. [2021-06-10 11:36:53,163 INFO L132 encePairwiseOnDemand]: 551/553 looper letters, 8 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2021-06-10 11:36:53,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 464 transitions, 1191 flow [2021-06-10 11:36:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1516 transitions. [2021-06-10 11:36:53,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9138034960819771 [2021-06-10 11:36:53,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1516 transitions. [2021-06-10 11:36:53,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1516 transitions. [2021-06-10 11:36:53,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:53,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1516 transitions. [2021-06-10 11:36:53,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,166 INFO L185 Difference]: Start difference. First operand has 553 places, 466 transitions, 1178 flow. Second operand 3 states and 1516 transitions. [2021-06-10 11:36:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 464 transitions, 1191 flow [2021-06-10 11:36:53,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 464 transitions, 1190 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:53,171 INFO L241 Difference]: Finished difference. Result has 552 places, 464 transitions, 1174 flow [2021-06-10 11:36:53,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=553, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1174, PETRI_PLACES=552, PETRI_TRANSITIONS=464} [2021-06-10 11:36:53,171 INFO L343 CegarLoopForPetriNet]: 515 programPoint places, 37 predicate places. [2021-06-10 11:36:53,171 INFO L480 AbstractCegarLoop]: Abstraction has has 552 places, 464 transitions, 1174 flow [2021-06-10 11:36:53,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,171 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,171 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:53,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2021-06-10 11:36:53,171 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1029224496, now seen corresponding path program 1 times [2021-06-10 11:36:53,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667504053] [2021-06-10 11:36:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:53,180 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:36:53,184 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:36:53,192 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:36:53,192 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:36:53,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2021-06-10 11:36:53,193 WARN L342 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:36:53,193 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2021-06-10 11:36:53,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of20ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of20ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:36:53,299 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:36:53,299 INFO L253 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2021-06-10 11:36:53,299 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:36:53,299 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:36:53,299 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:36:53,299 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:36:53,299 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:36:53,300 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:36:53,300 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:36:53,300 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:36:53,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 541 places, 581 transitions, 1642 flow [2021-06-10 11:36:53,436 INFO L129 PetriNetUnfolder]: 101/760 cut-off events. [2021-06-10 11:36:53,436 INFO L130 PetriNetUnfolder]: For 1520/1520 co-relation queries the response was YES. [2021-06-10 11:36:53,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 760 events. 101/760 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3145 event pairs, 0 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 961. Up to 42 conditions per place. [2021-06-10 11:36:53,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 541 places, 581 transitions, 1642 flow [2021-06-10 11:36:53,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 541 places, 581 transitions, 1642 flow [2021-06-10 11:36:53,478 INFO L129 PetriNetUnfolder]: 10/108 cut-off events. [2021-06-10 11:36:53,478 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:36:53,478 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,478 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-06-10 11:36:53,478 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash 650231250, now seen corresponding path program 1 times [2021-06-10 11:36:53,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832556873] [2021-06-10 11:36:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:53,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:53,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:53,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832556873] [2021-06-10 11:36:53,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:53,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:53,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005905057] [2021-06-10 11:36:53,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:53,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:53,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:53,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 581 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:53,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:53,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:53,622 INFO L129 PetriNetUnfolder]: 59/602 cut-off events. [2021-06-10 11:36:53,622 INFO L130 PetriNetUnfolder]: For 1521/1521 co-relation queries the response was YES. [2021-06-10 11:36:53,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 602 events. 59/602 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2355 event pairs, 0 based on Foata normal form. 88/609 useless extension candidates. Maximal degree in co-relation 816. Up to 21 conditions per place. [2021-06-10 11:36:53,648 INFO L132 encePairwiseOnDemand]: 554/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/537 dead transitions. [2021-06-10 11:36:53,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 537 transitions, 1580 flow [2021-06-10 11:36:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1643 transitions. [2021-06-10 11:36:53,649 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.942627653471027 [2021-06-10 11:36:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1643 transitions. [2021-06-10 11:36:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1643 transitions. [2021-06-10 11:36:53,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:53,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1643 transitions. [2021-06-10 11:36:53,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,651 INFO L185 Difference]: Start difference. First operand has 541 places, 581 transitions, 1642 flow. Second operand 3 states and 1643 transitions. [2021-06-10 11:36:53,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 537 transitions, 1580 flow [2021-06-10 11:36:53,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 537 transitions, 1200 flow, removed 190 selfloop flow, removed 0 redundant places. [2021-06-10 11:36:53,657 INFO L241 Difference]: Finished difference. Result has 520 places, 537 transitions, 1194 flow [2021-06-10 11:36:53,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=520, PETRI_TRANSITIONS=537} [2021-06-10 11:36:53,657 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -21 predicate places. [2021-06-10 11:36:53,657 INFO L480 AbstractCegarLoop]: Abstraction has has 520 places, 537 transitions, 1194 flow [2021-06-10 11:36:53,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,657 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-06-10 11:36:53,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2021-06-10 11:36:53,657 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 650230227, now seen corresponding path program 1 times [2021-06-10 11:36:53,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832275758] [2021-06-10 11:36:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:53,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:53,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:53,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832275758] [2021-06-10 11:36:53,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:53,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:53,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477325986] [2021-06-10 11:36:53,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:53,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:53,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:53,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:53,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:53,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 537 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:53,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:53,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:53,785 INFO L129 PetriNetUnfolder]: 57/603 cut-off events. [2021-06-10 11:36:53,786 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:53,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 603 events. 57/603 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2378 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 657. Up to 21 conditions per place. [2021-06-10 11:36:53,809 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/537 dead transitions. [2021-06-10 11:36:53,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 537 transitions, 1206 flow [2021-06-10 11:36:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:53,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:53,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:53,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:53,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:53,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:53,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,812 INFO L185 Difference]: Start difference. First operand has 520 places, 537 transitions, 1194 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:53,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 537 transitions, 1206 flow [2021-06-10 11:36:53,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 537 transitions, 1201 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:53,817 INFO L241 Difference]: Finished difference. Result has 522 places, 536 transitions, 1190 flow [2021-06-10 11:36:53,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1190, PETRI_PLACES=522, PETRI_TRANSITIONS=536} [2021-06-10 11:36:53,817 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -19 predicate places. [2021-06-10 11:36:53,817 INFO L480 AbstractCegarLoop]: Abstraction has has 522 places, 536 transitions, 1190 flow [2021-06-10 11:36:53,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,817 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-06-10 11:36:53,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2021-06-10 11:36:53,817 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash 649276915, now seen corresponding path program 1 times [2021-06-10 11:36:53,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210640924] [2021-06-10 11:36:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:53,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:53,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:53,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210640924] [2021-06-10 11:36:53,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:53,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:53,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231666542] [2021-06-10 11:36:53,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:53,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:53,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:53,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 536 transitions, 1190 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:53,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:53,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:53,946 INFO L129 PetriNetUnfolder]: 57/597 cut-off events. [2021-06-10 11:36:53,947 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:36:53,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 597 events. 57/597 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2329 event pairs, 0 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 664. Up to 21 conditions per place. [2021-06-10 11:36:53,970 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 9 selfloop transitions, 1 changer transitions 0/534 dead transitions. [2021-06-10 11:36:53,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 534 transitions, 1200 flow [2021-06-10 11:36:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2021-06-10 11:36:53,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2021-06-10 11:36:53,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2021-06-10 11:36:53,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2021-06-10 11:36:53,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:53,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2021-06-10 11:36:53,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,973 INFO L185 Difference]: Start difference. First operand has 522 places, 536 transitions, 1190 flow. Second operand 3 states and 1596 transitions. [2021-06-10 11:36:53,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 534 transitions, 1200 flow [2021-06-10 11:36:53,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 534 transitions, 1199 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:53,977 INFO L241 Difference]: Finished difference. Result has 523 places, 534 transitions, 1181 flow [2021-06-10 11:36:53,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=523, PETRI_TRANSITIONS=534} [2021-06-10 11:36:53,978 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -18 predicate places. [2021-06-10 11:36:53,978 INFO L480 AbstractCegarLoop]: Abstraction has has 523 places, 534 transitions, 1181 flow [2021-06-10 11:36:53,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:53,978 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-06-10 11:36:53,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2021-06-10 11:36:53,978 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 649277938, now seen corresponding path program 1 times [2021-06-10 11:36:53,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:53,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973139861] [2021-06-10 11:36:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:53,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:53,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:53,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:36:53,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973139861] [2021-06-10 11:36:53,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:53,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:53,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668221106] [2021-06-10 11:36:53,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:53,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:53,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:53,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 534 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:53,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:53,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:53,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,105 INFO L129 PetriNetUnfolder]: 57/594 cut-off events. [2021-06-10 11:36:54,105 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:54,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 594 events. 57/594 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2308 event pairs, 0 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 655. Up to 21 conditions per place. [2021-06-10 11:36:54,128 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2021-06-10 11:36:54,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 532 transitions, 1187 flow [2021-06-10 11:36:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:54,129 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:54,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,131 INFO L185 Difference]: Start difference. First operand has 523 places, 534 transitions, 1181 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:54,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 532 transitions, 1187 flow [2021-06-10 11:36:54,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 532 transitions, 1182 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:54,135 INFO L241 Difference]: Finished difference. Result has 521 places, 532 transitions, 1175 flow [2021-06-10 11:36:54,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=521, PETRI_TRANSITIONS=532} [2021-06-10 11:36:54,136 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -20 predicate places. [2021-06-10 11:36:54,136 INFO L480 AbstractCegarLoop]: Abstraction has has 521 places, 532 transitions, 1175 flow [2021-06-10 11:36:54,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,136 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,136 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2021-06-10 11:36:54,136 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash -581581011, now seen corresponding path program 1 times [2021-06-10 11:36:54,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986095964] [2021-06-10 11:36:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:54,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:54,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986095964] [2021-06-10 11:36:54,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084206239] [2021-06-10 11:36:54,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:54,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 532 transitions, 1175 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:54,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,276 INFO L129 PetriNetUnfolder]: 56/601 cut-off events. [2021-06-10 11:36:54,276 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:54,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 601 events. 56/601 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2368 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 666. Up to 21 conditions per place. [2021-06-10 11:36:54,293 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/533 dead transitions. [2021-06-10 11:36:54,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 533 transitions, 1191 flow [2021-06-10 11:36:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:54,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:54,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:54,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:54,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:54,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,296 INFO L185 Difference]: Start difference. First operand has 521 places, 532 transitions, 1175 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:54,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 533 transitions, 1191 flow [2021-06-10 11:36:54,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 533 transitions, 1190 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:54,300 INFO L241 Difference]: Finished difference. Result has 523 places, 532 transitions, 1179 flow [2021-06-10 11:36:54,301 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=523, PETRI_TRANSITIONS=532} [2021-06-10 11:36:54,301 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -18 predicate places. [2021-06-10 11:36:54,301 INFO L480 AbstractCegarLoop]: Abstraction has has 523 places, 532 transitions, 1179 flow [2021-06-10 11:36:54,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,301 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,301 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2021-06-10 11:36:54,301 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash -581579988, now seen corresponding path program 1 times [2021-06-10 11:36:54,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213953159] [2021-06-10 11:36:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:54,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:54,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213953159] [2021-06-10 11:36:54,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213561761] [2021-06-10 11:36:54,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:54,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 532 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:54,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,436 INFO L129 PetriNetUnfolder]: 54/603 cut-off events. [2021-06-10 11:36:54,436 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:54,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 603 events. 54/603 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2401 event pairs, 0 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 675. Up to 21 conditions per place. [2021-06-10 11:36:54,461 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/533 dead transitions. [2021-06-10 11:36:54,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 533 transitions, 1205 flow [2021-06-10 11:36:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:36:54,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:36:54,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:36:54,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:36:54,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:36:54,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,464 INFO L185 Difference]: Start difference. First operand has 523 places, 532 transitions, 1179 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:36:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 533 transitions, 1205 flow [2021-06-10 11:36:54,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 533 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:54,469 INFO L241 Difference]: Finished difference. Result has 526 places, 533 transitions, 1196 flow [2021-06-10 11:36:54,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1196, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2021-06-10 11:36:54,469 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -15 predicate places. [2021-06-10 11:36:54,469 INFO L480 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1196 flow [2021-06-10 11:36:54,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,469 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2021-06-10 11:36:54,470 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -582533300, now seen corresponding path program 1 times [2021-06-10 11:36:54,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451825141] [2021-06-10 11:36:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:54,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:54,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451825141] [2021-06-10 11:36:54,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876979843] [2021-06-10 11:36:54,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,482 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:54,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1196 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:54,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,600 INFO L129 PetriNetUnfolder]: 54/596 cut-off events. [2021-06-10 11:36:54,600 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:54,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 596 events. 54/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2341 event pairs, 0 based on Foata normal form. 1/524 useless extension candidates. Maximal degree in co-relation 661. Up to 21 conditions per place. [2021-06-10 11:36:54,624 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/531 dead transitions. [2021-06-10 11:36:54,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 531 transitions, 1198 flow [2021-06-10 11:36:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:54,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:54,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:54,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,627 INFO L185 Difference]: Start difference. First operand has 526 places, 533 transitions, 1196 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:54,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 531 transitions, 1198 flow [2021-06-10 11:36:54,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 531 transitions, 1190 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:54,632 INFO L241 Difference]: Finished difference. Result has 526 places, 531 transitions, 1183 flow [2021-06-10 11:36:54,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=526, PETRI_TRANSITIONS=531} [2021-06-10 11:36:54,632 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -15 predicate places. [2021-06-10 11:36:54,632 INFO L480 AbstractCegarLoop]: Abstraction has has 526 places, 531 transitions, 1183 flow [2021-06-10 11:36:54,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,632 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2021-06-10 11:36:54,633 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash -582534323, now seen corresponding path program 1 times [2021-06-10 11:36:54,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287384848] [2021-06-10 11:36:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:54,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:36:54,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287384848] [2021-06-10 11:36:54,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86237301] [2021-06-10 11:36:54,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:54,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 531 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:54,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,766 INFO L129 PetriNetUnfolder]: 54/594 cut-off events. [2021-06-10 11:36:54,767 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:54,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 594 events. 54/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2326 event pairs, 0 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 665. Up to 21 conditions per place. [2021-06-10 11:36:54,790 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/529 dead transitions. [2021-06-10 11:36:54,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1196 flow [2021-06-10 11:36:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:54,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:54,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:54,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:54,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:54,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,794 INFO L185 Difference]: Start difference. First operand has 526 places, 531 transitions, 1183 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:54,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1196 flow [2021-06-10 11:36:54,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 529 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:54,798 INFO L241 Difference]: Finished difference. Result has 525 places, 529 transitions, 1179 flow [2021-06-10 11:36:54,798 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1179, PETRI_PLACES=525, PETRI_TRANSITIONS=529} [2021-06-10 11:36:54,798 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -16 predicate places. [2021-06-10 11:36:54,798 INFO L480 AbstractCegarLoop]: Abstraction has has 525 places, 529 transitions, 1179 flow [2021-06-10 11:36:54,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,799 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2021-06-10 11:36:54,799 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2063226503, now seen corresponding path program 1 times [2021-06-10 11:36:54,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976175317] [2021-06-10 11:36:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:54,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:54,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976175317] [2021-06-10 11:36:54,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053446880] [2021-06-10 11:36:54,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:54,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 529 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:54,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:54,937 INFO L129 PetriNetUnfolder]: 53/602 cut-off events. [2021-06-10 11:36:54,937 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:54,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 602 events. 53/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2396 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 677. Up to 21 conditions per place. [2021-06-10 11:36:54,961 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/531 dead transitions. [2021-06-10 11:36:54,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 531 transitions, 1209 flow [2021-06-10 11:36:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:36:54,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:36:54,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:36:54,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:36:54,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:54,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:36:54,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,975 INFO L185 Difference]: Start difference. First operand has 525 places, 529 transitions, 1179 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:36:54,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 531 transitions, 1209 flow [2021-06-10 11:36:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 531 transitions, 1208 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:54,980 INFO L241 Difference]: Finished difference. Result has 528 places, 531 transitions, 1202 flow [2021-06-10 11:36:54,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1202, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2021-06-10 11:36:54,980 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -13 predicate places. [2021-06-10 11:36:54,981 INFO L480 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1202 flow [2021-06-10 11:36:54,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:54,981 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:54,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2021-06-10 11:36:54,981 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:54,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2063225480, now seen corresponding path program 1 times [2021-06-10 11:36:54,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:54,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644426158] [2021-06-10 11:36:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:54,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:54,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:54,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:54,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644426158] [2021-06-10 11:36:54,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:54,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:54,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365105921] [2021-06-10 11:36:54,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:54,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:54,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:54,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1202 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:54,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:54,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:54,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,117 INFO L129 PetriNetUnfolder]: 51/603 cut-off events. [2021-06-10 11:36:55,117 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:55,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 603 events. 51/603 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2417 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 677. Up to 21 conditions per place. [2021-06-10 11:36:55,141 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/531 dead transitions. [2021-06-10 11:36:55,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1214 flow [2021-06-10 11:36:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:55,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:55,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,144 INFO L185 Difference]: Start difference. First operand has 528 places, 531 transitions, 1202 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:55,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1214 flow [2021-06-10 11:36:55,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 531 transitions, 1209 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:55,149 INFO L241 Difference]: Finished difference. Result has 530 places, 530 transitions, 1198 flow [2021-06-10 11:36:55,149 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1198, PETRI_PLACES=530, PETRI_TRANSITIONS=530} [2021-06-10 11:36:55,149 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -11 predicate places. [2021-06-10 11:36:55,149 INFO L480 AbstractCegarLoop]: Abstraction has has 530 places, 530 transitions, 1198 flow [2021-06-10 11:36:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,149 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2021-06-10 11:36:55,149 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2062273191, now seen corresponding path program 1 times [2021-06-10 11:36:55,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632343734] [2021-06-10 11:36:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:55,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:55,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632343734] [2021-06-10 11:36:55,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150090763] [2021-06-10 11:36:55,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:55,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:55,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 530 transitions, 1198 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:55,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:55,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,281 INFO L129 PetriNetUnfolder]: 51/596 cut-off events. [2021-06-10 11:36:55,282 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:55,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 596 events. 51/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2360 event pairs, 0 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 671. Up to 21 conditions per place. [2021-06-10 11:36:55,304 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/528 dead transitions. [2021-06-10 11:36:55,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 528 transitions, 1201 flow [2021-06-10 11:36:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:55,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:55,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,307 INFO L185 Difference]: Start difference. First operand has 530 places, 530 transitions, 1198 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:55,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 528 transitions, 1201 flow [2021-06-10 11:36:55,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 528 transitions, 1194 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:55,311 INFO L241 Difference]: Finished difference. Result has 530 places, 528 transitions, 1187 flow [2021-06-10 11:36:55,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=530, PETRI_TRANSITIONS=528} [2021-06-10 11:36:55,311 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -11 predicate places. [2021-06-10 11:36:55,311 INFO L480 AbstractCegarLoop]: Abstraction has has 530 places, 528 transitions, 1187 flow [2021-06-10 11:36:55,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,312 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,312 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2021-06-10 11:36:55,312 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2062272168, now seen corresponding path program 1 times [2021-06-10 11:36:55,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507459557] [2021-06-10 11:36:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:55,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:36:55,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507459557] [2021-06-10 11:36:55,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452057324] [2021-06-10 11:36:55,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:55,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:55,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 528 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:55,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:55,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,441 INFO L129 PetriNetUnfolder]: 51/594 cut-off events. [2021-06-10 11:36:55,441 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:55,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 594 events. 51/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2343 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 671. Up to 21 conditions per place. [2021-06-10 11:36:55,463 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/526 dead transitions. [2021-06-10 11:36:55,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 526 transitions, 1200 flow [2021-06-10 11:36:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:55,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:55,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:55,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:55,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:55,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,466 INFO L185 Difference]: Start difference. First operand has 530 places, 528 transitions, 1187 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:55,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 526 transitions, 1200 flow [2021-06-10 11:36:55,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 526 transitions, 1199 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:55,471 INFO L241 Difference]: Finished difference. Result has 529 places, 526 transitions, 1183 flow [2021-06-10 11:36:55,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=529, PETRI_TRANSITIONS=526} [2021-06-10 11:36:55,471 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -12 predicate places. [2021-06-10 11:36:55,471 INFO L480 AbstractCegarLoop]: Abstraction has has 529 places, 526 transitions, 1183 flow [2021-06-10 11:36:55,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,471 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2021-06-10 11:36:55,471 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1958896253, now seen corresponding path program 1 times [2021-06-10 11:36:55,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799698475] [2021-06-10 11:36:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:55,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:55,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799698475] [2021-06-10 11:36:55,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963316622] [2021-06-10 11:36:55,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:55,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:55,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 526 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:55,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:55,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,601 INFO L129 PetriNetUnfolder]: 49/599 cut-off events. [2021-06-10 11:36:55,601 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:55,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 599 events. 49/599 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2394 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 674. Up to 21 conditions per place. [2021-06-10 11:36:55,623 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2021-06-10 11:36:55,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 527 transitions, 1199 flow [2021-06-10 11:36:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:55,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:55,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:55,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,626 INFO L185 Difference]: Start difference. First operand has 529 places, 526 transitions, 1183 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:55,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 527 transitions, 1199 flow [2021-06-10 11:36:55,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 527 transitions, 1198 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:55,631 INFO L241 Difference]: Finished difference. Result has 532 places, 527 transitions, 1196 flow [2021-06-10 11:36:55,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1196, PETRI_PLACES=532, PETRI_TRANSITIONS=527} [2021-06-10 11:36:55,631 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -9 predicate places. [2021-06-10 11:36:55,631 INFO L480 AbstractCegarLoop]: Abstraction has has 532 places, 527 transitions, 1196 flow [2021-06-10 11:36:55,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,631 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2021-06-10 11:36:55,631 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1958897276, now seen corresponding path program 1 times [2021-06-10 11:36:55,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030669368] [2021-06-10 11:36:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:55,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:55,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030669368] [2021-06-10 11:36:55,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336475838] [2021-06-10 11:36:55,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:55,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:55,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 527 transitions, 1196 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:55,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:55,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,792 INFO L129 PetriNetUnfolder]: 49/600 cut-off events. [2021-06-10 11:36:55,792 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:55,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 600 events. 49/600 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2401 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 682. Up to 21 conditions per place. [2021-06-10 11:36:55,815 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2021-06-10 11:36:55,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 528 transitions, 1222 flow [2021-06-10 11:36:55,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:36:55,816 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:36:55,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:36:55,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:36:55,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:36:55,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,817 INFO L185 Difference]: Start difference. First operand has 532 places, 527 transitions, 1196 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:36:55,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 528 transitions, 1222 flow [2021-06-10 11:36:55,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 528 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:55,822 INFO L241 Difference]: Finished difference. Result has 535 places, 528 transitions, 1212 flow [2021-06-10 11:36:55,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=535, PETRI_TRANSITIONS=528} [2021-06-10 11:36:55,822 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -6 predicate places. [2021-06-10 11:36:55,822 INFO L480 AbstractCegarLoop]: Abstraction has has 535 places, 528 transitions, 1212 flow [2021-06-10 11:36:55,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,822 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2021-06-10 11:36:55,823 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1957943964, now seen corresponding path program 1 times [2021-06-10 11:36:55,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871850300] [2021-06-10 11:36:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:55,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:55,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871850300] [2021-06-10 11:36:55,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080243488] [2021-06-10 11:36:55,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:55,836 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:55,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 528 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:55,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:55,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:55,953 INFO L129 PetriNetUnfolder]: 48/596 cut-off events. [2021-06-10 11:36:55,953 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:55,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 596 events. 48/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2378 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 675. Up to 21 conditions per place. [2021-06-10 11:36:55,976 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/525 dead transitions. [2021-06-10 11:36:55,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 525 transitions, 1209 flow [2021-06-10 11:36:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:55,977 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:55,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:55,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:55,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,979 INFO L185 Difference]: Start difference. First operand has 535 places, 528 transitions, 1212 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:55,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 525 transitions, 1209 flow [2021-06-10 11:36:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 525 transitions, 1201 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:55,983 INFO L241 Difference]: Finished difference. Result has 534 places, 525 transitions, 1191 flow [2021-06-10 11:36:55,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=534, PETRI_TRANSITIONS=525} [2021-06-10 11:36:55,984 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -7 predicate places. [2021-06-10 11:36:55,984 INFO L480 AbstractCegarLoop]: Abstraction has has 534 places, 525 transitions, 1191 flow [2021-06-10 11:36:55,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:55,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:55,984 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:55,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2021-06-10 11:36:55,984 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1957942941, now seen corresponding path program 1 times [2021-06-10 11:36:55,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:55,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429828093] [2021-06-10 11:36:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:55,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:55,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:55,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:36:55,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429828093] [2021-06-10 11:36:55,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:55,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:55,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199317502] [2021-06-10 11:36:55,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:55,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:56,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 525 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:56,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,120 INFO L129 PetriNetUnfolder]: 48/594 cut-off events. [2021-06-10 11:36:56,120 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:56,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 594 events. 48/594 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2360 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 678. Up to 21 conditions per place. [2021-06-10 11:36:56,143 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/523 dead transitions. [2021-06-10 11:36:56,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 523 transitions, 1204 flow [2021-06-10 11:36:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:56,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:56,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:56,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:56,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:56,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,146 INFO L185 Difference]: Start difference. First operand has 534 places, 525 transitions, 1191 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:56,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 523 transitions, 1204 flow [2021-06-10 11:36:56,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 523 transitions, 1203 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:56,151 INFO L241 Difference]: Finished difference. Result has 533 places, 523 transitions, 1187 flow [2021-06-10 11:36:56,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=533, PETRI_TRANSITIONS=523} [2021-06-10 11:36:56,151 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -8 predicate places. [2021-06-10 11:36:56,151 INFO L480 AbstractCegarLoop]: Abstraction has has 533 places, 523 transitions, 1187 flow [2021-06-10 11:36:56,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,151 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,151 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2021-06-10 11:36:56,151 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1597437536, now seen corresponding path program 1 times [2021-06-10 11:36:56,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919925263] [2021-06-10 11:36:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:56,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:56,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:56,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919925263] [2021-06-10 11:36:56,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:56,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:56,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250057199] [2021-06-10 11:36:56,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:56,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:56,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 523 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:56,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,283 INFO L129 PetriNetUnfolder]: 46/599 cut-off events. [2021-06-10 11:36:56,283 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:56,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 599 events. 46/599 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2410 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 681. Up to 21 conditions per place. [2021-06-10 11:36:56,306 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2021-06-10 11:36:56,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 524 transitions, 1203 flow [2021-06-10 11:36:56,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:56,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:56,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,311 INFO L185 Difference]: Start difference. First operand has 533 places, 523 transitions, 1187 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:56,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 524 transitions, 1203 flow [2021-06-10 11:36:56,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 524 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:56,316 INFO L241 Difference]: Finished difference. Result has 536 places, 524 transitions, 1200 flow [2021-06-10 11:36:56,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=536, PETRI_TRANSITIONS=524} [2021-06-10 11:36:56,316 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -5 predicate places. [2021-06-10 11:36:56,316 INFO L480 AbstractCegarLoop]: Abstraction has has 536 places, 524 transitions, 1200 flow [2021-06-10 11:36:56,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,316 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2021-06-10 11:36:56,316 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1597436513, now seen corresponding path program 1 times [2021-06-10 11:36:56,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724965523] [2021-06-10 11:36:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:56,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:56,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:56,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724965523] [2021-06-10 11:36:56,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:56,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:56,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732487099] [2021-06-10 11:36:56,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:56,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:56,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 524 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:56,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,456 INFO L129 PetriNetUnfolder]: 46/600 cut-off events. [2021-06-10 11:36:56,457 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:36:56,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 600 events. 46/600 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2421 event pairs, 0 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 689. Up to 21 conditions per place. [2021-06-10 11:36:56,480 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/525 dead transitions. [2021-06-10 11:36:56,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 525 transitions, 1226 flow [2021-06-10 11:36:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:36:56,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:36:56,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:36:56,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:36:56,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:36:56,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,483 INFO L185 Difference]: Start difference. First operand has 536 places, 524 transitions, 1200 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:36:56,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 525 transitions, 1226 flow [2021-06-10 11:36:56,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 525 transitions, 1224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:56,487 INFO L241 Difference]: Finished difference. Result has 539 places, 525 transitions, 1216 flow [2021-06-10 11:36:56,488 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=539, PETRI_TRANSITIONS=525} [2021-06-10 11:36:56,488 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -2 predicate places. [2021-06-10 11:36:56,488 INFO L480 AbstractCegarLoop]: Abstraction has has 539 places, 525 transitions, 1216 flow [2021-06-10 11:36:56,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,488 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2021-06-10 11:36:56,488 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1598390848, now seen corresponding path program 1 times [2021-06-10 11:36:56,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302338287] [2021-06-10 11:36:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:56,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:56,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:56,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302338287] [2021-06-10 11:36:56,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:56,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:56,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496407946] [2021-06-10 11:36:56,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:56,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:56,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 525 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:56,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,637 INFO L129 PetriNetUnfolder]: 45/597 cut-off events. [2021-06-10 11:36:56,637 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:36:56,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 597 events. 45/597 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2402 event pairs, 0 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 688. Up to 21 conditions per place. [2021-06-10 11:36:56,659 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 9 selfloop transitions, 1 changer transitions 0/523 dead transitions. [2021-06-10 11:36:56,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 523 transitions, 1224 flow [2021-06-10 11:36:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2021-06-10 11:36:56,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2021-06-10 11:36:56,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2021-06-10 11:36:56,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2021-06-10 11:36:56,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2021-06-10 11:36:56,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,662 INFO L185 Difference]: Start difference. First operand has 539 places, 525 transitions, 1216 flow. Second operand 3 states and 1596 transitions. [2021-06-10 11:36:56,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 523 transitions, 1224 flow [2021-06-10 11:36:56,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 523 transitions, 1223 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:56,667 INFO L241 Difference]: Finished difference. Result has 540 places, 523 transitions, 1205 flow [2021-06-10 11:36:56,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1205, PETRI_PLACES=540, PETRI_TRANSITIONS=523} [2021-06-10 11:36:56,667 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -1 predicate places. [2021-06-10 11:36:56,667 INFO L480 AbstractCegarLoop]: Abstraction has has 540 places, 523 transitions, 1205 flow [2021-06-10 11:36:56,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,667 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2021-06-10 11:36:56,667 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1598389825, now seen corresponding path program 1 times [2021-06-10 11:36:56,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575067746] [2021-06-10 11:36:56,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:56,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:56,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:36:56,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575067746] [2021-06-10 11:36:56,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:56,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:56,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964011153] [2021-06-10 11:36:56,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:56,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:56,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 523 transitions, 1205 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:56,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,798 INFO L129 PetriNetUnfolder]: 45/594 cut-off events. [2021-06-10 11:36:56,798 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:56,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 594 events. 45/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2381 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 682. Up to 21 conditions per place. [2021-06-10 11:36:56,820 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/520 dead transitions. [2021-06-10 11:36:56,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 520 transitions, 1206 flow [2021-06-10 11:36:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:56,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:56,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:56,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:56,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:56,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,823 INFO L185 Difference]: Start difference. First operand has 540 places, 523 transitions, 1205 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:56,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 520 transitions, 1206 flow [2021-06-10 11:36:56,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 520 transitions, 1201 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:56,828 INFO L241 Difference]: Finished difference. Result has 537 places, 520 transitions, 1191 flow [2021-06-10 11:36:56,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=537, PETRI_TRANSITIONS=520} [2021-06-10 11:36:56,828 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -4 predicate places. [2021-06-10 11:36:56,828 INFO L480 AbstractCegarLoop]: Abstraction has has 537 places, 520 transitions, 1191 flow [2021-06-10 11:36:56,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,829 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2021-06-10 11:36:56,829 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1137383327, now seen corresponding path program 1 times [2021-06-10 11:36:56,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926774021] [2021-06-10 11:36:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:56,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:56,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:56,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:56,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926774021] [2021-06-10 11:36:56,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:56,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:56,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105273984] [2021-06-10 11:36:56,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:56,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:56,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:56,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:56,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 520 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:56,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:56,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:56,962 INFO L129 PetriNetUnfolder]: 44/601 cut-off events. [2021-06-10 11:36:56,962 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:56,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 601 events. 44/601 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2439 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 692. Up to 21 conditions per place. [2021-06-10 11:36:56,984 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/521 dead transitions. [2021-06-10 11:36:56,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 521 transitions, 1207 flow [2021-06-10 11:36:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:56,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:56,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:56,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:56,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,987 INFO L185 Difference]: Start difference. First operand has 537 places, 520 transitions, 1191 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:56,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 521 transitions, 1207 flow [2021-06-10 11:36:56,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 521 transitions, 1206 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:56,992 INFO L241 Difference]: Finished difference. Result has 539 places, 520 transitions, 1195 flow [2021-06-10 11:36:56,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=539, PETRI_TRANSITIONS=520} [2021-06-10 11:36:56,992 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, -2 predicate places. [2021-06-10 11:36:56,992 INFO L480 AbstractCegarLoop]: Abstraction has has 539 places, 520 transitions, 1195 flow [2021-06-10 11:36:56,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:56,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:56,992 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:56,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2021-06-10 11:36:56,992 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1137384350, now seen corresponding path program 1 times [2021-06-10 11:36:56,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:56,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067349033] [2021-06-10 11:36:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:57,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:57,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067349033] [2021-06-10 11:36:57,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850760645] [2021-06-10 11:36:57,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:57,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 520 transitions, 1195 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:57,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:57,138 INFO L129 PetriNetUnfolder]: 42/603 cut-off events. [2021-06-10 11:36:57,139 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:57,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 603 events. 42/603 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2470 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 701. Up to 21 conditions per place. [2021-06-10 11:36:57,159 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/521 dead transitions. [2021-06-10 11:36:57,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 521 transitions, 1221 flow [2021-06-10 11:36:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:36:57,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:36:57,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:36:57,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:36:57,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:57,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:36:57,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,162 INFO L185 Difference]: Start difference. First operand has 539 places, 520 transitions, 1195 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:36:57,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 521 transitions, 1221 flow [2021-06-10 11:36:57,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 521 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:57,166 INFO L241 Difference]: Finished difference. Result has 542 places, 521 transitions, 1212 flow [2021-06-10 11:36:57,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=542, PETRI_TRANSITIONS=521} [2021-06-10 11:36:57,166 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 1 predicate places. [2021-06-10 11:36:57,166 INFO L480 AbstractCegarLoop]: Abstraction has has 542 places, 521 transitions, 1212 flow [2021-06-10 11:36:57,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:57,167 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:57,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2021-06-10 11:36:57,167 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1136431038, now seen corresponding path program 1 times [2021-06-10 11:36:57,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:57,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399103596] [2021-06-10 11:36:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:57,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:57,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399103596] [2021-06-10 11:36:57,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650778542] [2021-06-10 11:36:57,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:57,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 521 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:57,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:57,301 INFO L129 PetriNetUnfolder]: 42/596 cut-off events. [2021-06-10 11:36:57,302 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:57,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 596 events. 42/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2411 event pairs, 0 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 687. Up to 21 conditions per place. [2021-06-10 11:36:57,323 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/519 dead transitions. [2021-06-10 11:36:57,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 519 transitions, 1214 flow [2021-06-10 11:36:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:57,325 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:57,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:57,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:57,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:57,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:57,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,326 INFO L185 Difference]: Start difference. First operand has 542 places, 521 transitions, 1212 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:57,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 519 transitions, 1214 flow [2021-06-10 11:36:57,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 519 transitions, 1206 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:57,331 INFO L241 Difference]: Finished difference. Result has 542 places, 519 transitions, 1199 flow [2021-06-10 11:36:57,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=542, PETRI_TRANSITIONS=519} [2021-06-10 11:36:57,331 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 1 predicate places. [2021-06-10 11:36:57,331 INFO L480 AbstractCegarLoop]: Abstraction has has 542 places, 519 transitions, 1199 flow [2021-06-10 11:36:57,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:57,332 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:57,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2021-06-10 11:36:57,332 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1136430015, now seen corresponding path program 1 times [2021-06-10 11:36:57,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:57,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608662530] [2021-06-10 11:36:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:57,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:36:57,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608662530] [2021-06-10 11:36:57,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110177350] [2021-06-10 11:36:57,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:57,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 519 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:57,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:57,480 INFO L129 PetriNetUnfolder]: 42/594 cut-off events. [2021-06-10 11:36:57,480 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:57,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 594 events. 42/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2394 event pairs, 0 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 691. Up to 21 conditions per place. [2021-06-10 11:36:57,502 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/517 dead transitions. [2021-06-10 11:36:57,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 517 transitions, 1212 flow [2021-06-10 11:36:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:57,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:57,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:57,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:57,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:57,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:57,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,505 INFO L185 Difference]: Start difference. First operand has 542 places, 519 transitions, 1199 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:57,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 517 transitions, 1212 flow [2021-06-10 11:36:57,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 517 transitions, 1211 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:57,509 INFO L241 Difference]: Finished difference. Result has 541 places, 517 transitions, 1195 flow [2021-06-10 11:36:57,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=541, PETRI_TRANSITIONS=517} [2021-06-10 11:36:57,510 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 0 predicate places. [2021-06-10 11:36:57,510 INFO L480 AbstractCegarLoop]: Abstraction has has 541 places, 517 transitions, 1195 flow [2021-06-10 11:36:57,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,510 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:57,510 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:57,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2021-06-10 11:36:57,510 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1127582494, now seen corresponding path program 1 times [2021-06-10 11:36:57,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:57,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343799420] [2021-06-10 11:36:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:57,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:57,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343799420] [2021-06-10 11:36:57,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767769415] [2021-06-10 11:36:57,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,528 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:57,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 517 transitions, 1195 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:57,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:57,662 INFO L129 PetriNetUnfolder]: 41/602 cut-off events. [2021-06-10 11:36:57,662 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:57,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 602 events. 41/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2467 event pairs, 0 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 703. Up to 21 conditions per place. [2021-06-10 11:36:57,685 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/519 dead transitions. [2021-06-10 11:36:57,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 519 transitions, 1225 flow [2021-06-10 11:36:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:36:57,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:36:57,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:36:57,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:36:57,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:57,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:36:57,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,688 INFO L185 Difference]: Start difference. First operand has 541 places, 517 transitions, 1195 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:36:57,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 519 transitions, 1225 flow [2021-06-10 11:36:57,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 519 transitions, 1224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:57,693 INFO L241 Difference]: Finished difference. Result has 544 places, 519 transitions, 1218 flow [2021-06-10 11:36:57,693 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=544, PETRI_TRANSITIONS=519} [2021-06-10 11:36:57,693 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 3 predicate places. [2021-06-10 11:36:57,693 INFO L480 AbstractCegarLoop]: Abstraction has has 544 places, 519 transitions, 1218 flow [2021-06-10 11:36:57,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:57,693 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:57,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2021-06-10 11:36:57,694 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1127583517, now seen corresponding path program 1 times [2021-06-10 11:36:57,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:57,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753139413] [2021-06-10 11:36:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:57,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:57,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753139413] [2021-06-10 11:36:57,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381229474] [2021-06-10 11:36:57,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:57,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 519 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:57,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:57,831 INFO L129 PetriNetUnfolder]: 40/600 cut-off events. [2021-06-10 11:36:57,832 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:57,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 600 events. 40/600 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2457 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 700. Up to 21 conditions per place. [2021-06-10 11:36:57,855 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/519 dead transitions. [2021-06-10 11:36:57,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 519 transitions, 1230 flow [2021-06-10 11:36:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:57,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:57,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:57,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:57,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:57,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:57,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,858 INFO L185 Difference]: Start difference. First operand has 544 places, 519 transitions, 1218 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 519 transitions, 1230 flow [2021-06-10 11:36:57,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 519 transitions, 1225 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:57,863 INFO L241 Difference]: Finished difference. Result has 547 places, 519 transitions, 1223 flow [2021-06-10 11:36:57,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=547, PETRI_TRANSITIONS=519} [2021-06-10 11:36:57,864 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 6 predicate places. [2021-06-10 11:36:57,864 INFO L480 AbstractCegarLoop]: Abstraction has has 547 places, 519 transitions, 1223 flow [2021-06-10 11:36:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:57,864 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:57,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2021-06-10 11:36:57,864 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1128535806, now seen corresponding path program 1 times [2021-06-10 11:36:57,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:57,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771902786] [2021-06-10 11:36:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:57,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:57,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:57,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:57,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771902786] [2021-06-10 11:36:57,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:57,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:57,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822237763] [2021-06-10 11:36:57,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:57,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:57,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:57,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 519 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:57,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:57,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:57,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,001 INFO L129 PetriNetUnfolder]: 39/596 cut-off events. [2021-06-10 11:36:58,002 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:36:58,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 596 events. 39/596 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2427 event pairs, 0 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 697. Up to 21 conditions per place. [2021-06-10 11:36:58,023 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2021-06-10 11:36:58,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 516 transitions, 1220 flow [2021-06-10 11:36:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:58,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:58,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,026 INFO L185 Difference]: Start difference. First operand has 547 places, 519 transitions, 1223 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:58,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 516 transitions, 1220 flow [2021-06-10 11:36:58,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 516 transitions, 1213 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:58,030 INFO L241 Difference]: Finished difference. Result has 546 places, 516 transitions, 1203 flow [2021-06-10 11:36:58,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=546, PETRI_TRANSITIONS=516} [2021-06-10 11:36:58,031 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 5 predicate places. [2021-06-10 11:36:58,031 INFO L480 AbstractCegarLoop]: Abstraction has has 546 places, 516 transitions, 1203 flow [2021-06-10 11:36:58,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,031 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2021-06-10 11:36:58,031 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1128536829, now seen corresponding path program 1 times [2021-06-10 11:36:58,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726182486] [2021-06-10 11:36:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:58,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:36:58,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726182486] [2021-06-10 11:36:58,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447063634] [2021-06-10 11:36:58,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:58,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 516 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:58,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,167 INFO L129 PetriNetUnfolder]: 39/594 cut-off events. [2021-06-10 11:36:58,168 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:58,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 594 events. 39/594 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2411 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 698. Up to 21 conditions per place. [2021-06-10 11:36:58,189 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/514 dead transitions. [2021-06-10 11:36:58,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 514 transitions, 1216 flow [2021-06-10 11:36:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:58,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:58,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,192 INFO L185 Difference]: Start difference. First operand has 546 places, 516 transitions, 1203 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:58,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 514 transitions, 1216 flow [2021-06-10 11:36:58,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 514 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:58,196 INFO L241 Difference]: Finished difference. Result has 545 places, 514 transitions, 1199 flow [2021-06-10 11:36:58,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=545, PETRI_TRANSITIONS=514} [2021-06-10 11:36:58,197 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 4 predicate places. [2021-06-10 11:36:58,197 INFO L480 AbstractCegarLoop]: Abstraction has has 545 places, 514 transitions, 1199 flow [2021-06-10 11:36:58,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,197 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2021-06-10 11:36:58,197 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -211997731, now seen corresponding path program 1 times [2021-06-10 11:36:58,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619939061] [2021-06-10 11:36:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:58,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:58,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619939061] [2021-06-10 11:36:58,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044478415] [2021-06-10 11:36:58,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:58,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 514 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:58,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,340 INFO L129 PetriNetUnfolder]: 38/602 cut-off events. [2021-06-10 11:36:58,341 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:58,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 602 events. 38/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2482 event pairs, 0 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 710. Up to 21 conditions per place. [2021-06-10 11:36:58,363 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/516 dead transitions. [2021-06-10 11:36:58,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 516 transitions, 1229 flow [2021-06-10 11:36:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:36:58,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:36:58,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:36:58,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:36:58,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:36:58,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,365 INFO L185 Difference]: Start difference. First operand has 545 places, 514 transitions, 1199 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:36:58,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 516 transitions, 1229 flow [2021-06-10 11:36:58,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 516 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:58,370 INFO L241 Difference]: Finished difference. Result has 548 places, 516 transitions, 1222 flow [2021-06-10 11:36:58,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=548, PETRI_TRANSITIONS=516} [2021-06-10 11:36:58,370 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 7 predicate places. [2021-06-10 11:36:58,370 INFO L480 AbstractCegarLoop]: Abstraction has has 548 places, 516 transitions, 1222 flow [2021-06-10 11:36:58,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,370 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2021-06-10 11:36:58,371 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash -211998754, now seen corresponding path program 1 times [2021-06-10 11:36:58,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325680645] [2021-06-10 11:36:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:58,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:58,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325680645] [2021-06-10 11:36:58,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731468952] [2021-06-10 11:36:58,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:58,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 516 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:58,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,515 INFO L129 PetriNetUnfolder]: 36/603 cut-off events. [2021-06-10 11:36:58,515 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:58,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 603 events. 36/603 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2501 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 710. Up to 21 conditions per place. [2021-06-10 11:36:58,534 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2021-06-10 11:36:58,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 516 transitions, 1234 flow [2021-06-10 11:36:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:58,535 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:58,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:58,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:58,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:58,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,537 INFO L185 Difference]: Start difference. First operand has 548 places, 516 transitions, 1222 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:58,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 516 transitions, 1234 flow [2021-06-10 11:36:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 516 transitions, 1229 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:58,541 INFO L241 Difference]: Finished difference. Result has 550 places, 515 transitions, 1218 flow [2021-06-10 11:36:58,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=550, PETRI_TRANSITIONS=515} [2021-06-10 11:36:58,541 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 9 predicate places. [2021-06-10 11:36:58,541 INFO L480 AbstractCegarLoop]: Abstraction has has 550 places, 515 transitions, 1218 flow [2021-06-10 11:36:58,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,542 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2021-06-10 11:36:58,542 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash -212951043, now seen corresponding path program 1 times [2021-06-10 11:36:58,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058149961] [2021-06-10 11:36:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:58,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:58,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058149961] [2021-06-10 11:36:58,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13074284] [2021-06-10 11:36:58,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:58,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 515 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:58,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,678 INFO L129 PetriNetUnfolder]: 36/596 cut-off events. [2021-06-10 11:36:58,678 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:58,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 596 events. 36/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2447 event pairs, 0 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 704. Up to 21 conditions per place. [2021-06-10 11:36:58,699 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/513 dead transitions. [2021-06-10 11:36:58,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 513 transitions, 1221 flow [2021-06-10 11:36:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:58,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:58,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:58,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,702 INFO L185 Difference]: Start difference. First operand has 550 places, 515 transitions, 1218 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:58,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 513 transitions, 1221 flow [2021-06-10 11:36:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 513 transitions, 1214 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:58,707 INFO L241 Difference]: Finished difference. Result has 550 places, 513 transitions, 1207 flow [2021-06-10 11:36:58,707 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1207, PETRI_PLACES=550, PETRI_TRANSITIONS=513} [2021-06-10 11:36:58,707 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 9 predicate places. [2021-06-10 11:36:58,707 INFO L480 AbstractCegarLoop]: Abstraction has has 550 places, 513 transitions, 1207 flow [2021-06-10 11:36:58,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,707 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2021-06-10 11:36:58,707 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash -212952066, now seen corresponding path program 1 times [2021-06-10 11:36:58,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906393151] [2021-06-10 11:36:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:58,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:36:58,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906393151] [2021-06-10 11:36:58,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638172413] [2021-06-10 11:36:58,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:58,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 513 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:58,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:58,847 INFO L129 PetriNetUnfolder]: 36/594 cut-off events. [2021-06-10 11:36:58,848 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:58,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 594 events. 36/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2429 event pairs, 0 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 704. Up to 21 conditions per place. [2021-06-10 11:36:58,869 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/511 dead transitions. [2021-06-10 11:36:58,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 511 transitions, 1220 flow [2021-06-10 11:36:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:58,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:58,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:58,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:58,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,872 INFO L185 Difference]: Start difference. First operand has 550 places, 513 transitions, 1207 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:58,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 511 transitions, 1220 flow [2021-06-10 11:36:58,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 511 transitions, 1219 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:58,876 INFO L241 Difference]: Finished difference. Result has 549 places, 511 transitions, 1203 flow [2021-06-10 11:36:58,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=549, PETRI_TRANSITIONS=511} [2021-06-10 11:36:58,876 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 8 predicate places. [2021-06-10 11:36:58,876 INFO L480 AbstractCegarLoop]: Abstraction has has 549 places, 511 transitions, 1203 flow [2021-06-10 11:36:58,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:58,877 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:58,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2021-06-10 11:36:58,877 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1363559358, now seen corresponding path program 1 times [2021-06-10 11:36:58,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:58,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994245660] [2021-06-10 11:36:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:58,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:58,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:58,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:58,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994245660] [2021-06-10 11:36:58,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:58,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:58,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864956034] [2021-06-10 11:36:58,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:58,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:58,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:58,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:58,891 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:58,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 511 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:58,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:58,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:58,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,023 INFO L129 PetriNetUnfolder]: 35/602 cut-off events. [2021-06-10 11:36:59,023 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:59,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 602 events. 35/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2500 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 716. Up to 21 conditions per place. [2021-06-10 11:36:59,045 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/513 dead transitions. [2021-06-10 11:36:59,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 513 transitions, 1233 flow [2021-06-10 11:36:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:36:59,046 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:36:59,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,048 INFO L185 Difference]: Start difference. First operand has 549 places, 511 transitions, 1203 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:36:59,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 513 transitions, 1233 flow [2021-06-10 11:36:59,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 513 transitions, 1232 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:59,053 INFO L241 Difference]: Finished difference. Result has 552 places, 513 transitions, 1226 flow [2021-06-10 11:36:59,053 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=552, PETRI_TRANSITIONS=513} [2021-06-10 11:36:59,053 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 11 predicate places. [2021-06-10 11:36:59,053 INFO L480 AbstractCegarLoop]: Abstraction has has 552 places, 513 transitions, 1226 flow [2021-06-10 11:36:59,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,053 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,053 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2021-06-10 11:36:59,053 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1363558335, now seen corresponding path program 1 times [2021-06-10 11:36:59,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652588163] [2021-06-10 11:36:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:59,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:59,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652588163] [2021-06-10 11:36:59,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751297760] [2021-06-10 11:36:59,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:59,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 513 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:59,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,195 INFO L129 PetriNetUnfolder]: 33/603 cut-off events. [2021-06-10 11:36:59,196 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:59,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 603 events. 33/603 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2521 event pairs, 0 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 716. Up to 21 conditions per place. [2021-06-10 11:36:59,217 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/513 dead transitions. [2021-06-10 11:36:59,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 513 transitions, 1238 flow [2021-06-10 11:36:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:59,218 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:59,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,220 INFO L185 Difference]: Start difference. First operand has 552 places, 513 transitions, 1226 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:59,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 513 transitions, 1238 flow [2021-06-10 11:36:59,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 513 transitions, 1233 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:59,225 INFO L241 Difference]: Finished difference. Result has 554 places, 512 transitions, 1222 flow [2021-06-10 11:36:59,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=554, PETRI_TRANSITIONS=512} [2021-06-10 11:36:59,225 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 13 predicate places. [2021-06-10 11:36:59,225 INFO L480 AbstractCegarLoop]: Abstraction has has 554 places, 512 transitions, 1222 flow [2021-06-10 11:36:59,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,226 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2021-06-10 11:36:59,226 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1362606046, now seen corresponding path program 1 times [2021-06-10 11:36:59,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850579570] [2021-06-10 11:36:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:59,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:59,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850579570] [2021-06-10 11:36:59,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289209582] [2021-06-10 11:36:59,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:59,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 512 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:59,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,365 INFO L129 PetriNetUnfolder]: 33/596 cut-off events. [2021-06-10 11:36:59,365 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:59,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 596 events. 33/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2463 event pairs, 0 based on Foata normal form. 1/545 useless extension candidates. Maximal degree in co-relation 710. Up to 21 conditions per place. [2021-06-10 11:36:59,386 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2021-06-10 11:36:59,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 510 transitions, 1225 flow [2021-06-10 11:36:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:36:59,387 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:36:59,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:36:59,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:36:59,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:36:59,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,389 INFO L185 Difference]: Start difference. First operand has 554 places, 512 transitions, 1222 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:36:59,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 510 transitions, 1225 flow [2021-06-10 11:36:59,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 510 transitions, 1218 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:36:59,393 INFO L241 Difference]: Finished difference. Result has 554 places, 510 transitions, 1211 flow [2021-06-10 11:36:59,394 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=554, PETRI_TRANSITIONS=510} [2021-06-10 11:36:59,394 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 13 predicate places. [2021-06-10 11:36:59,394 INFO L480 AbstractCegarLoop]: Abstraction has has 554 places, 510 transitions, 1211 flow [2021-06-10 11:36:59,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,394 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2021-06-10 11:36:59,394 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1362605023, now seen corresponding path program 1 times [2021-06-10 11:36:59,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074492633] [2021-06-10 11:36:59,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:59,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:36:59,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074492633] [2021-06-10 11:36:59,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888261663] [2021-06-10 11:36:59,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:59,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 510 transitions, 1211 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:59,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,540 INFO L129 PetriNetUnfolder]: 33/594 cut-off events. [2021-06-10 11:36:59,540 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:36:59,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 594 events. 33/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2447 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 710. Up to 21 conditions per place. [2021-06-10 11:36:59,562 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/508 dead transitions. [2021-06-10 11:36:59,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 508 transitions, 1224 flow [2021-06-10 11:36:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:36:59,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:36:59,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:36:59,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:36:59,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:36:59,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,565 INFO L185 Difference]: Start difference. First operand has 554 places, 510 transitions, 1211 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:36:59,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 508 transitions, 1224 flow [2021-06-10 11:36:59,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 508 transitions, 1223 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:59,570 INFO L241 Difference]: Finished difference. Result has 553 places, 508 transitions, 1207 flow [2021-06-10 11:36:59,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1207, PETRI_PLACES=553, PETRI_TRANSITIONS=508} [2021-06-10 11:36:59,570 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 12 predicate places. [2021-06-10 11:36:59,570 INFO L480 AbstractCegarLoop]: Abstraction has has 553 places, 508 transitions, 1207 flow [2021-06-10 11:36:59,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,570 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2021-06-10 11:36:59,570 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -581844192, now seen corresponding path program 1 times [2021-06-10 11:36:59,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263610462] [2021-06-10 11:36:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:36:59,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:59,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263610462] [2021-06-10 11:36:59,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504557402] [2021-06-10 11:36:59,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:59,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 508 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:59,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,718 INFO L129 PetriNetUnfolder]: 32/602 cut-off events. [2021-06-10 11:36:59,718 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:36:59,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 602 events. 32/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2516 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2021-06-10 11:36:59,740 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/510 dead transitions. [2021-06-10 11:36:59,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 510 transitions, 1237 flow [2021-06-10 11:36:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:36:59,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:36:59,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:36:59,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,742 INFO L185 Difference]: Start difference. First operand has 553 places, 508 transitions, 1207 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:36:59,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 510 transitions, 1237 flow [2021-06-10 11:36:59,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 510 transitions, 1236 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:59,747 INFO L241 Difference]: Finished difference. Result has 556 places, 510 transitions, 1230 flow [2021-06-10 11:36:59,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=556, PETRI_TRANSITIONS=510} [2021-06-10 11:36:59,747 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 15 predicate places. [2021-06-10 11:36:59,747 INFO L480 AbstractCegarLoop]: Abstraction has has 556 places, 510 transitions, 1230 flow [2021-06-10 11:36:59,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,748 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2021-06-10 11:36:59,748 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash -581845215, now seen corresponding path program 1 times [2021-06-10 11:36:59,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271147670] [2021-06-10 11:36:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:36:59,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:59,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271147670] [2021-06-10 11:36:59,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388823035] [2021-06-10 11:36:59,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:36:59,762 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 510 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:36:59,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:36:59,894 INFO L129 PetriNetUnfolder]: 30/603 cut-off events. [2021-06-10 11:36:59,895 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:36:59,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 603 events. 30/603 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2540 event pairs, 0 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2021-06-10 11:36:59,915 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2021-06-10 11:36:59,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 510 transitions, 1242 flow [2021-06-10 11:36:59,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:36:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:36:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:36:59,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:36:59,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:36:59,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:36:59,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,918 INFO L185 Difference]: Start difference. First operand has 556 places, 510 transitions, 1230 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:36:59,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 510 transitions, 1242 flow [2021-06-10 11:36:59,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 510 transitions, 1237 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:36:59,922 INFO L241 Difference]: Finished difference. Result has 558 places, 509 transitions, 1226 flow [2021-06-10 11:36:59,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=558, PETRI_TRANSITIONS=509} [2021-06-10 11:36:59,923 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 17 predicate places. [2021-06-10 11:36:59,923 INFO L480 AbstractCegarLoop]: Abstraction has has 558 places, 509 transitions, 1226 flow [2021-06-10 11:36:59,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:36:59,923 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:36:59,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2021-06-10 11:36:59,923 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:36:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:36:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash -582798527, now seen corresponding path program 1 times [2021-06-10 11:36:59,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:36:59,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309715876] [2021-06-10 11:36:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:36:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:36:59,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:36:59,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:36:59,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:36:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:36:59,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309715876] [2021-06-10 11:36:59,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:36:59,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:36:59,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548189462] [2021-06-10 11:36:59,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:36:59,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:36:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:36:59,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:36:59,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:36:59,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 509 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:36:59,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:36:59,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:36:59,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,068 INFO L129 PetriNetUnfolder]: 30/597 cut-off events. [2021-06-10 11:37:00,068 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:00,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 597 events. 30/597 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2491 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 721. Up to 21 conditions per place. [2021-06-10 11:37:00,089 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 9 selfloop transitions, 1 changer transitions 0/507 dead transitions. [2021-06-10 11:37:00,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 507 transitions, 1236 flow [2021-06-10 11:37:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2021-06-10 11:37:00,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2021-06-10 11:37:00,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2021-06-10 11:37:00,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2021-06-10 11:37:00,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2021-06-10 11:37:00,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,091 INFO L185 Difference]: Start difference. First operand has 558 places, 509 transitions, 1226 flow. Second operand 3 states and 1596 transitions. [2021-06-10 11:37:00,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 507 transitions, 1236 flow [2021-06-10 11:37:00,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 507 transitions, 1235 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:00,096 INFO L241 Difference]: Finished difference. Result has 559 places, 507 transitions, 1217 flow [2021-06-10 11:37:00,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1217, PETRI_PLACES=559, PETRI_TRANSITIONS=507} [2021-06-10 11:37:00,096 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 18 predicate places. [2021-06-10 11:37:00,096 INFO L480 AbstractCegarLoop]: Abstraction has has 559 places, 507 transitions, 1217 flow [2021-06-10 11:37:00,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,097 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2021-06-10 11:37:00,097 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -582797504, now seen corresponding path program 1 times [2021-06-10 11:37:00,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931814659] [2021-06-10 11:37:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:00,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:00,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931814659] [2021-06-10 11:37:00,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:00,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:00,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310249255] [2021-06-10 11:37:00,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:00,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:00,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:00,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 507 transitions, 1217 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:00,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:00,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,237 INFO L129 PetriNetUnfolder]: 30/594 cut-off events. [2021-06-10 11:37:00,237 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:00,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 594 events. 30/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2468 event pairs, 0 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 712. Up to 21 conditions per place. [2021-06-10 11:37:00,257 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/505 dead transitions. [2021-06-10 11:37:00,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 505 transitions, 1223 flow [2021-06-10 11:37:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:00,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:00,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,260 INFO L185 Difference]: Start difference. First operand has 559 places, 507 transitions, 1217 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:00,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 505 transitions, 1223 flow [2021-06-10 11:37:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 505 transitions, 1218 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:00,265 INFO L241 Difference]: Finished difference. Result has 557 places, 505 transitions, 1211 flow [2021-06-10 11:37:00,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=557, PETRI_TRANSITIONS=505} [2021-06-10 11:37:00,265 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 16 predicate places. [2021-06-10 11:37:00,265 INFO L480 AbstractCegarLoop]: Abstraction has has 557 places, 505 transitions, 1211 flow [2021-06-10 11:37:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,265 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,265 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2021-06-10 11:37:00,265 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -527677565, now seen corresponding path program 1 times [2021-06-10 11:37:00,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928211100] [2021-06-10 11:37:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:00,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:00,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928211100] [2021-06-10 11:37:00,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:00,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:00,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487534151] [2021-06-10 11:37:00,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:00,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:00,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:00,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 505 transitions, 1211 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:00,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:00,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,417 INFO L129 PetriNetUnfolder]: 29/602 cut-off events. [2021-06-10 11:37:00,417 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:00,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 602 events. 29/602 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2538 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 730. Up to 21 conditions per place. [2021-06-10 11:37:00,439 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/507 dead transitions. [2021-06-10 11:37:00,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 507 transitions, 1241 flow [2021-06-10 11:37:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:37:00,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:37:00,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:37:00,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:37:00,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:37:00,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,442 INFO L185 Difference]: Start difference. First operand has 557 places, 505 transitions, 1211 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:37:00,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 507 transitions, 1241 flow [2021-06-10 11:37:00,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 507 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:00,447 INFO L241 Difference]: Finished difference. Result has 560 places, 507 transitions, 1234 flow [2021-06-10 11:37:00,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=560, PETRI_TRANSITIONS=507} [2021-06-10 11:37:00,447 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 19 predicate places. [2021-06-10 11:37:00,447 INFO L480 AbstractCegarLoop]: Abstraction has has 560 places, 507 transitions, 1234 flow [2021-06-10 11:37:00,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,448 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2021-06-10 11:37:00,448 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash -527678588, now seen corresponding path program 1 times [2021-06-10 11:37:00,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888664939] [2021-06-10 11:37:00,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:00,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:00,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888664939] [2021-06-10 11:37:00,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:00,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:00,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452151073] [2021-06-10 11:37:00,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:00,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:00,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:00,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 507 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:00,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:00,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,598 INFO L129 PetriNetUnfolder]: 27/603 cut-off events. [2021-06-10 11:37:00,598 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:00,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 603 events. 27/603 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2556 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 728. Up to 21 conditions per place. [2021-06-10 11:37:00,620 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/507 dead transitions. [2021-06-10 11:37:00,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 507 transitions, 1246 flow [2021-06-10 11:37:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:00,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:00,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:00,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:00,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:00,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,623 INFO L185 Difference]: Start difference. First operand has 560 places, 507 transitions, 1234 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:00,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 507 transitions, 1246 flow [2021-06-10 11:37:00,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 507 transitions, 1241 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:00,628 INFO L241 Difference]: Finished difference. Result has 562 places, 506 transitions, 1230 flow [2021-06-10 11:37:00,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=562, PETRI_TRANSITIONS=506} [2021-06-10 11:37:00,628 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 21 predicate places. [2021-06-10 11:37:00,628 INFO L480 AbstractCegarLoop]: Abstraction has has 562 places, 506 transitions, 1230 flow [2021-06-10 11:37:00,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,629 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2021-06-10 11:37:00,629 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -528630877, now seen corresponding path program 1 times [2021-06-10 11:37:00,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429122807] [2021-06-10 11:37:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:00,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:00,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429122807] [2021-06-10 11:37:00,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:00,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:00,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197189174] [2021-06-10 11:37:00,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:00,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:00,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:00,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 506 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:00,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:00,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,777 INFO L129 PetriNetUnfolder]: 27/596 cut-off events. [2021-06-10 11:37:00,777 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:00,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 596 events. 27/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2498 event pairs, 0 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2021-06-10 11:37:00,798 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/504 dead transitions. [2021-06-10 11:37:00,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 504 transitions, 1233 flow [2021-06-10 11:37:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:00,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:00,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:00,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,801 INFO L185 Difference]: Start difference. First operand has 562 places, 506 transitions, 1230 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:00,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 504 transitions, 1233 flow [2021-06-10 11:37:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 504 transitions, 1226 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:00,806 INFO L241 Difference]: Finished difference. Result has 562 places, 504 transitions, 1219 flow [2021-06-10 11:37:00,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=562, PETRI_TRANSITIONS=504} [2021-06-10 11:37:00,806 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 21 predicate places. [2021-06-10 11:37:00,806 INFO L480 AbstractCegarLoop]: Abstraction has has 562 places, 504 transitions, 1219 flow [2021-06-10 11:37:00,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,807 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2021-06-10 11:37:00,807 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,807 INFO L82 PathProgramCache]: Analyzing trace with hash -528631900, now seen corresponding path program 1 times [2021-06-10 11:37:00,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876558457] [2021-06-10 11:37:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:00,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:00,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876558457] [2021-06-10 11:37:00,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:00,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:00,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769427224] [2021-06-10 11:37:00,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:00,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:00,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:00,822 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:00,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 504 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:00,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:00,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:00,956 INFO L129 PetriNetUnfolder]: 27/594 cut-off events. [2021-06-10 11:37:00,956 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:00,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 594 events. 27/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2482 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 722. Up to 21 conditions per place. [2021-06-10 11:37:00,977 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/502 dead transitions. [2021-06-10 11:37:00,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 502 transitions, 1232 flow [2021-06-10 11:37:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:37:00,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:37:00,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:37:00,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:37:00,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:00,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:37:00,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,980 INFO L185 Difference]: Start difference. First operand has 562 places, 504 transitions, 1219 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:37:00,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 502 transitions, 1232 flow [2021-06-10 11:37:00,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 502 transitions, 1231 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:00,984 INFO L241 Difference]: Finished difference. Result has 561 places, 502 transitions, 1215 flow [2021-06-10 11:37:00,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=561, PETRI_TRANSITIONS=502} [2021-06-10 11:37:00,985 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 20 predicate places. [2021-06-10 11:37:00,985 INFO L480 AbstractCegarLoop]: Abstraction has has 561 places, 502 transitions, 1215 flow [2021-06-10 11:37:00,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:00,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:00,985 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:00,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2021-06-10 11:37:00,985 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -585674648, now seen corresponding path program 1 times [2021-06-10 11:37:00,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:00,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814367654] [2021-06-10 11:37:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:00,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:00,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:00,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:01,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:01,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814367654] [2021-06-10 11:37:01,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151217637] [2021-06-10 11:37:01,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:01,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 502 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:01,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:01,158 INFO L129 PetriNetUnfolder]: 26/601 cut-off events. [2021-06-10 11:37:01,158 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:01,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 601 events. 26/601 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2545 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 727. Up to 21 conditions per place. [2021-06-10 11:37:01,172 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/503 dead transitions. [2021-06-10 11:37:01,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 503 transitions, 1231 flow [2021-06-10 11:37:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:01,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:01,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:01,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,175 INFO L185 Difference]: Start difference. First operand has 561 places, 502 transitions, 1215 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:01,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 503 transitions, 1231 flow [2021-06-10 11:37:01,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 503 transitions, 1230 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:01,180 INFO L241 Difference]: Finished difference. Result has 563 places, 502 transitions, 1219 flow [2021-06-10 11:37:01,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=563, PETRI_TRANSITIONS=502} [2021-06-10 11:37:01,180 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 22 predicate places. [2021-06-10 11:37:01,180 INFO L480 AbstractCegarLoop]: Abstraction has has 563 places, 502 transitions, 1219 flow [2021-06-10 11:37:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:01,180 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:01,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2021-06-10 11:37:01,180 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash -585673625, now seen corresponding path program 1 times [2021-06-10 11:37:01,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:01,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017002346] [2021-06-10 11:37:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:01,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:01,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:01,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017002346] [2021-06-10 11:37:01,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735290305] [2021-06-10 11:37:01,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:01,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 502 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:01,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:01,333 INFO L129 PetriNetUnfolder]: 24/603 cut-off events. [2021-06-10 11:37:01,334 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:01,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 603 events. 24/603 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2576 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 738. Up to 21 conditions per place. [2021-06-10 11:37:01,355 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/503 dead transitions. [2021-06-10 11:37:01,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 503 transitions, 1245 flow [2021-06-10 11:37:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:37:01,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:37:01,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:37:01,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:37:01,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:01,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:37:01,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,357 INFO L185 Difference]: Start difference. First operand has 563 places, 502 transitions, 1219 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:37:01,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 503 transitions, 1245 flow [2021-06-10 11:37:01,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 503 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:01,362 INFO L241 Difference]: Finished difference. Result has 566 places, 503 transitions, 1236 flow [2021-06-10 11:37:01,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=566, PETRI_TRANSITIONS=503} [2021-06-10 11:37:01,362 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 25 predicate places. [2021-06-10 11:37:01,362 INFO L480 AbstractCegarLoop]: Abstraction has has 566 places, 503 transitions, 1236 flow [2021-06-10 11:37:01,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:01,363 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:01,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2021-06-10 11:37:01,363 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash -586626937, now seen corresponding path program 1 times [2021-06-10 11:37:01,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:01,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836335043] [2021-06-10 11:37:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:01,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:01,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:01,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836335043] [2021-06-10 11:37:01,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094939698] [2021-06-10 11:37:01,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:01,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 503 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:01,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:01,512 INFO L129 PetriNetUnfolder]: 24/596 cut-off events. [2021-06-10 11:37:01,512 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:01,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 596 events. 24/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2516 event pairs, 0 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 724. Up to 21 conditions per place. [2021-06-10 11:37:01,534 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/501 dead transitions. [2021-06-10 11:37:01,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 501 transitions, 1238 flow [2021-06-10 11:37:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:01,535 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:01,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:01,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:01,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:01,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:01,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,536 INFO L185 Difference]: Start difference. First operand has 566 places, 503 transitions, 1236 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:01,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 501 transitions, 1238 flow [2021-06-10 11:37:01,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 501 transitions, 1230 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:01,541 INFO L241 Difference]: Finished difference. Result has 566 places, 501 transitions, 1223 flow [2021-06-10 11:37:01,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=566, PETRI_TRANSITIONS=501} [2021-06-10 11:37:01,541 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 25 predicate places. [2021-06-10 11:37:01,541 INFO L480 AbstractCegarLoop]: Abstraction has has 566 places, 501 transitions, 1223 flow [2021-06-10 11:37:01,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:01,542 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:01,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2021-06-10 11:37:01,542 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -586627960, now seen corresponding path program 1 times [2021-06-10 11:37:01,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:01,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170903528] [2021-06-10 11:37:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:01,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:01,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:01,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170903528] [2021-06-10 11:37:01,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775503394] [2021-06-10 11:37:01,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:01,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 501 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:01,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:01,688 INFO L129 PetriNetUnfolder]: 24/594 cut-off events. [2021-06-10 11:37:01,688 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:01,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 594 events. 24/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2500 event pairs, 0 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 728. Up to 21 conditions per place. [2021-06-10 11:37:01,709 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2021-06-10 11:37:01,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 499 transitions, 1236 flow [2021-06-10 11:37:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:37:01,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:37:01,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:37:01,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:37:01,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:01,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:37:01,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,712 INFO L185 Difference]: Start difference. First operand has 566 places, 501 transitions, 1223 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:37:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 499 transitions, 1236 flow [2021-06-10 11:37:01,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 499 transitions, 1235 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:01,716 INFO L241 Difference]: Finished difference. Result has 565 places, 499 transitions, 1219 flow [2021-06-10 11:37:01,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=565, PETRI_TRANSITIONS=499} [2021-06-10 11:37:01,716 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 24 predicate places. [2021-06-10 11:37:01,717 INFO L480 AbstractCegarLoop]: Abstraction has has 565 places, 499 transitions, 1219 flow [2021-06-10 11:37:01,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:01,717 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:01,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2021-06-10 11:37:01,717 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -26808468, now seen corresponding path program 1 times [2021-06-10 11:37:01,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:01,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683844728] [2021-06-10 11:37:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:01,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:01,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:01,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683844728] [2021-06-10 11:37:01,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386143902] [2021-06-10 11:37:01,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:01,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 499 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:01,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:01,863 INFO L129 PetriNetUnfolder]: 22/599 cut-off events. [2021-06-10 11:37:01,863 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:01,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 599 events. 22/599 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2551 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 731. Up to 21 conditions per place. [2021-06-10 11:37:01,884 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/500 dead transitions. [2021-06-10 11:37:01,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 500 transitions, 1235 flow [2021-06-10 11:37:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:01,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:01,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:01,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:01,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,887 INFO L185 Difference]: Start difference. First operand has 565 places, 499 transitions, 1219 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:01,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 500 transitions, 1235 flow [2021-06-10 11:37:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 500 transitions, 1234 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:01,892 INFO L241 Difference]: Finished difference. Result has 568 places, 500 transitions, 1232 flow [2021-06-10 11:37:01,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=568, PETRI_TRANSITIONS=500} [2021-06-10 11:37:01,892 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 27 predicate places. [2021-06-10 11:37:01,892 INFO L480 AbstractCegarLoop]: Abstraction has has 568 places, 500 transitions, 1232 flow [2021-06-10 11:37:01,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:01,892 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:01,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2021-06-10 11:37:01,892 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -26809491, now seen corresponding path program 1 times [2021-06-10 11:37:01,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:01,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090511736] [2021-06-10 11:37:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:01,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:01,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:01,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:01,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090511736] [2021-06-10 11:37:01,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:01,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:01,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704860212] [2021-06-10 11:37:01,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:01,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:01,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:01,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 500 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:01,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:01,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:01,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,046 INFO L129 PetriNetUnfolder]: 22/600 cut-off events. [2021-06-10 11:37:02,046 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:02,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 600 events. 22/600 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2560 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 739. Up to 21 conditions per place. [2021-06-10 11:37:02,067 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/501 dead transitions. [2021-06-10 11:37:02,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 501 transitions, 1258 flow [2021-06-10 11:37:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:37:02,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:37:02,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:37:02,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:37:02,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:37:02,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,070 INFO L185 Difference]: Start difference. First operand has 568 places, 500 transitions, 1232 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:37:02,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 501 transitions, 1258 flow [2021-06-10 11:37:02,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 501 transitions, 1256 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:02,074 INFO L241 Difference]: Finished difference. Result has 571 places, 501 transitions, 1248 flow [2021-06-10 11:37:02,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=571, PETRI_TRANSITIONS=501} [2021-06-10 11:37:02,075 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 30 predicate places. [2021-06-10 11:37:02,075 INFO L480 AbstractCegarLoop]: Abstraction has has 571 places, 501 transitions, 1248 flow [2021-06-10 11:37:02,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,075 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2021-06-10 11:37:02,075 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -25855156, now seen corresponding path program 1 times [2021-06-10 11:37:02,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790890600] [2021-06-10 11:37:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:02,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:02,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:02,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790890600] [2021-06-10 11:37:02,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:02,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:02,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942546272] [2021-06-10 11:37:02,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:02,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:02,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:02,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 501 transitions, 1248 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:02,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:02,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,227 INFO L129 PetriNetUnfolder]: 21/597 cut-off events. [2021-06-10 11:37:02,227 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:37:02,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 597 events. 21/597 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2543 event pairs, 0 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 738. Up to 21 conditions per place. [2021-06-10 11:37:02,249 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 9 selfloop transitions, 1 changer transitions 0/499 dead transitions. [2021-06-10 11:37:02,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 499 transitions, 1256 flow [2021-06-10 11:37:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1596 transitions. [2021-06-10 11:37:02,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2021-06-10 11:37:02,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1596 transitions. [2021-06-10 11:37:02,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1596 transitions. [2021-06-10 11:37:02,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1596 transitions. [2021-06-10 11:37:02,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.0) internal successors, (1596), 3 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,252 INFO L185 Difference]: Start difference. First operand has 571 places, 501 transitions, 1248 flow. Second operand 3 states and 1596 transitions. [2021-06-10 11:37:02,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 499 transitions, 1256 flow [2021-06-10 11:37:02,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 499 transitions, 1255 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:02,256 INFO L241 Difference]: Finished difference. Result has 572 places, 499 transitions, 1237 flow [2021-06-10 11:37:02,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1237, PETRI_PLACES=572, PETRI_TRANSITIONS=499} [2021-06-10 11:37:02,257 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 31 predicate places. [2021-06-10 11:37:02,257 INFO L480 AbstractCegarLoop]: Abstraction has has 572 places, 499 transitions, 1237 flow [2021-06-10 11:37:02,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,257 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,257 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2021-06-10 11:37:02,257 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -25856179, now seen corresponding path program 1 times [2021-06-10 11:37:02,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240717693] [2021-06-10 11:37:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:02,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:02,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:02,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240717693] [2021-06-10 11:37:02,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:02,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:02,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726818827] [2021-06-10 11:37:02,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:02,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:02,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:02,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 499 transitions, 1237 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:02,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:02,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,403 INFO L129 PetriNetUnfolder]: 21/594 cut-off events. [2021-06-10 11:37:02,404 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:02,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 594 events. 21/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2519 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 732. Up to 21 conditions per place. [2021-06-10 11:37:02,424 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2021-06-10 11:37:02,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 496 transitions, 1238 flow [2021-06-10 11:37:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:02,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:02,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,427 INFO L185 Difference]: Start difference. First operand has 572 places, 499 transitions, 1237 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:02,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 496 transitions, 1238 flow [2021-06-10 11:37:02,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 496 transitions, 1233 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:02,432 INFO L241 Difference]: Finished difference. Result has 569 places, 496 transitions, 1223 flow [2021-06-10 11:37:02,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=569, PETRI_TRANSITIONS=496} [2021-06-10 11:37:02,432 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 28 predicate places. [2021-06-10 11:37:02,432 INFO L480 AbstractCegarLoop]: Abstraction has has 569 places, 496 transitions, 1223 flow [2021-06-10 11:37:02,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,432 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,432 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2021-06-10 11:37:02,433 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -599621677, now seen corresponding path program 1 times [2021-06-10 11:37:02,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438757704] [2021-06-10 11:37:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:02,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:02,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:02,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438757704] [2021-06-10 11:37:02,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:02,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:02,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810608481] [2021-06-10 11:37:02,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:02,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:02,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:02,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 496 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:02,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:02,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,596 INFO L129 PetriNetUnfolder]: 20/602 cut-off events. [2021-06-10 11:37:02,596 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:02,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 602 events. 20/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2589 event pairs, 0 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 749. Up to 21 conditions per place. [2021-06-10 11:37:02,618 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/498 dead transitions. [2021-06-10 11:37:02,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 498 transitions, 1253 flow [2021-06-10 11:37:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:37:02,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:37:02,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:37:02,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:37:02,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:37:02,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,621 INFO L185 Difference]: Start difference. First operand has 569 places, 496 transitions, 1223 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:37:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 498 transitions, 1253 flow [2021-06-10 11:37:02,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 498 transitions, 1252 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:02,626 INFO L241 Difference]: Finished difference. Result has 572 places, 498 transitions, 1246 flow [2021-06-10 11:37:02,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=572, PETRI_TRANSITIONS=498} [2021-06-10 11:37:02,626 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 31 predicate places. [2021-06-10 11:37:02,626 INFO L480 AbstractCegarLoop]: Abstraction has has 572 places, 498 transitions, 1246 flow [2021-06-10 11:37:02,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,626 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2021-06-10 11:37:02,626 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash -599620654, now seen corresponding path program 1 times [2021-06-10 11:37:02,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62861290] [2021-06-10 11:37:02,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:02,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:02,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:02,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62861290] [2021-06-10 11:37:02,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:02,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:02,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404805959] [2021-06-10 11:37:02,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:02,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:02,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:02,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 498 transitions, 1246 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:02,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:02,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,784 INFO L129 PetriNetUnfolder]: 19/600 cut-off events. [2021-06-10 11:37:02,784 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:02,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 600 events. 19/600 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2579 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 744. Up to 21 conditions per place. [2021-06-10 11:37:02,806 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2021-06-10 11:37:02,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 498 transitions, 1258 flow [2021-06-10 11:37:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:02,807 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:02,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:02,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:02,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:02,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,809 INFO L185 Difference]: Start difference. First operand has 572 places, 498 transitions, 1246 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 498 transitions, 1258 flow [2021-06-10 11:37:02,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 498 transitions, 1253 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:02,814 INFO L241 Difference]: Finished difference. Result has 575 places, 498 transitions, 1251 flow [2021-06-10 11:37:02,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1251, PETRI_PLACES=575, PETRI_TRANSITIONS=498} [2021-06-10 11:37:02,814 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 34 predicate places. [2021-06-10 11:37:02,814 INFO L480 AbstractCegarLoop]: Abstraction has has 575 places, 498 transitions, 1251 flow [2021-06-10 11:37:02,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,814 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2021-06-10 11:37:02,815 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash -598668365, now seen corresponding path program 1 times [2021-06-10 11:37:02,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801193653] [2021-06-10 11:37:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:02,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:02,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:02,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:02,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801193653] [2021-06-10 11:37:02,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:02,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:02,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35003613] [2021-06-10 11:37:02,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:02,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:02,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:02,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 498 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:02,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:02,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:02,965 INFO L129 PetriNetUnfolder]: 18/596 cut-off events. [2021-06-10 11:37:02,965 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:02,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 596 events. 18/596 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2556 event pairs, 0 based on Foata normal form. 1/560 useless extension candidates. Maximal degree in co-relation 741. Up to 21 conditions per place. [2021-06-10 11:37:02,986 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/495 dead transitions. [2021-06-10 11:37:02,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 495 transitions, 1248 flow [2021-06-10 11:37:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:02,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:02,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:02,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:02,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,989 INFO L185 Difference]: Start difference. First operand has 575 places, 498 transitions, 1251 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:02,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 495 transitions, 1248 flow [2021-06-10 11:37:02,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 495 transitions, 1241 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:02,994 INFO L241 Difference]: Finished difference. Result has 574 places, 495 transitions, 1231 flow [2021-06-10 11:37:02,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=574, PETRI_TRANSITIONS=495} [2021-06-10 11:37:02,994 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 33 predicate places. [2021-06-10 11:37:02,994 INFO L480 AbstractCegarLoop]: Abstraction has has 574 places, 495 transitions, 1231 flow [2021-06-10 11:37:02,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:02,994 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:02,994 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:02,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2021-06-10 11:37:02,995 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -598667342, now seen corresponding path program 1 times [2021-06-10 11:37:02,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:02,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773138860] [2021-06-10 11:37:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:03,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:03,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773138860] [2021-06-10 11:37:03,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031078713] [2021-06-10 11:37:03,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:03,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 495 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:03,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:03,161 INFO L129 PetriNetUnfolder]: 18/594 cut-off events. [2021-06-10 11:37:03,161 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:03,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 594 events. 18/594 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2541 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 742. Up to 21 conditions per place. [2021-06-10 11:37:03,182 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/493 dead transitions. [2021-06-10 11:37:03,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 493 transitions, 1244 flow [2021-06-10 11:37:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:37:03,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:37:03,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:03,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,184 INFO L185 Difference]: Start difference. First operand has 574 places, 495 transitions, 1231 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:37:03,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 493 transitions, 1244 flow [2021-06-10 11:37:03,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 493 transitions, 1243 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:03,189 INFO L241 Difference]: Finished difference. Result has 573 places, 493 transitions, 1227 flow [2021-06-10 11:37:03,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=573, PETRI_TRANSITIONS=493} [2021-06-10 11:37:03,189 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 32 predicate places. [2021-06-10 11:37:03,190 INFO L480 AbstractCegarLoop]: Abstraction has has 573 places, 493 transitions, 1227 flow [2021-06-10 11:37:03,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:03,190 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:03,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2021-06-10 11:37:03,190 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1140488646, now seen corresponding path program 1 times [2021-06-10 11:37:03,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:03,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454295844] [2021-06-10 11:37:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:03,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:03,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454295844] [2021-06-10 11:37:03,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254160101] [2021-06-10 11:37:03,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:03,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 493 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:03,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:03,355 INFO L129 PetriNetUnfolder]: 17/602 cut-off events. [2021-06-10 11:37:03,355 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:03,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 602 events. 17/602 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2608 event pairs, 0 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 754. Up to 21 conditions per place. [2021-06-10 11:37:03,376 INFO L132 encePairwiseOnDemand]: 576/581 looper letters, 10 selfloop transitions, 3 changer transitions 0/495 dead transitions. [2021-06-10 11:37:03,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 495 transitions, 1257 flow [2021-06-10 11:37:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1599 transitions. [2021-06-10 11:37:03,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173838209982789 [2021-06-10 11:37:03,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1599 transitions. [2021-06-10 11:37:03,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1599 transitions. [2021-06-10 11:37:03,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:03,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1599 transitions. [2021-06-10 11:37:03,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,379 INFO L185 Difference]: Start difference. First operand has 573 places, 493 transitions, 1227 flow. Second operand 3 states and 1599 transitions. [2021-06-10 11:37:03,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 495 transitions, 1257 flow [2021-06-10 11:37:03,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 495 transitions, 1256 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:03,383 INFO L241 Difference]: Finished difference. Result has 576 places, 495 transitions, 1250 flow [2021-06-10 11:37:03,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1250, PETRI_PLACES=576, PETRI_TRANSITIONS=495} [2021-06-10 11:37:03,384 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 35 predicate places. [2021-06-10 11:37:03,384 INFO L480 AbstractCegarLoop]: Abstraction has has 576 places, 495 transitions, 1250 flow [2021-06-10 11:37:03,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:03,384 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:03,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2021-06-10 11:37:03,384 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1140487623, now seen corresponding path program 1 times [2021-06-10 11:37:03,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:03,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138806808] [2021-06-10 11:37:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:03,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:03,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138806808] [2021-06-10 11:37:03,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325816642] [2021-06-10 11:37:03,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:03,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 495 transitions, 1250 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:03,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:03,556 INFO L129 PetriNetUnfolder]: 16/600 cut-off events. [2021-06-10 11:37:03,557 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:03,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 600 events. 16/600 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2598 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 751. Up to 21 conditions per place. [2021-06-10 11:37:03,578 INFO L132 encePairwiseOnDemand]: 578/581 looper letters, 5 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2021-06-10 11:37:03,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 495 transitions, 1262 flow [2021-06-10 11:37:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:03,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:03,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:03,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:03,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:03,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:03,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,580 INFO L185 Difference]: Start difference. First operand has 576 places, 495 transitions, 1250 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:03,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 495 transitions, 1262 flow [2021-06-10 11:37:03,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 495 transitions, 1257 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:03,585 INFO L241 Difference]: Finished difference. Result has 579 places, 495 transitions, 1255 flow [2021-06-10 11:37:03,585 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1255, PETRI_PLACES=579, PETRI_TRANSITIONS=495} [2021-06-10 11:37:03,586 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 38 predicate places. [2021-06-10 11:37:03,586 INFO L480 AbstractCegarLoop]: Abstraction has has 579 places, 495 transitions, 1255 flow [2021-06-10 11:37:03,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:03,586 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:03,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2021-06-10 11:37:03,586 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1139535334, now seen corresponding path program 1 times [2021-06-10 11:37:03,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:03,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23077576] [2021-06-10 11:37:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:03,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:03,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23077576] [2021-06-10 11:37:03,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088851480] [2021-06-10 11:37:03,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:03,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 495 transitions, 1255 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:03,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:03,739 INFO L129 PetriNetUnfolder]: 15/596 cut-off events. [2021-06-10 11:37:03,739 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:03,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 596 events. 15/596 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2571 event pairs, 0 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 748. Up to 21 conditions per place. [2021-06-10 11:37:03,760 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2021-06-10 11:37:03,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 492 transitions, 1252 flow [2021-06-10 11:37:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:03,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:03,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:03,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:03,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:03,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:03,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,763 INFO L185 Difference]: Start difference. First operand has 579 places, 495 transitions, 1255 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:03,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 492 transitions, 1252 flow [2021-06-10 11:37:03,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 492 transitions, 1245 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:03,767 INFO L241 Difference]: Finished difference. Result has 578 places, 492 transitions, 1235 flow [2021-06-10 11:37:03,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1235, PETRI_PLACES=578, PETRI_TRANSITIONS=492} [2021-06-10 11:37:03,767 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 37 predicate places. [2021-06-10 11:37:03,768 INFO L480 AbstractCegarLoop]: Abstraction has has 578 places, 492 transitions, 1235 flow [2021-06-10 11:37:03,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:03,768 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:03,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2021-06-10 11:37:03,768 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1139534311, now seen corresponding path program 1 times [2021-06-10 11:37:03,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:03,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484542915] [2021-06-10 11:37:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:03,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:03,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484542915] [2021-06-10 11:37:03,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121564595] [2021-06-10 11:37:03,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:03,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 492 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:03,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:03,925 INFO L129 PetriNetUnfolder]: 15/594 cut-off events. [2021-06-10 11:37:03,925 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:03,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 594 events. 15/594 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2558 event pairs, 0 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 749. Up to 21 conditions per place. [2021-06-10 11:37:03,942 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/490 dead transitions. [2021-06-10 11:37:03,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 490 transitions, 1248 flow [2021-06-10 11:37:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:37:03,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:37:03,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:03,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:37:03,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,945 INFO L185 Difference]: Start difference. First operand has 578 places, 492 transitions, 1235 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:37:03,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 490 transitions, 1248 flow [2021-06-10 11:37:03,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 490 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:03,949 INFO L241 Difference]: Finished difference. Result has 577 places, 490 transitions, 1231 flow [2021-06-10 11:37:03,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=577, PETRI_TRANSITIONS=490} [2021-06-10 11:37:03,949 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 36 predicate places. [2021-06-10 11:37:03,949 INFO L480 AbstractCegarLoop]: Abstraction has has 577 places, 490 transitions, 1231 flow [2021-06-10 11:37:03,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:03,949 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:03,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2021-06-10 11:37:03,950 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash 5092354, now seen corresponding path program 1 times [2021-06-10 11:37:03,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:03,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552358713] [2021-06-10 11:37:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:03,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:03,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:03,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:03,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552358713] [2021-06-10 11:37:03,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:03,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:03,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112749047] [2021-06-10 11:37:03,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:03,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:03,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:03,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 490 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:03,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:03,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:03,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:04,103 INFO L129 PetriNetUnfolder]: 14/601 cut-off events. [2021-06-10 11:37:04,103 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-10 11:37:04,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 601 events. 14/601 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2616 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 754. Up to 21 conditions per place. [2021-06-10 11:37:04,124 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 6 selfloop transitions, 1 changer transitions 0/491 dead transitions. [2021-06-10 11:37:04,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 491 transitions, 1247 flow [2021-06-10 11:37:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1607 transitions. [2021-06-10 11:37:04,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219736087205966 [2021-06-10 11:37:04,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1607 transitions. [2021-06-10 11:37:04,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1607 transitions. [2021-06-10 11:37:04,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:04,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1607 transitions. [2021-06-10 11:37:04,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.6666666666666) internal successors, (1607), 3 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,127 INFO L185 Difference]: Start difference. First operand has 577 places, 490 transitions, 1231 flow. Second operand 3 states and 1607 transitions. [2021-06-10 11:37:04,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 491 transitions, 1247 flow [2021-06-10 11:37:04,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 491 transitions, 1246 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:04,132 INFO L241 Difference]: Finished difference. Result has 579 places, 490 transitions, 1235 flow [2021-06-10 11:37:04,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1235, PETRI_PLACES=579, PETRI_TRANSITIONS=490} [2021-06-10 11:37:04,132 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 38 predicate places. [2021-06-10 11:37:04,132 INFO L480 AbstractCegarLoop]: Abstraction has has 579 places, 490 transitions, 1235 flow [2021-06-10 11:37:04,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,132 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:04,132 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:04,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2021-06-10 11:37:04,132 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 5093377, now seen corresponding path program 1 times [2021-06-10 11:37:04,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:04,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322177500] [2021-06-10 11:37:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:04,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:04,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:04,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322177500] [2021-06-10 11:37:04,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:04,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:04,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934777628] [2021-06-10 11:37:04,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:04,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:04,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:04,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 490 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:04,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:04,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:04,295 INFO L129 PetriNetUnfolder]: 12/603 cut-off events. [2021-06-10 11:37:04,296 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:04,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 603 events. 12/603 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2650 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 765. Up to 21 conditions per place. [2021-06-10 11:37:04,316 INFO L132 encePairwiseOnDemand]: 577/581 looper letters, 9 selfloop transitions, 3 changer transitions 0/491 dead transitions. [2021-06-10 11:37:04,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 491 transitions, 1261 flow [2021-06-10 11:37:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1597 transitions. [2021-06-10 11:37:04,318 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162363740676994 [2021-06-10 11:37:04,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1597 transitions. [2021-06-10 11:37:04,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1597 transitions. [2021-06-10 11:37:04,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:04,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1597 transitions. [2021-06-10 11:37:04,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 532.3333333333334) internal successors, (1597), 3 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,319 INFO L185 Difference]: Start difference. First operand has 579 places, 490 transitions, 1235 flow. Second operand 3 states and 1597 transitions. [2021-06-10 11:37:04,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 491 transitions, 1261 flow [2021-06-10 11:37:04,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 491 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:04,324 INFO L241 Difference]: Finished difference. Result has 582 places, 491 transitions, 1252 flow [2021-06-10 11:37:04,324 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=582, PETRI_TRANSITIONS=491} [2021-06-10 11:37:04,324 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 41 predicate places. [2021-06-10 11:37:04,324 INFO L480 AbstractCegarLoop]: Abstraction has has 582 places, 491 transitions, 1252 flow [2021-06-10 11:37:04,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:04,325 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:04,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2021-06-10 11:37:04,325 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash 4140065, now seen corresponding path program 1 times [2021-06-10 11:37:04,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:04,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058076916] [2021-06-10 11:37:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:04,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:04,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:04,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058076916] [2021-06-10 11:37:04,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:04,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:04,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332215664] [2021-06-10 11:37:04,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:04,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:04,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 581 [2021-06-10 11:37:04,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 491 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:04,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 581 [2021-06-10 11:37:04,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:04,476 INFO L129 PetriNetUnfolder]: 12/596 cut-off events. [2021-06-10 11:37:04,477 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:04,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 596 events. 12/596 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2586 event pairs, 0 based on Foata normal form. 1/566 useless extension candidates. Maximal degree in co-relation 751. Up to 21 conditions per place. [2021-06-10 11:37:04,497 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 5 selfloop transitions, 1 changer transitions 0/489 dead transitions. [2021-06-10 11:37:04,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 489 transitions, 1254 flow [2021-06-10 11:37:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1606 transitions. [2021-06-10 11:37:04,498 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9213998852553069 [2021-06-10 11:37:04,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1606 transitions. [2021-06-10 11:37:04,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1606 transitions. [2021-06-10 11:37:04,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:04,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1606 transitions. [2021-06-10 11:37:04,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 535.3333333333334) internal successors, (1606), 3 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,500 INFO L185 Difference]: Start difference. First operand has 582 places, 491 transitions, 1252 flow. Second operand 3 states and 1606 transitions. [2021-06-10 11:37:04,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 489 transitions, 1254 flow [2021-06-10 11:37:04,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 489 transitions, 1246 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:04,505 INFO L241 Difference]: Finished difference. Result has 582 places, 489 transitions, 1239 flow [2021-06-10 11:37:04,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=582, PETRI_TRANSITIONS=489} [2021-06-10 11:37:04,505 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 41 predicate places. [2021-06-10 11:37:04,505 INFO L480 AbstractCegarLoop]: Abstraction has has 582 places, 489 transitions, 1239 flow [2021-06-10 11:37:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 534.3333333333334) internal successors, (1603), 3 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:04,505 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:04,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2021-06-10 11:37:04,506 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash 4139042, now seen corresponding path program 1 times [2021-06-10 11:37:04,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:04,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259347855] [2021-06-10 11:37:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:04,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:04,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:04,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:04,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259347855] [2021-06-10 11:37:04,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:04,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:04,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622178008] [2021-06-10 11:37:04,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:04,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:04,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 528 out of 581 [2021-06-10 11:37:04,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 489 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:04,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 528 of 581 [2021-06-10 11:37:04,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:04,661 INFO L129 PetriNetUnfolder]: 12/594 cut-off events. [2021-06-10 11:37:04,662 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:04,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 594 events. 12/594 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2571 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 755. Up to 21 conditions per place. [2021-06-10 11:37:04,682 INFO L132 encePairwiseOnDemand]: 579/581 looper letters, 8 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2021-06-10 11:37:04,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 487 transitions, 1252 flow [2021-06-10 11:37:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2021-06-10 11:37:04,683 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145152036718301 [2021-06-10 11:37:04,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2021-06-10 11:37:04,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2021-06-10 11:37:04,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:04,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2021-06-10 11:37:04,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 581.0) internal successors, (2324), 4 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,685 INFO L185 Difference]: Start difference. First operand has 582 places, 489 transitions, 1239 flow. Second operand 3 states and 1594 transitions. [2021-06-10 11:37:04,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 487 transitions, 1252 flow [2021-06-10 11:37:04,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 487 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:04,689 INFO L241 Difference]: Finished difference. Result has 581 places, 487 transitions, 1235 flow [2021-06-10 11:37:04,690 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=581, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1235, PETRI_PLACES=581, PETRI_TRANSITIONS=487} [2021-06-10 11:37:04,690 INFO L343 CegarLoopForPetriNet]: 541 programPoint places, 40 predicate places. [2021-06-10 11:37:04,690 INFO L480 AbstractCegarLoop]: Abstraction has has 581 places, 487 transitions, 1235 flow [2021-06-10 11:37:04,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 530.3333333333334) internal successors, (1591), 3 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:04,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:04,690 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:04,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2021-06-10 11:37:04,690 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1793026216, now seen corresponding path program 1 times [2021-06-10 11:37:04,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:04,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659187223] [2021-06-10 11:37:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:04,699 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:04,704 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:04,714 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:37:04,714 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:37:04,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2021-06-10 11:37:04,714 WARN L342 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:37:04,715 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of21ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of21ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:04,836 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:37:04,836 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-06-10 11:37:04,836 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:37:04,836 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:37:04,836 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:37:04,836 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:37:04,836 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:37:04,836 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:37:04,836 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:37:04,836 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:37:04,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 567 places, 609 transitions, 1743 flow [2021-06-10 11:37:04,991 INFO L129 PetriNetUnfolder]: 106/797 cut-off events. [2021-06-10 11:37:04,991 INFO L130 PetriNetUnfolder]: For 1750/1750 co-relation queries the response was YES. [2021-06-10 11:37:05,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 797 events. 106/797 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3313 event pairs, 0 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 1021. Up to 44 conditions per place. [2021-06-10 11:37:05,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 567 places, 609 transitions, 1743 flow [2021-06-10 11:37:05,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 567 places, 609 transitions, 1743 flow [2021-06-10 11:37:05,038 INFO L129 PetriNetUnfolder]: 9/106 cut-off events. [2021-06-10 11:37:05,038 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:37:05,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,038 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-06-10 11:37:05,038 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1162480333, now seen corresponding path program 1 times [2021-06-10 11:37:05,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28929542] [2021-06-10 11:37:05,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:05,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:05,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28929542] [2021-06-10 11:37:05,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390539166] [2021-06-10 11:37:05,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:05,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 609 transitions, 1743 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:05,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:05,188 INFO L129 PetriNetUnfolder]: 62/631 cut-off events. [2021-06-10 11:37:05,189 INFO L130 PetriNetUnfolder]: For 1751/1751 co-relation queries the response was YES. [2021-06-10 11:37:05,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 631 events. 62/631 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2479 event pairs, 0 based on Foata normal form. 92/638 useless extension candidates. Maximal degree in co-relation 868. Up to 22 conditions per place. [2021-06-10 11:37:05,247 INFO L132 encePairwiseOnDemand]: 581/609 looper letters, 10 selfloop transitions, 3 changer transitions 0/563 dead transitions. [2021-06-10 11:37:05,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 563 transitions, 1677 flow [2021-06-10 11:37:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2021-06-10 11:37:05,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9430760810071155 [2021-06-10 11:37:05,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1723 transitions. [2021-06-10 11:37:05,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1723 transitions. [2021-06-10 11:37:05,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:05,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1723 transitions. [2021-06-10 11:37:05,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 574.3333333333334) internal successors, (1723), 3 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,250 INFO L185 Difference]: Start difference. First operand has 567 places, 609 transitions, 1743 flow. Second operand 3 states and 1723 transitions. [2021-06-10 11:37:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 563 transitions, 1677 flow [2021-06-10 11:37:05,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 563 transitions, 1257 flow, removed 210 selfloop flow, removed 0 redundant places. [2021-06-10 11:37:05,256 INFO L241 Difference]: Finished difference. Result has 545 places, 563 transitions, 1251 flow [2021-06-10 11:37:05,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1251, PETRI_PLACES=545, PETRI_TRANSITIONS=563} [2021-06-10 11:37:05,256 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -22 predicate places. [2021-06-10 11:37:05,256 INFO L480 AbstractCegarLoop]: Abstraction has has 545 places, 563 transitions, 1251 flow [2021-06-10 11:37:05,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,256 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-06-10 11:37:05,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2021-06-10 11:37:05,256 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1162479310, now seen corresponding path program 1 times [2021-06-10 11:37:05,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313293699] [2021-06-10 11:37:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:05,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,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-06-10 11:37:05,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313293699] [2021-06-10 11:37:05,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549348559] [2021-06-10 11:37:05,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:05,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 563 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:05,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:05,392 INFO L129 PetriNetUnfolder]: 60/632 cut-off events. [2021-06-10 11:37:05,392 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:05,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 632 events. 60/632 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2499 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 689. Up to 22 conditions per place. [2021-06-10 11:37:05,419 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/563 dead transitions. [2021-06-10 11:37:05,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 563 transitions, 1263 flow [2021-06-10 11:37:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:05,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:05,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:05,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,423 INFO L185 Difference]: Start difference. First operand has 545 places, 563 transitions, 1251 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:05,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 563 transitions, 1263 flow [2021-06-10 11:37:05,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 563 transitions, 1258 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:05,428 INFO L241 Difference]: Finished difference. Result has 547 places, 562 transitions, 1247 flow [2021-06-10 11:37:05,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1247, PETRI_PLACES=547, PETRI_TRANSITIONS=562} [2021-06-10 11:37:05,428 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -20 predicate places. [2021-06-10 11:37:05,428 INFO L480 AbstractCegarLoop]: Abstraction has has 547 places, 562 transitions, 1247 flow [2021-06-10 11:37:05,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,428 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-06-10 11:37:05,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2021-06-10 11:37:05,429 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1161525998, now seen corresponding path program 1 times [2021-06-10 11:37:05,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315613892] [2021-06-10 11:37:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:05,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:05,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315613892] [2021-06-10 11:37:05,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307089954] [2021-06-10 11:37:05,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:05,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 562 transitions, 1247 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:05,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:05,572 INFO L129 PetriNetUnfolder]: 60/626 cut-off events. [2021-06-10 11:37:05,573 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:05,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 626 events. 60/626 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2452 event pairs, 0 based on Foata normal form. 1/547 useless extension candidates. Maximal degree in co-relation 696. Up to 22 conditions per place. [2021-06-10 11:37:05,598 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 9 selfloop transitions, 1 changer transitions 0/560 dead transitions. [2021-06-10 11:37:05,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 560 transitions, 1257 flow [2021-06-10 11:37:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2021-06-10 11:37:05,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2021-06-10 11:37:05,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2021-06-10 11:37:05,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2021-06-10 11:37:05,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:05,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2021-06-10 11:37:05,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,601 INFO L185 Difference]: Start difference. First operand has 547 places, 562 transitions, 1247 flow. Second operand 3 states and 1674 transitions. [2021-06-10 11:37:05,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 560 transitions, 1257 flow [2021-06-10 11:37:05,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 560 transitions, 1256 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:05,606 INFO L241 Difference]: Finished difference. Result has 548 places, 560 transitions, 1238 flow [2021-06-10 11:37:05,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=548, PETRI_TRANSITIONS=560} [2021-06-10 11:37:05,606 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -19 predicate places. [2021-06-10 11:37:05,606 INFO L480 AbstractCegarLoop]: Abstraction has has 548 places, 560 transitions, 1238 flow [2021-06-10 11:37:05,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,607 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-06-10 11:37:05,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2021-06-10 11:37:05,607 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1161527021, now seen corresponding path program 1 times [2021-06-10 11:37:05,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520543218] [2021-06-10 11:37:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:05,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:05,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520543218] [2021-06-10 11:37:05,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312837281] [2021-06-10 11:37:05,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:05,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 560 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:05,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:05,746 INFO L129 PetriNetUnfolder]: 60/623 cut-off events. [2021-06-10 11:37:05,747 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:05,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 623 events. 60/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2434 event pairs, 0 based on Foata normal form. 1/544 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2021-06-10 11:37:05,772 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2021-06-10 11:37:05,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 558 transitions, 1244 flow [2021-06-10 11:37:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:05,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:05,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:05,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:05,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:05,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:05,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,775 INFO L185 Difference]: Start difference. First operand has 548 places, 560 transitions, 1238 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:05,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 558 transitions, 1244 flow [2021-06-10 11:37:05,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 558 transitions, 1239 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:05,780 INFO L241 Difference]: Finished difference. Result has 546 places, 558 transitions, 1232 flow [2021-06-10 11:37:05,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=546, PETRI_TRANSITIONS=558} [2021-06-10 11:37:05,780 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -21 predicate places. [2021-06-10 11:37:05,780 INFO L480 AbstractCegarLoop]: Abstraction has has 546 places, 558 transitions, 1232 flow [2021-06-10 11:37:05,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,781 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:05,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2021-06-10 11:37:05,781 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1906383869, now seen corresponding path program 1 times [2021-06-10 11:37:05,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226729953] [2021-06-10 11:37:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:05,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:05,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226729953] [2021-06-10 11:37:05,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766282720] [2021-06-10 11:37:05,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:05,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 558 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:05,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:05,920 INFO L129 PetriNetUnfolder]: 59/630 cut-off events. [2021-06-10 11:37:05,920 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:05,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 630 events. 59/630 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2494 event pairs, 0 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 698. Up to 22 conditions per place. [2021-06-10 11:37:05,947 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2021-06-10 11:37:05,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 559 transitions, 1248 flow [2021-06-10 11:37:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:05,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:05,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:05,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:05,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,950 INFO L185 Difference]: Start difference. First operand has 546 places, 558 transitions, 1232 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:05,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 559 transitions, 1248 flow [2021-06-10 11:37:05,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 559 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:05,954 INFO L241 Difference]: Finished difference. Result has 548 places, 558 transitions, 1236 flow [2021-06-10 11:37:05,955 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=548, PETRI_TRANSITIONS=558} [2021-06-10 11:37:05,955 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -19 predicate places. [2021-06-10 11:37:05,955 INFO L480 AbstractCegarLoop]: Abstraction has has 548 places, 558 transitions, 1236 flow [2021-06-10 11:37:05,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:05,955 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:05,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2021-06-10 11:37:05,955 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1906382846, now seen corresponding path program 1 times [2021-06-10 11:37:05,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:05,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488035025] [2021-06-10 11:37:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:05,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:05,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:05,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:05,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488035025] [2021-06-10 11:37:05,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:05,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:05,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415691403] [2021-06-10 11:37:05,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:05,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:05,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:05,983 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:05,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 558 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:05,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:05,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:05,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:06,119 INFO L129 PetriNetUnfolder]: 57/632 cut-off events. [2021-06-10 11:37:06,119 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:06,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 632 events. 57/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2522 event pairs, 0 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 707. Up to 22 conditions per place. [2021-06-10 11:37:06,147 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2021-06-10 11:37:06,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 559 transitions, 1262 flow [2021-06-10 11:37:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:06,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:06,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:06,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:06,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,150 INFO L185 Difference]: Start difference. First operand has 548 places, 558 transitions, 1236 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:06,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 559 transitions, 1262 flow [2021-06-10 11:37:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 559 transitions, 1261 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:06,155 INFO L241 Difference]: Finished difference. Result has 551 places, 559 transitions, 1253 flow [2021-06-10 11:37:06,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1253, PETRI_PLACES=551, PETRI_TRANSITIONS=559} [2021-06-10 11:37:06,155 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -16 predicate places. [2021-06-10 11:37:06,155 INFO L480 AbstractCegarLoop]: Abstraction has has 551 places, 559 transitions, 1253 flow [2021-06-10 11:37:06,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:06,156 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:06,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2021-06-10 11:37:06,156 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1907336158, now seen corresponding path program 1 times [2021-06-10 11:37:06,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:06,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317853963] [2021-06-10 11:37:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:06,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:06,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:06,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317853963] [2021-06-10 11:37:06,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:06,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:06,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656947170] [2021-06-10 11:37:06,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:06,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:06,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:06,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 559 transitions, 1253 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:06,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:06,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:06,297 INFO L129 PetriNetUnfolder]: 57/625 cut-off events. [2021-06-10 11:37:06,297 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:06,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 625 events. 57/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2466 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 693. Up to 22 conditions per place. [2021-06-10 11:37:06,324 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2021-06-10 11:37:06,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 557 transitions, 1255 flow [2021-06-10 11:37:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:06,325 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:06,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:06,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:06,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:06,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:06,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,327 INFO L185 Difference]: Start difference. First operand has 551 places, 559 transitions, 1253 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:06,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 557 transitions, 1255 flow [2021-06-10 11:37:06,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 557 transitions, 1247 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:06,332 INFO L241 Difference]: Finished difference. Result has 551 places, 557 transitions, 1240 flow [2021-06-10 11:37:06,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2021-06-10 11:37:06,332 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -16 predicate places. [2021-06-10 11:37:06,332 INFO L480 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1240 flow [2021-06-10 11:37:06,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,333 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:06,333 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:06,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2021-06-10 11:37:06,333 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1907337181, now seen corresponding path program 1 times [2021-06-10 11:37:06,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:06,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327831527] [2021-06-10 11:37:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:06,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:06,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:06,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327831527] [2021-06-10 11:37:06,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:06,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:06,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295810555] [2021-06-10 11:37:06,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:06,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:06,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:06,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:06,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:06,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:06,485 INFO L129 PetriNetUnfolder]: 57/623 cut-off events. [2021-06-10 11:37:06,485 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:06,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 623 events. 57/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2452 event pairs, 0 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 697. Up to 22 conditions per place. [2021-06-10 11:37:06,511 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2021-06-10 11:37:06,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 555 transitions, 1253 flow [2021-06-10 11:37:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:06,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:06,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:06,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:06,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:06,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:06,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,514 INFO L185 Difference]: Start difference. First operand has 551 places, 557 transitions, 1240 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:06,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 555 transitions, 1253 flow [2021-06-10 11:37:06,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 555 transitions, 1252 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:06,519 INFO L241 Difference]: Finished difference. Result has 550 places, 555 transitions, 1236 flow [2021-06-10 11:37:06,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=550, PETRI_TRANSITIONS=555} [2021-06-10 11:37:06,519 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -17 predicate places. [2021-06-10 11:37:06,519 INFO L480 AbstractCegarLoop]: Abstraction has has 550 places, 555 transitions, 1236 flow [2021-06-10 11:37:06,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,519 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:06,519 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:06,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2021-06-10 11:37:06,519 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1230730280, now seen corresponding path program 1 times [2021-06-10 11:37:06,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:06,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302877706] [2021-06-10 11:37:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:06,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:06,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:06,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302877706] [2021-06-10 11:37:06,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:06,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:06,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465534417] [2021-06-10 11:37:06,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:06,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:06,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:06,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 555 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:06,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:06,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:06,677 INFO L129 PetriNetUnfolder]: 55/628 cut-off events. [2021-06-10 11:37:06,678 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:06,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 628 events. 55/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2500 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 700. Up to 22 conditions per place. [2021-06-10 11:37:06,695 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2021-06-10 11:37:06,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1252 flow [2021-06-10 11:37:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:06,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:06,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:06,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:06,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:06,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:06,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,698 INFO L185 Difference]: Start difference. First operand has 550 places, 555 transitions, 1236 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:06,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1252 flow [2021-06-10 11:37:06,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:06,702 INFO L241 Difference]: Finished difference. Result has 553 places, 556 transitions, 1249 flow [2021-06-10 11:37:06,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1249, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2021-06-10 11:37:06,702 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -14 predicate places. [2021-06-10 11:37:06,702 INFO L480 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1249 flow [2021-06-10 11:37:06,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:06,703 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:06,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2021-06-10 11:37:06,703 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:06,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1230731303, now seen corresponding path program 1 times [2021-06-10 11:37:06,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:06,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736201345] [2021-06-10 11:37:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:06,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:06,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:06,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736201345] [2021-06-10 11:37:06,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:06,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:06,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593544578] [2021-06-10 11:37:06,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:06,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:06,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:06,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1249 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:06,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:06,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:06,848 INFO L129 PetriNetUnfolder]: 55/629 cut-off events. [2021-06-10 11:37:06,848 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:06,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 629 events. 55/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2507 event pairs, 0 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 708. Up to 22 conditions per place. [2021-06-10 11:37:06,874 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/557 dead transitions. [2021-06-10 11:37:06,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 557 transitions, 1275 flow [2021-06-10 11:37:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:06,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:06,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:06,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:06,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:06,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,877 INFO L185 Difference]: Start difference. First operand has 553 places, 556 transitions, 1249 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:06,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 557 transitions, 1275 flow [2021-06-10 11:37:06,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:06,882 INFO L241 Difference]: Finished difference. Result has 556 places, 557 transitions, 1265 flow [2021-06-10 11:37:06,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1265, PETRI_PLACES=556, PETRI_TRANSITIONS=557} [2021-06-10 11:37:06,882 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -11 predicate places. [2021-06-10 11:37:06,882 INFO L480 AbstractCegarLoop]: Abstraction has has 556 places, 557 transitions, 1265 flow [2021-06-10 11:37:06,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:06,883 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:06,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2021-06-10 11:37:06,883 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1229776968, now seen corresponding path program 1 times [2021-06-10 11:37:06,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:06,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474386785] [2021-06-10 11:37:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:06,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:06,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:06,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:06,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474386785] [2021-06-10 11:37:06,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:06,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:06,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434724373] [2021-06-10 11:37:06,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:06,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:06,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:06,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 557 transitions, 1265 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:06,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:06,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:06,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,029 INFO L129 PetriNetUnfolder]: 54/626 cut-off events. [2021-06-10 11:37:07,029 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:37:07,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 626 events. 54/626 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2492 event pairs, 0 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 707. Up to 22 conditions per place. [2021-06-10 11:37:07,055 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 9 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2021-06-10 11:37:07,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 555 transitions, 1273 flow [2021-06-10 11:37:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2021-06-10 11:37:07,056 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2021-06-10 11:37:07,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2021-06-10 11:37:07,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2021-06-10 11:37:07,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2021-06-10 11:37:07,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,058 INFO L185 Difference]: Start difference. First operand has 556 places, 557 transitions, 1265 flow. Second operand 3 states and 1674 transitions. [2021-06-10 11:37:07,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 555 transitions, 1273 flow [2021-06-10 11:37:07,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 555 transitions, 1272 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:07,062 INFO L241 Difference]: Finished difference. Result has 557 places, 555 transitions, 1254 flow [2021-06-10 11:37:07,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1254, PETRI_PLACES=557, PETRI_TRANSITIONS=555} [2021-06-10 11:37:07,063 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -10 predicate places. [2021-06-10 11:37:07,063 INFO L480 AbstractCegarLoop]: Abstraction has has 557 places, 555 transitions, 1254 flow [2021-06-10 11:37:07,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,063 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,063 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2021-06-10 11:37:07,063 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1229777991, now seen corresponding path program 1 times [2021-06-10 11:37:07,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050963798] [2021-06-10 11:37:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:07,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:07,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050963798] [2021-06-10 11:37:07,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177269838] [2021-06-10 11:37:07,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:07,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 555 transitions, 1254 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:07,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,209 INFO L129 PetriNetUnfolder]: 54/623 cut-off events. [2021-06-10 11:37:07,209 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:07,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 623 events. 54/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2466 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 701. Up to 22 conditions per place. [2021-06-10 11:37:07,235 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2021-06-10 11:37:07,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 552 transitions, 1255 flow [2021-06-10 11:37:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:07,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:07,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,238 INFO L185 Difference]: Start difference. First operand has 557 places, 555 transitions, 1254 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:07,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 552 transitions, 1255 flow [2021-06-10 11:37:07,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 552 transitions, 1250 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:07,242 INFO L241 Difference]: Finished difference. Result has 554 places, 552 transitions, 1240 flow [2021-06-10 11:37:07,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1240, PETRI_PLACES=554, PETRI_TRANSITIONS=552} [2021-06-10 11:37:07,244 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -13 predicate places. [2021-06-10 11:37:07,244 INFO L480 AbstractCegarLoop]: Abstraction has has 554 places, 552 transitions, 1240 flow [2021-06-10 11:37:07,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,244 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2021-06-10 11:37:07,245 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1398362480, now seen corresponding path program 1 times [2021-06-10 11:37:07,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925488657] [2021-06-10 11:37:07,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:07,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:07,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925488657] [2021-06-10 11:37:07,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073502903] [2021-06-10 11:37:07,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,258 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:07,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 552 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:07,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,387 INFO L129 PetriNetUnfolder]: 53/630 cut-off events. [2021-06-10 11:37:07,387 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:07,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 630 events. 53/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2529 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 711. Up to 22 conditions per place. [2021-06-10 11:37:07,413 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/553 dead transitions. [2021-06-10 11:37:07,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 553 transitions, 1256 flow [2021-06-10 11:37:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:07,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:07,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:07,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:07,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:07,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,416 INFO L185 Difference]: Start difference. First operand has 554 places, 552 transitions, 1240 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:07,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 553 transitions, 1256 flow [2021-06-10 11:37:07,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 553 transitions, 1255 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:07,421 INFO L241 Difference]: Finished difference. Result has 556 places, 552 transitions, 1244 flow [2021-06-10 11:37:07,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=556, PETRI_TRANSITIONS=552} [2021-06-10 11:37:07,421 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -11 predicate places. [2021-06-10 11:37:07,421 INFO L480 AbstractCegarLoop]: Abstraction has has 556 places, 552 transitions, 1244 flow [2021-06-10 11:37:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,422 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2021-06-10 11:37:07,422 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1398363503, now seen corresponding path program 1 times [2021-06-10 11:37:07,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182968765] [2021-06-10 11:37:07,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:07,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:07,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182968765] [2021-06-10 11:37:07,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508241469] [2021-06-10 11:37:07,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,435 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:07,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 552 transitions, 1244 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:07,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,570 INFO L129 PetriNetUnfolder]: 51/632 cut-off events. [2021-06-10 11:37:07,570 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:07,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 632 events. 51/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2562 event pairs, 0 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 720. Up to 22 conditions per place. [2021-06-10 11:37:07,596 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/553 dead transitions. [2021-06-10 11:37:07,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 553 transitions, 1270 flow [2021-06-10 11:37:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:07,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:07,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:07,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:07,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:07,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:07,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,599 INFO L185 Difference]: Start difference. First operand has 556 places, 552 transitions, 1244 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:07,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 553 transitions, 1270 flow [2021-06-10 11:37:07,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 553 transitions, 1269 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:07,604 INFO L241 Difference]: Finished difference. Result has 559 places, 553 transitions, 1261 flow [2021-06-10 11:37:07,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=559, PETRI_TRANSITIONS=553} [2021-06-10 11:37:07,604 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -8 predicate places. [2021-06-10 11:37:07,604 INFO L480 AbstractCegarLoop]: Abstraction has has 559 places, 553 transitions, 1261 flow [2021-06-10 11:37:07,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,605 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,605 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2021-06-10 11:37:07,605 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1397410191, now seen corresponding path program 1 times [2021-06-10 11:37:07,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992363200] [2021-06-10 11:37:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:07,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:07,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992363200] [2021-06-10 11:37:07,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585525873] [2021-06-10 11:37:07,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:07,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 553 transitions, 1261 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:07,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,745 INFO L129 PetriNetUnfolder]: 51/625 cut-off events. [2021-06-10 11:37:07,745 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:07,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 625 events. 51/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2505 event pairs, 0 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 706. Up to 22 conditions per place. [2021-06-10 11:37:07,770 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2021-06-10 11:37:07,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 551 transitions, 1263 flow [2021-06-10 11:37:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:07,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:07,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:07,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,772 INFO L185 Difference]: Start difference. First operand has 559 places, 553 transitions, 1261 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:07,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 551 transitions, 1263 flow [2021-06-10 11:37:07,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 551 transitions, 1255 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:07,777 INFO L241 Difference]: Finished difference. Result has 559 places, 551 transitions, 1248 flow [2021-06-10 11:37:07,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=559, PETRI_TRANSITIONS=551} [2021-06-10 11:37:07,777 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -8 predicate places. [2021-06-10 11:37:07,777 INFO L480 AbstractCegarLoop]: Abstraction has has 559 places, 551 transitions, 1248 flow [2021-06-10 11:37:07,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,778 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,778 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2021-06-10 11:37:07,778 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1397409168, now seen corresponding path program 1 times [2021-06-10 11:37:07,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693031053] [2021-06-10 11:37:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:07,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:07,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693031053] [2021-06-10 11:37:07,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514320452] [2021-06-10 11:37:07,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:07,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 551 transitions, 1248 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:07,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:07,929 INFO L129 PetriNetUnfolder]: 51/623 cut-off events. [2021-06-10 11:37:07,929 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:07,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 623 events. 51/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2490 event pairs, 0 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 710. Up to 22 conditions per place. [2021-06-10 11:37:07,953 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/549 dead transitions. [2021-06-10 11:37:07,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 549 transitions, 1261 flow [2021-06-10 11:37:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:07,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:07,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:07,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:07,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:07,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,956 INFO L185 Difference]: Start difference. First operand has 559 places, 551 transitions, 1248 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:07,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 549 transitions, 1261 flow [2021-06-10 11:37:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 549 transitions, 1260 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:07,961 INFO L241 Difference]: Finished difference. Result has 558 places, 549 transitions, 1244 flow [2021-06-10 11:37:07,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=558, PETRI_TRANSITIONS=549} [2021-06-10 11:37:07,961 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -9 predicate places. [2021-06-10 11:37:07,961 INFO L480 AbstractCegarLoop]: Abstraction has has 558 places, 549 transitions, 1244 flow [2021-06-10 11:37:07,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:07,962 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:07,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2021-06-10 11:37:07,962 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1914514888, now seen corresponding path program 1 times [2021-06-10 11:37:07,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:07,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449077550] [2021-06-10 11:37:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:07,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:07,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:07,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:07,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449077550] [2021-06-10 11:37:07,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:07,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:07,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819391054] [2021-06-10 11:37:07,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:07,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:07,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:07,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:07,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 549 transitions, 1244 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:07,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:07,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:07,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:08,116 INFO L129 PetriNetUnfolder]: 50/631 cut-off events. [2021-06-10 11:37:08,116 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:08,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 631 events. 50/631 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2559 event pairs, 0 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 722. Up to 22 conditions per place. [2021-06-10 11:37:08,138 INFO L132 encePairwiseOnDemand]: 604/609 looper letters, 10 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2021-06-10 11:37:08,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 551 transitions, 1274 flow [2021-06-10 11:37:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1677 transitions. [2021-06-10 11:37:08,141 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178981937602627 [2021-06-10 11:37:08,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:08,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,143 INFO L185 Difference]: Start difference. First operand has 558 places, 549 transitions, 1244 flow. Second operand 3 states and 1677 transitions. [2021-06-10 11:37:08,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 551 transitions, 1274 flow [2021-06-10 11:37:08,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 551 transitions, 1273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:08,148 INFO L241 Difference]: Finished difference. Result has 561 places, 551 transitions, 1267 flow [2021-06-10 11:37:08,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1267, PETRI_PLACES=561, PETRI_TRANSITIONS=551} [2021-06-10 11:37:08,148 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -6 predicate places. [2021-06-10 11:37:08,148 INFO L480 AbstractCegarLoop]: Abstraction has has 561 places, 551 transitions, 1267 flow [2021-06-10 11:37:08,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:08,148 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:08,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2021-06-10 11:37:08,148 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1914515911, now seen corresponding path program 1 times [2021-06-10 11:37:08,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:08,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71735311] [2021-06-10 11:37:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:08,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:08,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:08,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71735311] [2021-06-10 11:37:08,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:08,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:08,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632916956] [2021-06-10 11:37:08,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:08,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:08,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:08,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 551 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:08,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:08,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:08,306 INFO L129 PetriNetUnfolder]: 49/629 cut-off events. [2021-06-10 11:37:08,306 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:08,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 629 events. 49/629 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2543 event pairs, 0 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 719. Up to 22 conditions per place. [2021-06-10 11:37:08,330 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2021-06-10 11:37:08,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 551 transitions, 1279 flow [2021-06-10 11:37:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:08,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:08,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:08,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:08,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:08,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:08,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,333 INFO L185 Difference]: Start difference. First operand has 561 places, 551 transitions, 1267 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:08,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 551 transitions, 1279 flow [2021-06-10 11:37:08,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 551 transitions, 1274 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:08,338 INFO L241 Difference]: Finished difference. Result has 564 places, 551 transitions, 1272 flow [2021-06-10 11:37:08,338 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=564, PETRI_TRANSITIONS=551} [2021-06-10 11:37:08,338 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -3 predicate places. [2021-06-10 11:37:08,338 INFO L480 AbstractCegarLoop]: Abstraction has has 564 places, 551 transitions, 1272 flow [2021-06-10 11:37:08,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,338 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:08,339 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:08,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2021-06-10 11:37:08,339 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1915468200, now seen corresponding path program 1 times [2021-06-10 11:37:08,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:08,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303089232] [2021-06-10 11:37:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:08,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:08,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:08,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303089232] [2021-06-10 11:37:08,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:08,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:08,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628703338] [2021-06-10 11:37:08,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:08,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:08,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:08,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 551 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:08,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:08,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:08,479 INFO L129 PetriNetUnfolder]: 48/625 cut-off events. [2021-06-10 11:37:08,479 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:08,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 625 events. 48/625 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2519 event pairs, 0 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 716. Up to 22 conditions per place. [2021-06-10 11:37:08,503 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/548 dead transitions. [2021-06-10 11:37:08,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 548 transitions, 1269 flow [2021-06-10 11:37:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:08,504 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:08,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:08,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:08,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:08,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:08,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,506 INFO L185 Difference]: Start difference. First operand has 564 places, 551 transitions, 1272 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:08,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 548 transitions, 1269 flow [2021-06-10 11:37:08,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 548 transitions, 1262 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:08,510 INFO L241 Difference]: Finished difference. Result has 563 places, 548 transitions, 1252 flow [2021-06-10 11:37:08,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=563, PETRI_TRANSITIONS=548} [2021-06-10 11:37:08,511 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -4 predicate places. [2021-06-10 11:37:08,511 INFO L480 AbstractCegarLoop]: Abstraction has has 563 places, 548 transitions, 1252 flow [2021-06-10 11:37:08,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:08,511 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:08,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2021-06-10 11:37:08,511 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1915469223, now seen corresponding path program 1 times [2021-06-10 11:37:08,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:08,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869464146] [2021-06-10 11:37:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:08,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:08,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:08,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869464146] [2021-06-10 11:37:08,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:08,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:08,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951458911] [2021-06-10 11:37:08,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:08,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:08,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:08,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 548 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:08,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:08,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:08,652 INFO L129 PetriNetUnfolder]: 48/623 cut-off events. [2021-06-10 11:37:08,653 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:08,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 623 events. 48/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2503 event pairs, 0 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 717. Up to 22 conditions per place. [2021-06-10 11:37:08,676 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2021-06-10 11:37:08,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 546 transitions, 1265 flow [2021-06-10 11:37:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:08,677 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:08,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:08,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:08,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:08,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:08,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,679 INFO L185 Difference]: Start difference. First operand has 563 places, 548 transitions, 1252 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:08,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 546 transitions, 1265 flow [2021-06-10 11:37:08,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 546 transitions, 1264 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:08,684 INFO L241 Difference]: Finished difference. Result has 562 places, 546 transitions, 1248 flow [2021-06-10 11:37:08,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1248, PETRI_PLACES=562, PETRI_TRANSITIONS=546} [2021-06-10 11:37:08,684 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -5 predicate places. [2021-06-10 11:37:08,684 INFO L480 AbstractCegarLoop]: Abstraction has has 562 places, 546 transitions, 1248 flow [2021-06-10 11:37:08,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,685 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:08,685 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:08,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2021-06-10 11:37:08,685 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1152334593, now seen corresponding path program 1 times [2021-06-10 11:37:08,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:08,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623392615] [2021-06-10 11:37:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:08,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:08,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:08,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623392615] [2021-06-10 11:37:08,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:08,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:08,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181254233] [2021-06-10 11:37:08,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:08,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:08,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:08,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 546 transitions, 1248 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:08,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:08,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:08,839 INFO L129 PetriNetUnfolder]: 47/631 cut-off events. [2021-06-10 11:37:08,839 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:08,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 631 events. 47/631 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2576 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 729. Up to 22 conditions per place. [2021-06-10 11:37:08,863 INFO L132 encePairwiseOnDemand]: 604/609 looper letters, 10 selfloop transitions, 3 changer transitions 0/548 dead transitions. [2021-06-10 11:37:08,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 548 transitions, 1278 flow [2021-06-10 11:37:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1677 transitions. [2021-06-10 11:37:08,864 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9178981937602627 [2021-06-10 11:37:08,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:08,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1677 transitions. [2021-06-10 11:37:08,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,866 INFO L185 Difference]: Start difference. First operand has 562 places, 546 transitions, 1248 flow. Second operand 3 states and 1677 transitions. [2021-06-10 11:37:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 548 transitions, 1278 flow [2021-06-10 11:37:08,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 548 transitions, 1277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:08,871 INFO L241 Difference]: Finished difference. Result has 565 places, 548 transitions, 1271 flow [2021-06-10 11:37:08,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1271, PETRI_PLACES=565, PETRI_TRANSITIONS=548} [2021-06-10 11:37:08,871 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -2 predicate places. [2021-06-10 11:37:08,871 INFO L480 AbstractCegarLoop]: Abstraction has has 565 places, 548 transitions, 1271 flow [2021-06-10 11:37:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:08,872 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:08,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2021-06-10 11:37:08,872 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1152335616, now seen corresponding path program 1 times [2021-06-10 11:37:08,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:08,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660641581] [2021-06-10 11:37:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:08,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:08,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:08,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:08,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660641581] [2021-06-10 11:37:08,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:08,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:08,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155107987] [2021-06-10 11:37:08,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:08,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:08,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:08,885 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:08,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 548 transitions, 1271 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:08,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:08,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:08,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,016 INFO L129 PetriNetUnfolder]: 46/629 cut-off events. [2021-06-10 11:37:09,016 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:09,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 629 events. 46/629 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2565 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 726. Up to 22 conditions per place. [2021-06-10 11:37:09,040 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2021-06-10 11:37:09,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 548 transitions, 1283 flow [2021-06-10 11:37:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:09,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:09,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,043 INFO L185 Difference]: Start difference. First operand has 565 places, 548 transitions, 1271 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:09,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 548 transitions, 1283 flow [2021-06-10 11:37:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 548 transitions, 1278 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:09,048 INFO L241 Difference]: Finished difference. Result has 568 places, 548 transitions, 1276 flow [2021-06-10 11:37:09,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=568, PETRI_TRANSITIONS=548} [2021-06-10 11:37:09,048 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 1 predicate places. [2021-06-10 11:37:09,048 INFO L480 AbstractCegarLoop]: Abstraction has has 568 places, 548 transitions, 1276 flow [2021-06-10 11:37:09,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,049 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2021-06-10 11:37:09,049 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1153287905, now seen corresponding path program 1 times [2021-06-10 11:37:09,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826440032] [2021-06-10 11:37:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:09,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:09,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826440032] [2021-06-10 11:37:09,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154428563] [2021-06-10 11:37:09,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,062 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:09,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 548 transitions, 1276 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:09,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,192 INFO L129 PetriNetUnfolder]: 45/625 cut-off events. [2021-06-10 11:37:09,192 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:09,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 625 events. 45/625 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2538 event pairs, 0 based on Foata normal form. 1/561 useless extension candidates. Maximal degree in co-relation 723. Up to 22 conditions per place. [2021-06-10 11:37:09,217 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2021-06-10 11:37:09,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 545 transitions, 1273 flow [2021-06-10 11:37:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:09,218 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:09,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,220 INFO L185 Difference]: Start difference. First operand has 568 places, 548 transitions, 1276 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:09,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 545 transitions, 1273 flow [2021-06-10 11:37:09,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 545 transitions, 1266 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:09,224 INFO L241 Difference]: Finished difference. Result has 567 places, 545 transitions, 1256 flow [2021-06-10 11:37:09,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=567, PETRI_TRANSITIONS=545} [2021-06-10 11:37:09,225 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 0 predicate places. [2021-06-10 11:37:09,225 INFO L480 AbstractCegarLoop]: Abstraction has has 567 places, 545 transitions, 1256 flow [2021-06-10 11:37:09,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,225 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2021-06-10 11:37:09,225 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1153288928, now seen corresponding path program 1 times [2021-06-10 11:37:09,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055616023] [2021-06-10 11:37:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:09,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:09,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055616023] [2021-06-10 11:37:09,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364909438] [2021-06-10 11:37:09,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:09,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 545 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:09,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,371 INFO L129 PetriNetUnfolder]: 45/623 cut-off events. [2021-06-10 11:37:09,371 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:09,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 623 events. 45/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2521 event pairs, 0 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 724. Up to 22 conditions per place. [2021-06-10 11:37:09,395 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2021-06-10 11:37:09,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 543 transitions, 1269 flow [2021-06-10 11:37:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:09,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:09,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:09,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:09,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:09,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,422 INFO L185 Difference]: Start difference. First operand has 567 places, 545 transitions, 1256 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:09,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 543 transitions, 1269 flow [2021-06-10 11:37:09,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 543 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:09,426 INFO L241 Difference]: Finished difference. Result has 566 places, 543 transitions, 1252 flow [2021-06-10 11:37:09,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1252, PETRI_PLACES=566, PETRI_TRANSITIONS=543} [2021-06-10 11:37:09,426 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, -1 predicate places. [2021-06-10 11:37:09,426 INFO L480 AbstractCegarLoop]: Abstraction has has 566 places, 543 transitions, 1252 flow [2021-06-10 11:37:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,427 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2021-06-10 11:37:09,427 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1847215942, now seen corresponding path program 1 times [2021-06-10 11:37:09,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152819445] [2021-06-10 11:37:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:09,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:09,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152819445] [2021-06-10 11:37:09,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190173684] [2021-06-10 11:37:09,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:09,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 543 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:09,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,573 INFO L129 PetriNetUnfolder]: 43/628 cut-off events. [2021-06-10 11:37:09,573 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:09,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 628 events. 43/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2572 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 727. Up to 22 conditions per place. [2021-06-10 11:37:09,597 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2021-06-10 11:37:09,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 544 transitions, 1268 flow [2021-06-10 11:37:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:09,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:09,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:09,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,600 INFO L185 Difference]: Start difference. First operand has 566 places, 543 transitions, 1252 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 544 transitions, 1268 flow [2021-06-10 11:37:09,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 544 transitions, 1267 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:09,605 INFO L241 Difference]: Finished difference. Result has 569 places, 544 transitions, 1265 flow [2021-06-10 11:37:09,605 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1265, PETRI_PLACES=569, PETRI_TRANSITIONS=544} [2021-06-10 11:37:09,605 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 2 predicate places. [2021-06-10 11:37:09,605 INFO L480 AbstractCegarLoop]: Abstraction has has 569 places, 544 transitions, 1265 flow [2021-06-10 11:37:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,606 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2021-06-10 11:37:09,606 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1847216965, now seen corresponding path program 1 times [2021-06-10 11:37:09,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341871377] [2021-06-10 11:37:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:09,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:09,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341871377] [2021-06-10 11:37:09,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177531943] [2021-06-10 11:37:09,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:09,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 544 transitions, 1265 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:09,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,758 INFO L129 PetriNetUnfolder]: 43/629 cut-off events. [2021-06-10 11:37:09,758 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:09,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 629 events. 43/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2582 event pairs, 0 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 735. Up to 22 conditions per place. [2021-06-10 11:37:09,783 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2021-06-10 11:37:09,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 545 transitions, 1291 flow [2021-06-10 11:37:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:09,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:09,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:09,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:09,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:09,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:09,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,786 INFO L185 Difference]: Start difference. First operand has 569 places, 544 transitions, 1265 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:09,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 545 transitions, 1291 flow [2021-06-10 11:37:09,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 545 transitions, 1289 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:09,790 INFO L241 Difference]: Finished difference. Result has 572 places, 545 transitions, 1281 flow [2021-06-10 11:37:09,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1281, PETRI_PLACES=572, PETRI_TRANSITIONS=545} [2021-06-10 11:37:09,791 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 5 predicate places. [2021-06-10 11:37:09,791 INFO L480 AbstractCegarLoop]: Abstraction has has 572 places, 545 transitions, 1281 flow [2021-06-10 11:37:09,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,791 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2021-06-10 11:37:09,791 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1846263653, now seen corresponding path program 1 times [2021-06-10 11:37:09,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538282595] [2021-06-10 11:37:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:09,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:09,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538282595] [2021-06-10 11:37:09,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122802208] [2021-06-10 11:37:09,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:09,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 545 transitions, 1281 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:09,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:09,936 INFO L129 PetriNetUnfolder]: 42/625 cut-off events. [2021-06-10 11:37:09,936 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:09,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 625 events. 42/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2555 event pairs, 0 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 728. Up to 22 conditions per place. [2021-06-10 11:37:09,959 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2021-06-10 11:37:09,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 542 transitions, 1278 flow [2021-06-10 11:37:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:09,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:09,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:09,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:09,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,962 INFO L185 Difference]: Start difference. First operand has 572 places, 545 transitions, 1281 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 542 transitions, 1278 flow [2021-06-10 11:37:09,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 542 transitions, 1270 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:09,967 INFO L241 Difference]: Finished difference. Result has 571 places, 542 transitions, 1260 flow [2021-06-10 11:37:09,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=571, PETRI_TRANSITIONS=542} [2021-06-10 11:37:09,967 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 4 predicate places. [2021-06-10 11:37:09,967 INFO L480 AbstractCegarLoop]: Abstraction has has 571 places, 542 transitions, 1260 flow [2021-06-10 11:37:09,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:09,968 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:09,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2021-06-10 11:37:09,968 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1846262630, now seen corresponding path program 1 times [2021-06-10 11:37:09,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:09,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371660409] [2021-06-10 11:37:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:09,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:09,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:09,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:09,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371660409] [2021-06-10 11:37:09,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:09,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:09,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129385501] [2021-06-10 11:37:09,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:09,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:09,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:09,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:09,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 542 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:09,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:09,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:09,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:10,126 INFO L129 PetriNetUnfolder]: 42/623 cut-off events. [2021-06-10 11:37:10,126 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:10,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 623 events. 42/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2542 event pairs, 0 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 731. Up to 22 conditions per place. [2021-06-10 11:37:10,150 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/540 dead transitions. [2021-06-10 11:37:10,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 540 transitions, 1273 flow [2021-06-10 11:37:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:10,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:10,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:10,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:10,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:10,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:10,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,155 INFO L185 Difference]: Start difference. First operand has 571 places, 542 transitions, 1260 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:10,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 540 transitions, 1273 flow [2021-06-10 11:37:10,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 540 transitions, 1272 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:10,160 INFO L241 Difference]: Finished difference. Result has 570 places, 540 transitions, 1256 flow [2021-06-10 11:37:10,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=570, PETRI_TRANSITIONS=540} [2021-06-10 11:37:10,160 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 3 predicate places. [2021-06-10 11:37:10,160 INFO L480 AbstractCegarLoop]: Abstraction has has 570 places, 540 transitions, 1256 flow [2021-06-10 11:37:10,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:10,160 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:10,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2021-06-10 11:37:10,160 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -16890251, now seen corresponding path program 1 times [2021-06-10 11:37:10,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:10,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689251863] [2021-06-10 11:37:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:10,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:10,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:10,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689251863] [2021-06-10 11:37:10,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:10,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:10,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360856892] [2021-06-10 11:37:10,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:10,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:10,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:10,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 540 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:10,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:10,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:10,307 INFO L129 PetriNetUnfolder]: 40/628 cut-off events. [2021-06-10 11:37:10,308 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:10,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 628 events. 40/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2592 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 734. Up to 22 conditions per place. [2021-06-10 11:37:10,331 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2021-06-10 11:37:10,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 541 transitions, 1272 flow [2021-06-10 11:37:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:10,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:10,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:10,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:10,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:10,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:10,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,334 INFO L185 Difference]: Start difference. First operand has 570 places, 540 transitions, 1256 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:10,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 541 transitions, 1272 flow [2021-06-10 11:37:10,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 541 transitions, 1271 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:10,339 INFO L241 Difference]: Finished difference. Result has 573 places, 541 transitions, 1269 flow [2021-06-10 11:37:10,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1269, PETRI_PLACES=573, PETRI_TRANSITIONS=541} [2021-06-10 11:37:10,339 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 6 predicate places. [2021-06-10 11:37:10,339 INFO L480 AbstractCegarLoop]: Abstraction has has 573 places, 541 transitions, 1269 flow [2021-06-10 11:37:10,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:10,339 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:10,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2021-06-10 11:37:10,340 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash -16891274, now seen corresponding path program 1 times [2021-06-10 11:37:10,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:10,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092009393] [2021-06-10 11:37:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:10,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:10,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:10,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092009393] [2021-06-10 11:37:10,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:10,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:10,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047593368] [2021-06-10 11:37:10,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:10,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:10,353 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:10,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 541 transitions, 1269 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:10,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:10,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:10,493 INFO L129 PetriNetUnfolder]: 40/629 cut-off events. [2021-06-10 11:37:10,493 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:10,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 629 events. 40/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2598 event pairs, 0 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 742. Up to 22 conditions per place. [2021-06-10 11:37:10,517 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/542 dead transitions. [2021-06-10 11:37:10,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 542 transitions, 1295 flow [2021-06-10 11:37:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:10,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:10,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:10,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:10,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:10,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:10,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:10,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,520 INFO L185 Difference]: Start difference. First operand has 573 places, 541 transitions, 1269 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:10,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 542 transitions, 1295 flow [2021-06-10 11:37:10,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 542 transitions, 1293 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:10,525 INFO L241 Difference]: Finished difference. Result has 576 places, 542 transitions, 1285 flow [2021-06-10 11:37:10,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1285, PETRI_PLACES=576, PETRI_TRANSITIONS=542} [2021-06-10 11:37:10,525 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 9 predicate places. [2021-06-10 11:37:10,525 INFO L480 AbstractCegarLoop]: Abstraction has has 576 places, 542 transitions, 1285 flow [2021-06-10 11:37:10,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,525 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:10,525 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:10,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2021-06-10 11:37:10,526 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -15936939, now seen corresponding path program 1 times [2021-06-10 11:37:10,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:10,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324870079] [2021-06-10 11:37:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:10,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:10,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:10,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324870079] [2021-06-10 11:37:10,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:10,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:10,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373184162] [2021-06-10 11:37:10,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:10,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:10,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:10,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:10,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 542 transitions, 1285 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:10,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:10,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:10,696 INFO L129 PetriNetUnfolder]: 39/626 cut-off events. [2021-06-10 11:37:10,696 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:37:10,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 626 events. 39/626 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2580 event pairs, 0 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 741. Up to 22 conditions per place. [2021-06-10 11:37:10,721 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 9 selfloop transitions, 1 changer transitions 0/540 dead transitions. [2021-06-10 11:37:10,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 540 transitions, 1293 flow [2021-06-10 11:37:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2021-06-10 11:37:10,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2021-06-10 11:37:10,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2021-06-10 11:37:10,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2021-06-10 11:37:10,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:10,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2021-06-10 11:37:10,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,724 INFO L185 Difference]: Start difference. First operand has 576 places, 542 transitions, 1285 flow. Second operand 3 states and 1674 transitions. [2021-06-10 11:37:10,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 540 transitions, 1293 flow [2021-06-10 11:37:10,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 540 transitions, 1292 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:10,729 INFO L241 Difference]: Finished difference. Result has 577 places, 540 transitions, 1274 flow [2021-06-10 11:37:10,729 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=577, PETRI_TRANSITIONS=540} [2021-06-10 11:37:10,729 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 10 predicate places. [2021-06-10 11:37:10,729 INFO L480 AbstractCegarLoop]: Abstraction has has 577 places, 540 transitions, 1274 flow [2021-06-10 11:37:10,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:10,730 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:10,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2021-06-10 11:37:10,730 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -15937962, now seen corresponding path program 1 times [2021-06-10 11:37:10,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:10,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805162772] [2021-06-10 11:37:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:10,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:10,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:10,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805162772] [2021-06-10 11:37:10,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:10,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:10,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792176832] [2021-06-10 11:37:10,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:10,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:10,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:10,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 540 transitions, 1274 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:10,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:10,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:10,901 INFO L129 PetriNetUnfolder]: 39/623 cut-off events. [2021-06-10 11:37:10,901 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:10,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 623 events. 39/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2556 event pairs, 0 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 735. Up to 22 conditions per place. [2021-06-10 11:37:10,924 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/537 dead transitions. [2021-06-10 11:37:10,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 537 transitions, 1275 flow [2021-06-10 11:37:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:10,925 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:10,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:10,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:10,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:10,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:10,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,927 INFO L185 Difference]: Start difference. First operand has 577 places, 540 transitions, 1274 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:10,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 537 transitions, 1275 flow [2021-06-10 11:37:10,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 537 transitions, 1270 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:10,932 INFO L241 Difference]: Finished difference. Result has 574 places, 537 transitions, 1260 flow [2021-06-10 11:37:10,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=574, PETRI_TRANSITIONS=537} [2021-06-10 11:37:10,932 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 7 predicate places. [2021-06-10 11:37:10,932 INFO L480 AbstractCegarLoop]: Abstraction has has 574 places, 537 transitions, 1260 flow [2021-06-10 11:37:10,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:10,932 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:10,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2021-06-10 11:37:10,932 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash -910704238, now seen corresponding path program 1 times [2021-06-10 11:37:10,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:10,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750216045] [2021-06-10 11:37:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:10,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:10,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:10,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:10,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750216045] [2021-06-10 11:37:10,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:10,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:10,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518996131] [2021-06-10 11:37:10,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:10,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:10,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:10,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 537 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:10,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:10,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:10,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:11,088 INFO L129 PetriNetUnfolder]: 38/630 cut-off events. [2021-06-10 11:37:11,088 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:11,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 630 events. 38/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2618 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 745. Up to 22 conditions per place. [2021-06-10 11:37:11,113 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2021-06-10 11:37:11,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 538 transitions, 1276 flow [2021-06-10 11:37:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:11,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:11,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:11,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,116 INFO L185 Difference]: Start difference. First operand has 574 places, 537 transitions, 1260 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:11,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 538 transitions, 1276 flow [2021-06-10 11:37:11,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 538 transitions, 1275 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:11,121 INFO L241 Difference]: Finished difference. Result has 576 places, 537 transitions, 1264 flow [2021-06-10 11:37:11,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=576, PETRI_TRANSITIONS=537} [2021-06-10 11:37:11,121 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 9 predicate places. [2021-06-10 11:37:11,121 INFO L480 AbstractCegarLoop]: Abstraction has has 576 places, 537 transitions, 1264 flow [2021-06-10 11:37:11,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:11,121 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:11,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2021-06-10 11:37:11,122 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash -910703215, now seen corresponding path program 1 times [2021-06-10 11:37:11,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:11,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109536980] [2021-06-10 11:37:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:11,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:11,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:11,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109536980] [2021-06-10 11:37:11,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:11,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:11,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337352086] [2021-06-10 11:37:11,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:11,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:11,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:11,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 537 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:11,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:11,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:11,279 INFO L129 PetriNetUnfolder]: 36/632 cut-off events. [2021-06-10 11:37:11,280 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:11,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 632 events. 36/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2648 event pairs, 0 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 754. Up to 22 conditions per place. [2021-06-10 11:37:11,304 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/538 dead transitions. [2021-06-10 11:37:11,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 538 transitions, 1290 flow [2021-06-10 11:37:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:11,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:11,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:11,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:11,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:11,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:11,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:11,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,307 INFO L185 Difference]: Start difference. First operand has 576 places, 537 transitions, 1264 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:11,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 538 transitions, 1290 flow [2021-06-10 11:37:11,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 538 transitions, 1289 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:11,312 INFO L241 Difference]: Finished difference. Result has 579 places, 538 transitions, 1281 flow [2021-06-10 11:37:11,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1281, PETRI_PLACES=579, PETRI_TRANSITIONS=538} [2021-06-10 11:37:11,312 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 12 predicate places. [2021-06-10 11:37:11,312 INFO L480 AbstractCegarLoop]: Abstraction has has 579 places, 538 transitions, 1281 flow [2021-06-10 11:37:11,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:11,313 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:11,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2021-06-10 11:37:11,313 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash -911656527, now seen corresponding path program 1 times [2021-06-10 11:37:11,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:11,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584411322] [2021-06-10 11:37:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:11,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:11,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:11,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584411322] [2021-06-10 11:37:11,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:11,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:11,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316063017] [2021-06-10 11:37:11,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:11,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:11,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:11,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 538 transitions, 1281 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:11,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:11,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:11,466 INFO L129 PetriNetUnfolder]: 36/625 cut-off events. [2021-06-10 11:37:11,467 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:11,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 625 events. 36/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2589 event pairs, 0 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 740. Up to 22 conditions per place. [2021-06-10 11:37:11,490 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2021-06-10 11:37:11,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 536 transitions, 1283 flow [2021-06-10 11:37:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:11,491 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:11,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:11,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:11,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:11,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:11,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,493 INFO L185 Difference]: Start difference. First operand has 579 places, 538 transitions, 1281 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:11,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 536 transitions, 1283 flow [2021-06-10 11:37:11,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 536 transitions, 1275 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:11,498 INFO L241 Difference]: Finished difference. Result has 579 places, 536 transitions, 1268 flow [2021-06-10 11:37:11,498 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=579, PETRI_TRANSITIONS=536} [2021-06-10 11:37:11,498 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 12 predicate places. [2021-06-10 11:37:11,498 INFO L480 AbstractCegarLoop]: Abstraction has has 579 places, 536 transitions, 1268 flow [2021-06-10 11:37:11,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:11,498 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:11,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2021-06-10 11:37:11,498 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -911657550, now seen corresponding path program 1 times [2021-06-10 11:37:11,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:11,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47448301] [2021-06-10 11:37:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:11,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:11,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:11,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47448301] [2021-06-10 11:37:11,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:11,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:11,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268049020] [2021-06-10 11:37:11,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:11,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:11,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:11,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 536 transitions, 1268 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:11,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:11,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:11,661 INFO L129 PetriNetUnfolder]: 36/623 cut-off events. [2021-06-10 11:37:11,662 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:11,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 623 events. 36/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2572 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 744. Up to 22 conditions per place. [2021-06-10 11:37:11,685 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/534 dead transitions. [2021-06-10 11:37:11,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 534 transitions, 1281 flow [2021-06-10 11:37:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:11,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:11,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:11,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:11,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:11,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:11,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,689 INFO L185 Difference]: Start difference. First operand has 579 places, 536 transitions, 1268 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:11,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 534 transitions, 1281 flow [2021-06-10 11:37:11,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 534 transitions, 1280 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:11,693 INFO L241 Difference]: Finished difference. Result has 578 places, 534 transitions, 1264 flow [2021-06-10 11:37:11,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=578, PETRI_TRANSITIONS=534} [2021-06-10 11:37:11,694 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 11 predicate places. [2021-06-10 11:37:11,694 INFO L480 AbstractCegarLoop]: Abstraction has has 578 places, 534 transitions, 1264 flow [2021-06-10 11:37:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:11,694 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:11,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2021-06-10 11:37:11,694 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 733410798, now seen corresponding path program 1 times [2021-06-10 11:37:11,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:11,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996528350] [2021-06-10 11:37:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:11,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:11,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:11,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996528350] [2021-06-10 11:37:11,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:11,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:11,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705050957] [2021-06-10 11:37:11,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:11,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:11,709 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:11,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 534 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:11,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:11,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:11,845 INFO L129 PetriNetUnfolder]: 34/628 cut-off events. [2021-06-10 11:37:11,846 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:11,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 628 events. 34/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2625 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 747. Up to 22 conditions per place. [2021-06-10 11:37:11,869 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2021-06-10 11:37:11,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 535 transitions, 1280 flow [2021-06-10 11:37:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:11,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:11,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:11,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:11,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,872 INFO L185 Difference]: Start difference. First operand has 578 places, 534 transitions, 1264 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:11,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 535 transitions, 1280 flow [2021-06-10 11:37:11,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 535 transitions, 1279 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:11,876 INFO L241 Difference]: Finished difference. Result has 581 places, 535 transitions, 1277 flow [2021-06-10 11:37:11,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1277, PETRI_PLACES=581, PETRI_TRANSITIONS=535} [2021-06-10 11:37:11,877 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 14 predicate places. [2021-06-10 11:37:11,877 INFO L480 AbstractCegarLoop]: Abstraction has has 581 places, 535 transitions, 1277 flow [2021-06-10 11:37:11,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:11,877 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:11,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2021-06-10 11:37:11,877 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash 733409775, now seen corresponding path program 1 times [2021-06-10 11:37:11,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:11,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312158287] [2021-06-10 11:37:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:11,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:11,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:11,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:11,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312158287] [2021-06-10 11:37:11,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:11,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:11,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693639558] [2021-06-10 11:37:11,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:11,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:11,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:11,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 535 transitions, 1277 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:11,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:11,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:11,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:12,038 INFO L129 PetriNetUnfolder]: 34/629 cut-off events. [2021-06-10 11:37:12,038 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:12,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 629 events. 34/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2632 event pairs, 0 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 755. Up to 22 conditions per place. [2021-06-10 11:37:12,062 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2021-06-10 11:37:12,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 536 transitions, 1303 flow [2021-06-10 11:37:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:12,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:12,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:12,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:12,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,064 INFO L185 Difference]: Start difference. First operand has 581 places, 535 transitions, 1277 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:12,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 536 transitions, 1303 flow [2021-06-10 11:37:12,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 536 transitions, 1301 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:12,069 INFO L241 Difference]: Finished difference. Result has 584 places, 536 transitions, 1293 flow [2021-06-10 11:37:12,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=536} [2021-06-10 11:37:12,070 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 17 predicate places. [2021-06-10 11:37:12,070 INFO L480 AbstractCegarLoop]: Abstraction has has 584 places, 536 transitions, 1293 flow [2021-06-10 11:37:12,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:12,070 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:12,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2021-06-10 11:37:12,070 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 734363087, now seen corresponding path program 1 times [2021-06-10 11:37:12,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:12,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356645652] [2021-06-10 11:37:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:12,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:12,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:12,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356645652] [2021-06-10 11:37:12,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:12,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:12,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056563703] [2021-06-10 11:37:12,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:12,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:12,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:12,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 536 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:12,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:12,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:12,226 INFO L129 PetriNetUnfolder]: 33/625 cut-off events. [2021-06-10 11:37:12,226 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:12,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 625 events. 33/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2608 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 748. Up to 22 conditions per place. [2021-06-10 11:37:12,246 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/533 dead transitions. [2021-06-10 11:37:12,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 533 transitions, 1290 flow [2021-06-10 11:37:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:12,247 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:12,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:12,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:12,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:12,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:12,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,249 INFO L185 Difference]: Start difference. First operand has 584 places, 536 transitions, 1293 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:12,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 533 transitions, 1290 flow [2021-06-10 11:37:12,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 533 transitions, 1282 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:12,254 INFO L241 Difference]: Finished difference. Result has 583 places, 533 transitions, 1272 flow [2021-06-10 11:37:12,254 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=583, PETRI_TRANSITIONS=533} [2021-06-10 11:37:12,254 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 16 predicate places. [2021-06-10 11:37:12,254 INFO L480 AbstractCegarLoop]: Abstraction has has 583 places, 533 transitions, 1272 flow [2021-06-10 11:37:12,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,254 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:12,254 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:12,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2021-06-10 11:37:12,254 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 734364110, now seen corresponding path program 1 times [2021-06-10 11:37:12,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:12,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221544125] [2021-06-10 11:37:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:12,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:12,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:12,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221544125] [2021-06-10 11:37:12,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:12,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:12,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135531430] [2021-06-10 11:37:12,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:12,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:12,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:12,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 533 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:12,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:12,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:12,409 INFO L129 PetriNetUnfolder]: 33/623 cut-off events. [2021-06-10 11:37:12,409 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:12,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 623 events. 33/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2590 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 751. Up to 22 conditions per place. [2021-06-10 11:37:12,432 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/531 dead transitions. [2021-06-10 11:37:12,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 531 transitions, 1285 flow [2021-06-10 11:37:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:12,433 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:12,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:12,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:12,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:12,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:12,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,435 INFO L185 Difference]: Start difference. First operand has 583 places, 533 transitions, 1272 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:12,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 531 transitions, 1285 flow [2021-06-10 11:37:12,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 531 transitions, 1284 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:12,440 INFO L241 Difference]: Finished difference. Result has 582 places, 531 transitions, 1268 flow [2021-06-10 11:37:12,440 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=582, PETRI_TRANSITIONS=531} [2021-06-10 11:37:12,440 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 15 predicate places. [2021-06-10 11:37:12,440 INFO L480 AbstractCegarLoop]: Abstraction has has 582 places, 531 transitions, 1268 flow [2021-06-10 11:37:12,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:12,441 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:12,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2021-06-10 11:37:12,441 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2132161139, now seen corresponding path program 1 times [2021-06-10 11:37:12,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:12,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006303411] [2021-06-10 11:37:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:12,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:12,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:12,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006303411] [2021-06-10 11:37:12,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:12,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:12,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385962304] [2021-06-10 11:37:12,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:12,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:12,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:12,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 531 transitions, 1268 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:12,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:12,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:12,596 INFO L129 PetriNetUnfolder]: 32/630 cut-off events. [2021-06-10 11:37:12,596 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:12,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 630 events. 32/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2653 event pairs, 0 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 756. Up to 22 conditions per place. [2021-06-10 11:37:12,620 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/532 dead transitions. [2021-06-10 11:37:12,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 532 transitions, 1284 flow [2021-06-10 11:37:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:12,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:12,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:12,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:12,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:12,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:12,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,624 INFO L185 Difference]: Start difference. First operand has 582 places, 531 transitions, 1268 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:12,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 532 transitions, 1284 flow [2021-06-10 11:37:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 532 transitions, 1283 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:12,629 INFO L241 Difference]: Finished difference. Result has 584 places, 531 transitions, 1272 flow [2021-06-10 11:37:12,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=584, PETRI_TRANSITIONS=531} [2021-06-10 11:37:12,630 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 17 predicate places. [2021-06-10 11:37:12,630 INFO L480 AbstractCegarLoop]: Abstraction has has 584 places, 531 transitions, 1272 flow [2021-06-10 11:37:12,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:12,630 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:12,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2021-06-10 11:37:12,630 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2132160116, now seen corresponding path program 1 times [2021-06-10 11:37:12,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:12,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624507732] [2021-06-10 11:37:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:12,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:12,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:12,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624507732] [2021-06-10 11:37:12,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:12,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:12,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434985227] [2021-06-10 11:37:12,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:12,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:12,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:12,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 531 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:12,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:12,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:12,821 INFO L129 PetriNetUnfolder]: 30/632 cut-off events. [2021-06-10 11:37:12,821 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:12,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 632 events. 30/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2682 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 767. Up to 22 conditions per place. [2021-06-10 11:37:12,844 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/532 dead transitions. [2021-06-10 11:37:12,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 532 transitions, 1298 flow [2021-06-10 11:37:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:12,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:12,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:12,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:12,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:12,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,847 INFO L185 Difference]: Start difference. First operand has 584 places, 531 transitions, 1272 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:12,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 532 transitions, 1298 flow [2021-06-10 11:37:12,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 532 transitions, 1297 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:12,852 INFO L241 Difference]: Finished difference. Result has 587 places, 532 transitions, 1289 flow [2021-06-10 11:37:12,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=587, PETRI_TRANSITIONS=532} [2021-06-10 11:37:12,853 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 20 predicate places. [2021-06-10 11:37:12,853 INFO L480 AbstractCegarLoop]: Abstraction has has 587 places, 532 transitions, 1289 flow [2021-06-10 11:37:12,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:12,853 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:12,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2021-06-10 11:37:12,853 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2133113428, now seen corresponding path program 1 times [2021-06-10 11:37:12,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:12,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946649812] [2021-06-10 11:37:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:12,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:12,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:12,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:12,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946649812] [2021-06-10 11:37:12,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:12,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:12,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969829983] [2021-06-10 11:37:12,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:12,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:12,867 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:12,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 532 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:12,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:12,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:12,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,009 INFO L129 PetriNetUnfolder]: 30/625 cut-off events. [2021-06-10 11:37:13,010 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:13,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 625 events. 30/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2625 event pairs, 0 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 753. Up to 22 conditions per place. [2021-06-10 11:37:13,035 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/530 dead transitions. [2021-06-10 11:37:13,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 530 transitions, 1291 flow [2021-06-10 11:37:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:13,036 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:13,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:13,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:13,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:13,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:13,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,038 INFO L185 Difference]: Start difference. First operand has 587 places, 532 transitions, 1289 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 530 transitions, 1291 flow [2021-06-10 11:37:13,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 530 transitions, 1283 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:13,043 INFO L241 Difference]: Finished difference. Result has 587 places, 530 transitions, 1276 flow [2021-06-10 11:37:13,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=587, PETRI_TRANSITIONS=530} [2021-06-10 11:37:13,043 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 20 predicate places. [2021-06-10 11:37:13,043 INFO L480 AbstractCegarLoop]: Abstraction has has 587 places, 530 transitions, 1276 flow [2021-06-10 11:37:13,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,044 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:13,044 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:13,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2021-06-10 11:37:13,044 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2133114451, now seen corresponding path program 1 times [2021-06-10 11:37:13,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:13,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710527207] [2021-06-10 11:37:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:13,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:13,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:13,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710527207] [2021-06-10 11:37:13,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:13,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:13,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743457408] [2021-06-10 11:37:13,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:13,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:13,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:13,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 530 transitions, 1276 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:13,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:13,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,206 INFO L129 PetriNetUnfolder]: 30/623 cut-off events. [2021-06-10 11:37:13,206 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:13,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 623 events. 30/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2609 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 757. Up to 22 conditions per place. [2021-06-10 11:37:13,230 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/528 dead transitions. [2021-06-10 11:37:13,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 528 transitions, 1289 flow [2021-06-10 11:37:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:13,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:13,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:13,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:13,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:13,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:13,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,233 INFO L185 Difference]: Start difference. First operand has 587 places, 530 transitions, 1276 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:13,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 528 transitions, 1289 flow [2021-06-10 11:37:13,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 528 transitions, 1288 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:13,238 INFO L241 Difference]: Finished difference. Result has 586 places, 528 transitions, 1272 flow [2021-06-10 11:37:13,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=586, PETRI_TRANSITIONS=528} [2021-06-10 11:37:13,238 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 19 predicate places. [2021-06-10 11:37:13,238 INFO L480 AbstractCegarLoop]: Abstraction has has 586 places, 528 transitions, 1272 flow [2021-06-10 11:37:13,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:13,239 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:13,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2021-06-10 11:37:13,239 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:13,239 INFO L82 PathProgramCache]: Analyzing trace with hash -964301205, now seen corresponding path program 1 times [2021-06-10 11:37:13,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:13,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757438276] [2021-06-10 11:37:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:13,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:13,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:13,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757438276] [2021-06-10 11:37:13,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:13,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:13,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746824613] [2021-06-10 11:37:13,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:13,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:13,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:13,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 528 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:13,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:13,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,400 INFO L129 PetriNetUnfolder]: 28/628 cut-off events. [2021-06-10 11:37:13,401 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:13,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 628 events. 28/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2661 event pairs, 0 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 760. Up to 22 conditions per place. [2021-06-10 11:37:13,426 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2021-06-10 11:37:13,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 529 transitions, 1288 flow [2021-06-10 11:37:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:13,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:13,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:13,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:13,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:13,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:13,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,429 INFO L185 Difference]: Start difference. First operand has 586 places, 528 transitions, 1272 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:13,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 529 transitions, 1288 flow [2021-06-10 11:37:13,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 529 transitions, 1287 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:13,434 INFO L241 Difference]: Finished difference. Result has 589 places, 529 transitions, 1285 flow [2021-06-10 11:37:13,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1285, PETRI_PLACES=589, PETRI_TRANSITIONS=529} [2021-06-10 11:37:13,434 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 22 predicate places. [2021-06-10 11:37:13,434 INFO L480 AbstractCegarLoop]: Abstraction has has 589 places, 529 transitions, 1285 flow [2021-06-10 11:37:13,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:13,435 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:13,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2021-06-10 11:37:13,435 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash -964302228, now seen corresponding path program 1 times [2021-06-10 11:37:13,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:13,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542224704] [2021-06-10 11:37:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:13,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:13,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:13,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542224704] [2021-06-10 11:37:13,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:13,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:13,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926496373] [2021-06-10 11:37:13,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:13,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:13,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:13,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 529 transitions, 1285 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:13,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:13,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,603 INFO L129 PetriNetUnfolder]: 28/629 cut-off events. [2021-06-10 11:37:13,603 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:13,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 629 events. 28/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2666 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 768. Up to 22 conditions per place. [2021-06-10 11:37:13,622 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/530 dead transitions. [2021-06-10 11:37:13,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 530 transitions, 1311 flow [2021-06-10 11:37:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:13,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:13,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:13,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:13,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:13,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:13,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:13,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,625 INFO L185 Difference]: Start difference. First operand has 589 places, 529 transitions, 1285 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:13,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 530 transitions, 1311 flow [2021-06-10 11:37:13,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 530 transitions, 1309 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:13,630 INFO L241 Difference]: Finished difference. Result has 592 places, 530 transitions, 1301 flow [2021-06-10 11:37:13,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=592, PETRI_TRANSITIONS=530} [2021-06-10 11:37:13,630 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 25 predicate places. [2021-06-10 11:37:13,630 INFO L480 AbstractCegarLoop]: Abstraction has has 592 places, 530 transitions, 1301 flow [2021-06-10 11:37:13,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:13,630 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:13,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2021-06-10 11:37:13,630 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -963347893, now seen corresponding path program 1 times [2021-06-10 11:37:13,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:13,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284064123] [2021-06-10 11:37:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:13,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:13,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:13,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284064123] [2021-06-10 11:37:13,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:13,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:13,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797931408] [2021-06-10 11:37:13,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:13,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:13,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:13,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 530 transitions, 1301 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:13,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:13,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,794 INFO L129 PetriNetUnfolder]: 27/626 cut-off events. [2021-06-10 11:37:13,795 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:37:13,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 626 events. 27/626 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2652 event pairs, 0 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 767. Up to 22 conditions per place. [2021-06-10 11:37:13,817 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 9 selfloop transitions, 1 changer transitions 0/528 dead transitions. [2021-06-10 11:37:13,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 528 transitions, 1309 flow [2021-06-10 11:37:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1674 transitions. [2021-06-10 11:37:13,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916256157635468 [2021-06-10 11:37:13,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1674 transitions. [2021-06-10 11:37:13,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1674 transitions. [2021-06-10 11:37:13,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:13,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1674 transitions. [2021-06-10 11:37:13,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.0) internal successors, (1674), 3 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,820 INFO L185 Difference]: Start difference. First operand has 592 places, 530 transitions, 1301 flow. Second operand 3 states and 1674 transitions. [2021-06-10 11:37:13,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 528 transitions, 1309 flow [2021-06-10 11:37:13,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 528 transitions, 1308 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:13,825 INFO L241 Difference]: Finished difference. Result has 593 places, 528 transitions, 1290 flow [2021-06-10 11:37:13,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=593, PETRI_TRANSITIONS=528} [2021-06-10 11:37:13,826 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 26 predicate places. [2021-06-10 11:37:13,826 INFO L480 AbstractCegarLoop]: Abstraction has has 593 places, 528 transitions, 1290 flow [2021-06-10 11:37:13,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,826 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:13,826 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:13,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2021-06-10 11:37:13,826 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:13,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash -963348916, now seen corresponding path program 1 times [2021-06-10 11:37:13,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:13,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766480884] [2021-06-10 11:37:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:13,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:13,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:13,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:13,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766480884] [2021-06-10 11:37:13,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:13,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:13,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928710049] [2021-06-10 11:37:13,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:13,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:13,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:13,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 528 transitions, 1290 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:13,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:13,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:13,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:13,980 INFO L129 PetriNetUnfolder]: 27/623 cut-off events. [2021-06-10 11:37:13,980 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:14,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 623 events. 27/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2626 event pairs, 0 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 761. Up to 22 conditions per place. [2021-06-10 11:37:14,003 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/525 dead transitions. [2021-06-10 11:37:14,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 525 transitions, 1291 flow [2021-06-10 11:37:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:14,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:14,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,006 INFO L185 Difference]: Start difference. First operand has 593 places, 528 transitions, 1290 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:14,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 525 transitions, 1291 flow [2021-06-10 11:37:14,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 525 transitions, 1286 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:14,011 INFO L241 Difference]: Finished difference. Result has 590 places, 525 transitions, 1276 flow [2021-06-10 11:37:14,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=590, PETRI_TRANSITIONS=525} [2021-06-10 11:37:14,011 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 23 predicate places. [2021-06-10 11:37:14,011 INFO L480 AbstractCegarLoop]: Abstraction has has 590 places, 525 transitions, 1276 flow [2021-06-10 11:37:14,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,011 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2021-06-10 11:37:14,012 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1312181132, now seen corresponding path program 1 times [2021-06-10 11:37:14,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238549037] [2021-06-10 11:37:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:14,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:14,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238549037] [2021-06-10 11:37:14,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302096421] [2021-06-10 11:37:14,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,026 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:14,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 525 transitions, 1276 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:14,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:14,170 INFO L129 PetriNetUnfolder]: 26/630 cut-off events. [2021-06-10 11:37:14,170 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:14,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 630 events. 26/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2688 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 771. Up to 22 conditions per place. [2021-06-10 11:37:14,193 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/526 dead transitions. [2021-06-10 11:37:14,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 526 transitions, 1292 flow [2021-06-10 11:37:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:14,194 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:14,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,196 INFO L185 Difference]: Start difference. First operand has 590 places, 525 transitions, 1276 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:14,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 526 transitions, 1292 flow [2021-06-10 11:37:14,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 526 transitions, 1291 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:14,200 INFO L241 Difference]: Finished difference. Result has 592 places, 525 transitions, 1280 flow [2021-06-10 11:37:14,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=592, PETRI_TRANSITIONS=525} [2021-06-10 11:37:14,201 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 25 predicate places. [2021-06-10 11:37:14,201 INFO L480 AbstractCegarLoop]: Abstraction has has 592 places, 525 transitions, 1280 flow [2021-06-10 11:37:14,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,201 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2021-06-10 11:37:14,201 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1312182155, now seen corresponding path program 1 times [2021-06-10 11:37:14,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753786113] [2021-06-10 11:37:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:14,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:14,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753786113] [2021-06-10 11:37:14,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471745815] [2021-06-10 11:37:14,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:14,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 525 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:14,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:14,367 INFO L129 PetriNetUnfolder]: 24/632 cut-off events. [2021-06-10 11:37:14,367 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:14,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 632 events. 24/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2721 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 780. Up to 22 conditions per place. [2021-06-10 11:37:14,390 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/526 dead transitions. [2021-06-10 11:37:14,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 526 transitions, 1306 flow [2021-06-10 11:37:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:14,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:14,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:14,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:14,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:14,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:14,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,393 INFO L185 Difference]: Start difference. First operand has 592 places, 525 transitions, 1280 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 526 transitions, 1306 flow [2021-06-10 11:37:14,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 526 transitions, 1305 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:14,398 INFO L241 Difference]: Finished difference. Result has 595 places, 526 transitions, 1297 flow [2021-06-10 11:37:14,398 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=595, PETRI_TRANSITIONS=526} [2021-06-10 11:37:14,398 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 28 predicate places. [2021-06-10 11:37:14,398 INFO L480 AbstractCegarLoop]: Abstraction has has 595 places, 526 transitions, 1297 flow [2021-06-10 11:37:14,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,399 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,399 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2021-06-10 11:37:14,399 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1311228843, now seen corresponding path program 1 times [2021-06-10 11:37:14,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263877286] [2021-06-10 11:37:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:14,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:14,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263877286] [2021-06-10 11:37:14,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726473299] [2021-06-10 11:37:14,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:14,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 526 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:14,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:14,556 INFO L129 PetriNetUnfolder]: 24/625 cut-off events. [2021-06-10 11:37:14,556 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:14,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 625 events. 24/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2660 event pairs, 0 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 766. Up to 22 conditions per place. [2021-06-10 11:37:14,580 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/524 dead transitions. [2021-06-10 11:37:14,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 524 transitions, 1299 flow [2021-06-10 11:37:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:14,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:14,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:14,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,583 INFO L185 Difference]: Start difference. First operand has 595 places, 526 transitions, 1297 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 524 transitions, 1299 flow [2021-06-10 11:37:14,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 524 transitions, 1291 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:14,588 INFO L241 Difference]: Finished difference. Result has 595 places, 524 transitions, 1284 flow [2021-06-10 11:37:14,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=595, PETRI_TRANSITIONS=524} [2021-06-10 11:37:14,588 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 28 predicate places. [2021-06-10 11:37:14,588 INFO L480 AbstractCegarLoop]: Abstraction has has 595 places, 524 transitions, 1284 flow [2021-06-10 11:37:14,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,588 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2021-06-10 11:37:14,588 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1311227820, now seen corresponding path program 1 times [2021-06-10 11:37:14,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801859763] [2021-06-10 11:37:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:14,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:14,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801859763] [2021-06-10 11:37:14,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241399119] [2021-06-10 11:37:14,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:14,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 524 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:14,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:14,749 INFO L129 PetriNetUnfolder]: 24/623 cut-off events. [2021-06-10 11:37:14,749 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:14,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 623 events. 24/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2644 event pairs, 0 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 770. Up to 22 conditions per place. [2021-06-10 11:37:14,772 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/522 dead transitions. [2021-06-10 11:37:14,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 522 transitions, 1297 flow [2021-06-10 11:37:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:14,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:14,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:14,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:14,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:14,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,775 INFO L185 Difference]: Start difference. First operand has 595 places, 524 transitions, 1284 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:14,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 522 transitions, 1297 flow [2021-06-10 11:37:14,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 522 transitions, 1296 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:14,780 INFO L241 Difference]: Finished difference. Result has 594 places, 522 transitions, 1280 flow [2021-06-10 11:37:14,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=594, PETRI_TRANSITIONS=522} [2021-06-10 11:37:14,780 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 27 predicate places. [2021-06-10 11:37:14,780 INFO L480 AbstractCegarLoop]: Abstraction has has 594 places, 522 transitions, 1280 flow [2021-06-10 11:37:14,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,780 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2021-06-10 11:37:14,780 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1665012685, now seen corresponding path program 1 times [2021-06-10 11:37:14,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584699167] [2021-06-10 11:37:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:14,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:14,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584699167] [2021-06-10 11:37:14,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447645406] [2021-06-10 11:37:14,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:14,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 522 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:14,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:14,955 INFO L129 PetriNetUnfolder]: 23/630 cut-off events. [2021-06-10 11:37:14,955 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:14,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 630 events. 23/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2702 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 775. Up to 22 conditions per place. [2021-06-10 11:37:14,975 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/523 dead transitions. [2021-06-10 11:37:14,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 523 transitions, 1296 flow [2021-06-10 11:37:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:14,976 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:14,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:14,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:14,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,978 INFO L185 Difference]: Start difference. First operand has 594 places, 522 transitions, 1280 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:14,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 523 transitions, 1296 flow [2021-06-10 11:37:14,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 523 transitions, 1295 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:14,983 INFO L241 Difference]: Finished difference. Result has 596 places, 522 transitions, 1284 flow [2021-06-10 11:37:14,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=596, PETRI_TRANSITIONS=522} [2021-06-10 11:37:14,983 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 29 predicate places. [2021-06-10 11:37:14,983 INFO L480 AbstractCegarLoop]: Abstraction has has 596 places, 522 transitions, 1284 flow [2021-06-10 11:37:14,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:14,983 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:14,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2021-06-10 11:37:14,983 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1665013708, now seen corresponding path program 1 times [2021-06-10 11:37:14,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:14,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876436502] [2021-06-10 11:37:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:14,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:14,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:14,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:14,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876436502] [2021-06-10 11:37:14,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:14,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:14,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991098743] [2021-06-10 11:37:14,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:14,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:14,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:14,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:14,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 522 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:14,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:14,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:14,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:15,151 INFO L129 PetriNetUnfolder]: 21/632 cut-off events. [2021-06-10 11:37:15,151 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:15,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 632 events. 21/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2736 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 786. Up to 22 conditions per place. [2021-06-10 11:37:15,175 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/523 dead transitions. [2021-06-10 11:37:15,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 523 transitions, 1310 flow [2021-06-10 11:37:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:15,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:15,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:15,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:15,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,178 INFO L185 Difference]: Start difference. First operand has 596 places, 522 transitions, 1284 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:15,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 523 transitions, 1310 flow [2021-06-10 11:37:15,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 523 transitions, 1309 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:15,182 INFO L241 Difference]: Finished difference. Result has 599 places, 523 transitions, 1301 flow [2021-06-10 11:37:15,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=599, PETRI_TRANSITIONS=523} [2021-06-10 11:37:15,183 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 32 predicate places. [2021-06-10 11:37:15,183 INFO L480 AbstractCegarLoop]: Abstraction has has 599 places, 523 transitions, 1301 flow [2021-06-10 11:37:15,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,183 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:15,183 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:15,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2021-06-10 11:37:15,183 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1664060396, now seen corresponding path program 1 times [2021-06-10 11:37:15,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:15,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911026519] [2021-06-10 11:37:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:15,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:15,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:15,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911026519] [2021-06-10 11:37:15,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:15,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:15,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257511804] [2021-06-10 11:37:15,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:15,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:15,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:15,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:15,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:15,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 523 transitions, 1301 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:15,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:15,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:15,355 INFO L129 PetriNetUnfolder]: 21/625 cut-off events. [2021-06-10 11:37:15,355 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:15,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 625 events. 21/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2679 event pairs, 0 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 772. Up to 22 conditions per place. [2021-06-10 11:37:15,377 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/521 dead transitions. [2021-06-10 11:37:15,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 521 transitions, 1303 flow [2021-06-10 11:37:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:15,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:15,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:15,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:15,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:15,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:15,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,380 INFO L185 Difference]: Start difference. First operand has 599 places, 523 transitions, 1301 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:15,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 521 transitions, 1303 flow [2021-06-10 11:37:15,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 521 transitions, 1295 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:15,385 INFO L241 Difference]: Finished difference. Result has 599 places, 521 transitions, 1288 flow [2021-06-10 11:37:15,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=599, PETRI_TRANSITIONS=521} [2021-06-10 11:37:15,386 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 32 predicate places. [2021-06-10 11:37:15,386 INFO L480 AbstractCegarLoop]: Abstraction has has 599 places, 521 transitions, 1288 flow [2021-06-10 11:37:15,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,386 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:15,386 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:15,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2021-06-10 11:37:15,386 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1664059373, now seen corresponding path program 1 times [2021-06-10 11:37:15,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:15,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907661312] [2021-06-10 11:37:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:15,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:15,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907661312] [2021-06-10 11:37:15,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:15,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:15,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471315227] [2021-06-10 11:37:15,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:15,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:15,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:15,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 521 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:15,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:15,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:15,548 INFO L129 PetriNetUnfolder]: 21/623 cut-off events. [2021-06-10 11:37:15,548 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:15,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 623 events. 21/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2661 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 776. Up to 22 conditions per place. [2021-06-10 11:37:15,570 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/519 dead transitions. [2021-06-10 11:37:15,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 519 transitions, 1301 flow [2021-06-10 11:37:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:15,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:15,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:15,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:15,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:15,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:15,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,573 INFO L185 Difference]: Start difference. First operand has 599 places, 521 transitions, 1288 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:15,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 519 transitions, 1301 flow [2021-06-10 11:37:15,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 519 transitions, 1300 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:15,578 INFO L241 Difference]: Finished difference. Result has 598 places, 519 transitions, 1284 flow [2021-06-10 11:37:15,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1284, PETRI_PLACES=598, PETRI_TRANSITIONS=519} [2021-06-10 11:37:15,579 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 31 predicate places. [2021-06-10 11:37:15,579 INFO L480 AbstractCegarLoop]: Abstraction has has 598 places, 519 transitions, 1284 flow [2021-06-10 11:37:15,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:15,579 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:15,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2021-06-10 11:37:15,579 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1389646991, now seen corresponding path program 1 times [2021-06-10 11:37:15,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:15,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711223506] [2021-06-10 11:37:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:15,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:15,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:15,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711223506] [2021-06-10 11:37:15,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:15,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:15,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579539215] [2021-06-10 11:37:15,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:15,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:15,594 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:15,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 519 transitions, 1284 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:15,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:15,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:15,742 INFO L129 PetriNetUnfolder]: 20/630 cut-off events. [2021-06-10 11:37:15,743 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:15,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 630 events. 20/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2722 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 781. Up to 22 conditions per place. [2021-06-10 11:37:15,766 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/520 dead transitions. [2021-06-10 11:37:15,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 520 transitions, 1300 flow [2021-06-10 11:37:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:15,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:15,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:15,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:15,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:15,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:15,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,769 INFO L185 Difference]: Start difference. First operand has 598 places, 519 transitions, 1284 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:15,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 520 transitions, 1300 flow [2021-06-10 11:37:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 520 transitions, 1299 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:15,774 INFO L241 Difference]: Finished difference. Result has 600 places, 519 transitions, 1288 flow [2021-06-10 11:37:15,774 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=600, PETRI_TRANSITIONS=519} [2021-06-10 11:37:15,774 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 33 predicate places. [2021-06-10 11:37:15,774 INFO L480 AbstractCegarLoop]: Abstraction has has 600 places, 519 transitions, 1288 flow [2021-06-10 11:37:15,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:15,774 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:15,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2021-06-10 11:37:15,774 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1389648014, now seen corresponding path program 1 times [2021-06-10 11:37:15,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:15,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155004506] [2021-06-10 11:37:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:15,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:15,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:15,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155004506] [2021-06-10 11:37:15,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:15,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:15,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330717972] [2021-06-10 11:37:15,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:15,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:15,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:15,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 519 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:15,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:15,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:15,950 INFO L129 PetriNetUnfolder]: 18/632 cut-off events. [2021-06-10 11:37:15,950 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:15,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 632 events. 18/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2751 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 792. Up to 22 conditions per place. [2021-06-10 11:37:15,973 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/520 dead transitions. [2021-06-10 11:37:15,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 520 transitions, 1314 flow [2021-06-10 11:37:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:15,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:15,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:15,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:15,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:15,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,976 INFO L185 Difference]: Start difference. First operand has 600 places, 519 transitions, 1288 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:15,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 520 transitions, 1314 flow [2021-06-10 11:37:15,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 520 transitions, 1313 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:15,981 INFO L241 Difference]: Finished difference. Result has 603 places, 520 transitions, 1305 flow [2021-06-10 11:37:15,981 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=603, PETRI_TRANSITIONS=520} [2021-06-10 11:37:15,981 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 36 predicate places. [2021-06-10 11:37:15,981 INFO L480 AbstractCegarLoop]: Abstraction has has 603 places, 520 transitions, 1305 flow [2021-06-10 11:37:15,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:15,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:15,981 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:15,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2021-06-10 11:37:15,982 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1388694702, now seen corresponding path program 1 times [2021-06-10 11:37:15,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:15,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868475087] [2021-06-10 11:37:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:15,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:15,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:15,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:15,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868475087] [2021-06-10 11:37:15,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:15,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:15,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943903213] [2021-06-10 11:37:16,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:16,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:16,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:16,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:16,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 520 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:16,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:16,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:16,150 INFO L129 PetriNetUnfolder]: 18/625 cut-off events. [2021-06-10 11:37:16,150 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:16,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 625 events. 18/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2692 event pairs, 0 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 778. Up to 22 conditions per place. [2021-06-10 11:37:16,173 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2021-06-10 11:37:16,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 518 transitions, 1307 flow [2021-06-10 11:37:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:16,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:16,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:16,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,176 INFO L185 Difference]: Start difference. First operand has 603 places, 520 transitions, 1305 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 518 transitions, 1307 flow [2021-06-10 11:37:16,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 518 transitions, 1299 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:16,181 INFO L241 Difference]: Finished difference. Result has 603 places, 518 transitions, 1292 flow [2021-06-10 11:37:16,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=603, PETRI_TRANSITIONS=518} [2021-06-10 11:37:16,181 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 36 predicate places. [2021-06-10 11:37:16,182 INFO L480 AbstractCegarLoop]: Abstraction has has 603 places, 518 transitions, 1292 flow [2021-06-10 11:37:16,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:16,182 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:16,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2021-06-10 11:37:16,182 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1388693679, now seen corresponding path program 1 times [2021-06-10 11:37:16,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:16,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095895329] [2021-06-10 11:37:16,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:16,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:16,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:16,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095895329] [2021-06-10 11:37:16,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:16,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:16,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27004779] [2021-06-10 11:37:16,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:16,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:16,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:16,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 518 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:16,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:16,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:16,354 INFO L129 PetriNetUnfolder]: 18/623 cut-off events. [2021-06-10 11:37:16,354 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:16,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 623 events. 18/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2682 event pairs, 0 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 782. Up to 22 conditions per place. [2021-06-10 11:37:16,376 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/516 dead transitions. [2021-06-10 11:37:16,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 516 transitions, 1305 flow [2021-06-10 11:37:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:16,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:16,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:16,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:16,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:16,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:16,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,379 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,379 INFO L185 Difference]: Start difference. First operand has 603 places, 518 transitions, 1292 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:16,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 516 transitions, 1305 flow [2021-06-10 11:37:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 516 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:16,384 INFO L241 Difference]: Finished difference. Result has 602 places, 516 transitions, 1288 flow [2021-06-10 11:37:16,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1288, PETRI_PLACES=602, PETRI_TRANSITIONS=516} [2021-06-10 11:37:16,384 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 35 predicate places. [2021-06-10 11:37:16,384 INFO L480 AbstractCegarLoop]: Abstraction has has 602 places, 516 transitions, 1288 flow [2021-06-10 11:37:16,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:16,385 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:16,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2021-06-10 11:37:16,385 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 195418450, now seen corresponding path program 1 times [2021-06-10 11:37:16,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:16,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359689922] [2021-06-10 11:37:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:16,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:16,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:16,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359689922] [2021-06-10 11:37:16,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:16,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:16,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745136616] [2021-06-10 11:37:16,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:16,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:16,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:16,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:16,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 516 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:16,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:16,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:16,551 INFO L129 PetriNetUnfolder]: 17/630 cut-off events. [2021-06-10 11:37:16,551 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:16,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 630 events. 17/630 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2739 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 787. Up to 22 conditions per place. [2021-06-10 11:37:16,574 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 6 selfloop transitions, 1 changer transitions 0/517 dead transitions. [2021-06-10 11:37:16,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 517 transitions, 1304 flow [2021-06-10 11:37:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:16,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:16,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:16,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:16,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:16,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:16,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,577 INFO L185 Difference]: Start difference. First operand has 602 places, 516 transitions, 1288 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:16,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 517 transitions, 1304 flow [2021-06-10 11:37:16,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 517 transitions, 1303 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:16,582 INFO L241 Difference]: Finished difference. Result has 604 places, 516 transitions, 1292 flow [2021-06-10 11:37:16,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=604, PETRI_TRANSITIONS=516} [2021-06-10 11:37:16,582 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 37 predicate places. [2021-06-10 11:37:16,582 INFO L480 AbstractCegarLoop]: Abstraction has has 604 places, 516 transitions, 1292 flow [2021-06-10 11:37:16,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:16,583 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:16,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2021-06-10 11:37:16,583 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 195419473, now seen corresponding path program 1 times [2021-06-10 11:37:16,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:16,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837962319] [2021-06-10 11:37:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:16,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:16,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:16,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837962319] [2021-06-10 11:37:16,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:16,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:16,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177054319] [2021-06-10 11:37:16,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:16,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:16,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:16,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 516 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:16,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:16,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:16,757 INFO L129 PetriNetUnfolder]: 15/632 cut-off events. [2021-06-10 11:37:16,758 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:16,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 632 events. 15/632 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2770 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 798. Up to 22 conditions per place. [2021-06-10 11:37:16,782 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2021-06-10 11:37:16,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 517 transitions, 1318 flow [2021-06-10 11:37:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:16,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:16,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:16,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:16,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:16,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:16,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:16,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,785 INFO L185 Difference]: Start difference. First operand has 604 places, 516 transitions, 1292 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:16,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 517 transitions, 1318 flow [2021-06-10 11:37:16,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 517 transitions, 1317 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:16,791 INFO L241 Difference]: Finished difference. Result has 607 places, 517 transitions, 1309 flow [2021-06-10 11:37:16,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=607, PETRI_TRANSITIONS=517} [2021-06-10 11:37:16,791 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 40 predicate places. [2021-06-10 11:37:16,791 INFO L480 AbstractCegarLoop]: Abstraction has has 607 places, 517 transitions, 1309 flow [2021-06-10 11:37:16,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:16,791 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:16,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2021-06-10 11:37:16,791 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 194466161, now seen corresponding path program 1 times [2021-06-10 11:37:16,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:16,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304877846] [2021-06-10 11:37:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:16,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:16,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:16,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:16,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304877846] [2021-06-10 11:37:16,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:16,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:16,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118341271] [2021-06-10 11:37:16,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:16,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:16,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:16,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 517 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:16,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:16,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:16,962 INFO L129 PetriNetUnfolder]: 15/625 cut-off events. [2021-06-10 11:37:16,962 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:16,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 625 events. 15/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2712 event pairs, 0 based on Foata normal form. 1/591 useless extension candidates. Maximal degree in co-relation 784. Up to 22 conditions per place. [2021-06-10 11:37:16,985 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/515 dead transitions. [2021-06-10 11:37:16,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 515 transitions, 1311 flow [2021-06-10 11:37:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:16,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:16,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:16,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:16,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,988 INFO L185 Difference]: Start difference. First operand has 607 places, 517 transitions, 1309 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:16,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 515 transitions, 1311 flow [2021-06-10 11:37:16,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 515 transitions, 1303 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:16,994 INFO L241 Difference]: Finished difference. Result has 607 places, 515 transitions, 1296 flow [2021-06-10 11:37:16,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1296, PETRI_PLACES=607, PETRI_TRANSITIONS=515} [2021-06-10 11:37:16,994 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 40 predicate places. [2021-06-10 11:37:16,994 INFO L480 AbstractCegarLoop]: Abstraction has has 607 places, 515 transitions, 1296 flow [2021-06-10 11:37:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:16,994 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:16,994 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:16,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2021-06-10 11:37:16,994 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 194465138, now seen corresponding path program 1 times [2021-06-10 11:37:16,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:16,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746003118] [2021-06-10 11:37:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:17,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:17,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:17,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746003118] [2021-06-10 11:37:17,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:17,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:17,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084578720] [2021-06-10 11:37:17,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:17,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:17,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:17,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:17,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 515 transitions, 1296 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:17,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:17,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:17,164 INFO L129 PetriNetUnfolder]: 15/623 cut-off events. [2021-06-10 11:37:17,164 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:17,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 623 events. 15/623 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2695 event pairs, 0 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 788. Up to 22 conditions per place. [2021-06-10 11:37:17,186 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/513 dead transitions. [2021-06-10 11:37:17,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 513 transitions, 1309 flow [2021-06-10 11:37:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:17,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:17,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:17,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:17,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:17,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:17,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,189 INFO L185 Difference]: Start difference. First operand has 607 places, 515 transitions, 1296 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:17,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 513 transitions, 1309 flow [2021-06-10 11:37:17,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 513 transitions, 1308 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:17,194 INFO L241 Difference]: Finished difference. Result has 606 places, 513 transitions, 1292 flow [2021-06-10 11:37:17,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=606, PETRI_TRANSITIONS=513} [2021-06-10 11:37:17,194 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 39 predicate places. [2021-06-10 11:37:17,194 INFO L480 AbstractCegarLoop]: Abstraction has has 606 places, 513 transitions, 1292 flow [2021-06-10 11:37:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:17,195 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:17,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2021-06-10 11:37:17,195 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1512503115, now seen corresponding path program 1 times [2021-06-10 11:37:17,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:17,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374753733] [2021-06-10 11:37:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:17,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:17,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:17,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374753733] [2021-06-10 11:37:17,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:17,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:17,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137585714] [2021-06-10 11:37:17,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:17,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:17,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:17,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 513 transitions, 1292 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:17,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:17,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:17,360 INFO L129 PetriNetUnfolder]: 13/628 cut-off events. [2021-06-10 11:37:17,361 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:17,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 628 events. 13/628 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2746 event pairs, 0 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 791. Up to 22 conditions per place. [2021-06-10 11:37:17,383 INFO L132 encePairwiseOnDemand]: 606/609 looper letters, 5 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2021-06-10 11:37:17,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 514 transitions, 1308 flow [2021-06-10 11:37:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1685 transitions. [2021-06-10 11:37:17,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222769567597153 [2021-06-10 11:37:17,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1685 transitions. [2021-06-10 11:37:17,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1685 transitions. [2021-06-10 11:37:17,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:17,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1685 transitions. [2021-06-10 11:37:17,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.6666666666666) internal successors, (1685), 3 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,386 INFO L185 Difference]: Start difference. First operand has 606 places, 513 transitions, 1292 flow. Second operand 3 states and 1685 transitions. [2021-06-10 11:37:17,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 514 transitions, 1308 flow [2021-06-10 11:37:17,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 514 transitions, 1307 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:17,391 INFO L241 Difference]: Finished difference. Result has 609 places, 514 transitions, 1305 flow [2021-06-10 11:37:17,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=609, PETRI_TRANSITIONS=514} [2021-06-10 11:37:17,391 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 42 predicate places. [2021-06-10 11:37:17,391 INFO L480 AbstractCegarLoop]: Abstraction has has 609 places, 514 transitions, 1305 flow [2021-06-10 11:37:17,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,392 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:17,392 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:17,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2021-06-10 11:37:17,392 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1512504138, now seen corresponding path program 1 times [2021-06-10 11:37:17,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:17,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192789290] [2021-06-10 11:37:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:17,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:17,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:17,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192789290] [2021-06-10 11:37:17,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:17,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:17,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613025127] [2021-06-10 11:37:17,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:17,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:17,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:17,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 514 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:17,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:17,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:17,590 INFO L129 PetriNetUnfolder]: 13/629 cut-off events. [2021-06-10 11:37:17,590 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:17,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 629 events. 13/629 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2754 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2021-06-10 11:37:17,605 INFO L132 encePairwiseOnDemand]: 605/609 looper letters, 9 selfloop transitions, 3 changer transitions 0/515 dead transitions. [2021-06-10 11:37:17,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 515 transitions, 1331 flow [2021-06-10 11:37:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1675 transitions. [2021-06-10 11:37:17,606 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9168035030103996 [2021-06-10 11:37:17,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1675 transitions. [2021-06-10 11:37:17,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1675 transitions. [2021-06-10 11:37:17,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:17,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1675 transitions. [2021-06-10 11:37:17,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.3333333333334) internal successors, (1675), 3 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-06-10 11:37:17,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,608 INFO L185 Difference]: Start difference. First operand has 609 places, 514 transitions, 1305 flow. Second operand 3 states and 1675 transitions. [2021-06-10 11:37:17,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 515 transitions, 1331 flow [2021-06-10 11:37:17,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 515 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:17,613 INFO L241 Difference]: Finished difference. Result has 612 places, 515 transitions, 1321 flow [2021-06-10 11:37:17,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=612, PETRI_TRANSITIONS=515} [2021-06-10 11:37:17,613 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 45 predicate places. [2021-06-10 11:37:17,613 INFO L480 AbstractCegarLoop]: Abstraction has has 612 places, 515 transitions, 1321 flow [2021-06-10 11:37:17,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:17,613 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:17,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2021-06-10 11:37:17,614 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1511550826, now seen corresponding path program 1 times [2021-06-10 11:37:17,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:17,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824081142] [2021-06-10 11:37:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:17,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:17,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:17,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824081142] [2021-06-10 11:37:17,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:17,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:17,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499368099] [2021-06-10 11:37:17,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:17,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:17,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 609 [2021-06-10 11:37:17,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 515 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:17,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 609 [2021-06-10 11:37:17,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:17,779 INFO L129 PetriNetUnfolder]: 12/625 cut-off events. [2021-06-10 11:37:17,779 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:17,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 625 events. 12/625 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2729 event pairs, 0 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 792. Up to 22 conditions per place. [2021-06-10 11:37:17,801 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 5 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2021-06-10 11:37:17,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 512 transitions, 1318 flow [2021-06-10 11:37:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1684 transitions. [2021-06-10 11:37:17,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217296113847838 [2021-06-10 11:37:17,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1684 transitions. [2021-06-10 11:37:17,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1684 transitions. [2021-06-10 11:37:17,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:17,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1684 transitions. [2021-06-10 11:37:17,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.3333333333334) internal successors, (1684), 3 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,804 INFO L185 Difference]: Start difference. First operand has 612 places, 515 transitions, 1321 flow. Second operand 3 states and 1684 transitions. [2021-06-10 11:37:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 512 transitions, 1318 flow [2021-06-10 11:37:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 512 transitions, 1310 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:17,809 INFO L241 Difference]: Finished difference. Result has 611 places, 512 transitions, 1300 flow [2021-06-10 11:37:17,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=611, PETRI_TRANSITIONS=512} [2021-06-10 11:37:17,810 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 44 predicate places. [2021-06-10 11:37:17,810 INFO L480 AbstractCegarLoop]: Abstraction has has 611 places, 512 transitions, 1300 flow [2021-06-10 11:37:17,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:17,810 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:17,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2021-06-10 11:37:17,810 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1511549803, now seen corresponding path program 1 times [2021-06-10 11:37:17,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:17,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468344368] [2021-06-10 11:37:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:17,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:17,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:17,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468344368] [2021-06-10 11:37:17,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:17,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:17,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522358801] [2021-06-10 11:37:17,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:17,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:17,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 609 [2021-06-10 11:37:17,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 512 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:17,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:17,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 609 [2021-06-10 11:37:17,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:17,982 INFO L129 PetriNetUnfolder]: 12/623 cut-off events. [2021-06-10 11:37:17,982 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:18,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 623 events. 12/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2712 event pairs, 0 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 795. Up to 22 conditions per place. [2021-06-10 11:37:18,004 INFO L132 encePairwiseOnDemand]: 607/609 looper letters, 8 selfloop transitions, 1 changer transitions 0/510 dead transitions. [2021-06-10 11:37:18,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 510 transitions, 1313 flow [2021-06-10 11:37:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1672 transitions. [2021-06-10 11:37:18,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9151614668856048 [2021-06-10 11:37:18,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1672 transitions. [2021-06-10 11:37:18,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1672 transitions. [2021-06-10 11:37:18,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:18,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1672 transitions. [2021-06-10 11:37:18,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 557.3333333333334) internal successors, (1672), 3 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 609.0) internal successors, (2436), 4 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,007 INFO L185 Difference]: Start difference. First operand has 611 places, 512 transitions, 1300 flow. Second operand 3 states and 1672 transitions. [2021-06-10 11:37:18,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 510 transitions, 1313 flow [2021-06-10 11:37:18,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 510 transitions, 1312 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:18,012 INFO L241 Difference]: Finished difference. Result has 610 places, 510 transitions, 1296 flow [2021-06-10 11:37:18,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=609, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1296, PETRI_PLACES=610, PETRI_TRANSITIONS=510} [2021-06-10 11:37:18,013 INFO L343 CegarLoopForPetriNet]: 567 programPoint places, 43 predicate places. [2021-06-10 11:37:18,013 INFO L480 AbstractCegarLoop]: Abstraction has has 610 places, 510 transitions, 1296 flow [2021-06-10 11:37:18,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 556.3333333333334) internal successors, (1669), 3 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:18,013 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:18,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2021-06-10 11:37:18,013 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:18,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1563814729, now seen corresponding path program 1 times [2021-06-10 11:37:18,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:18,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195822145] [2021-06-10 11:37:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:18,022 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:18,027 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:18,036 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:37:18,036 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:37:18,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2021-06-10 11:37:18,036 WARN L342 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:37:18,036 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,132 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of22ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of22ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:18,154 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:37:18,154 INFO L253 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2021-06-10 11:37:18,154 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:37:18,154 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:37:18,154 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:37:18,154 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:37:18,154 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:37:18,154 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:37:18,154 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:37:18,154 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:37:18,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 593 places, 637 transitions, 1846 flow [2021-06-10 11:37:18,322 INFO L129 PetriNetUnfolder]: 111/834 cut-off events. [2021-06-10 11:37:18,322 INFO L130 PetriNetUnfolder]: For 2002/2002 co-relation queries the response was YES. [2021-06-10 11:37:18,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 834 events. 111/834 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3485 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1082. Up to 46 conditions per place. [2021-06-10 11:37:18,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 593 places, 637 transitions, 1846 flow [2021-06-10 11:37:18,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 593 places, 637 transitions, 1846 flow [2021-06-10 11:37:18,374 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2021-06-10 11:37:18,374 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:37:18,375 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:18,375 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-06-10 11:37:18,375 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2040514376, now seen corresponding path program 1 times [2021-06-10 11:37:18,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:18,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084730082] [2021-06-10 11:37:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:18,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:18,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:18,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084730082] [2021-06-10 11:37:18,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:18,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:18,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909255340] [2021-06-10 11:37:18,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:18,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:18,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:18,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:18,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 637 transitions, 1846 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:18,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:18,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:18,539 INFO L129 PetriNetUnfolder]: 65/660 cut-off events. [2021-06-10 11:37:18,539 INFO L130 PetriNetUnfolder]: For 2003/2003 co-relation queries the response was YES. [2021-06-10 11:37:18,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 660 events. 65/660 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2606 event pairs, 0 based on Foata normal form. 96/667 useless extension candidates. Maximal degree in co-relation 921. Up to 23 conditions per place. [2021-06-10 11:37:18,570 INFO L132 encePairwiseOnDemand]: 608/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/589 dead transitions. [2021-06-10 11:37:18,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 589 transitions, 1776 flow [2021-06-10 11:37:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2021-06-10 11:37:18,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9434850863422292 [2021-06-10 11:37:18,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1803 transitions. [2021-06-10 11:37:18,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1803 transitions. [2021-06-10 11:37:18,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:18,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1803 transitions. [2021-06-10 11:37:18,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,574 INFO L185 Difference]: Start difference. First operand has 593 places, 637 transitions, 1846 flow. Second operand 3 states and 1803 transitions. [2021-06-10 11:37:18,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 589 transitions, 1776 flow [2021-06-10 11:37:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 589 transitions, 1314 flow, removed 231 selfloop flow, removed 0 redundant places. [2021-06-10 11:37:18,581 INFO L241 Difference]: Finished difference. Result has 570 places, 589 transitions, 1308 flow [2021-06-10 11:37:18,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=570, PETRI_TRANSITIONS=589} [2021-06-10 11:37:18,581 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -23 predicate places. [2021-06-10 11:37:18,581 INFO L480 AbstractCegarLoop]: Abstraction has has 570 places, 589 transitions, 1308 flow [2021-06-10 11:37:18,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:18,581 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-06-10 11:37:18,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2021-06-10 11:37:18,581 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2039560041, now seen corresponding path program 1 times [2021-06-10 11:37:18,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:18,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148525363] [2021-06-10 11:37:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:18,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:18,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:18,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148525363] [2021-06-10 11:37:18,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:18,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:18,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494033951] [2021-06-10 11:37:18,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:18,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:18,595 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:18,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 589 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:18,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:18,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:18,733 INFO L129 PetriNetUnfolder]: 63/658 cut-off events. [2021-06-10 11:37:18,733 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:37:18,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 658 events. 63/658 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2603 event pairs, 0 based on Foata normal form. 2/574 useless extension candidates. Maximal degree in co-relation 724. Up to 23 conditions per place. [2021-06-10 11:37:18,761 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 10 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2021-06-10 11:37:18,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 587 transitions, 1318 flow [2021-06-10 11:37:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:18,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:18,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:18,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:18,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:18,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:18,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,764 INFO L185 Difference]: Start difference. First operand has 570 places, 589 transitions, 1308 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:18,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 587 transitions, 1318 flow [2021-06-10 11:37:18,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 587 transitions, 1317 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:18,769 INFO L241 Difference]: Finished difference. Result has 571 places, 587 transitions, 1297 flow [2021-06-10 11:37:18,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=571, PETRI_TRANSITIONS=587} [2021-06-10 11:37:18,769 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -22 predicate places. [2021-06-10 11:37:18,769 INFO L480 AbstractCegarLoop]: Abstraction has has 571 places, 587 transitions, 1297 flow [2021-06-10 11:37:18,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:18,770 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-06-10 11:37:18,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2021-06-10 11:37:18,770 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2040513353, now seen corresponding path program 1 times [2021-06-10 11:37:18,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:18,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741560696] [2021-06-10 11:37:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:18,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:18,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:18,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741560696] [2021-06-10 11:37:18,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:18,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:18,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141332567] [2021-06-10 11:37:18,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:18,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:18,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:18,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:18,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:18,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 587 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:18,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:18,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:18,919 INFO L129 PetriNetUnfolder]: 63/655 cut-off events. [2021-06-10 11:37:18,919 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-10 11:37:18,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 655 events. 63/655 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2576 event pairs, 0 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 718. Up to 23 conditions per place. [2021-06-10 11:37:18,967 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2021-06-10 11:37:18,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 587 transitions, 1309 flow [2021-06-10 11:37:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:18,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:18,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:18,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:18,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:18,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:18,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,970 INFO L185 Difference]: Start difference. First operand has 571 places, 587 transitions, 1297 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:18,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 587 transitions, 1309 flow [2021-06-10 11:37:18,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 587 transitions, 1306 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:18,975 INFO L241 Difference]: Finished difference. Result has 573 places, 586 transitions, 1295 flow [2021-06-10 11:37:18,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1295, PETRI_PLACES=573, PETRI_TRANSITIONS=586} [2021-06-10 11:37:18,975 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -20 predicate places. [2021-06-10 11:37:18,975 INFO L480 AbstractCegarLoop]: Abstraction has has 573 places, 586 transitions, 1295 flow [2021-06-10 11:37:18,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:18,975 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-06-10 11:37:18,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2021-06-10 11:37:18,975 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2039561064, now seen corresponding path program 1 times [2021-06-10 11:37:18,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:18,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296553682] [2021-06-10 11:37:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:18,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:18,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:18,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:18,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296553682] [2021-06-10 11:37:18,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:18,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:18,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080229476] [2021-06-10 11:37:18,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:18,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:18,989 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:18,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 586 transitions, 1295 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:18,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:18,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:18,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:19,123 INFO L129 PetriNetUnfolder]: 63/652 cut-off events. [2021-06-10 11:37:19,123 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:19,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 652 events. 63/652 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2561 event pairs, 0 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 720. Up to 23 conditions per place. [2021-06-10 11:37:19,150 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2021-06-10 11:37:19,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 584 transitions, 1301 flow [2021-06-10 11:37:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:19,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:19,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:19,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,153 INFO L185 Difference]: Start difference. First operand has 573 places, 586 transitions, 1295 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 584 transitions, 1301 flow [2021-06-10 11:37:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 584 transitions, 1296 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:19,158 INFO L241 Difference]: Finished difference. Result has 571 places, 584 transitions, 1289 flow [2021-06-10 11:37:19,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=571, PETRI_TRANSITIONS=584} [2021-06-10 11:37:19,158 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -22 predicate places. [2021-06-10 11:37:19,158 INFO L480 AbstractCegarLoop]: Abstraction has has 571 places, 584 transitions, 1289 flow [2021-06-10 11:37:19,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:19,158 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:19,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2021-06-10 11:37:19,158 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -471127975, now seen corresponding path program 1 times [2021-06-10 11:37:19,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:19,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033137658] [2021-06-10 11:37:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:19,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:19,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:19,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033137658] [2021-06-10 11:37:19,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:19,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:19,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389612988] [2021-06-10 11:37:19,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:19,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:19,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:19,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:19,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 584 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:19,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:19,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:19,305 INFO L129 PetriNetUnfolder]: 62/659 cut-off events. [2021-06-10 11:37:19,305 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:19,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 659 events. 62/659 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2616 event pairs, 0 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 730. Up to 23 conditions per place. [2021-06-10 11:37:19,333 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2021-06-10 11:37:19,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 585 transitions, 1305 flow [2021-06-10 11:37:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:19,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:19,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:19,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:19,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:19,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:19,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,336 INFO L185 Difference]: Start difference. First operand has 571 places, 584 transitions, 1289 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:19,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 585 transitions, 1305 flow [2021-06-10 11:37:19,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:19,341 INFO L241 Difference]: Finished difference. Result has 573 places, 584 transitions, 1293 flow [2021-06-10 11:37:19,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=573, PETRI_TRANSITIONS=584} [2021-06-10 11:37:19,341 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -20 predicate places. [2021-06-10 11:37:19,341 INFO L480 AbstractCegarLoop]: Abstraction has has 573 places, 584 transitions, 1293 flow [2021-06-10 11:37:19,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,341 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:19,341 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:19,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2021-06-10 11:37:19,342 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -471126952, now seen corresponding path program 1 times [2021-06-10 11:37:19,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:19,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035564853] [2021-06-10 11:37:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:19,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:19,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:19,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035564853] [2021-06-10 11:37:19,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:19,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:19,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449289007] [2021-06-10 11:37:19,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:19,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:19,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:19,355 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:19,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:19,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:19,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:19,497 INFO L129 PetriNetUnfolder]: 60/661 cut-off events. [2021-06-10 11:37:19,497 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:19,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 661 events. 60/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2652 event pairs, 0 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 739. Up to 23 conditions per place. [2021-06-10 11:37:19,525 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2021-06-10 11:37:19,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 585 transitions, 1319 flow [2021-06-10 11:37:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:19,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:19,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:19,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:19,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:19,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:19,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,528 INFO L185 Difference]: Start difference. First operand has 573 places, 584 transitions, 1293 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:19,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 585 transitions, 1319 flow [2021-06-10 11:37:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 585 transitions, 1318 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:19,533 INFO L241 Difference]: Finished difference. Result has 576 places, 585 transitions, 1310 flow [2021-06-10 11:37:19,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2021-06-10 11:37:19,534 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -17 predicate places. [2021-06-10 11:37:19,534 INFO L480 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1310 flow [2021-06-10 11:37:19,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:19,534 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:19,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2021-06-10 11:37:19,534 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -472080264, now seen corresponding path program 1 times [2021-06-10 11:37:19,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:19,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626716278] [2021-06-10 11:37:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:19,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:19,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:19,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626716278] [2021-06-10 11:37:19,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:19,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:19,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174110428] [2021-06-10 11:37:19,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:19,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:19,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:19,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:19,548 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:19,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:19,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:19,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:19,682 INFO L129 PetriNetUnfolder]: 60/654 cut-off events. [2021-06-10 11:37:19,682 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:19,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 654 events. 60/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2590 event pairs, 0 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 725. Up to 23 conditions per place. [2021-06-10 11:37:19,709 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2021-06-10 11:37:19,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 583 transitions, 1312 flow [2021-06-10 11:37:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:19,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:19,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:19,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:19,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,712 INFO L185 Difference]: Start difference. First operand has 576 places, 585 transitions, 1310 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:19,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 583 transitions, 1312 flow [2021-06-10 11:37:19,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 583 transitions, 1304 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:19,717 INFO L241 Difference]: Finished difference. Result has 576 places, 583 transitions, 1297 flow [2021-06-10 11:37:19,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=576, PETRI_TRANSITIONS=583} [2021-06-10 11:37:19,717 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -17 predicate places. [2021-06-10 11:37:19,717 INFO L480 AbstractCegarLoop]: Abstraction has has 576 places, 583 transitions, 1297 flow [2021-06-10 11:37:19,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:19,718 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:19,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2021-06-10 11:37:19,718 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash -472081287, now seen corresponding path program 1 times [2021-06-10 11:37:19,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:19,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243207167] [2021-06-10 11:37:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:19,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:19,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:19,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243207167] [2021-06-10 11:37:19,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:19,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:19,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44287084] [2021-06-10 11:37:19,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:19,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:19,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:19,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 583 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:19,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:19,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:19,867 INFO L129 PetriNetUnfolder]: 60/652 cut-off events. [2021-06-10 11:37:19,867 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:19,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 652 events. 60/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2575 event pairs, 0 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 729. Up to 23 conditions per place. [2021-06-10 11:37:19,894 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2021-06-10 11:37:19,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 581 transitions, 1310 flow [2021-06-10 11:37:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:19,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:19,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:19,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:19,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:19,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:19,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,897 INFO L185 Difference]: Start difference. First operand has 576 places, 583 transitions, 1297 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:19,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 581 transitions, 1310 flow [2021-06-10 11:37:19,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 581 transitions, 1309 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:19,902 INFO L241 Difference]: Finished difference. Result has 575 places, 581 transitions, 1293 flow [2021-06-10 11:37:19,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=575, PETRI_TRANSITIONS=581} [2021-06-10 11:37:19,902 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -18 predicate places. [2021-06-10 11:37:19,902 INFO L480 AbstractCegarLoop]: Abstraction has has 575 places, 581 transitions, 1293 flow [2021-06-10 11:37:19,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:19,903 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:19,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2021-06-10 11:37:19,903 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:19,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1492281193, now seen corresponding path program 1 times [2021-06-10 11:37:19,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:19,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717558187] [2021-06-10 11:37:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:19,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:19,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:19,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:19,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717558187] [2021-06-10 11:37:19,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:19,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:19,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951057288] [2021-06-10 11:37:19,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:19,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:19,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:19,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:19,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:19,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:19,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:19,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:20,059 INFO L129 PetriNetUnfolder]: 59/660 cut-off events. [2021-06-10 11:37:20,059 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:20,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 660 events. 59/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2649 event pairs, 0 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 741. Up to 23 conditions per place. [2021-06-10 11:37:20,087 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/583 dead transitions. [2021-06-10 11:37:20,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 583 transitions, 1323 flow [2021-06-10 11:37:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:20,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:20,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:20,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,090 INFO L185 Difference]: Start difference. First operand has 575 places, 581 transitions, 1293 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:20,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 583 transitions, 1323 flow [2021-06-10 11:37:20,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 583 transitions, 1322 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:20,095 INFO L241 Difference]: Finished difference. Result has 578 places, 583 transitions, 1316 flow [2021-06-10 11:37:20,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=578, PETRI_TRANSITIONS=583} [2021-06-10 11:37:20,095 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -15 predicate places. [2021-06-10 11:37:20,095 INFO L480 AbstractCegarLoop]: Abstraction has has 578 places, 583 transitions, 1316 flow [2021-06-10 11:37:20,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:20,095 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:20,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2021-06-10 11:37:20,095 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1492280170, now seen corresponding path program 1 times [2021-06-10 11:37:20,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:20,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224534633] [2021-06-10 11:37:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:20,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:20,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:20,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224534633] [2021-06-10 11:37:20,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:20,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:20,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685056673] [2021-06-10 11:37:20,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:20,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:20,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:20,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:20,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 583 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:20,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:20,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:20,246 INFO L129 PetriNetUnfolder]: 57/661 cut-off events. [2021-06-10 11:37:20,246 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:20,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 661 events. 57/661 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2668 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 741. Up to 23 conditions per place. [2021-06-10 11:37:20,273 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2021-06-10 11:37:20,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 583 transitions, 1328 flow [2021-06-10 11:37:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:20,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:20,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:20,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:20,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:20,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:20,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,276 INFO L185 Difference]: Start difference. First operand has 578 places, 583 transitions, 1316 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:20,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 583 transitions, 1328 flow [2021-06-10 11:37:20,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 583 transitions, 1323 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:20,281 INFO L241 Difference]: Finished difference. Result has 580 places, 582 transitions, 1312 flow [2021-06-10 11:37:20,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=580, PETRI_TRANSITIONS=582} [2021-06-10 11:37:20,281 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -13 predicate places. [2021-06-10 11:37:20,281 INFO L480 AbstractCegarLoop]: Abstraction has has 580 places, 582 transitions, 1312 flow [2021-06-10 11:37:20,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,282 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:20,282 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:20,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2021-06-10 11:37:20,282 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1491327881, now seen corresponding path program 1 times [2021-06-10 11:37:20,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:20,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265691788] [2021-06-10 11:37:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:20,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:20,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:20,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265691788] [2021-06-10 11:37:20,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:20,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:20,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124042592] [2021-06-10 11:37:20,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:20,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:20,304 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:20,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 582 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:20,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:20,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:20,459 INFO L129 PetriNetUnfolder]: 57/654 cut-off events. [2021-06-10 11:37:20,460 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:20,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 654 events. 57/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2610 event pairs, 0 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 735. Up to 23 conditions per place. [2021-06-10 11:37:20,487 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2021-06-10 11:37:20,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 580 transitions, 1315 flow [2021-06-10 11:37:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:20,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:20,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:20,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:20,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:20,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:20,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,490 INFO L185 Difference]: Start difference. First operand has 580 places, 582 transitions, 1312 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:20,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 580 transitions, 1315 flow [2021-06-10 11:37:20,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 580 transitions, 1308 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:20,495 INFO L241 Difference]: Finished difference. Result has 580 places, 580 transitions, 1301 flow [2021-06-10 11:37:20,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=580, PETRI_TRANSITIONS=580} [2021-06-10 11:37:20,495 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -13 predicate places. [2021-06-10 11:37:20,495 INFO L480 AbstractCegarLoop]: Abstraction has has 580 places, 580 transitions, 1301 flow [2021-06-10 11:37:20,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:20,495 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:20,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2021-06-10 11:37:20,495 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1491326858, now seen corresponding path program 1 times [2021-06-10 11:37:20,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:20,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42382068] [2021-06-10 11:37:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:20,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:20,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:20,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42382068] [2021-06-10 11:37:20,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:20,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:20,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898743578] [2021-06-10 11:37:20,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:20,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:20,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:20,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:20,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:20,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 580 transitions, 1301 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:20,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:20,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:20,657 INFO L129 PetriNetUnfolder]: 57/652 cut-off events. [2021-06-10 11:37:20,657 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:20,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 652 events. 57/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2593 event pairs, 0 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 735. Up to 23 conditions per place. [2021-06-10 11:37:20,684 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2021-06-10 11:37:20,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 578 transitions, 1314 flow [2021-06-10 11:37:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:20,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:20,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:20,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:20,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:20,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:20,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,687 INFO L185 Difference]: Start difference. First operand has 580 places, 580 transitions, 1301 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:20,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 578 transitions, 1314 flow [2021-06-10 11:37:20,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 578 transitions, 1313 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:20,692 INFO L241 Difference]: Finished difference. Result has 579 places, 578 transitions, 1297 flow [2021-06-10 11:37:20,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=579, PETRI_TRANSITIONS=578} [2021-06-10 11:37:20,692 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -14 predicate places. [2021-06-10 11:37:20,692 INFO L480 AbstractCegarLoop]: Abstraction has has 579 places, 578 transitions, 1297 flow [2021-06-10 11:37:20,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:20,692 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:20,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2021-06-10 11:37:20,692 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1391690980, now seen corresponding path program 1 times [2021-06-10 11:37:20,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:20,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059162235] [2021-06-10 11:37:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:20,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:20,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:20,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059162235] [2021-06-10 11:37:20,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:20,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:20,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905284341] [2021-06-10 11:37:20,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:20,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:20,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:20,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 578 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:20,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:20,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:20,850 INFO L129 PetriNetUnfolder]: 56/660 cut-off events. [2021-06-10 11:37:20,850 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:20,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 660 events. 56/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2664 event pairs, 0 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 747. Up to 23 conditions per place. [2021-06-10 11:37:20,877 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/580 dead transitions. [2021-06-10 11:37:20,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 580 transitions, 1327 flow [2021-06-10 11:37:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:20,878 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:20,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:20,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:20,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,880 INFO L185 Difference]: Start difference. First operand has 579 places, 578 transitions, 1297 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:20,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 580 transitions, 1327 flow [2021-06-10 11:37:20,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 580 transitions, 1326 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:20,885 INFO L241 Difference]: Finished difference. Result has 582 places, 580 transitions, 1320 flow [2021-06-10 11:37:20,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=582, PETRI_TRANSITIONS=580} [2021-06-10 11:37:20,885 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -11 predicate places. [2021-06-10 11:37:20,885 INFO L480 AbstractCegarLoop]: Abstraction has has 582 places, 580 transitions, 1320 flow [2021-06-10 11:37:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:20,886 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:20,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2021-06-10 11:37:20,886 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1391689957, now seen corresponding path program 1 times [2021-06-10 11:37:20,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:20,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720822070] [2021-06-10 11:37:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:20,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:20,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:20,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:20,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720822070] [2021-06-10 11:37:20,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:20,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:20,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323417521] [2021-06-10 11:37:20,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:20,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:20,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:20,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 580 transitions, 1320 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:20,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:20,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:20,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,039 INFO L129 PetriNetUnfolder]: 55/658 cut-off events. [2021-06-10 11:37:21,039 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:21,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 658 events. 55/658 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2651 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 744. Up to 23 conditions per place. [2021-06-10 11:37:21,067 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2021-06-10 11:37:21,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 580 transitions, 1332 flow [2021-06-10 11:37:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:21,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:21,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:21,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,070 INFO L185 Difference]: Start difference. First operand has 582 places, 580 transitions, 1320 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 580 transitions, 1332 flow [2021-06-10 11:37:21,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 580 transitions, 1327 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:21,075 INFO L241 Difference]: Finished difference. Result has 585 places, 580 transitions, 1325 flow [2021-06-10 11:37:21,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=585, PETRI_TRANSITIONS=580} [2021-06-10 11:37:21,075 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -8 predicate places. [2021-06-10 11:37:21,075 INFO L480 AbstractCegarLoop]: Abstraction has has 585 places, 580 transitions, 1325 flow [2021-06-10 11:37:21,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:21,076 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:21,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2021-06-10 11:37:21,076 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1390737668, now seen corresponding path program 1 times [2021-06-10 11:37:21,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:21,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159903695] [2021-06-10 11:37:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:21,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:21,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:21,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159903695] [2021-06-10 11:37:21,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:21,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:21,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61987466] [2021-06-10 11:37:21,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:21,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:21,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:21,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 580 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:21,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:21,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,228 INFO L129 PetriNetUnfolder]: 54/654 cut-off events. [2021-06-10 11:37:21,228 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:21,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 654 events. 54/654 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2629 event pairs, 0 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 741. Up to 23 conditions per place. [2021-06-10 11:37:21,256 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2021-06-10 11:37:21,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 577 transitions, 1322 flow [2021-06-10 11:37:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:21,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:21,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:21,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:21,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:21,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:21,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,259 INFO L185 Difference]: Start difference. First operand has 585 places, 580 transitions, 1325 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:21,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 577 transitions, 1322 flow [2021-06-10 11:37:21,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 577 transitions, 1315 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:21,264 INFO L241 Difference]: Finished difference. Result has 584 places, 577 transitions, 1305 flow [2021-06-10 11:37:21,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=584, PETRI_TRANSITIONS=577} [2021-06-10 11:37:21,264 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -9 predicate places. [2021-06-10 11:37:21,264 INFO L480 AbstractCegarLoop]: Abstraction has has 584 places, 577 transitions, 1305 flow [2021-06-10 11:37:21,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:21,264 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:21,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2021-06-10 11:37:21,264 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1390736645, now seen corresponding path program 1 times [2021-06-10 11:37:21,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:21,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668529279] [2021-06-10 11:37:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:21,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:21,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:21,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668529279] [2021-06-10 11:37:21,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:21,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:21,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209674652] [2021-06-10 11:37:21,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:21,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:21,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:21,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:21,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 577 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:21,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:21,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,417 INFO L129 PetriNetUnfolder]: 54/652 cut-off events. [2021-06-10 11:37:21,417 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:21,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 652 events. 54/652 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2611 event pairs, 0 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 742. Up to 23 conditions per place. [2021-06-10 11:37:21,443 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/575 dead transitions. [2021-06-10 11:37:21,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 575 transitions, 1318 flow [2021-06-10 11:37:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:21,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:21,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:21,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:21,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:21,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:21,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,446 INFO L185 Difference]: Start difference. First operand has 584 places, 577 transitions, 1305 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:21,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 575 transitions, 1318 flow [2021-06-10 11:37:21,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 575 transitions, 1317 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:21,451 INFO L241 Difference]: Finished difference. Result has 583 places, 575 transitions, 1301 flow [2021-06-10 11:37:21,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=583, PETRI_TRANSITIONS=575} [2021-06-10 11:37:21,451 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -10 predicate places. [2021-06-10 11:37:21,451 INFO L480 AbstractCegarLoop]: Abstraction has has 583 places, 575 transitions, 1301 flow [2021-06-10 11:37:21,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:21,452 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:21,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2021-06-10 11:37:21,452 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:21,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1868210033, now seen corresponding path program 1 times [2021-06-10 11:37:21,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:21,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927957149] [2021-06-10 11:37:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:21,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:21,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:21,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927957149] [2021-06-10 11:37:21,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:21,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:21,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857944664] [2021-06-10 11:37:21,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:21,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:21,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:21,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 575 transitions, 1301 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:21,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:21,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,606 INFO L129 PetriNetUnfolder]: 53/659 cut-off events. [2021-06-10 11:37:21,606 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:21,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 659 events. 53/659 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2674 event pairs, 0 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 747. Up to 23 conditions per place. [2021-06-10 11:37:21,633 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2021-06-10 11:37:21,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 576 transitions, 1317 flow [2021-06-10 11:37:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:21,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:21,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:21,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:21,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,636 INFO L185 Difference]: Start difference. First operand has 583 places, 575 transitions, 1301 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:21,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 576 transitions, 1317 flow [2021-06-10 11:37:21,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 576 transitions, 1316 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:21,641 INFO L241 Difference]: Finished difference. Result has 585 places, 575 transitions, 1305 flow [2021-06-10 11:37:21,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2021-06-10 11:37:21,642 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -8 predicate places. [2021-06-10 11:37:21,642 INFO L480 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1305 flow [2021-06-10 11:37:21,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:21,642 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:21,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2021-06-10 11:37:21,642 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1868209010, now seen corresponding path program 1 times [2021-06-10 11:37:21,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:21,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213899851] [2021-06-10 11:37:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:21,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:21,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:21,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213899851] [2021-06-10 11:37:21,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:21,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:21,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547466000] [2021-06-10 11:37:21,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:21,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:21,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:21,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:21,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:21,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,807 INFO L129 PetriNetUnfolder]: 51/661 cut-off events. [2021-06-10 11:37:21,807 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:21,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 661 events. 51/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2703 event pairs, 0 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2021-06-10 11:37:21,832 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/576 dead transitions. [2021-06-10 11:37:21,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 576 transitions, 1331 flow [2021-06-10 11:37:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:21,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:21,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:21,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:21,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:21,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,835 INFO L185 Difference]: Start difference. First operand has 585 places, 575 transitions, 1305 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:21,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 576 transitions, 1331 flow [2021-06-10 11:37:21,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 576 transitions, 1330 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:21,840 INFO L241 Difference]: Finished difference. Result has 588 places, 576 transitions, 1322 flow [2021-06-10 11:37:21,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=588, PETRI_TRANSITIONS=576} [2021-06-10 11:37:21,840 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -5 predicate places. [2021-06-10 11:37:21,840 INFO L480 AbstractCegarLoop]: Abstraction has has 588 places, 576 transitions, 1322 flow [2021-06-10 11:37:21,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:21,841 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:21,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2021-06-10 11:37:21,841 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1869162322, now seen corresponding path program 1 times [2021-06-10 11:37:21,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:21,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142739173] [2021-06-10 11:37:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:21,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:21,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:21,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:21,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142739173] [2021-06-10 11:37:21,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:21,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:21,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480471685] [2021-06-10 11:37:21,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:21,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:21,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:21,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 576 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:21,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:21,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:21,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:21,995 INFO L129 PetriNetUnfolder]: 51/654 cut-off events. [2021-06-10 11:37:21,995 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:22,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 654 events. 51/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2646 event pairs, 0 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 744. Up to 23 conditions per place. [2021-06-10 11:37:22,021 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2021-06-10 11:37:22,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 574 transitions, 1324 flow [2021-06-10 11:37:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:22,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:22,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:22,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,024 INFO L185 Difference]: Start difference. First operand has 588 places, 576 transitions, 1322 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:22,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 574 transitions, 1324 flow [2021-06-10 11:37:22,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 574 transitions, 1316 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:22,029 INFO L241 Difference]: Finished difference. Result has 588 places, 574 transitions, 1309 flow [2021-06-10 11:37:22,029 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=588, PETRI_TRANSITIONS=574} [2021-06-10 11:37:22,029 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -5 predicate places. [2021-06-10 11:37:22,029 INFO L480 AbstractCegarLoop]: Abstraction has has 588 places, 574 transitions, 1309 flow [2021-06-10 11:37:22,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:22,029 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:22,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2021-06-10 11:37:22,030 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1869163345, now seen corresponding path program 1 times [2021-06-10 11:37:22,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:22,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433214495] [2021-06-10 11:37:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:22,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:22,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:22,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433214495] [2021-06-10 11:37:22,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:22,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:22,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83289588] [2021-06-10 11:37:22,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:22,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:22,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:22,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 574 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:22,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:22,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:22,184 INFO L129 PetriNetUnfolder]: 51/652 cut-off events. [2021-06-10 11:37:22,184 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:22,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 652 events. 51/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2630 event pairs, 0 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 748. Up to 23 conditions per place. [2021-06-10 11:37:22,211 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/572 dead transitions. [2021-06-10 11:37:22,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 572 transitions, 1322 flow [2021-06-10 11:37:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:22,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:22,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:22,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:22,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:22,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:22,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,214 INFO L185 Difference]: Start difference. First operand has 588 places, 574 transitions, 1309 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:22,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 572 transitions, 1322 flow [2021-06-10 11:37:22,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 572 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:22,220 INFO L241 Difference]: Finished difference. Result has 587 places, 572 transitions, 1305 flow [2021-06-10 11:37:22,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=587, PETRI_TRANSITIONS=572} [2021-06-10 11:37:22,220 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -6 predicate places. [2021-06-10 11:37:22,220 INFO L480 AbstractCegarLoop]: Abstraction has has 587 places, 572 transitions, 1305 flow [2021-06-10 11:37:22,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:22,220 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:22,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2021-06-10 11:37:22,220 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1563836765, now seen corresponding path program 1 times [2021-06-10 11:37:22,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:22,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675143343] [2021-06-10 11:37:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:22,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:22,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:22,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675143343] [2021-06-10 11:37:22,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:22,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:22,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902953439] [2021-06-10 11:37:22,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:22,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:22,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:22,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 572 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:22,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:22,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:22,384 INFO L129 PetriNetUnfolder]: 50/659 cut-off events. [2021-06-10 11:37:22,384 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:22,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 659 events. 50/659 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2689 event pairs, 0 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 753. Up to 23 conditions per place. [2021-06-10 11:37:22,412 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/573 dead transitions. [2021-06-10 11:37:22,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 573 transitions, 1321 flow [2021-06-10 11:37:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:22,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:22,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:22,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:22,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:22,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:22,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,416 INFO L185 Difference]: Start difference. First operand has 587 places, 572 transitions, 1305 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:22,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 573 transitions, 1321 flow [2021-06-10 11:37:22,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 573 transitions, 1320 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:22,421 INFO L241 Difference]: Finished difference. Result has 589 places, 572 transitions, 1309 flow [2021-06-10 11:37:22,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=589, PETRI_TRANSITIONS=572} [2021-06-10 11:37:22,421 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -4 predicate places. [2021-06-10 11:37:22,421 INFO L480 AbstractCegarLoop]: Abstraction has has 589 places, 572 transitions, 1309 flow [2021-06-10 11:37:22,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:22,422 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:22,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2021-06-10 11:37:22,422 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1563835742, now seen corresponding path program 1 times [2021-06-10 11:37:22,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:22,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243052594] [2021-06-10 11:37:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:22,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:22,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:22,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243052594] [2021-06-10 11:37:22,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:22,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:22,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391156776] [2021-06-10 11:37:22,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:22,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:22,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:22,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:22,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 572 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:22,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:22,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:22,592 INFO L129 PetriNetUnfolder]: 48/661 cut-off events. [2021-06-10 11:37:22,592 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:22,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 661 events. 48/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2720 event pairs, 0 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 764. Up to 23 conditions per place. [2021-06-10 11:37:22,629 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2021-06-10 11:37:22,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 573 transitions, 1335 flow [2021-06-10 11:37:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:22,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:22,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:22,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:22,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:22,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:22,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,632 INFO L185 Difference]: Start difference. First operand has 589 places, 572 transitions, 1309 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:22,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 573 transitions, 1335 flow [2021-06-10 11:37:22,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 573 transitions, 1334 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:22,637 INFO L241 Difference]: Finished difference. Result has 592 places, 573 transitions, 1326 flow [2021-06-10 11:37:22,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1326, PETRI_PLACES=592, PETRI_TRANSITIONS=573} [2021-06-10 11:37:22,637 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -1 predicate places. [2021-06-10 11:37:22,637 INFO L480 AbstractCegarLoop]: Abstraction has has 592 places, 573 transitions, 1326 flow [2021-06-10 11:37:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:22,638 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:22,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2021-06-10 11:37:22,638 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1564789054, now seen corresponding path program 1 times [2021-06-10 11:37:22,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:22,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105272098] [2021-06-10 11:37:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:22,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:22,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:22,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105272098] [2021-06-10 11:37:22,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:22,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:22,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678269305] [2021-06-10 11:37:22,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:22,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:22,654 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:22,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 573 transitions, 1326 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:22,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:22,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:22,801 INFO L129 PetriNetUnfolder]: 48/654 cut-off events. [2021-06-10 11:37:22,801 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:22,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 654 events. 48/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2664 event pairs, 0 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 750. Up to 23 conditions per place. [2021-06-10 11:37:22,827 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/571 dead transitions. [2021-06-10 11:37:22,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 571 transitions, 1328 flow [2021-06-10 11:37:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:22,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:22,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:22,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:22,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,830 INFO L185 Difference]: Start difference. First operand has 592 places, 573 transitions, 1326 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 571 transitions, 1328 flow [2021-06-10 11:37:22,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 571 transitions, 1320 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:22,835 INFO L241 Difference]: Finished difference. Result has 592 places, 571 transitions, 1313 flow [2021-06-10 11:37:22,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=592, PETRI_TRANSITIONS=571} [2021-06-10 11:37:22,836 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -1 predicate places. [2021-06-10 11:37:22,836 INFO L480 AbstractCegarLoop]: Abstraction has has 592 places, 571 transitions, 1313 flow [2021-06-10 11:37:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:22,836 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:22,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2021-06-10 11:37:22,836 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1564790077, now seen corresponding path program 1 times [2021-06-10 11:37:22,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:22,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064137321] [2021-06-10 11:37:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:22,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:22,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:22,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:22,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064137321] [2021-06-10 11:37:22,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:22,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:22,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823210842] [2021-06-10 11:37:22,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:22,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:22,850 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:22,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 571 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:22,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:22,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:22,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:22,995 INFO L129 PetriNetUnfolder]: 48/652 cut-off events. [2021-06-10 11:37:22,995 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:23,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 652 events. 48/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2646 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 754. Up to 23 conditions per place. [2021-06-10 11:37:23,021 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/569 dead transitions. [2021-06-10 11:37:23,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 569 transitions, 1326 flow [2021-06-10 11:37:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:23,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:23,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:23,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,024 INFO L185 Difference]: Start difference. First operand has 592 places, 571 transitions, 1313 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:23,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 569 transitions, 1326 flow [2021-06-10 11:37:23,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 569 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:23,029 INFO L241 Difference]: Finished difference. Result has 591 places, 569 transitions, 1309 flow [2021-06-10 11:37:23,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=591, PETRI_TRANSITIONS=569} [2021-06-10 11:37:23,030 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, -2 predicate places. [2021-06-10 11:37:23,030 INFO L480 AbstractCegarLoop]: Abstraction has has 591 places, 569 transitions, 1309 flow [2021-06-10 11:37:23,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:23,030 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:23,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2021-06-10 11:37:23,030 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash -528531016, now seen corresponding path program 1 times [2021-06-10 11:37:23,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:23,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207004378] [2021-06-10 11:37:23,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:23,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:23,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:23,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207004378] [2021-06-10 11:37:23,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:23,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:23,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727542536] [2021-06-10 11:37:23,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:23,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:23,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:23,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 569 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:23,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:23,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:23,195 INFO L129 PetriNetUnfolder]: 47/659 cut-off events. [2021-06-10 11:37:23,196 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:23,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 659 events. 47/659 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2709 event pairs, 0 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 759. Up to 23 conditions per place. [2021-06-10 11:37:23,220 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2021-06-10 11:37:23,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 570 transitions, 1325 flow [2021-06-10 11:37:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:23,222 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:23,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:23,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:23,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:23,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:23,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,224 INFO L185 Difference]: Start difference. First operand has 591 places, 569 transitions, 1309 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 570 transitions, 1325 flow [2021-06-10 11:37:23,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 570 transitions, 1324 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:23,228 INFO L241 Difference]: Finished difference. Result has 593 places, 569 transitions, 1313 flow [2021-06-10 11:37:23,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=593, PETRI_TRANSITIONS=569} [2021-06-10 11:37:23,229 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 0 predicate places. [2021-06-10 11:37:23,229 INFO L480 AbstractCegarLoop]: Abstraction has has 593 places, 569 transitions, 1313 flow [2021-06-10 11:37:23,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:23,229 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:23,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2021-06-10 11:37:23,229 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash -528529993, now seen corresponding path program 1 times [2021-06-10 11:37:23,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:23,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082797079] [2021-06-10 11:37:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:23,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:23,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:23,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082797079] [2021-06-10 11:37:23,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:23,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:23,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397921610] [2021-06-10 11:37:23,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:23,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:23,243 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:23,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 569 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:23,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:23,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:23,395 INFO L129 PetriNetUnfolder]: 45/661 cut-off events. [2021-06-10 11:37:23,395 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:23,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 661 events. 45/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2738 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 770. Up to 23 conditions per place. [2021-06-10 11:37:23,422 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/570 dead transitions. [2021-06-10 11:37:23,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 570 transitions, 1339 flow [2021-06-10 11:37:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:23,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:23,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:23,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:23,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:23,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:23,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,425 INFO L185 Difference]: Start difference. First operand has 593 places, 569 transitions, 1313 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:23,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 570 transitions, 1339 flow [2021-06-10 11:37:23,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 570 transitions, 1338 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:23,430 INFO L241 Difference]: Finished difference. Result has 596 places, 570 transitions, 1330 flow [2021-06-10 11:37:23,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=596, PETRI_TRANSITIONS=570} [2021-06-10 11:37:23,430 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 3 predicate places. [2021-06-10 11:37:23,430 INFO L480 AbstractCegarLoop]: Abstraction has has 596 places, 570 transitions, 1330 flow [2021-06-10 11:37:23,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:23,430 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:23,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2021-06-10 11:37:23,430 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash -529483305, now seen corresponding path program 1 times [2021-06-10 11:37:23,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:23,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420208961] [2021-06-10 11:37:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:23,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:23,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:23,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420208961] [2021-06-10 11:37:23,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:23,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:23,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458043] [2021-06-10 11:37:23,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:23,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:23,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:23,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 570 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:23,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:23,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:23,596 INFO L129 PetriNetUnfolder]: 45/654 cut-off events. [2021-06-10 11:37:23,596 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:23,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 654 events. 45/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2681 event pairs, 0 based on Foata normal form. 1/589 useless extension candidates. Maximal degree in co-relation 756. Up to 23 conditions per place. [2021-06-10 11:37:23,622 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/568 dead transitions. [2021-06-10 11:37:23,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 568 transitions, 1332 flow [2021-06-10 11:37:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:23,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:23,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:23,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:23,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:23,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:23,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,626 INFO L185 Difference]: Start difference. First operand has 596 places, 570 transitions, 1330 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:23,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 568 transitions, 1332 flow [2021-06-10 11:37:23,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 568 transitions, 1324 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:23,631 INFO L241 Difference]: Finished difference. Result has 596 places, 568 transitions, 1317 flow [2021-06-10 11:37:23,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=596, PETRI_TRANSITIONS=568} [2021-06-10 11:37:23,631 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 3 predicate places. [2021-06-10 11:37:23,631 INFO L480 AbstractCegarLoop]: Abstraction has has 596 places, 568 transitions, 1317 flow [2021-06-10 11:37:23,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:23,631 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:23,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2021-06-10 11:37:23,631 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -529484328, now seen corresponding path program 1 times [2021-06-10 11:37:23,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:23,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928254797] [2021-06-10 11:37:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:23,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:23,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:23,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928254797] [2021-06-10 11:37:23,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:23,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:23,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753505209] [2021-06-10 11:37:23,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:23,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:23,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:23,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 568 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:23,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:23,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:23,793 INFO L129 PetriNetUnfolder]: 45/652 cut-off events. [2021-06-10 11:37:23,793 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:23,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 652 events. 45/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2665 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 760. Up to 23 conditions per place. [2021-06-10 11:37:23,819 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2021-06-10 11:37:23,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 566 transitions, 1330 flow [2021-06-10 11:37:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:23,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:23,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:23,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:23,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,822 INFO L185 Difference]: Start difference. First operand has 596 places, 568 transitions, 1317 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:23,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 566 transitions, 1330 flow [2021-06-10 11:37:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 566 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:23,827 INFO L241 Difference]: Finished difference. Result has 595 places, 566 transitions, 1313 flow [2021-06-10 11:37:23,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=595, PETRI_TRANSITIONS=566} [2021-06-10 11:37:23,827 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 2 predicate places. [2021-06-10 11:37:23,827 INFO L480 AbstractCegarLoop]: Abstraction has has 595 places, 566 transitions, 1313 flow [2021-06-10 11:37:23,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:23,828 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:23,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2021-06-10 11:37:23,828 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash -767625394, now seen corresponding path program 1 times [2021-06-10 11:37:23,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:23,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787565276] [2021-06-10 11:37:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:23,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:23,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:23,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:23,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787565276] [2021-06-10 11:37:23,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:23,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:23,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294921222] [2021-06-10 11:37:23,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:23,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:23,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:23,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 566 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:23,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:23,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:23,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:24,002 INFO L129 PetriNetUnfolder]: 44/659 cut-off events. [2021-06-10 11:37:24,002 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:24,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 659 events. 44/659 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2724 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 765. Up to 23 conditions per place. [2021-06-10 11:37:24,029 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2021-06-10 11:37:24,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 567 transitions, 1329 flow [2021-06-10 11:37:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:24,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:24,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:24,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:24,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:24,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:24,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,032 INFO L185 Difference]: Start difference. First operand has 595 places, 566 transitions, 1313 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:24,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 567 transitions, 1329 flow [2021-06-10 11:37:24,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 567 transitions, 1328 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:24,037 INFO L241 Difference]: Finished difference. Result has 597 places, 566 transitions, 1317 flow [2021-06-10 11:37:24,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=597, PETRI_TRANSITIONS=566} [2021-06-10 11:37:24,038 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 4 predicate places. [2021-06-10 11:37:24,038 INFO L480 AbstractCegarLoop]: Abstraction has has 597 places, 566 transitions, 1317 flow [2021-06-10 11:37:24,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:24,038 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:24,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2021-06-10 11:37:24,038 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -767624371, now seen corresponding path program 1 times [2021-06-10 11:37:24,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:24,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454205144] [2021-06-10 11:37:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:24,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:24,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:24,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454205144] [2021-06-10 11:37:24,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:24,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:24,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124796341] [2021-06-10 11:37:24,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:24,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:24,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:24,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 566 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:24,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:24,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:24,207 INFO L129 PetriNetUnfolder]: 42/661 cut-off events. [2021-06-10 11:37:24,207 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:24,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 661 events. 42/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2756 event pairs, 0 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 776. Up to 23 conditions per place. [2021-06-10 11:37:24,234 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/567 dead transitions. [2021-06-10 11:37:24,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 567 transitions, 1343 flow [2021-06-10 11:37:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:24,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:24,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:24,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:24,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:24,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,237 INFO L185 Difference]: Start difference. First operand has 597 places, 566 transitions, 1317 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:24,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 567 transitions, 1343 flow [2021-06-10 11:37:24,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 567 transitions, 1342 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:24,242 INFO L241 Difference]: Finished difference. Result has 600 places, 567 transitions, 1334 flow [2021-06-10 11:37:24,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1334, PETRI_PLACES=600, PETRI_TRANSITIONS=567} [2021-06-10 11:37:24,243 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 7 predicate places. [2021-06-10 11:37:24,243 INFO L480 AbstractCegarLoop]: Abstraction has has 600 places, 567 transitions, 1334 flow [2021-06-10 11:37:24,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:24,243 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:24,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2021-06-10 11:37:24,243 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -768577683, now seen corresponding path program 1 times [2021-06-10 11:37:24,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:24,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148495534] [2021-06-10 11:37:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:24,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:24,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:24,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148495534] [2021-06-10 11:37:24,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:24,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:24,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784457834] [2021-06-10 11:37:24,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:24,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:24,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:24,258 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:24,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 567 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:24,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:24,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:24,405 INFO L129 PetriNetUnfolder]: 42/654 cut-off events. [2021-06-10 11:37:24,406 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:24,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 654 events. 42/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2699 event pairs, 0 based on Foata normal form. 1/592 useless extension candidates. Maximal degree in co-relation 762. Up to 23 conditions per place. [2021-06-10 11:37:24,432 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2021-06-10 11:37:24,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 565 transitions, 1336 flow [2021-06-10 11:37:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:24,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:24,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:24,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:24,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:24,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:24,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,436 INFO L185 Difference]: Start difference. First operand has 600 places, 567 transitions, 1334 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:24,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 565 transitions, 1336 flow [2021-06-10 11:37:24,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 565 transitions, 1328 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:24,441 INFO L241 Difference]: Finished difference. Result has 600 places, 565 transitions, 1321 flow [2021-06-10 11:37:24,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=600, PETRI_TRANSITIONS=565} [2021-06-10 11:37:24,441 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 7 predicate places. [2021-06-10 11:37:24,441 INFO L480 AbstractCegarLoop]: Abstraction has has 600 places, 565 transitions, 1321 flow [2021-06-10 11:37:24,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:24,441 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:24,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2021-06-10 11:37:24,441 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -768578706, now seen corresponding path program 1 times [2021-06-10 11:37:24,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:24,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010223591] [2021-06-10 11:37:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:24,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:24,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:24,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010223591] [2021-06-10 11:37:24,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:24,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:24,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358309824] [2021-06-10 11:37:24,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:24,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:24,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:24,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 565 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:24,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:24,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:24,611 INFO L129 PetriNetUnfolder]: 42/652 cut-off events. [2021-06-10 11:37:24,611 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:24,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 652 events. 42/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2681 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 766. Up to 23 conditions per place. [2021-06-10 11:37:24,637 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/563 dead transitions. [2021-06-10 11:37:24,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 563 transitions, 1334 flow [2021-06-10 11:37:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:24,638 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:24,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:24,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:24,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:24,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:24,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,640 INFO L185 Difference]: Start difference. First operand has 600 places, 565 transitions, 1321 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:24,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 563 transitions, 1334 flow [2021-06-10 11:37:24,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 563 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:24,645 INFO L241 Difference]: Finished difference. Result has 599 places, 563 transitions, 1317 flow [2021-06-10 11:37:24,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=599, PETRI_TRANSITIONS=563} [2021-06-10 11:37:24,645 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 6 predicate places. [2021-06-10 11:37:24,645 INFO L480 AbstractCegarLoop]: Abstraction has has 599 places, 563 transitions, 1317 flow [2021-06-10 11:37:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:24,645 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:24,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2021-06-10 11:37:24,645 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 475006436, now seen corresponding path program 1 times [2021-06-10 11:37:24,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:24,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602382184] [2021-06-10 11:37:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:24,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:24,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:24,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602382184] [2021-06-10 11:37:24,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:24,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:24,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784710865] [2021-06-10 11:37:24,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:24,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:24,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:24,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 563 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:24,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:24,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:24,819 INFO L129 PetriNetUnfolder]: 41/660 cut-off events. [2021-06-10 11:37:24,819 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:24,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 660 events. 41/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2751 event pairs, 0 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2021-06-10 11:37:24,846 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2021-06-10 11:37:24,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 565 transitions, 1347 flow [2021-06-10 11:37:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:24,847 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:24,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:24,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:24,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:24,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:24,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,849 INFO L185 Difference]: Start difference. First operand has 599 places, 563 transitions, 1317 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 565 transitions, 1347 flow [2021-06-10 11:37:24,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 565 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:24,854 INFO L241 Difference]: Finished difference. Result has 602 places, 565 transitions, 1340 flow [2021-06-10 11:37:24,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1340, PETRI_PLACES=602, PETRI_TRANSITIONS=565} [2021-06-10 11:37:24,854 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 9 predicate places. [2021-06-10 11:37:24,854 INFO L480 AbstractCegarLoop]: Abstraction has has 602 places, 565 transitions, 1340 flow [2021-06-10 11:37:24,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:24,854 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:24,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2021-06-10 11:37:24,854 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 475005413, now seen corresponding path program 1 times [2021-06-10 11:37:24,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:24,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982885336] [2021-06-10 11:37:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:24,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:24,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:24,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:24,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982885336] [2021-06-10 11:37:24,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:24,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:24,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458325343] [2021-06-10 11:37:24,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:24,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:24,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:24,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:24,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 565 transitions, 1340 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:24,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:24,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:24,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:25,020 INFO L129 PetriNetUnfolder]: 39/661 cut-off events. [2021-06-10 11:37:25,020 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:25,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 661 events. 39/661 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2769 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2021-06-10 11:37:25,047 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2021-06-10 11:37:25,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 565 transitions, 1352 flow [2021-06-10 11:37:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:25,048 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:25,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:25,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,050 INFO L185 Difference]: Start difference. First operand has 602 places, 565 transitions, 1340 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 565 transitions, 1352 flow [2021-06-10 11:37:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 565 transitions, 1347 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:25,055 INFO L241 Difference]: Finished difference. Result has 604 places, 564 transitions, 1336 flow [2021-06-10 11:37:25,055 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1336, PETRI_PLACES=604, PETRI_TRANSITIONS=564} [2021-06-10 11:37:25,055 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 11 predicate places. [2021-06-10 11:37:25,055 INFO L480 AbstractCegarLoop]: Abstraction has has 604 places, 564 transitions, 1336 flow [2021-06-10 11:37:25,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:25,056 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:25,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2021-06-10 11:37:25,056 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 474053124, now seen corresponding path program 1 times [2021-06-10 11:37:25,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:25,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828559748] [2021-06-10 11:37:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:25,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:25,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:25,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828559748] [2021-06-10 11:37:25,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:25,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202072790] [2021-06-10 11:37:25,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:25,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:25,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:25,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 564 transitions, 1336 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:25,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:25,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:25,219 INFO L129 PetriNetUnfolder]: 39/654 cut-off events. [2021-06-10 11:37:25,219 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:25,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 654 events. 39/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2715 event pairs, 0 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 772. Up to 23 conditions per place. [2021-06-10 11:37:25,245 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2021-06-10 11:37:25,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 562 transitions, 1339 flow [2021-06-10 11:37:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:25,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:25,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:25,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:25,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:25,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:25,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,248 INFO L185 Difference]: Start difference. First operand has 604 places, 564 transitions, 1336 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:25,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 562 transitions, 1339 flow [2021-06-10 11:37:25,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 562 transitions, 1332 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:25,253 INFO L241 Difference]: Finished difference. Result has 604 places, 562 transitions, 1325 flow [2021-06-10 11:37:25,254 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=604, PETRI_TRANSITIONS=562} [2021-06-10 11:37:25,254 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 11 predicate places. [2021-06-10 11:37:25,254 INFO L480 AbstractCegarLoop]: Abstraction has has 604 places, 562 transitions, 1325 flow [2021-06-10 11:37:25,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,254 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:25,254 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:25,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2021-06-10 11:37:25,254 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash 474052101, now seen corresponding path program 1 times [2021-06-10 11:37:25,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:25,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969320279] [2021-06-10 11:37:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:25,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:25,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:25,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969320279] [2021-06-10 11:37:25,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:25,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:25,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435986387] [2021-06-10 11:37:25,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:25,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:25,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:25,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 562 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:25,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:25,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:25,421 INFO L129 PetriNetUnfolder]: 39/652 cut-off events. [2021-06-10 11:37:25,421 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:25,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 652 events. 39/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2698 event pairs, 0 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 772. Up to 23 conditions per place. [2021-06-10 11:37:25,447 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/560 dead transitions. [2021-06-10 11:37:25,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 560 transitions, 1338 flow [2021-06-10 11:37:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:25,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:25,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:25,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:25,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:25,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:25,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,450 INFO L185 Difference]: Start difference. First operand has 604 places, 562 transitions, 1325 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:25,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 560 transitions, 1338 flow [2021-06-10 11:37:25,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 560 transitions, 1337 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:25,455 INFO L241 Difference]: Finished difference. Result has 603 places, 560 transitions, 1321 flow [2021-06-10 11:37:25,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=603, PETRI_TRANSITIONS=560} [2021-06-10 11:37:25,455 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 10 predicate places. [2021-06-10 11:37:25,455 INFO L480 AbstractCegarLoop]: Abstraction has has 603 places, 560 transitions, 1321 flow [2021-06-10 11:37:25,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:25,455 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:25,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2021-06-10 11:37:25,455 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:25,456 INFO L82 PathProgramCache]: Analyzing trace with hash -504142852, now seen corresponding path program 1 times [2021-06-10 11:37:25,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:25,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096009150] [2021-06-10 11:37:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:25,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:25,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:25,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096009150] [2021-06-10 11:37:25,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:25,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:25,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869497222] [2021-06-10 11:37:25,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:25,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:25,470 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:25,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 560 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:25,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:25,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:25,628 INFO L129 PetriNetUnfolder]: 38/660 cut-off events. [2021-06-10 11:37:25,629 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:25,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 660 events. 38/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2768 event pairs, 0 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 784. Up to 23 conditions per place. [2021-06-10 11:37:25,655 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/562 dead transitions. [2021-06-10 11:37:25,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 562 transitions, 1351 flow [2021-06-10 11:37:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:25,656 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:25,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:25,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:25,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:25,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:25,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,658 INFO L185 Difference]: Start difference. First operand has 603 places, 560 transitions, 1321 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 562 transitions, 1351 flow [2021-06-10 11:37:25,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 562 transitions, 1350 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:25,663 INFO L241 Difference]: Finished difference. Result has 606 places, 562 transitions, 1344 flow [2021-06-10 11:37:25,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1344, PETRI_PLACES=606, PETRI_TRANSITIONS=562} [2021-06-10 11:37:25,663 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 13 predicate places. [2021-06-10 11:37:25,663 INFO L480 AbstractCegarLoop]: Abstraction has has 606 places, 562 transitions, 1344 flow [2021-06-10 11:37:25,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,664 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:25,664 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:25,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2021-06-10 11:37:25,664 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -504143875, now seen corresponding path program 1 times [2021-06-10 11:37:25,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:25,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638945648] [2021-06-10 11:37:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:25,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:25,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:25,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638945648] [2021-06-10 11:37:25,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:25,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:25,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50713457] [2021-06-10 11:37:25,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:25,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:25,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:25,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 562 transitions, 1344 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:25,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:25,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:25,853 INFO L129 PetriNetUnfolder]: 36/661 cut-off events. [2021-06-10 11:37:25,853 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:25,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 661 events. 36/661 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2790 event pairs, 0 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 784. Up to 23 conditions per place. [2021-06-10 11:37:25,870 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2021-06-10 11:37:25,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 562 transitions, 1356 flow [2021-06-10 11:37:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:25,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:25,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:25,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:25,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,873 INFO L185 Difference]: Start difference. First operand has 606 places, 562 transitions, 1344 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:25,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 562 transitions, 1356 flow [2021-06-10 11:37:25,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 562 transitions, 1351 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:25,878 INFO L241 Difference]: Finished difference. Result has 608 places, 561 transitions, 1340 flow [2021-06-10 11:37:25,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1340, PETRI_PLACES=608, PETRI_TRANSITIONS=561} [2021-06-10 11:37:25,878 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 15 predicate places. [2021-06-10 11:37:25,878 INFO L480 AbstractCegarLoop]: Abstraction has has 608 places, 561 transitions, 1340 flow [2021-06-10 11:37:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,879 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:25,879 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:25,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2021-06-10 11:37:25,879 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash -505096164, now seen corresponding path program 1 times [2021-06-10 11:37:25,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:25,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303929160] [2021-06-10 11:37:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:25,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:25,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:25,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:25,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303929160] [2021-06-10 11:37:25,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:25,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:25,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652614364] [2021-06-10 11:37:25,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:25,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:25,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:25,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 561 transitions, 1340 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:25,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:25,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:25,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:26,045 INFO L129 PetriNetUnfolder]: 36/654 cut-off events. [2021-06-10 11:37:26,045 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:26,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 654 events. 36/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2733 event pairs, 0 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2021-06-10 11:37:26,071 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2021-06-10 11:37:26,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 559 transitions, 1343 flow [2021-06-10 11:37:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:26,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:26,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:26,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:26,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:26,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:26,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,074 INFO L185 Difference]: Start difference. First operand has 608 places, 561 transitions, 1340 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:26,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 559 transitions, 1343 flow [2021-06-10 11:37:26,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 559 transitions, 1336 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:26,079 INFO L241 Difference]: Finished difference. Result has 608 places, 559 transitions, 1329 flow [2021-06-10 11:37:26,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=608, PETRI_TRANSITIONS=559} [2021-06-10 11:37:26,080 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 15 predicate places. [2021-06-10 11:37:26,080 INFO L480 AbstractCegarLoop]: Abstraction has has 608 places, 559 transitions, 1329 flow [2021-06-10 11:37:26,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:26,080 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:26,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2021-06-10 11:37:26,080 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -505097187, now seen corresponding path program 1 times [2021-06-10 11:37:26,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:26,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840183969] [2021-06-10 11:37:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:26,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:26,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:26,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840183969] [2021-06-10 11:37:26,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:26,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:26,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819362406] [2021-06-10 11:37:26,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:26,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:26,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:26,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:26,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 559 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:26,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:26,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:26,249 INFO L129 PetriNetUnfolder]: 36/652 cut-off events. [2021-06-10 11:37:26,249 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:26,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 652 events. 36/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2715 event pairs, 0 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 778. Up to 23 conditions per place. [2021-06-10 11:37:26,275 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2021-06-10 11:37:26,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 557 transitions, 1342 flow [2021-06-10 11:37:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:26,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:26,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:26,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:26,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:26,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:26,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,279 INFO L185 Difference]: Start difference. First operand has 608 places, 559 transitions, 1329 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 557 transitions, 1342 flow [2021-06-10 11:37:26,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 557 transitions, 1341 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:26,284 INFO L241 Difference]: Finished difference. Result has 607 places, 557 transitions, 1325 flow [2021-06-10 11:37:26,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=607, PETRI_TRANSITIONS=557} [2021-06-10 11:37:26,285 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 14 predicate places. [2021-06-10 11:37:26,285 INFO L480 AbstractCegarLoop]: Abstraction has has 607 places, 557 transitions, 1325 flow [2021-06-10 11:37:26,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:26,285 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:26,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2021-06-10 11:37:26,285 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1473513269, now seen corresponding path program 1 times [2021-06-10 11:37:26,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:26,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452272006] [2021-06-10 11:37:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:26,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:26,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:26,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452272006] [2021-06-10 11:37:26,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:26,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:26,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392306581] [2021-06-10 11:37:26,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:26,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:26,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:26,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:26,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 557 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:26,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:26,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:26,467 INFO L129 PetriNetUnfolder]: 34/657 cut-off events. [2021-06-10 11:37:26,468 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:26,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 657 events. 34/657 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2765 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 781. Up to 23 conditions per place. [2021-06-10 11:37:26,493 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2021-06-10 11:37:26,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 558 transitions, 1341 flow [2021-06-10 11:37:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:26,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:26,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:26,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:26,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:26,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:26,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,496 INFO L185 Difference]: Start difference. First operand has 607 places, 557 transitions, 1325 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:26,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 558 transitions, 1341 flow [2021-06-10 11:37:26,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 558 transitions, 1340 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:26,501 INFO L241 Difference]: Finished difference. Result has 610 places, 558 transitions, 1338 flow [2021-06-10 11:37:26,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=610, PETRI_TRANSITIONS=558} [2021-06-10 11:37:26,502 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 17 predicate places. [2021-06-10 11:37:26,502 INFO L480 AbstractCegarLoop]: Abstraction has has 610 places, 558 transitions, 1338 flow [2021-06-10 11:37:26,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:26,502 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:26,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2021-06-10 11:37:26,502 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1473512246, now seen corresponding path program 1 times [2021-06-10 11:37:26,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:26,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649063937] [2021-06-10 11:37:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:26,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:26,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:26,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649063937] [2021-06-10 11:37:26,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:26,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:26,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527774933] [2021-06-10 11:37:26,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:26,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:26,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:26,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 558 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:26,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:26,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:26,675 INFO L129 PetriNetUnfolder]: 34/658 cut-off events. [2021-06-10 11:37:26,675 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:26,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 658 events. 34/658 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2775 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 789. Up to 23 conditions per place. [2021-06-10 11:37:26,701 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2021-06-10 11:37:26,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 559 transitions, 1364 flow [2021-06-10 11:37:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:26,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:26,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:26,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:26,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:26,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:26,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,704 INFO L185 Difference]: Start difference. First operand has 610 places, 558 transitions, 1338 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:26,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 559 transitions, 1364 flow [2021-06-10 11:37:26,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 559 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:26,709 INFO L241 Difference]: Finished difference. Result has 613 places, 559 transitions, 1354 flow [2021-06-10 11:37:26,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=613, PETRI_TRANSITIONS=559} [2021-06-10 11:37:26,710 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 20 predicate places. [2021-06-10 11:37:26,710 INFO L480 AbstractCegarLoop]: Abstraction has has 613 places, 559 transitions, 1354 flow [2021-06-10 11:37:26,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:26,710 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:26,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2021-06-10 11:37:26,710 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1474466581, now seen corresponding path program 1 times [2021-06-10 11:37:26,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:26,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566202277] [2021-06-10 11:37:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:26,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:26,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:26,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566202277] [2021-06-10 11:37:26,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:26,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:26,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275113387] [2021-06-10 11:37:26,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:26,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:26,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:26,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 559 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:26,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:26,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:26,890 INFO L129 PetriNetUnfolder]: 33/655 cut-off events. [2021-06-10 11:37:26,890 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:37:26,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 655 events. 33/655 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2757 event pairs, 0 based on Foata normal form. 2/602 useless extension candidates. Maximal degree in co-relation 788. Up to 23 conditions per place. [2021-06-10 11:37:26,916 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 9 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2021-06-10 11:37:26,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 557 transitions, 1362 flow [2021-06-10 11:37:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2021-06-10 11:37:26,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167974882260597 [2021-06-10 11:37:26,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2021-06-10 11:37:26,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2021-06-10 11:37:26,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:26,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2021-06-10 11:37:26,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.0) internal successors, (1752), 3 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,919 INFO L185 Difference]: Start difference. First operand has 613 places, 559 transitions, 1354 flow. Second operand 3 states and 1752 transitions. [2021-06-10 11:37:26,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 557 transitions, 1362 flow [2021-06-10 11:37:26,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 557 transitions, 1361 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:26,924 INFO L241 Difference]: Finished difference. Result has 614 places, 557 transitions, 1343 flow [2021-06-10 11:37:26,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1343, PETRI_PLACES=614, PETRI_TRANSITIONS=557} [2021-06-10 11:37:26,924 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 21 predicate places. [2021-06-10 11:37:26,924 INFO L480 AbstractCegarLoop]: Abstraction has has 614 places, 557 transitions, 1343 flow [2021-06-10 11:37:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:26,924 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:26,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2021-06-10 11:37:26,925 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1474465558, now seen corresponding path program 1 times [2021-06-10 11:37:26,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:26,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268848874] [2021-06-10 11:37:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:26,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:26,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:26,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:26,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268848874] [2021-06-10 11:37:26,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:26,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:26,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870491788] [2021-06-10 11:37:26,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:26,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:26,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:26,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 557 transitions, 1343 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:26,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:26,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:26,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:27,090 INFO L129 PetriNetUnfolder]: 33/652 cut-off events. [2021-06-10 11:37:27,091 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:27,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 652 events. 33/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2733 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 782. Up to 23 conditions per place. [2021-06-10 11:37:27,116 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/554 dead transitions. [2021-06-10 11:37:27,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 554 transitions, 1344 flow [2021-06-10 11:37:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:27,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:27,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:27,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,119 INFO L185 Difference]: Start difference. First operand has 614 places, 557 transitions, 1343 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:27,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 554 transitions, 1344 flow [2021-06-10 11:37:27,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 554 transitions, 1339 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:27,124 INFO L241 Difference]: Finished difference. Result has 611 places, 554 transitions, 1329 flow [2021-06-10 11:37:27,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=611, PETRI_TRANSITIONS=554} [2021-06-10 11:37:27,124 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 18 predicate places. [2021-06-10 11:37:27,124 INFO L480 AbstractCegarLoop]: Abstraction has has 611 places, 554 transitions, 1329 flow [2021-06-10 11:37:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:27,125 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:27,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2021-06-10 11:37:27,125 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1955410608, now seen corresponding path program 1 times [2021-06-10 11:37:27,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:27,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98441269] [2021-06-10 11:37:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:27,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:27,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:27,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98441269] [2021-06-10 11:37:27,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:27,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:27,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464945196] [2021-06-10 11:37:27,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:27,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:27,140 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:27,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 554 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:27,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:27,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:27,298 INFO L129 PetriNetUnfolder]: 32/659 cut-off events. [2021-06-10 11:37:27,298 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:27,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 659 events. 32/659 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2790 event pairs, 0 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 792. Up to 23 conditions per place. [2021-06-10 11:37:27,321 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2021-06-10 11:37:27,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 555 transitions, 1345 flow [2021-06-10 11:37:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:27,322 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:27,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:27,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:27,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:27,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:27,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,324 INFO L185 Difference]: Start difference. First operand has 611 places, 554 transitions, 1329 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:27,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 555 transitions, 1345 flow [2021-06-10 11:37:27,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 555 transitions, 1344 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:27,329 INFO L241 Difference]: Finished difference. Result has 613 places, 554 transitions, 1333 flow [2021-06-10 11:37:27,329 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1333, PETRI_PLACES=613, PETRI_TRANSITIONS=554} [2021-06-10 11:37:27,329 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 20 predicate places. [2021-06-10 11:37:27,330 INFO L480 AbstractCegarLoop]: Abstraction has has 613 places, 554 transitions, 1333 flow [2021-06-10 11:37:27,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:27,330 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:27,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2021-06-10 11:37:27,330 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1955411631, now seen corresponding path program 1 times [2021-06-10 11:37:27,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:27,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301169549] [2021-06-10 11:37:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:27,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:27,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:27,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301169549] [2021-06-10 11:37:27,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:27,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:27,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124487320] [2021-06-10 11:37:27,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:27,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:27,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:27,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 554 transitions, 1333 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:27,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:27,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:27,507 INFO L129 PetriNetUnfolder]: 30/661 cut-off events. [2021-06-10 11:37:27,507 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:27,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 661 events. 30/661 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2824 event pairs, 0 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 801. Up to 23 conditions per place. [2021-06-10 11:37:27,533 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/555 dead transitions. [2021-06-10 11:37:27,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 555 transitions, 1359 flow [2021-06-10 11:37:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:27,534 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:27,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:27,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:27,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:27,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:27,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,536 INFO L185 Difference]: Start difference. First operand has 613 places, 554 transitions, 1333 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:27,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 555 transitions, 1359 flow [2021-06-10 11:37:27,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 555 transitions, 1358 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:27,542 INFO L241 Difference]: Finished difference. Result has 616 places, 555 transitions, 1350 flow [2021-06-10 11:37:27,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=616, PETRI_TRANSITIONS=555} [2021-06-10 11:37:27,542 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 23 predicate places. [2021-06-10 11:37:27,542 INFO L480 AbstractCegarLoop]: Abstraction has has 616 places, 555 transitions, 1350 flow [2021-06-10 11:37:27,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:27,542 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:27,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2021-06-10 11:37:27,542 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1954458319, now seen corresponding path program 1 times [2021-06-10 11:37:27,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:27,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404261533] [2021-06-10 11:37:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:27,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:27,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:27,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404261533] [2021-06-10 11:37:27,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:27,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:27,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636235513] [2021-06-10 11:37:27,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:27,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:27,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:27,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 555 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:27,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:27,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:27,711 INFO L129 PetriNetUnfolder]: 30/654 cut-off events. [2021-06-10 11:37:27,711 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:27,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 654 events. 30/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2767 event pairs, 0 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 787. Up to 23 conditions per place. [2021-06-10 11:37:27,738 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/553 dead transitions. [2021-06-10 11:37:27,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 553 transitions, 1352 flow [2021-06-10 11:37:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:27,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:27,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:27,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:27,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,741 INFO L185 Difference]: Start difference. First operand has 616 places, 555 transitions, 1350 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:27,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 553 transitions, 1352 flow [2021-06-10 11:37:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 553 transitions, 1344 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:27,746 INFO L241 Difference]: Finished difference. Result has 616 places, 553 transitions, 1337 flow [2021-06-10 11:37:27,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1337, PETRI_PLACES=616, PETRI_TRANSITIONS=553} [2021-06-10 11:37:27,746 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 23 predicate places. [2021-06-10 11:37:27,746 INFO L480 AbstractCegarLoop]: Abstraction has has 616 places, 553 transitions, 1337 flow [2021-06-10 11:37:27,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:27,746 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:27,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2021-06-10 11:37:27,747 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1954457296, now seen corresponding path program 1 times [2021-06-10 11:37:27,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:27,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638224414] [2021-06-10 11:37:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:27,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:27,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:27,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638224414] [2021-06-10 11:37:27,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:27,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:27,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401292802] [2021-06-10 11:37:27,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:27,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:27,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:27,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 553 transitions, 1337 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:27,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:27,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:27,920 INFO L129 PetriNetUnfolder]: 30/652 cut-off events. [2021-06-10 11:37:27,920 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:27,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 652 events. 30/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2749 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 791. Up to 23 conditions per place. [2021-06-10 11:37:27,945 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2021-06-10 11:37:27,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 551 transitions, 1350 flow [2021-06-10 11:37:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:27,946 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:27,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:27,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:27,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:27,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:27,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,948 INFO L185 Difference]: Start difference. First operand has 616 places, 553 transitions, 1337 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:27,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 551 transitions, 1350 flow [2021-06-10 11:37:27,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 551 transitions, 1349 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:27,953 INFO L241 Difference]: Finished difference. Result has 615 places, 551 transitions, 1333 flow [2021-06-10 11:37:27,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1333, PETRI_PLACES=615, PETRI_TRANSITIONS=551} [2021-06-10 11:37:27,953 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 22 predicate places. [2021-06-10 11:37:27,953 INFO L480 AbstractCegarLoop]: Abstraction has has 615 places, 551 transitions, 1333 flow [2021-06-10 11:37:27,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:27,953 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:27,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2021-06-10 11:37:27,953 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1733457078, now seen corresponding path program 1 times [2021-06-10 11:37:27,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:27,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188268102] [2021-06-10 11:37:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:27,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:27,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:27,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:27,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188268102] [2021-06-10 11:37:27,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:27,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:27,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152606788] [2021-06-10 11:37:27,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:27,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:27,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:27,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 551 transitions, 1333 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:27,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:27,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:27,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:28,133 INFO L129 PetriNetUnfolder]: 29/660 cut-off events. [2021-06-10 11:37:28,134 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:28,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 660 events. 29/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2820 event pairs, 0 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 803. Up to 23 conditions per place. [2021-06-10 11:37:28,159 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/553 dead transitions. [2021-06-10 11:37:28,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 553 transitions, 1363 flow [2021-06-10 11:37:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:28,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:28,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:28,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:28,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:28,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:28,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,162 INFO L185 Difference]: Start difference. First operand has 615 places, 551 transitions, 1333 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:28,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 553 transitions, 1363 flow [2021-06-10 11:37:28,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 553 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:28,168 INFO L241 Difference]: Finished difference. Result has 618 places, 553 transitions, 1356 flow [2021-06-10 11:37:28,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1356, PETRI_PLACES=618, PETRI_TRANSITIONS=553} [2021-06-10 11:37:28,168 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 25 predicate places. [2021-06-10 11:37:28,168 INFO L480 AbstractCegarLoop]: Abstraction has has 618 places, 553 transitions, 1356 flow [2021-06-10 11:37:28,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:28,168 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:28,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2021-06-10 11:37:28,168 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1733458101, now seen corresponding path program 1 times [2021-06-10 11:37:28,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:28,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708312922] [2021-06-10 11:37:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:28,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:28,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:28,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708312922] [2021-06-10 11:37:28,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:28,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:28,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943975269] [2021-06-10 11:37:28,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:28,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:28,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:28,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:28,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 553 transitions, 1356 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:28,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:28,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:28,343 INFO L129 PetriNetUnfolder]: 27/661 cut-off events. [2021-06-10 11:37:28,343 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:28,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 661 events. 27/661 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2841 event pairs, 0 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 803. Up to 23 conditions per place. [2021-06-10 11:37:28,369 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/553 dead transitions. [2021-06-10 11:37:28,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 553 transitions, 1368 flow [2021-06-10 11:37:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:28,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:28,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:28,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:28,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:28,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:28,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,373 INFO L185 Difference]: Start difference. First operand has 618 places, 553 transitions, 1356 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:28,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 553 transitions, 1368 flow [2021-06-10 11:37:28,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 553 transitions, 1363 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:28,378 INFO L241 Difference]: Finished difference. Result has 620 places, 552 transitions, 1352 flow [2021-06-10 11:37:28,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=620, PETRI_TRANSITIONS=552} [2021-06-10 11:37:28,378 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 27 predicate places. [2021-06-10 11:37:28,378 INFO L480 AbstractCegarLoop]: Abstraction has has 620 places, 552 transitions, 1352 flow [2021-06-10 11:37:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:28,379 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:28,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2021-06-10 11:37:28,379 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1734410390, now seen corresponding path program 1 times [2021-06-10 11:37:28,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:28,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885912733] [2021-06-10 11:37:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:28,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:28,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:28,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885912733] [2021-06-10 11:37:28,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:28,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:28,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503393136] [2021-06-10 11:37:28,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:28,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:28,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:28,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 552 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:28,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:28,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:28,566 INFO L129 PetriNetUnfolder]: 27/654 cut-off events. [2021-06-10 11:37:28,566 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:28,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 654 events. 27/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2783 event pairs, 0 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 797. Up to 23 conditions per place. [2021-06-10 11:37:28,585 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/550 dead transitions. [2021-06-10 11:37:28,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 550 transitions, 1355 flow [2021-06-10 11:37:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:28,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:28,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:28,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:28,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:28,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:28,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,588 INFO L185 Difference]: Start difference. First operand has 620 places, 552 transitions, 1352 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:28,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 550 transitions, 1355 flow [2021-06-10 11:37:28,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 550 transitions, 1348 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:28,593 INFO L241 Difference]: Finished difference. Result has 620 places, 550 transitions, 1341 flow [2021-06-10 11:37:28,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=620, PETRI_TRANSITIONS=550} [2021-06-10 11:37:28,593 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 27 predicate places. [2021-06-10 11:37:28,593 INFO L480 AbstractCegarLoop]: Abstraction has has 620 places, 550 transitions, 1341 flow [2021-06-10 11:37:28,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:28,594 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:28,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2021-06-10 11:37:28,594 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1734411413, now seen corresponding path program 1 times [2021-06-10 11:37:28,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:28,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446158563] [2021-06-10 11:37:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:28,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:28,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:28,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446158563] [2021-06-10 11:37:28,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:28,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:28,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779778387] [2021-06-10 11:37:28,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:28,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:28,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:28,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 550 transitions, 1341 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:28,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:28,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:28,769 INFO L129 PetriNetUnfolder]: 27/652 cut-off events. [2021-06-10 11:37:28,769 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:28,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 652 events. 27/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2767 event pairs, 0 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 797. Up to 23 conditions per place. [2021-06-10 11:37:28,794 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/548 dead transitions. [2021-06-10 11:37:28,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 548 transitions, 1354 flow [2021-06-10 11:37:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:28,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:28,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:28,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:28,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:28,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:28,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,797 INFO L185 Difference]: Start difference. First operand has 620 places, 550 transitions, 1341 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:28,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 548 transitions, 1354 flow [2021-06-10 11:37:28,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 548 transitions, 1353 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:28,802 INFO L241 Difference]: Finished difference. Result has 619 places, 548 transitions, 1337 flow [2021-06-10 11:37:28,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1337, PETRI_PLACES=619, PETRI_TRANSITIONS=548} [2021-06-10 11:37:28,802 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 26 predicate places. [2021-06-10 11:37:28,802 INFO L480 AbstractCegarLoop]: Abstraction has has 619 places, 548 transitions, 1337 flow [2021-06-10 11:37:28,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:28,802 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:28,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2021-06-10 11:37:28,802 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -872857722, now seen corresponding path program 1 times [2021-06-10 11:37:28,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:28,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102783516] [2021-06-10 11:37:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:28,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:28,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:28,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:28,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102783516] [2021-06-10 11:37:28,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:28,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:28,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297135579] [2021-06-10 11:37:28,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:28,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:28,818 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:28,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 548 transitions, 1337 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:28,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:28,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:28,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:28,975 INFO L129 PetriNetUnfolder]: 25/657 cut-off events. [2021-06-10 11:37:28,975 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:28,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 657 events. 25/657 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2820 event pairs, 0 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 800. Up to 23 conditions per place. [2021-06-10 11:37:29,000 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2021-06-10 11:37:29,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 549 transitions, 1353 flow [2021-06-10 11:37:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:29,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:29,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:29,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:29,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:29,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:29,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,003 INFO L185 Difference]: Start difference. First operand has 619 places, 548 transitions, 1337 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:29,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 549 transitions, 1353 flow [2021-06-10 11:37:29,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 549 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:29,008 INFO L241 Difference]: Finished difference. Result has 622 places, 549 transitions, 1350 flow [2021-06-10 11:37:29,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=622, PETRI_TRANSITIONS=549} [2021-06-10 11:37:29,008 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 29 predicate places. [2021-06-10 11:37:29,009 INFO L480 AbstractCegarLoop]: Abstraction has has 622 places, 549 transitions, 1350 flow [2021-06-10 11:37:29,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,009 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:29,009 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:29,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2021-06-10 11:37:29,009 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash -872858745, now seen corresponding path program 1 times [2021-06-10 11:37:29,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:29,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329200035] [2021-06-10 11:37:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:29,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:29,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:29,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329200035] [2021-06-10 11:37:29,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:29,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:29,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501913399] [2021-06-10 11:37:29,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:29,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:29,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:29,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:29,024 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:29,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 549 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:29,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:29,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:29,188 INFO L129 PetriNetUnfolder]: 25/658 cut-off events. [2021-06-10 11:37:29,189 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:29,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 658 events. 25/658 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2826 event pairs, 0 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 808. Up to 23 conditions per place. [2021-06-10 11:37:29,214 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/550 dead transitions. [2021-06-10 11:37:29,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 550 transitions, 1376 flow [2021-06-10 11:37:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:29,215 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:29,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:29,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:29,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:29,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:29,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,217 INFO L185 Difference]: Start difference. First operand has 622 places, 549 transitions, 1350 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:29,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 550 transitions, 1376 flow [2021-06-10 11:37:29,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 550 transitions, 1374 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:29,222 INFO L241 Difference]: Finished difference. Result has 625 places, 550 transitions, 1366 flow [2021-06-10 11:37:29,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=625, PETRI_TRANSITIONS=550} [2021-06-10 11:37:29,222 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 32 predicate places. [2021-06-10 11:37:29,222 INFO L480 AbstractCegarLoop]: Abstraction has has 625 places, 550 transitions, 1366 flow [2021-06-10 11:37:29,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,223 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:29,223 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:29,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2021-06-10 11:37:29,223 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:29,223 INFO L82 PathProgramCache]: Analyzing trace with hash -871905433, now seen corresponding path program 1 times [2021-06-10 11:37:29,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:29,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456518325] [2021-06-10 11:37:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:29,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:29,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:29,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456518325] [2021-06-10 11:37:29,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:29,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:29,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446518067] [2021-06-10 11:37:29,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:29,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:29,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:29,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 550 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:29,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:29,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:29,395 INFO L129 PetriNetUnfolder]: 24/654 cut-off events. [2021-06-10 11:37:29,395 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:29,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 654 events. 24/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2803 event pairs, 0 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 801. Up to 23 conditions per place. [2021-06-10 11:37:29,420 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/547 dead transitions. [2021-06-10 11:37:29,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 547 transitions, 1363 flow [2021-06-10 11:37:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:29,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:29,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:29,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:29,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:29,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:29,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,423 INFO L185 Difference]: Start difference. First operand has 625 places, 550 transitions, 1366 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:29,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 547 transitions, 1363 flow [2021-06-10 11:37:29,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 547 transitions, 1355 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:29,428 INFO L241 Difference]: Finished difference. Result has 624 places, 547 transitions, 1345 flow [2021-06-10 11:37:29,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=624, PETRI_TRANSITIONS=547} [2021-06-10 11:37:29,428 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 31 predicate places. [2021-06-10 11:37:29,428 INFO L480 AbstractCegarLoop]: Abstraction has has 624 places, 547 transitions, 1345 flow [2021-06-10 11:37:29,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:29,429 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:29,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2021-06-10 11:37:29,429 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -871904410, now seen corresponding path program 1 times [2021-06-10 11:37:29,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:29,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045496354] [2021-06-10 11:37:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:29,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:29,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:29,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045496354] [2021-06-10 11:37:29,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:29,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:29,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424047723] [2021-06-10 11:37:29,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:29,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:29,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:29,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 547 transitions, 1345 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:29,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:29,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:29,606 INFO L129 PetriNetUnfolder]: 24/652 cut-off events. [2021-06-10 11:37:29,606 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:29,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 652 events. 24/652 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2788 event pairs, 0 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 804. Up to 23 conditions per place. [2021-06-10 11:37:29,631 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2021-06-10 11:37:29,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 545 transitions, 1358 flow [2021-06-10 11:37:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:29,632 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:29,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:29,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:29,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:29,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:29,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,634 INFO L185 Difference]: Start difference. First operand has 624 places, 547 transitions, 1345 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:29,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 545 transitions, 1358 flow [2021-06-10 11:37:29,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 545 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:29,639 INFO L241 Difference]: Finished difference. Result has 623 places, 545 transitions, 1341 flow [2021-06-10 11:37:29,639 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1341, PETRI_PLACES=623, PETRI_TRANSITIONS=545} [2021-06-10 11:37:29,639 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 30 predicate places. [2021-06-10 11:37:29,639 INFO L480 AbstractCegarLoop]: Abstraction has has 623 places, 545 transitions, 1341 flow [2021-06-10 11:37:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:29,640 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:29,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2021-06-10 11:37:29,640 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash -201906268, now seen corresponding path program 1 times [2021-06-10 11:37:29,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:29,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129749313] [2021-06-10 11:37:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:29,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:29,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:29,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129749313] [2021-06-10 11:37:29,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:29,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:29,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240940682] [2021-06-10 11:37:29,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:29,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:29,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:29,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 545 transitions, 1341 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:29,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:29,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:29,823 INFO L129 PetriNetUnfolder]: 23/660 cut-off events. [2021-06-10 11:37:29,824 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:29,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 660 events. 23/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2858 event pairs, 0 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 816. Up to 23 conditions per place. [2021-06-10 11:37:29,872 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2021-06-10 11:37:29,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 547 transitions, 1371 flow [2021-06-10 11:37:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:29,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:29,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:29,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:29,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:29,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:29,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,875 INFO L185 Difference]: Start difference. First operand has 623 places, 545 transitions, 1341 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:29,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 547 transitions, 1371 flow [2021-06-10 11:37:29,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 547 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:29,880 INFO L241 Difference]: Finished difference. Result has 626 places, 547 transitions, 1364 flow [2021-06-10 11:37:29,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1364, PETRI_PLACES=626, PETRI_TRANSITIONS=547} [2021-06-10 11:37:29,880 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 33 predicate places. [2021-06-10 11:37:29,880 INFO L480 AbstractCegarLoop]: Abstraction has has 626 places, 547 transitions, 1364 flow [2021-06-10 11:37:29,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:29,880 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:29,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2021-06-10 11:37:29,880 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash -201905245, now seen corresponding path program 1 times [2021-06-10 11:37:29,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:29,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897368486] [2021-06-10 11:37:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:29,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:29,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:29,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:29,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897368486] [2021-06-10 11:37:29,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:29,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:29,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527871127] [2021-06-10 11:37:29,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:29,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:29,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:29,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 547 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:29,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:29,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:29,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:30,056 INFO L129 PetriNetUnfolder]: 22/658 cut-off events. [2021-06-10 11:37:30,057 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:30,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 658 events. 22/658 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2842 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 813. Up to 23 conditions per place. [2021-06-10 11:37:30,082 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/547 dead transitions. [2021-06-10 11:37:30,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 547 transitions, 1376 flow [2021-06-10 11:37:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:30,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:30,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:30,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,085 INFO L185 Difference]: Start difference. First operand has 626 places, 547 transitions, 1364 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:30,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 547 transitions, 1376 flow [2021-06-10 11:37:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 547 transitions, 1371 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:30,090 INFO L241 Difference]: Finished difference. Result has 629 places, 547 transitions, 1369 flow [2021-06-10 11:37:30,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1369, PETRI_PLACES=629, PETRI_TRANSITIONS=547} [2021-06-10 11:37:30,090 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 36 predicate places. [2021-06-10 11:37:30,090 INFO L480 AbstractCegarLoop]: Abstraction has has 629 places, 547 transitions, 1369 flow [2021-06-10 11:37:30,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,090 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:30,090 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:30,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2021-06-10 11:37:30,090 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash -200952956, now seen corresponding path program 1 times [2021-06-10 11:37:30,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:30,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241536067] [2021-06-10 11:37:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:30,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:30,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:30,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241536067] [2021-06-10 11:37:30,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:30,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:30,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887832009] [2021-06-10 11:37:30,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:30,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:30,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:30,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:30,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 547 transitions, 1369 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:30,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:30,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:30,264 INFO L129 PetriNetUnfolder]: 21/654 cut-off events. [2021-06-10 11:37:30,264 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:30,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 654 events. 21/654 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2818 event pairs, 0 based on Foata normal form. 1/613 useless extension candidates. Maximal degree in co-relation 810. Up to 23 conditions per place. [2021-06-10 11:37:30,289 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2021-06-10 11:37:30,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 544 transitions, 1366 flow [2021-06-10 11:37:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:30,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:30,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:30,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:30,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:30,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:30,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,292 INFO L185 Difference]: Start difference. First operand has 629 places, 547 transitions, 1369 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:30,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 544 transitions, 1366 flow [2021-06-10 11:37:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 544 transitions, 1359 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:30,297 INFO L241 Difference]: Finished difference. Result has 628 places, 544 transitions, 1349 flow [2021-06-10 11:37:30,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=628, PETRI_TRANSITIONS=544} [2021-06-10 11:37:30,297 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 35 predicate places. [2021-06-10 11:37:30,297 INFO L480 AbstractCegarLoop]: Abstraction has has 628 places, 544 transitions, 1349 flow [2021-06-10 11:37:30,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:30,298 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:30,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2021-06-10 11:37:30,298 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -200951933, now seen corresponding path program 1 times [2021-06-10 11:37:30,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:30,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542613044] [2021-06-10 11:37:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:30,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:30,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:30,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542613044] [2021-06-10 11:37:30,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:30,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:30,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564842632] [2021-06-10 11:37:30,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:30,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:30,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:30,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 544 transitions, 1349 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:30,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:30,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:30,475 INFO L129 PetriNetUnfolder]: 21/652 cut-off events. [2021-06-10 11:37:30,475 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:30,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 652 events. 21/652 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2802 event pairs, 0 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 811. Up to 23 conditions per place. [2021-06-10 11:37:30,500 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2021-06-10 11:37:30,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 542 transitions, 1362 flow [2021-06-10 11:37:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:30,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:30,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:30,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:30,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:30,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:30,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,503 INFO L185 Difference]: Start difference. First operand has 628 places, 544 transitions, 1349 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:30,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 542 transitions, 1362 flow [2021-06-10 11:37:30,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 542 transitions, 1361 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:30,508 INFO L241 Difference]: Finished difference. Result has 627 places, 542 transitions, 1345 flow [2021-06-10 11:37:30,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1345, PETRI_PLACES=627, PETRI_TRANSITIONS=542} [2021-06-10 11:37:30,508 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 34 predicate places. [2021-06-10 11:37:30,508 INFO L480 AbstractCegarLoop]: Abstraction has has 627 places, 542 transitions, 1345 flow [2021-06-10 11:37:30,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:30,508 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:30,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2021-06-10 11:37:30,509 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash 30423105, now seen corresponding path program 1 times [2021-06-10 11:37:30,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:30,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776853738] [2021-06-10 11:37:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:30,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:30,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:30,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776853738] [2021-06-10 11:37:30,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:30,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:30,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680416207] [2021-06-10 11:37:30,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:30,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:30,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:30,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 542 transitions, 1345 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:30,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:30,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:30,708 INFO L129 PetriNetUnfolder]: 19/657 cut-off events. [2021-06-10 11:37:30,708 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:30,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 657 events. 19/657 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2856 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 814. Up to 23 conditions per place. [2021-06-10 11:37:30,734 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/543 dead transitions. [2021-06-10 11:37:30,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 543 transitions, 1361 flow [2021-06-10 11:37:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:30,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:30,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:30,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:30,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,737 INFO L185 Difference]: Start difference. First operand has 627 places, 542 transitions, 1345 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:30,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 543 transitions, 1361 flow [2021-06-10 11:37:30,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 543 transitions, 1360 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:30,742 INFO L241 Difference]: Finished difference. Result has 630 places, 543 transitions, 1358 flow [2021-06-10 11:37:30,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=630, PETRI_TRANSITIONS=543} [2021-06-10 11:37:30,743 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 37 predicate places. [2021-06-10 11:37:30,743 INFO L480 AbstractCegarLoop]: Abstraction has has 630 places, 543 transitions, 1358 flow [2021-06-10 11:37:30,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,743 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:30,743 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:30,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2021-06-10 11:37:30,743 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:30,743 INFO L82 PathProgramCache]: Analyzing trace with hash 30422082, now seen corresponding path program 1 times [2021-06-10 11:37:30,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:30,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134529509] [2021-06-10 11:37:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:30,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:30,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:30,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134529509] [2021-06-10 11:37:30,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:30,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:30,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476948100] [2021-06-10 11:37:30,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:30,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:30,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:30,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 543 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:30,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:30,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:30,934 INFO L129 PetriNetUnfolder]: 19/658 cut-off events. [2021-06-10 11:37:30,934 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:30,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 658 events. 19/658 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2863 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 822. Up to 23 conditions per place. [2021-06-10 11:37:30,959 INFO L132 encePairwiseOnDemand]: 633/637 looper letters, 9 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2021-06-10 11:37:30,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 544 transitions, 1384 flow [2021-06-10 11:37:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1753 transitions. [2021-06-10 11:37:30,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9173207744636316 [2021-06-10 11:37:30,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1753 transitions. [2021-06-10 11:37:30,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1753 transitions. [2021-06-10 11:37:30,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:30,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1753 transitions. [2021-06-10 11:37:30,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,962 INFO L185 Difference]: Start difference. First operand has 630 places, 543 transitions, 1358 flow. Second operand 3 states and 1753 transitions. [2021-06-10 11:37:30,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 544 transitions, 1384 flow [2021-06-10 11:37:30,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 544 transitions, 1382 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:30,968 INFO L241 Difference]: Finished difference. Result has 633 places, 544 transitions, 1374 flow [2021-06-10 11:37:30,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=633, PETRI_TRANSITIONS=544} [2021-06-10 11:37:30,968 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 40 predicate places. [2021-06-10 11:37:30,968 INFO L480 AbstractCegarLoop]: Abstraction has has 633 places, 544 transitions, 1374 flow [2021-06-10 11:37:30,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:30,968 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:30,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2021-06-10 11:37:30,968 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash 31376417, now seen corresponding path program 1 times [2021-06-10 11:37:30,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:30,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585907687] [2021-06-10 11:37:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:30,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:30,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:30,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:30,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585907687] [2021-06-10 11:37:30,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:30,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:30,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96770461] [2021-06-10 11:37:30,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:30,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:30,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:30,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 544 transitions, 1374 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:30,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:30,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:30,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:31,153 INFO L129 PetriNetUnfolder]: 18/655 cut-off events. [2021-06-10 11:37:31,153 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:37:31,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 655 events. 18/655 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2845 event pairs, 0 based on Foata normal form. 2/617 useless extension candidates. Maximal degree in co-relation 821. Up to 23 conditions per place. [2021-06-10 11:37:31,179 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 9 selfloop transitions, 1 changer transitions 0/542 dead transitions. [2021-06-10 11:37:31,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 542 transitions, 1382 flow [2021-06-10 11:37:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1752 transitions. [2021-06-10 11:37:31,180 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167974882260597 [2021-06-10 11:37:31,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1752 transitions. [2021-06-10 11:37:31,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1752 transitions. [2021-06-10 11:37:31,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:31,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1752 transitions. [2021-06-10 11:37:31,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 584.0) internal successors, (1752), 3 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,182 INFO L185 Difference]: Start difference. First operand has 633 places, 544 transitions, 1374 flow. Second operand 3 states and 1752 transitions. [2021-06-10 11:37:31,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 542 transitions, 1382 flow [2021-06-10 11:37:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 542 transitions, 1381 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:31,187 INFO L241 Difference]: Finished difference. Result has 634 places, 542 transitions, 1363 flow [2021-06-10 11:37:31,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=634, PETRI_TRANSITIONS=542} [2021-06-10 11:37:31,187 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 41 predicate places. [2021-06-10 11:37:31,187 INFO L480 AbstractCegarLoop]: Abstraction has has 634 places, 542 transitions, 1363 flow [2021-06-10 11:37:31,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:31,188 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:31,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2021-06-10 11:37:31,188 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 31375394, now seen corresponding path program 1 times [2021-06-10 11:37:31,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:31,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181664725] [2021-06-10 11:37:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:31,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:31,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:31,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181664725] [2021-06-10 11:37:31,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:31,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:31,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410205556] [2021-06-10 11:37:31,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:31,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:31,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:31,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:31,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 542 transitions, 1363 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:31,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:31,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:31,386 INFO L129 PetriNetUnfolder]: 18/652 cut-off events. [2021-06-10 11:37:31,387 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:31,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 652 events. 18/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2820 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 815. Up to 23 conditions per place. [2021-06-10 11:37:31,411 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/539 dead transitions. [2021-06-10 11:37:31,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 539 transitions, 1364 flow [2021-06-10 11:37:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:31,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:31,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:31,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:31,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:31,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:31,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,414 INFO L185 Difference]: Start difference. First operand has 634 places, 542 transitions, 1363 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:31,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 539 transitions, 1364 flow [2021-06-10 11:37:31,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 539 transitions, 1359 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:31,419 INFO L241 Difference]: Finished difference. Result has 631 places, 539 transitions, 1349 flow [2021-06-10 11:37:31,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=631, PETRI_TRANSITIONS=539} [2021-06-10 11:37:31,420 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 38 predicate places. [2021-06-10 11:37:31,420 INFO L480 AbstractCegarLoop]: Abstraction has has 631 places, 539 transitions, 1349 flow [2021-06-10 11:37:31,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:31,420 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:31,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2021-06-10 11:37:31,420 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1458742720, now seen corresponding path program 1 times [2021-06-10 11:37:31,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:31,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131614209] [2021-06-10 11:37:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:31,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:31,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:31,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131614209] [2021-06-10 11:37:31,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:31,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:31,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729474437] [2021-06-10 11:37:31,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:31,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:31,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:31,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 539 transitions, 1349 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:31,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:31,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:31,608 INFO L129 PetriNetUnfolder]: 17/660 cut-off events. [2021-06-10 11:37:31,608 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:31,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 660 events. 17/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2891 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 832. Up to 23 conditions per place. [2021-06-10 11:37:31,633 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/541 dead transitions. [2021-06-10 11:37:31,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 541 transitions, 1379 flow [2021-06-10 11:37:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:31,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:31,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:31,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:31,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:31,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:31,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,636 INFO L185 Difference]: Start difference. First operand has 631 places, 539 transitions, 1349 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:31,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 541 transitions, 1379 flow [2021-06-10 11:37:31,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 541 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:31,642 INFO L241 Difference]: Finished difference. Result has 634 places, 541 transitions, 1372 flow [2021-06-10 11:37:31,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1372, PETRI_PLACES=634, PETRI_TRANSITIONS=541} [2021-06-10 11:37:31,642 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 41 predicate places. [2021-06-10 11:37:31,642 INFO L480 AbstractCegarLoop]: Abstraction has has 634 places, 541 transitions, 1372 flow [2021-06-10 11:37:31,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:31,642 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:31,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2021-06-10 11:37:31,642 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1458741697, now seen corresponding path program 1 times [2021-06-10 11:37:31,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:31,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211662345] [2021-06-10 11:37:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:31,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:31,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:31,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211662345] [2021-06-10 11:37:31,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:31,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:31,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791244312] [2021-06-10 11:37:31,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:31,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:31,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:31,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 541 transitions, 1372 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:31,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:31,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:31,823 INFO L129 PetriNetUnfolder]: 15/661 cut-off events. [2021-06-10 11:37:31,824 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:31,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 661 events. 15/661 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2912 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 830. Up to 23 conditions per place. [2021-06-10 11:37:31,848 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 6 selfloop transitions, 1 changer transitions 0/541 dead transitions. [2021-06-10 11:37:31,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 541 transitions, 1384 flow [2021-06-10 11:37:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:31,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:31,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:31,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:31,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:31,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:31,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,851 INFO L185 Difference]: Start difference. First operand has 634 places, 541 transitions, 1372 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:31,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 541 transitions, 1384 flow [2021-06-10 11:37:31,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 541 transitions, 1379 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:31,857 INFO L241 Difference]: Finished difference. Result has 636 places, 540 transitions, 1368 flow [2021-06-10 11:37:31,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1368, PETRI_PLACES=636, PETRI_TRANSITIONS=540} [2021-06-10 11:37:31,857 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 43 predicate places. [2021-06-10 11:37:31,857 INFO L480 AbstractCegarLoop]: Abstraction has has 636 places, 540 transitions, 1368 flow [2021-06-10 11:37:31,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,857 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:31,857 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:31,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2021-06-10 11:37:31,857 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1457789408, now seen corresponding path program 1 times [2021-06-10 11:37:31,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:31,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885674560] [2021-06-10 11:37:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:31,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:31,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:31,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:31,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885674560] [2021-06-10 11:37:31,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:31,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:31,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462009817] [2021-06-10 11:37:31,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:31,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:31,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:31,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 540 transitions, 1368 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:31,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:31,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:31,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:32,039 INFO L129 PetriNetUnfolder]: 15/654 cut-off events. [2021-06-10 11:37:32,039 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:32,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 654 events. 15/654 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2855 event pairs, 0 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 824. Up to 23 conditions per place. [2021-06-10 11:37:32,064 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2021-06-10 11:37:32,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 538 transitions, 1371 flow [2021-06-10 11:37:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:32,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:32,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:32,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,067 INFO L185 Difference]: Start difference. First operand has 636 places, 540 transitions, 1368 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:32,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 538 transitions, 1371 flow [2021-06-10 11:37:32,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 538 transitions, 1364 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:32,072 INFO L241 Difference]: Finished difference. Result has 636 places, 538 transitions, 1357 flow [2021-06-10 11:37:32,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1357, PETRI_PLACES=636, PETRI_TRANSITIONS=538} [2021-06-10 11:37:32,072 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 43 predicate places. [2021-06-10 11:37:32,072 INFO L480 AbstractCegarLoop]: Abstraction has has 636 places, 538 transitions, 1357 flow [2021-06-10 11:37:32,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:32,072 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:32,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2021-06-10 11:37:32,073 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1457788385, now seen corresponding path program 1 times [2021-06-10 11:37:32,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:32,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51605087] [2021-06-10 11:37:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:32,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:32,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:32,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51605087] [2021-06-10 11:37:32,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:32,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:32,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917596498] [2021-06-10 11:37:32,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:32,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:32,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:32,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 538 transitions, 1357 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:32,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:32,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:32,258 INFO L129 PetriNetUnfolder]: 15/652 cut-off events. [2021-06-10 11:37:32,258 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:32,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 652 events. 15/652 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2838 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 824. Up to 23 conditions per place. [2021-06-10 11:37:32,283 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2021-06-10 11:37:32,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 536 transitions, 1370 flow [2021-06-10 11:37:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:32,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:32,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:32,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:32,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:32,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:32,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,286 INFO L185 Difference]: Start difference. First operand has 636 places, 538 transitions, 1357 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:32,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 536 transitions, 1370 flow [2021-06-10 11:37:32,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 536 transitions, 1369 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:32,291 INFO L241 Difference]: Finished difference. Result has 635 places, 536 transitions, 1353 flow [2021-06-10 11:37:32,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=635, PETRI_TRANSITIONS=536} [2021-06-10 11:37:32,291 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 42 predicate places. [2021-06-10 11:37:32,291 INFO L480 AbstractCegarLoop]: Abstraction has has 635 places, 536 transitions, 1353 flow [2021-06-10 11:37:32,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,291 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:32,292 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:32,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2021-06-10 11:37:32,292 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -247425535, now seen corresponding path program 1 times [2021-06-10 11:37:32,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:32,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588834912] [2021-06-10 11:37:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:32,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:32,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:32,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588834912] [2021-06-10 11:37:32,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:32,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:32,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750160545] [2021-06-10 11:37:32,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:32,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:32,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:32,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 536 transitions, 1353 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:32,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:32,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:32,484 INFO L129 PetriNetUnfolder]: 14/660 cut-off events. [2021-06-10 11:37:32,484 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:32,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 660 events. 14/660 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2909 event pairs, 0 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 836. Up to 23 conditions per place. [2021-06-10 11:37:32,509 INFO L132 encePairwiseOnDemand]: 632/637 looper letters, 10 selfloop transitions, 3 changer transitions 0/538 dead transitions. [2021-06-10 11:37:32,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 538 transitions, 1383 flow [2021-06-10 11:37:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1755 transitions. [2021-06-10 11:37:32,511 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9183673469387755 [2021-06-10 11:37:32,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1755 transitions. [2021-06-10 11:37:32,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1755 transitions. [2021-06-10 11:37:32,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:32,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1755 transitions. [2021-06-10 11:37:32,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 585.0) internal successors, (1755), 3 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,513 INFO L185 Difference]: Start difference. First operand has 635 places, 536 transitions, 1353 flow. Second operand 3 states and 1755 transitions. [2021-06-10 11:37:32,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 538 transitions, 1383 flow [2021-06-10 11:37:32,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 538 transitions, 1382 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:32,518 INFO L241 Difference]: Finished difference. Result has 638 places, 538 transitions, 1376 flow [2021-06-10 11:37:32,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1376, PETRI_PLACES=638, PETRI_TRANSITIONS=538} [2021-06-10 11:37:32,518 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 45 predicate places. [2021-06-10 11:37:32,518 INFO L480 AbstractCegarLoop]: Abstraction has has 638 places, 538 transitions, 1376 flow [2021-06-10 11:37:32,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,518 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:32,518 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:32,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2021-06-10 11:37:32,519 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash -247424512, now seen corresponding path program 1 times [2021-06-10 11:37:32,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:32,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436555413] [2021-06-10 11:37:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:32,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:32,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:32,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436555413] [2021-06-10 11:37:32,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:32,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:32,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944533967] [2021-06-10 11:37:32,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:32,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:32,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:32,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 538 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:32,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:32,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:32,721 INFO L129 PetriNetUnfolder]: 13/658 cut-off events. [2021-06-10 11:37:32,722 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:32,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 658 events. 13/658 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2899 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 833. Up to 23 conditions per place. [2021-06-10 11:37:32,746 INFO L132 encePairwiseOnDemand]: 634/637 looper letters, 5 selfloop transitions, 2 changer transitions 0/538 dead transitions. [2021-06-10 11:37:32,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 538 transitions, 1388 flow [2021-06-10 11:37:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1763 transitions. [2021-06-10 11:37:32,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225536368393511 [2021-06-10 11:37:32,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1763 transitions. [2021-06-10 11:37:32,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1763 transitions. [2021-06-10 11:37:32,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:32,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1763 transitions. [2021-06-10 11:37:32,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.6666666666666) internal successors, (1763), 3 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,750 INFO L185 Difference]: Start difference. First operand has 638 places, 538 transitions, 1376 flow. Second operand 3 states and 1763 transitions. [2021-06-10 11:37:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 538 transitions, 1388 flow [2021-06-10 11:37:32,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 538 transitions, 1383 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:32,755 INFO L241 Difference]: Finished difference. Result has 641 places, 538 transitions, 1381 flow [2021-06-10 11:37:32,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1381, PETRI_PLACES=641, PETRI_TRANSITIONS=538} [2021-06-10 11:37:32,755 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 48 predicate places. [2021-06-10 11:37:32,755 INFO L480 AbstractCegarLoop]: Abstraction has has 641 places, 538 transitions, 1381 flow [2021-06-10 11:37:32,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:32,755 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:32,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2021-06-10 11:37:32,755 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -246472223, now seen corresponding path program 1 times [2021-06-10 11:37:32,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:32,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70185780] [2021-06-10 11:37:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:32,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:32,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:32,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70185780] [2021-06-10 11:37:32,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:32,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:32,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866376715] [2021-06-10 11:37:32,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:32,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:32,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:32,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 637 [2021-06-10 11:37:32,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 538 transitions, 1381 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:32,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 637 [2021-06-10 11:37:32,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:32,937 INFO L129 PetriNetUnfolder]: 12/654 cut-off events. [2021-06-10 11:37:32,938 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:32,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 654 events. 12/654 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2874 event pairs, 0 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 830. Up to 23 conditions per place. [2021-06-10 11:37:32,962 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 5 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2021-06-10 11:37:32,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 535 transitions, 1378 flow [2021-06-10 11:37:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2021-06-10 11:37:32,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9220303506017792 [2021-06-10 11:37:32,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:32,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1762 transitions. [2021-06-10 11:37:32,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 587.3333333333334) internal successors, (1762), 3 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,966 INFO L185 Difference]: Start difference. First operand has 641 places, 538 transitions, 1381 flow. Second operand 3 states and 1762 transitions. [2021-06-10 11:37:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 535 transitions, 1378 flow [2021-06-10 11:37:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 535 transitions, 1371 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:32,971 INFO L241 Difference]: Finished difference. Result has 640 places, 535 transitions, 1361 flow [2021-06-10 11:37:32,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=640, PETRI_TRANSITIONS=535} [2021-06-10 11:37:32,971 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 47 predicate places. [2021-06-10 11:37:32,971 INFO L480 AbstractCegarLoop]: Abstraction has has 640 places, 535 transitions, 1361 flow [2021-06-10 11:37:32,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:32,972 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:32,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2021-06-10 11:37:32,972 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash -246471200, now seen corresponding path program 1 times [2021-06-10 11:37:32,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:32,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785802451] [2021-06-10 11:37:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:32,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:32,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:32,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:32,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785802451] [2021-06-10 11:37:32,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:32,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:32,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902616062] [2021-06-10 11:37:32,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:32,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:32,989 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 637 [2021-06-10 11:37:32,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 535 transitions, 1361 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:32,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:32,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 637 [2021-06-10 11:37:32,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:33,158 INFO L129 PetriNetUnfolder]: 12/652 cut-off events. [2021-06-10 11:37:33,158 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-10 11:37:33,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 652 events. 12/652 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2856 event pairs, 0 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 831. Up to 23 conditions per place. [2021-06-10 11:37:33,183 INFO L132 encePairwiseOnDemand]: 635/637 looper letters, 8 selfloop transitions, 1 changer transitions 0/533 dead transitions. [2021-06-10 11:37:33,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 533 transitions, 1374 flow [2021-06-10 11:37:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1750 transitions. [2021-06-10 11:37:33,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2021-06-10 11:37:33,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1750 transitions. [2021-06-10 11:37:33,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1750 transitions. [2021-06-10 11:37:33,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:33,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1750 transitions. [2021-06-10 11:37:33,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 583.3333333333334) internal successors, (1750), 3 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 637.0) internal successors, (2548), 4 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,186 INFO L185 Difference]: Start difference. First operand has 640 places, 535 transitions, 1361 flow. Second operand 3 states and 1750 transitions. [2021-06-10 11:37:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 533 transitions, 1374 flow [2021-06-10 11:37:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 533 transitions, 1373 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:33,191 INFO L241 Difference]: Finished difference. Result has 639 places, 533 transitions, 1357 flow [2021-06-10 11:37:33,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=637, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1357, PETRI_PLACES=639, PETRI_TRANSITIONS=533} [2021-06-10 11:37:33,191 INFO L343 CegarLoopForPetriNet]: 593 programPoint places, 46 predicate places. [2021-06-10 11:37:33,191 INFO L480 AbstractCegarLoop]: Abstraction has has 639 places, 533 transitions, 1357 flow [2021-06-10 11:37:33,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:33,192 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:33,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2021-06-10 11:37:33,192 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:33,192 INFO L82 PathProgramCache]: Analyzing trace with hash -115028915, now seen corresponding path program 1 times [2021-06-10 11:37:33,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:33,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950582407] [2021-06-10 11:37:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:33,203 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:33,207 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:33,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:37:33,218 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:37:33,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2021-06-10 11:37:33,218 WARN L342 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:37:33,218 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2021-06-10 11:37:33,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of23ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of23ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:33,345 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:37:33,346 INFO L253 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-06-10 11:37:33,346 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:37:33,346 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:37:33,346 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:37:33,346 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:37:33,346 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:37:33,346 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:37:33,346 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:37:33,346 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:37:33,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 619 places, 665 transitions, 1951 flow [2021-06-10 11:37:33,530 INFO L129 PetriNetUnfolder]: 116/871 cut-off events. [2021-06-10 11:37:33,530 INFO L130 PetriNetUnfolder]: For 2277/2277 co-relation queries the response was YES. [2021-06-10 11:37:33,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 871 events. 116/871 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3686 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1144. Up to 48 conditions per place. [2021-06-10 11:37:33,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 619 places, 665 transitions, 1951 flow [2021-06-10 11:37:33,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 619 places, 665 transitions, 1951 flow [2021-06-10 11:37:33,585 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:37:33,585 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:37:33,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:33,586 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-06-10 11:37:33,586 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -741247933, now seen corresponding path program 1 times [2021-06-10 11:37:33,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:33,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699389947] [2021-06-10 11:37:33,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:33,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:33,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:33,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:33,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699389947] [2021-06-10 11:37:33,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:33,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:33,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415450232] [2021-06-10 11:37:33,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:33,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:33,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:33,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 665 transitions, 1951 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:33,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:33,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:33,768 INFO L129 PetriNetUnfolder]: 68/689 cut-off events. [2021-06-10 11:37:33,768 INFO L130 PetriNetUnfolder]: For 2278/2278 co-relation queries the response was YES. [2021-06-10 11:37:33,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 689 events. 68/689 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2726 event pairs, 0 based on Foata normal form. 100/696 useless extension candidates. Maximal degree in co-relation 975. Up to 24 conditions per place. [2021-06-10 11:37:33,804 INFO L132 encePairwiseOnDemand]: 635/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/615 dead transitions. [2021-06-10 11:37:33,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 615 transitions, 1877 flow [2021-06-10 11:37:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2021-06-10 11:37:33,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2021-06-10 11:37:33,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1883 transitions. [2021-06-10 11:37:33,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1883 transitions. [2021-06-10 11:37:33,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:33,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1883 transitions. [2021-06-10 11:37:33,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,807 INFO L185 Difference]: Start difference. First operand has 619 places, 665 transitions, 1951 flow. Second operand 3 states and 1883 transitions. [2021-06-10 11:37:33,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 615 transitions, 1877 flow [2021-06-10 11:37:33,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 615 transitions, 1371 flow, removed 253 selfloop flow, removed 0 redundant places. [2021-06-10 11:37:33,814 INFO L241 Difference]: Finished difference. Result has 595 places, 615 transitions, 1365 flow [2021-06-10 11:37:33,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1365, PETRI_PLACES=595, PETRI_TRANSITIONS=615} [2021-06-10 11:37:33,815 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -24 predicate places. [2021-06-10 11:37:33,815 INFO L480 AbstractCegarLoop]: Abstraction has has 595 places, 615 transitions, 1365 flow [2021-06-10 11:37:33,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:33,815 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-06-10 11:37:33,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2021-06-10 11:37:33,815 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash -741248956, now seen corresponding path program 1 times [2021-06-10 11:37:33,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:33,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798451624] [2021-06-10 11:37:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:33,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:33,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:33,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:33,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:33,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798451624] [2021-06-10 11:37:33,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:33,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:33,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727228380] [2021-06-10 11:37:33,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:33,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:33,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:33,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:33,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 615 transitions, 1365 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:33,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:33,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:33,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:34,062 INFO L129 PetriNetUnfolder]: 66/690 cut-off events. [2021-06-10 11:37:34,062 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:34,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 690 events. 66/690 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2748 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 753. Up to 24 conditions per place. [2021-06-10 11:37:34,082 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2021-06-10 11:37:34,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 615 transitions, 1377 flow [2021-06-10 11:37:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:34,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:34,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:34,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,085 INFO L185 Difference]: Start difference. First operand has 595 places, 615 transitions, 1365 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 615 transitions, 1377 flow [2021-06-10 11:37:34,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 615 transitions, 1372 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:34,090 INFO L241 Difference]: Finished difference. Result has 597 places, 614 transitions, 1361 flow [2021-06-10 11:37:34,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=597, PETRI_TRANSITIONS=614} [2021-06-10 11:37:34,090 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -22 predicate places. [2021-06-10 11:37:34,090 INFO L480 AbstractCegarLoop]: Abstraction has has 597 places, 614 transitions, 1361 flow [2021-06-10 11:37:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:34,091 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-06-10 11:37:34,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2021-06-10 11:37:34,091 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash -742201245, now seen corresponding path program 1 times [2021-06-10 11:37:34,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:34,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789207077] [2021-06-10 11:37:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:34,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:34,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,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-06-10 11:37:34,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789207077] [2021-06-10 11:37:34,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:34,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:34,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568001845] [2021-06-10 11:37:34,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:34,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:34,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:34,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 614 transitions, 1361 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:34,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:34,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:34,253 INFO L129 PetriNetUnfolder]: 66/683 cut-off events. [2021-06-10 11:37:34,254 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:34,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 683 events. 66/683 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2695 event pairs, 0 based on Foata normal form. 1/596 useless extension candidates. Maximal degree in co-relation 755. Up to 24 conditions per place. [2021-06-10 11:37:34,285 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/612 dead transitions. [2021-06-10 11:37:34,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 612 transitions, 1364 flow [2021-06-10 11:37:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:34,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:34,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:34,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:34,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:34,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:34,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,289 INFO L185 Difference]: Start difference. First operand has 597 places, 614 transitions, 1361 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:34,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 612 transitions, 1364 flow [2021-06-10 11:37:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 612 transitions, 1357 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:34,294 INFO L241 Difference]: Finished difference. Result has 597 places, 612 transitions, 1350 flow [2021-06-10 11:37:34,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=597, PETRI_TRANSITIONS=612} [2021-06-10 11:37:34,294 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -22 predicate places. [2021-06-10 11:37:34,294 INFO L480 AbstractCegarLoop]: Abstraction has has 597 places, 612 transitions, 1350 flow [2021-06-10 11:37:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:34,294 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-06-10 11:37:34,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2021-06-10 11:37:34,294 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash -742202268, now seen corresponding path program 1 times [2021-06-10 11:37:34,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:34,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479354621] [2021-06-10 11:37:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:34,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:34,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:34,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479354621] [2021-06-10 11:37:34,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:34,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:34,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123591590] [2021-06-10 11:37:34,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:34,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:34,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:34,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 612 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:34,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:34,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:34,454 INFO L129 PetriNetUnfolder]: 66/681 cut-off events. [2021-06-10 11:37:34,455 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:34,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 681 events. 66/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2681 event pairs, 0 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 755. Up to 24 conditions per place. [2021-06-10 11:37:34,485 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2021-06-10 11:37:34,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 610 transitions, 1363 flow [2021-06-10 11:37:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:34,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:34,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:34,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:34,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:34,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:34,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:34,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,488 INFO L185 Difference]: Start difference. First operand has 597 places, 612 transitions, 1350 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:34,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 610 transitions, 1363 flow [2021-06-10 11:37:34,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 610 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:34,493 INFO L241 Difference]: Finished difference. Result has 596 places, 610 transitions, 1346 flow [2021-06-10 11:37:34,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1346, PETRI_PLACES=596, PETRI_TRANSITIONS=610} [2021-06-10 11:37:34,493 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -23 predicate places. [2021-06-10 11:37:34,493 INFO L480 AbstractCegarLoop]: Abstraction has has 596 places, 610 transitions, 1346 flow [2021-06-10 11:37:34,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:34,494 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:34,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2021-06-10 11:37:34,494 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash 928290639, now seen corresponding path program 1 times [2021-06-10 11:37:34,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:34,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175441861] [2021-06-10 11:37:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:34,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:34,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:34,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175441861] [2021-06-10 11:37:34,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:34,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:34,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574961851] [2021-06-10 11:37:34,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:34,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:34,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:34,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:34,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 610 transitions, 1346 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:34,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:34,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:34,660 INFO L129 PetriNetUnfolder]: 65/689 cut-off events. [2021-06-10 11:37:34,661 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:34,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 689 events. 65/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2751 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 767. Up to 24 conditions per place. [2021-06-10 11:37:34,691 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/612 dead transitions. [2021-06-10 11:37:34,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 612 transitions, 1376 flow [2021-06-10 11:37:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:34,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:34,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:34,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:34,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:34,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:34,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,695 INFO L185 Difference]: Start difference. First operand has 596 places, 610 transitions, 1346 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:34,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 612 transitions, 1376 flow [2021-06-10 11:37:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 612 transitions, 1375 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:34,700 INFO L241 Difference]: Finished difference. Result has 599 places, 612 transitions, 1369 flow [2021-06-10 11:37:34,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1369, PETRI_PLACES=599, PETRI_TRANSITIONS=612} [2021-06-10 11:37:34,700 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -20 predicate places. [2021-06-10 11:37:34,700 INFO L480 AbstractCegarLoop]: Abstraction has has 599 places, 612 transitions, 1369 flow [2021-06-10 11:37:34,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:34,700 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:34,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2021-06-10 11:37:34,701 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash 928291662, now seen corresponding path program 1 times [2021-06-10 11:37:34,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:34,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045743819] [2021-06-10 11:37:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:34,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:34,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:34,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045743819] [2021-06-10 11:37:34,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:34,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:34,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843323222] [2021-06-10 11:37:34,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:34,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:34,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:34,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 612 transitions, 1369 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:34,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:34,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:34,863 INFO L129 PetriNetUnfolder]: 64/687 cut-off events. [2021-06-10 11:37:34,863 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:34,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 687 events. 64/687 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2738 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 764. Up to 24 conditions per place. [2021-06-10 11:37:34,894 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/612 dead transitions. [2021-06-10 11:37:34,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 612 transitions, 1381 flow [2021-06-10 11:37:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:34,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:34,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:34,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:34,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,897 INFO L185 Difference]: Start difference. First operand has 599 places, 612 transitions, 1369 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:34,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 612 transitions, 1381 flow [2021-06-10 11:37:34,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 612 transitions, 1376 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:34,902 INFO L241 Difference]: Finished difference. Result has 602 places, 612 transitions, 1374 flow [2021-06-10 11:37:34,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=602, PETRI_TRANSITIONS=612} [2021-06-10 11:37:34,903 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -17 predicate places. [2021-06-10 11:37:34,903 INFO L480 AbstractCegarLoop]: Abstraction has has 602 places, 612 transitions, 1374 flow [2021-06-10 11:37:34,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:34,903 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:34,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2021-06-10 11:37:34,903 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 929243951, now seen corresponding path program 1 times [2021-06-10 11:37:34,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:34,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887056442] [2021-06-10 11:37:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:34,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:34,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:34,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:34,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887056442] [2021-06-10 11:37:34,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:34,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:34,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638588860] [2021-06-10 11:37:34,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:34,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:34,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:34,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 612 transitions, 1374 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:34,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:34,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:34,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:35,063 INFO L129 PetriNetUnfolder]: 63/683 cut-off events. [2021-06-10 11:37:35,063 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:35,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 683 events. 63/683 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2715 event pairs, 0 based on Foata normal form. 1/599 useless extension candidates. Maximal degree in co-relation 761. Up to 24 conditions per place. [2021-06-10 11:37:35,093 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2021-06-10 11:37:35,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 609 transitions, 1371 flow [2021-06-10 11:37:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:35,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:35,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:35,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,097 INFO L185 Difference]: Start difference. First operand has 602 places, 612 transitions, 1374 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:35,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 609 transitions, 1371 flow [2021-06-10 11:37:35,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 609 transitions, 1364 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:35,102 INFO L241 Difference]: Finished difference. Result has 601 places, 609 transitions, 1354 flow [2021-06-10 11:37:35,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=601, PETRI_TRANSITIONS=609} [2021-06-10 11:37:35,102 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -18 predicate places. [2021-06-10 11:37:35,102 INFO L480 AbstractCegarLoop]: Abstraction has has 601 places, 609 transitions, 1354 flow [2021-06-10 11:37:35,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:35,102 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:35,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2021-06-10 11:37:35,102 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 929244974, now seen corresponding path program 1 times [2021-06-10 11:37:35,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:35,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099851302] [2021-06-10 11:37:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:35,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:35,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:35,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099851302] [2021-06-10 11:37:35,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:35,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:35,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722074850] [2021-06-10 11:37:35,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:35,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:35,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:35,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 609 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:35,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:35,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:35,264 INFO L129 PetriNetUnfolder]: 63/681 cut-off events. [2021-06-10 11:37:35,264 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:35,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 681 events. 63/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2699 event pairs, 0 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 762. Up to 24 conditions per place. [2021-06-10 11:37:35,294 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2021-06-10 11:37:35,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 607 transitions, 1367 flow [2021-06-10 11:37:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:35,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:35,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:35,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:35,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:35,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:35,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:35,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,297 INFO L185 Difference]: Start difference. First operand has 601 places, 609 transitions, 1354 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:35,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 607 transitions, 1367 flow [2021-06-10 11:37:35,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 607 transitions, 1366 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:35,302 INFO L241 Difference]: Finished difference. Result has 600 places, 607 transitions, 1350 flow [2021-06-10 11:37:35,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=600, PETRI_TRANSITIONS=607} [2021-06-10 11:37:35,302 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -19 predicate places. [2021-06-10 11:37:35,302 INFO L480 AbstractCegarLoop]: Abstraction has has 600 places, 607 transitions, 1350 flow [2021-06-10 11:37:35,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:35,303 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:35,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2021-06-10 11:37:35,303 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -156413254, now seen corresponding path program 1 times [2021-06-10 11:37:35,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:35,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155509504] [2021-06-10 11:37:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:35,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:35,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:35,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155509504] [2021-06-10 11:37:35,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:35,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:35,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043647105] [2021-06-10 11:37:35,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:35,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:35,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:35,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 607 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:35,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:35,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:35,476 INFO L129 PetriNetUnfolder]: 61/686 cut-off events. [2021-06-10 11:37:35,476 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:35,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 686 events. 61/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2749 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 765. Up to 24 conditions per place. [2021-06-10 11:37:35,501 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2021-06-10 11:37:35,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 608 transitions, 1366 flow [2021-06-10 11:37:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:35,502 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:35,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:35,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:35,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:35,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:35,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,504 INFO L185 Difference]: Start difference. First operand has 600 places, 607 transitions, 1350 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:35,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 608 transitions, 1366 flow [2021-06-10 11:37:35,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 608 transitions, 1365 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:35,509 INFO L241 Difference]: Finished difference. Result has 603 places, 608 transitions, 1363 flow [2021-06-10 11:37:35,509 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=603, PETRI_TRANSITIONS=608} [2021-06-10 11:37:35,509 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -16 predicate places. [2021-06-10 11:37:35,509 INFO L480 AbstractCegarLoop]: Abstraction has has 603 places, 608 transitions, 1363 flow [2021-06-10 11:37:35,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:35,509 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:35,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2021-06-10 11:37:35,509 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash -156414277, now seen corresponding path program 1 times [2021-06-10 11:37:35,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:35,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692619238] [2021-06-10 11:37:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:35,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:35,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:35,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692619238] [2021-06-10 11:37:35,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:35,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:35,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714074063] [2021-06-10 11:37:35,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:35,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:35,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:35,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 608 transitions, 1363 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:35,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:35,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:35,676 INFO L129 PetriNetUnfolder]: 61/687 cut-off events. [2021-06-10 11:37:35,677 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:35,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 687 events. 61/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2760 event pairs, 0 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 773. Up to 24 conditions per place. [2021-06-10 11:37:35,707 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/609 dead transitions. [2021-06-10 11:37:35,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 609 transitions, 1389 flow [2021-06-10 11:37:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:35,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:35,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:35,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:35,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:35,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:35,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,711 INFO L185 Difference]: Start difference. First operand has 603 places, 608 transitions, 1363 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:35,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 609 transitions, 1389 flow [2021-06-10 11:37:35,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 609 transitions, 1387 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:35,716 INFO L241 Difference]: Finished difference. Result has 606 places, 609 transitions, 1379 flow [2021-06-10 11:37:35,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1379, PETRI_PLACES=606, PETRI_TRANSITIONS=609} [2021-06-10 11:37:35,716 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -13 predicate places. [2021-06-10 11:37:35,716 INFO L480 AbstractCegarLoop]: Abstraction has has 606 places, 609 transitions, 1379 flow [2021-06-10 11:37:35,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:35,716 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:35,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2021-06-10 11:37:35,716 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:35,717 INFO L82 PathProgramCache]: Analyzing trace with hash -155460965, now seen corresponding path program 1 times [2021-06-10 11:37:35,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:35,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169495285] [2021-06-10 11:37:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:35,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:35,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:35,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169495285] [2021-06-10 11:37:35,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:35,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:35,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623776450] [2021-06-10 11:37:35,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:35,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:35,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:35,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 609 transitions, 1379 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:35,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:35,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:35,878 INFO L129 PetriNetUnfolder]: 60/683 cut-off events. [2021-06-10 11:37:35,878 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:35,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 683 events. 60/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2734 event pairs, 0 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 766. Up to 24 conditions per place. [2021-06-10 11:37:35,908 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2021-06-10 11:37:35,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 606 transitions, 1376 flow [2021-06-10 11:37:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:35,910 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:35,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:35,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:35,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,912 INFO L185 Difference]: Start difference. First operand has 606 places, 609 transitions, 1379 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:35,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 606 transitions, 1376 flow [2021-06-10 11:37:35,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 606 transitions, 1368 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:35,917 INFO L241 Difference]: Finished difference. Result has 605 places, 606 transitions, 1358 flow [2021-06-10 11:37:35,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=605, PETRI_TRANSITIONS=606} [2021-06-10 11:37:35,917 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -14 predicate places. [2021-06-10 11:37:35,917 INFO L480 AbstractCegarLoop]: Abstraction has has 605 places, 606 transitions, 1358 flow [2021-06-10 11:37:35,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:35,917 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:35,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2021-06-10 11:37:35,917 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash -155459942, now seen corresponding path program 1 times [2021-06-10 11:37:35,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:35,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447507065] [2021-06-10 11:37:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:35,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:35,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:35,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:35,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447507065] [2021-06-10 11:37:35,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:35,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:35,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8805057] [2021-06-10 11:37:35,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:35,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:35,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:35,932 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:35,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 606 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:35,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:35,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:35,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:36,080 INFO L129 PetriNetUnfolder]: 60/681 cut-off events. [2021-06-10 11:37:36,080 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:36,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 681 events. 60/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2717 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 769. Up to 24 conditions per place. [2021-06-10 11:37:36,110 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2021-06-10 11:37:36,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 604 transitions, 1371 flow [2021-06-10 11:37:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:36,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:36,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:36,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:36,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:36,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:36,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:36,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,113 INFO L185 Difference]: Start difference. First operand has 605 places, 606 transitions, 1358 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:36,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 604 transitions, 1371 flow [2021-06-10 11:37:36,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 604 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:36,118 INFO L241 Difference]: Finished difference. Result has 604 places, 604 transitions, 1354 flow [2021-06-10 11:37:36,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=604, PETRI_TRANSITIONS=604} [2021-06-10 11:37:36,118 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -15 predicate places. [2021-06-10 11:37:36,118 INFO L480 AbstractCegarLoop]: Abstraction has has 604 places, 604 transitions, 1354 flow [2021-06-10 11:37:36,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:36,119 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:36,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2021-06-10 11:37:36,119 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 558672423, now seen corresponding path program 1 times [2021-06-10 11:37:36,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:36,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025599037] [2021-06-10 11:37:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:36,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:36,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:36,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025599037] [2021-06-10 11:37:36,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:36,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:36,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230480966] [2021-06-10 11:37:36,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:36,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:36,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:36,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:36,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:36,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 604 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:36,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:36,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:36,284 INFO L129 PetriNetUnfolder]: 58/686 cut-off events. [2021-06-10 11:37:36,284 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:36,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 686 events. 58/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2768 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 772. Up to 24 conditions per place. [2021-06-10 11:37:36,314 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2021-06-10 11:37:36,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 605 transitions, 1370 flow [2021-06-10 11:37:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:36,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:36,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:36,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:36,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:36,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:36,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,318 INFO L185 Difference]: Start difference. First operand has 604 places, 604 transitions, 1354 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:36,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 605 transitions, 1370 flow [2021-06-10 11:37:36,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 605 transitions, 1369 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:36,323 INFO L241 Difference]: Finished difference. Result has 607 places, 605 transitions, 1367 flow [2021-06-10 11:37:36,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=607, PETRI_TRANSITIONS=605} [2021-06-10 11:37:36,323 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -12 predicate places. [2021-06-10 11:37:36,323 INFO L480 AbstractCegarLoop]: Abstraction has has 607 places, 605 transitions, 1367 flow [2021-06-10 11:37:36,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,323 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:36,323 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:36,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2021-06-10 11:37:36,324 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 558671400, now seen corresponding path program 1 times [2021-06-10 11:37:36,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:36,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553014447] [2021-06-10 11:37:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:36,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:36,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:36,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553014447] [2021-06-10 11:37:36,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:36,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:36,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225908003] [2021-06-10 11:37:36,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:36,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:36,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:36,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 605 transitions, 1367 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:36,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:36,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:36,494 INFO L129 PetriNetUnfolder]: 58/687 cut-off events. [2021-06-10 11:37:36,494 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:36,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 687 events. 58/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2775 event pairs, 0 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 780. Up to 24 conditions per place. [2021-06-10 11:37:36,524 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/606 dead transitions. [2021-06-10 11:37:36,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 606 transitions, 1393 flow [2021-06-10 11:37:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:36,525 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:36,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:36,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:36,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:36,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:36,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,527 INFO L185 Difference]: Start difference. First operand has 607 places, 605 transitions, 1367 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 606 transitions, 1393 flow [2021-06-10 11:37:36,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:36,532 INFO L241 Difference]: Finished difference. Result has 610 places, 606 transitions, 1383 flow [2021-06-10 11:37:36,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=610, PETRI_TRANSITIONS=606} [2021-06-10 11:37:36,533 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -9 predicate places. [2021-06-10 11:37:36,533 INFO L480 AbstractCegarLoop]: Abstraction has has 610 places, 606 transitions, 1383 flow [2021-06-10 11:37:36,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,533 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:36,533 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:36,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2021-06-10 11:37:36,533 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash 559625735, now seen corresponding path program 1 times [2021-06-10 11:37:36,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:36,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507518793] [2021-06-10 11:37:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:36,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:36,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:36,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507518793] [2021-06-10 11:37:36,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:36,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:36,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525797122] [2021-06-10 11:37:36,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:36,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:36,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:36,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:36,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:36,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 606 transitions, 1383 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:36,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:36,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:36,702 INFO L129 PetriNetUnfolder]: 57/684 cut-off events. [2021-06-10 11:37:36,702 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:37:36,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 684 events. 57/684 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2760 event pairs, 0 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 779. Up to 24 conditions per place. [2021-06-10 11:37:36,733 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2021-06-10 11:37:36,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 604 transitions, 1391 flow [2021-06-10 11:37:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2021-06-10 11:37:36,734 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172932330827067 [2021-06-10 11:37:36,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2021-06-10 11:37:36,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2021-06-10 11:37:36,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:36,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2021-06-10 11:37:36,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.0) internal successors, (1830), 3 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,736 INFO L185 Difference]: Start difference. First operand has 610 places, 606 transitions, 1383 flow. Second operand 3 states and 1830 transitions. [2021-06-10 11:37:36,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 604 transitions, 1391 flow [2021-06-10 11:37:36,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 604 transitions, 1390 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:36,741 INFO L241 Difference]: Finished difference. Result has 611 places, 604 transitions, 1372 flow [2021-06-10 11:37:36,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1372, PETRI_PLACES=611, PETRI_TRANSITIONS=604} [2021-06-10 11:37:36,741 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -8 predicate places. [2021-06-10 11:37:36,741 INFO L480 AbstractCegarLoop]: Abstraction has has 611 places, 604 transitions, 1372 flow [2021-06-10 11:37:36,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:36,742 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:36,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2021-06-10 11:37:36,742 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 559624712, now seen corresponding path program 1 times [2021-06-10 11:37:36,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:36,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871985579] [2021-06-10 11:37:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:36,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:36,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:36,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871985579] [2021-06-10 11:37:36,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:36,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:36,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492939741] [2021-06-10 11:37:36,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:36,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:36,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:36,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:36,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 604 transitions, 1372 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:36,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:36,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:36,910 INFO L129 PetriNetUnfolder]: 57/681 cut-off events. [2021-06-10 11:37:36,910 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:36,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 681 events. 57/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2734 event pairs, 0 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 773. Up to 24 conditions per place. [2021-06-10 11:37:36,938 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2021-06-10 11:37:36,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 601 transitions, 1373 flow [2021-06-10 11:37:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:36,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:36,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:36,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:36,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:36,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:36,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,942 INFO L185 Difference]: Start difference. First operand has 611 places, 604 transitions, 1372 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:36,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 601 transitions, 1373 flow [2021-06-10 11:37:36,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 601 transitions, 1368 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:36,947 INFO L241 Difference]: Finished difference. Result has 608 places, 601 transitions, 1358 flow [2021-06-10 11:37:36,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=608, PETRI_TRANSITIONS=601} [2021-06-10 11:37:36,947 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -11 predicate places. [2021-06-10 11:37:36,947 INFO L480 AbstractCegarLoop]: Abstraction has has 608 places, 601 transitions, 1358 flow [2021-06-10 11:37:36,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,947 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:36,947 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:36,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2021-06-10 11:37:36,947 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1457611019, now seen corresponding path program 1 times [2021-06-10 11:37:36,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:36,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234174228] [2021-06-10 11:37:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:36,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:36,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:36,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:36,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234174228] [2021-06-10 11:37:36,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:36,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:36,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108154327] [2021-06-10 11:37:36,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:36,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:36,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:36,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 601 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:36,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:36,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:36,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:37,127 INFO L129 PetriNetUnfolder]: 56/689 cut-off events. [2021-06-10 11:37:37,127 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:37,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 689 events. 56/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2805 event pairs, 0 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 790. Up to 24 conditions per place. [2021-06-10 11:37:37,157 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/603 dead transitions. [2021-06-10 11:37:37,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 603 transitions, 1388 flow [2021-06-10 11:37:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:37,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:37,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:37,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:37,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:37,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:37,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,160 INFO L185 Difference]: Start difference. First operand has 608 places, 601 transitions, 1358 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:37,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 603 transitions, 1388 flow [2021-06-10 11:37:37,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 603 transitions, 1387 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:37,165 INFO L241 Difference]: Finished difference. Result has 611 places, 603 transitions, 1381 flow [2021-06-10 11:37:37,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1381, PETRI_PLACES=611, PETRI_TRANSITIONS=603} [2021-06-10 11:37:37,165 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -8 predicate places. [2021-06-10 11:37:37,165 INFO L480 AbstractCegarLoop]: Abstraction has has 611 places, 603 transitions, 1381 flow [2021-06-10 11:37:37,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:37,166 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:37,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2021-06-10 11:37:37,166 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1457612042, now seen corresponding path program 1 times [2021-06-10 11:37:37,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:37,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375986596] [2021-06-10 11:37:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:37,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:37,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:37,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375986596] [2021-06-10 11:37:37,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:37,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:37,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003987877] [2021-06-10 11:37:37,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:37,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:37,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:37,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 603 transitions, 1381 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:37,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:37,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:37,339 INFO L129 PetriNetUnfolder]: 54/690 cut-off events. [2021-06-10 11:37:37,339 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:37,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 690 events. 54/690 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2830 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 788. Up to 24 conditions per place. [2021-06-10 11:37:37,370 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/603 dead transitions. [2021-06-10 11:37:37,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 603 transitions, 1393 flow [2021-06-10 11:37:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:37,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:37,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:37,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,374 INFO L185 Difference]: Start difference. First operand has 611 places, 603 transitions, 1381 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:37,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 603 transitions, 1393 flow [2021-06-10 11:37:37,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 603 transitions, 1388 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:37,379 INFO L241 Difference]: Finished difference. Result has 613 places, 602 transitions, 1377 flow [2021-06-10 11:37:37,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1377, PETRI_PLACES=613, PETRI_TRANSITIONS=602} [2021-06-10 11:37:37,379 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -6 predicate places. [2021-06-10 11:37:37,379 INFO L480 AbstractCegarLoop]: Abstraction has has 613 places, 602 transitions, 1377 flow [2021-06-10 11:37:37,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:37,379 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:37,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2021-06-10 11:37:37,380 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1458564331, now seen corresponding path program 1 times [2021-06-10 11:37:37,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:37,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232854998] [2021-06-10 11:37:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:37,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:37,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:37,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232854998] [2021-06-10 11:37:37,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:37,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:37,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382726010] [2021-06-10 11:37:37,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:37,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:37,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:37,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 602 transitions, 1377 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:37,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:37,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:37,546 INFO L129 PetriNetUnfolder]: 54/683 cut-off events. [2021-06-10 11:37:37,547 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:37,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 683 events. 54/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2768 event pairs, 0 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 782. Up to 24 conditions per place. [2021-06-10 11:37:37,576 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/600 dead transitions. [2021-06-10 11:37:37,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 600 transitions, 1380 flow [2021-06-10 11:37:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:37,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:37,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:37,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:37,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:37,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:37,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,579 INFO L185 Difference]: Start difference. First operand has 613 places, 602 transitions, 1377 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:37,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 600 transitions, 1380 flow [2021-06-10 11:37:37,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 600 transitions, 1373 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:37,584 INFO L241 Difference]: Finished difference. Result has 613 places, 600 transitions, 1366 flow [2021-06-10 11:37:37,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=613, PETRI_TRANSITIONS=600} [2021-06-10 11:37:37,584 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -6 predicate places. [2021-06-10 11:37:37,585 INFO L480 AbstractCegarLoop]: Abstraction has has 613 places, 600 transitions, 1366 flow [2021-06-10 11:37:37,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:37,585 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:37,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2021-06-10 11:37:37,585 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1458565354, now seen corresponding path program 1 times [2021-06-10 11:37:37,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:37,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564260381] [2021-06-10 11:37:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:37,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:37,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:37,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564260381] [2021-06-10 11:37:37,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:37,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:37,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281406132] [2021-06-10 11:37:37,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:37,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:37,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:37,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 600 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:37,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:37,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:37,755 INFO L129 PetriNetUnfolder]: 54/681 cut-off events. [2021-06-10 11:37:37,755 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:37,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 681 events. 54/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2752 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 782. Up to 24 conditions per place. [2021-06-10 11:37:37,786 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/598 dead transitions. [2021-06-10 11:37:37,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 598 transitions, 1379 flow [2021-06-10 11:37:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:37,787 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:37,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:37,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:37,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:37,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:37,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:37,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,789 INFO L185 Difference]: Start difference. First operand has 613 places, 600 transitions, 1366 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:37,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 598 transitions, 1379 flow [2021-06-10 11:37:37,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 598 transitions, 1378 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:37,794 INFO L241 Difference]: Finished difference. Result has 612 places, 598 transitions, 1362 flow [2021-06-10 11:37:37,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1362, PETRI_PLACES=612, PETRI_TRANSITIONS=598} [2021-06-10 11:37:37,794 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -7 predicate places. [2021-06-10 11:37:37,794 INFO L480 AbstractCegarLoop]: Abstraction has has 612 places, 598 transitions, 1362 flow [2021-06-10 11:37:37,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:37,795 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:37,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2021-06-10 11:37:37,795 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1575943909, now seen corresponding path program 1 times [2021-06-10 11:37:37,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:37,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239027045] [2021-06-10 11:37:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:37,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:37,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:37,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:37,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239027045] [2021-06-10 11:37:37,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:37,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:37,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142859414] [2021-06-10 11:37:37,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:37,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:37,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:37,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 598 transitions, 1362 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:37,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:37,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:37,964 INFO L129 PetriNetUnfolder]: 53/688 cut-off events. [2021-06-10 11:37:37,964 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:37,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 688 events. 53/688 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2812 event pairs, 0 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 787. Up to 24 conditions per place. [2021-06-10 11:37:37,994 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2021-06-10 11:37:37,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 599 transitions, 1378 flow [2021-06-10 11:37:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:37,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:37,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:37,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:37,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:37,997 INFO L185 Difference]: Start difference. First operand has 612 places, 598 transitions, 1362 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:37,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 599 transitions, 1378 flow [2021-06-10 11:37:37,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 599 transitions, 1377 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:38,002 INFO L241 Difference]: Finished difference. Result has 614 places, 598 transitions, 1366 flow [2021-06-10 11:37:38,002 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=614, PETRI_TRANSITIONS=598} [2021-06-10 11:37:38,002 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -5 predicate places. [2021-06-10 11:37:38,002 INFO L480 AbstractCegarLoop]: Abstraction has has 614 places, 598 transitions, 1366 flow [2021-06-10 11:37:38,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:38,003 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:38,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2021-06-10 11:37:38,003 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1575944932, now seen corresponding path program 1 times [2021-06-10 11:37:38,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:38,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948487156] [2021-06-10 11:37:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:38,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:38,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:38,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948487156] [2021-06-10 11:37:38,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:38,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:38,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669177338] [2021-06-10 11:37:38,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:38,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:38,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:38,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 598 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:38,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:38,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:38,204 INFO L129 PetriNetUnfolder]: 51/690 cut-off events. [2021-06-10 11:37:38,204 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:38,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 690 events. 51/690 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2845 event pairs, 0 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 798. Up to 24 conditions per place. [2021-06-10 11:37:38,224 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/599 dead transitions. [2021-06-10 11:37:38,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 599 transitions, 1392 flow [2021-06-10 11:37:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:38,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:38,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:38,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:38,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:38,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:38,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,227 INFO L185 Difference]: Start difference. First operand has 614 places, 598 transitions, 1366 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:38,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 599 transitions, 1392 flow [2021-06-10 11:37:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 599 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:38,232 INFO L241 Difference]: Finished difference. Result has 617 places, 599 transitions, 1383 flow [2021-06-10 11:37:38,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=617, PETRI_TRANSITIONS=599} [2021-06-10 11:37:38,232 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -2 predicate places. [2021-06-10 11:37:38,232 INFO L480 AbstractCegarLoop]: Abstraction has has 617 places, 599 transitions, 1383 flow [2021-06-10 11:37:38,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:38,233 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:38,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2021-06-10 11:37:38,233 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1574991620, now seen corresponding path program 1 times [2021-06-10 11:37:38,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:38,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935206886] [2021-06-10 11:37:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:38,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:38,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:38,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935206886] [2021-06-10 11:37:38,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:38,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:38,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129396379] [2021-06-10 11:37:38,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:38,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:38,247 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:38,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 599 transitions, 1383 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:38,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:38,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:38,402 INFO L129 PetriNetUnfolder]: 51/683 cut-off events. [2021-06-10 11:37:38,402 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:38,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 683 events. 51/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2788 event pairs, 0 based on Foata normal form. 1/611 useless extension candidates. Maximal degree in co-relation 784. Up to 24 conditions per place. [2021-06-10 11:37:38,431 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/597 dead transitions. [2021-06-10 11:37:38,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 597 transitions, 1385 flow [2021-06-10 11:37:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:38,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:38,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:38,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:38,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:38,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:38,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,434 INFO L185 Difference]: Start difference. First operand has 617 places, 599 transitions, 1383 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:38,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 597 transitions, 1385 flow [2021-06-10 11:37:38,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 597 transitions, 1377 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:38,439 INFO L241 Difference]: Finished difference. Result has 617 places, 597 transitions, 1370 flow [2021-06-10 11:37:38,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=617, PETRI_TRANSITIONS=597} [2021-06-10 11:37:38,439 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -2 predicate places. [2021-06-10 11:37:38,439 INFO L480 AbstractCegarLoop]: Abstraction has has 617 places, 597 transitions, 1370 flow [2021-06-10 11:37:38,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,440 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:38,440 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:38,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2021-06-10 11:37:38,440 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1574990597, now seen corresponding path program 1 times [2021-06-10 11:37:38,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:38,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346530311] [2021-06-10 11:37:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:38,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:38,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:38,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346530311] [2021-06-10 11:37:38,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:38,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:38,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464703707] [2021-06-10 11:37:38,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:38,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:38,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:38,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 597 transitions, 1370 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:38,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:38,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:38,610 INFO L129 PetriNetUnfolder]: 51/681 cut-off events. [2021-06-10 11:37:38,610 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:38,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 681 events. 51/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2773 event pairs, 0 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 788. Up to 24 conditions per place. [2021-06-10 11:37:38,638 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2021-06-10 11:37:38,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 595 transitions, 1383 flow [2021-06-10 11:37:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:38,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:38,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:38,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:38,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:38,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:38,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:38,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,641 INFO L185 Difference]: Start difference. First operand has 617 places, 597 transitions, 1370 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:38,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 595 transitions, 1383 flow [2021-06-10 11:37:38,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 595 transitions, 1382 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:38,646 INFO L241 Difference]: Finished difference. Result has 616 places, 595 transitions, 1366 flow [2021-06-10 11:37:38,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=616, PETRI_TRANSITIONS=595} [2021-06-10 11:37:38,646 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, -3 predicate places. [2021-06-10 11:37:38,646 INFO L480 AbstractCegarLoop]: Abstraction has has 616 places, 595 transitions, 1366 flow [2021-06-10 11:37:38,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:38,647 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:38,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2021-06-10 11:37:38,647 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:38,647 INFO L82 PathProgramCache]: Analyzing trace with hash -419308684, now seen corresponding path program 1 times [2021-06-10 11:37:38,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:38,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556644598] [2021-06-10 11:37:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:38,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:38,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:38,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556644598] [2021-06-10 11:37:38,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:38,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:38,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592553944] [2021-06-10 11:37:38,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:38,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:38,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:38,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 595 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:38,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:38,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:38,820 INFO L129 PetriNetUnfolder]: 49/686 cut-off events. [2021-06-10 11:37:38,820 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:38,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 686 events. 49/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2818 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 791. Up to 24 conditions per place. [2021-06-10 11:37:38,850 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/596 dead transitions. [2021-06-10 11:37:38,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 596 transitions, 1382 flow [2021-06-10 11:37:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:38,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:38,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:38,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:38,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:38,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:38,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,853 INFO L185 Difference]: Start difference. First operand has 616 places, 595 transitions, 1366 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:38,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 596 transitions, 1382 flow [2021-06-10 11:37:38,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 596 transitions, 1381 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:38,858 INFO L241 Difference]: Finished difference. Result has 619 places, 596 transitions, 1379 flow [2021-06-10 11:37:38,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1379, PETRI_PLACES=619, PETRI_TRANSITIONS=596} [2021-06-10 11:37:38,858 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 0 predicate places. [2021-06-10 11:37:38,858 INFO L480 AbstractCegarLoop]: Abstraction has has 619 places, 596 transitions, 1379 flow [2021-06-10 11:37:38,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:38,859 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:38,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2021-06-10 11:37:38,859 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash -419309707, now seen corresponding path program 1 times [2021-06-10 11:37:38,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:38,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854612475] [2021-06-10 11:37:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:38,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:38,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:38,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:38,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854612475] [2021-06-10 11:37:38,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:38,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:38,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182398270] [2021-06-10 11:37:38,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:38,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:38,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:38,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:38,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:38,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 596 transitions, 1379 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:38,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:38,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:38,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:39,045 INFO L129 PetriNetUnfolder]: 49/687 cut-off events. [2021-06-10 11:37:39,046 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:39,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 687 events. 49/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2826 event pairs, 0 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 799. Up to 24 conditions per place. [2021-06-10 11:37:39,076 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/597 dead transitions. [2021-06-10 11:37:39,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 597 transitions, 1405 flow [2021-06-10 11:37:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:39,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:39,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:39,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,079 INFO L185 Difference]: Start difference. First operand has 619 places, 596 transitions, 1379 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:39,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 597 transitions, 1405 flow [2021-06-10 11:37:39,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 597 transitions, 1403 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:39,085 INFO L241 Difference]: Finished difference. Result has 622 places, 597 transitions, 1395 flow [2021-06-10 11:37:39,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1395, PETRI_PLACES=622, PETRI_TRANSITIONS=597} [2021-06-10 11:37:39,085 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 3 predicate places. [2021-06-10 11:37:39,085 INFO L480 AbstractCegarLoop]: Abstraction has has 622 places, 597 transitions, 1395 flow [2021-06-10 11:37:39,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:39,085 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:39,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2021-06-10 11:37:39,085 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash -418355372, now seen corresponding path program 1 times [2021-06-10 11:37:39,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:39,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204175605] [2021-06-10 11:37:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:39,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:39,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:39,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204175605] [2021-06-10 11:37:39,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:39,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:39,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024315814] [2021-06-10 11:37:39,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:39,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:39,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:39,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 597 transitions, 1395 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:39,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:39,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:39,273 INFO L129 PetriNetUnfolder]: 48/684 cut-off events. [2021-06-10 11:37:39,273 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:37:39,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 684 events. 48/684 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2807 event pairs, 0 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 798. Up to 24 conditions per place. [2021-06-10 11:37:39,302 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2021-06-10 11:37:39,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 595 transitions, 1403 flow [2021-06-10 11:37:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2021-06-10 11:37:39,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172932330827067 [2021-06-10 11:37:39,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2021-06-10 11:37:39,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2021-06-10 11:37:39,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:39,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2021-06-10 11:37:39,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.0) internal successors, (1830), 3 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,305 INFO L185 Difference]: Start difference. First operand has 622 places, 597 transitions, 1395 flow. Second operand 3 states and 1830 transitions. [2021-06-10 11:37:39,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 595 transitions, 1403 flow [2021-06-10 11:37:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 595 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:39,310 INFO L241 Difference]: Finished difference. Result has 623 places, 595 transitions, 1384 flow [2021-06-10 11:37:39,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1384, PETRI_PLACES=623, PETRI_TRANSITIONS=595} [2021-06-10 11:37:39,310 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 4 predicate places. [2021-06-10 11:37:39,310 INFO L480 AbstractCegarLoop]: Abstraction has has 623 places, 595 transitions, 1384 flow [2021-06-10 11:37:39,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:39,311 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:39,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2021-06-10 11:37:39,311 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash -418356395, now seen corresponding path program 1 times [2021-06-10 11:37:39,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:39,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508058049] [2021-06-10 11:37:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:39,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:39,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:39,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508058049] [2021-06-10 11:37:39,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:39,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:39,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567002160] [2021-06-10 11:37:39,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:39,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:39,326 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:39,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 595 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:39,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:39,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:39,480 INFO L129 PetriNetUnfolder]: 48/681 cut-off events. [2021-06-10 11:37:39,481 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:39,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 681 events. 48/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2785 event pairs, 0 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 792. Up to 24 conditions per place. [2021-06-10 11:37:39,509 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2021-06-10 11:37:39,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 592 transitions, 1385 flow [2021-06-10 11:37:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:39,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:39,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:39,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:39,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:39,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:39,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,512 INFO L185 Difference]: Start difference. First operand has 623 places, 595 transitions, 1384 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:39,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 592 transitions, 1385 flow [2021-06-10 11:37:39,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 592 transitions, 1380 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:39,517 INFO L241 Difference]: Finished difference. Result has 620 places, 592 transitions, 1370 flow [2021-06-10 11:37:39,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1370, PETRI_PLACES=620, PETRI_TRANSITIONS=592} [2021-06-10 11:37:39,518 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 1 predicate places. [2021-06-10 11:37:39,518 INFO L480 AbstractCegarLoop]: Abstraction has has 620 places, 592 transitions, 1370 flow [2021-06-10 11:37:39,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,518 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:39,518 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:39,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2021-06-10 11:37:39,518 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2057800475, now seen corresponding path program 1 times [2021-06-10 11:37:39,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:39,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980370303] [2021-06-10 11:37:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:39,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:39,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:39,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980370303] [2021-06-10 11:37:39,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:39,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:39,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090982664] [2021-06-10 11:37:39,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:39,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:39,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:39,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 592 transitions, 1370 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:39,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:39,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:39,702 INFO L129 PetriNetUnfolder]: 46/686 cut-off events. [2021-06-10 11:37:39,703 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:39,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 686 events. 46/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2839 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 800. Up to 24 conditions per place. [2021-06-10 11:37:39,732 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/593 dead transitions. [2021-06-10 11:37:39,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 593 transitions, 1386 flow [2021-06-10 11:37:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:39,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:39,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:39,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:39,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:39,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:39,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,735 INFO L185 Difference]: Start difference. First operand has 620 places, 592 transitions, 1370 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:39,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 593 transitions, 1386 flow [2021-06-10 11:37:39,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 593 transitions, 1385 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:39,741 INFO L241 Difference]: Finished difference. Result has 623 places, 593 transitions, 1383 flow [2021-06-10 11:37:39,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=623, PETRI_TRANSITIONS=593} [2021-06-10 11:37:39,741 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 4 predicate places. [2021-06-10 11:37:39,741 INFO L480 AbstractCegarLoop]: Abstraction has has 623 places, 593 transitions, 1383 flow [2021-06-10 11:37:39,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:39,741 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:39,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2021-06-10 11:37:39,741 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2057801498, now seen corresponding path program 1 times [2021-06-10 11:37:39,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:39,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861986784] [2021-06-10 11:37:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:39,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:39,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:39,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861986784] [2021-06-10 11:37:39,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:39,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:39,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066357973] [2021-06-10 11:37:39,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:39,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:39,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:39,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 593 transitions, 1383 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:39,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:39,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:39,921 INFO L129 PetriNetUnfolder]: 46/687 cut-off events. [2021-06-10 11:37:39,921 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:39,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 687 events. 46/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2848 event pairs, 0 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 806. Up to 24 conditions per place. [2021-06-10 11:37:39,950 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/594 dead transitions. [2021-06-10 11:37:39,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 594 transitions, 1409 flow [2021-06-10 11:37:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:39,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:39,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:39,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:39,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,953 INFO L185 Difference]: Start difference. First operand has 623 places, 593 transitions, 1383 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 594 transitions, 1409 flow [2021-06-10 11:37:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 594 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:39,958 INFO L241 Difference]: Finished difference. Result has 626 places, 594 transitions, 1399 flow [2021-06-10 11:37:39,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=626, PETRI_TRANSITIONS=594} [2021-06-10 11:37:39,959 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 7 predicate places. [2021-06-10 11:37:39,959 INFO L480 AbstractCegarLoop]: Abstraction has has 626 places, 594 transitions, 1399 flow [2021-06-10 11:37:39,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:39,959 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:39,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2021-06-10 11:37:39,959 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2056848186, now seen corresponding path program 1 times [2021-06-10 11:37:39,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:39,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340733526] [2021-06-10 11:37:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:39,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:39,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:39,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:39,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340733526] [2021-06-10 11:37:39,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:39,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:39,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204954750] [2021-06-10 11:37:39,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:39,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:39,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:39,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:39,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 594 transitions, 1399 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:39,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:39,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:39,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:40,138 INFO L129 PetriNetUnfolder]: 45/683 cut-off events. [2021-06-10 11:37:40,139 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:40,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 683 events. 45/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2819 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 799. Up to 24 conditions per place. [2021-06-10 11:37:40,167 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/591 dead transitions. [2021-06-10 11:37:40,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 591 transitions, 1396 flow [2021-06-10 11:37:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:40,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:40,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:40,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:40,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:40,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:40,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,170 INFO L185 Difference]: Start difference. First operand has 626 places, 594 transitions, 1399 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:40,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 591 transitions, 1396 flow [2021-06-10 11:37:40,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 591 transitions, 1388 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:40,176 INFO L241 Difference]: Finished difference. Result has 625 places, 591 transitions, 1378 flow [2021-06-10 11:37:40,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=625, PETRI_TRANSITIONS=591} [2021-06-10 11:37:40,176 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 6 predicate places. [2021-06-10 11:37:40,176 INFO L480 AbstractCegarLoop]: Abstraction has has 625 places, 591 transitions, 1378 flow [2021-06-10 11:37:40,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:40,176 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:40,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2021-06-10 11:37:40,176 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2056847163, now seen corresponding path program 1 times [2021-06-10 11:37:40,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:40,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990655711] [2021-06-10 11:37:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:40,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:40,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:40,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990655711] [2021-06-10 11:37:40,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:40,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:40,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892783077] [2021-06-10 11:37:40,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:40,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:40,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:40,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 591 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:40,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:40,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:40,354 INFO L129 PetriNetUnfolder]: 45/681 cut-off events. [2021-06-10 11:37:40,354 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:40,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 681 events. 45/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2803 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 802. Up to 24 conditions per place. [2021-06-10 11:37:40,382 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/589 dead transitions. [2021-06-10 11:37:40,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 589 transitions, 1391 flow [2021-06-10 11:37:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:40,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:40,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:40,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:40,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:40,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:40,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:40,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,385 INFO L185 Difference]: Start difference. First operand has 625 places, 591 transitions, 1378 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:40,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 589 transitions, 1391 flow [2021-06-10 11:37:40,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 589 transitions, 1390 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:40,390 INFO L241 Difference]: Finished difference. Result has 624 places, 589 transitions, 1374 flow [2021-06-10 11:37:40,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1374, PETRI_PLACES=624, PETRI_TRANSITIONS=589} [2021-06-10 11:37:40,391 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 5 predicate places. [2021-06-10 11:37:40,391 INFO L480 AbstractCegarLoop]: Abstraction has has 624 places, 589 transitions, 1374 flow [2021-06-10 11:37:40,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:40,391 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:40,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2021-06-10 11:37:40,391 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -775265065, now seen corresponding path program 1 times [2021-06-10 11:37:40,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:40,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837702856] [2021-06-10 11:37:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:40,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:40,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:40,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837702856] [2021-06-10 11:37:40,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:40,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:40,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676906017] [2021-06-10 11:37:40,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:40,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:40,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:40,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:40,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 589 transitions, 1374 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:40,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:40,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:40,566 INFO L129 PetriNetUnfolder]: 43/686 cut-off events. [2021-06-10 11:37:40,566 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:40,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 686 events. 43/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2855 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 805. Up to 24 conditions per place. [2021-06-10 11:37:40,594 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/590 dead transitions. [2021-06-10 11:37:40,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 590 transitions, 1390 flow [2021-06-10 11:37:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:40,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:40,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:40,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:40,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:40,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:40,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,597 INFO L185 Difference]: Start difference. First operand has 624 places, 589 transitions, 1374 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:40,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 590 transitions, 1390 flow [2021-06-10 11:37:40,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 590 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:40,603 INFO L241 Difference]: Finished difference. Result has 627 places, 590 transitions, 1387 flow [2021-06-10 11:37:40,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=627, PETRI_TRANSITIONS=590} [2021-06-10 11:37:40,603 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 8 predicate places. [2021-06-10 11:37:40,603 INFO L480 AbstractCegarLoop]: Abstraction has has 627 places, 590 transitions, 1387 flow [2021-06-10 11:37:40,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,603 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:40,603 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:40,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2021-06-10 11:37:40,603 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash -775266088, now seen corresponding path program 1 times [2021-06-10 11:37:40,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:40,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129818510] [2021-06-10 11:37:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:40,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:40,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:40,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129818510] [2021-06-10 11:37:40,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:40,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:40,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398819633] [2021-06-10 11:37:40,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:40,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:40,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:40,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:40,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 590 transitions, 1387 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:40,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:40,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:40,785 INFO L129 PetriNetUnfolder]: 43/687 cut-off events. [2021-06-10 11:37:40,785 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:40,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 687 events. 43/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2865 event pairs, 0 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 813. Up to 24 conditions per place. [2021-06-10 11:37:40,814 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/591 dead transitions. [2021-06-10 11:37:40,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 591 transitions, 1413 flow [2021-06-10 11:37:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:40,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:40,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:40,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:40,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:40,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:40,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,817 INFO L185 Difference]: Start difference. First operand has 627 places, 590 transitions, 1387 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:40,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 591 transitions, 1413 flow [2021-06-10 11:37:40,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 591 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:40,822 INFO L241 Difference]: Finished difference. Result has 630 places, 591 transitions, 1403 flow [2021-06-10 11:37:40,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1403, PETRI_PLACES=630, PETRI_TRANSITIONS=591} [2021-06-10 11:37:40,823 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 11 predicate places. [2021-06-10 11:37:40,823 INFO L480 AbstractCegarLoop]: Abstraction has has 630 places, 591 transitions, 1403 flow [2021-06-10 11:37:40,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:40,823 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:40,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2021-06-10 11:37:40,823 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:40,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -774312776, now seen corresponding path program 1 times [2021-06-10 11:37:40,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:40,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630408834] [2021-06-10 11:37:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:40,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:40,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:40,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:40,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630408834] [2021-06-10 11:37:40,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:40,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:40,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524078312] [2021-06-10 11:37:40,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:40,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:40,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:40,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 591 transitions, 1403 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:40,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:40,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:40,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:40,999 INFO L129 PetriNetUnfolder]: 42/683 cut-off events. [2021-06-10 11:37:41,000 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:41,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 683 events. 42/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2838 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 806. Up to 24 conditions per place. [2021-06-10 11:37:41,023 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/588 dead transitions. [2021-06-10 11:37:41,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 588 transitions, 1400 flow [2021-06-10 11:37:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:41,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:41,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:41,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,027 INFO L185 Difference]: Start difference. First operand has 630 places, 591 transitions, 1403 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:41,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 588 transitions, 1400 flow [2021-06-10 11:37:41,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 588 transitions, 1392 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:41,031 INFO L241 Difference]: Finished difference. Result has 629 places, 588 transitions, 1382 flow [2021-06-10 11:37:41,032 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=629, PETRI_TRANSITIONS=588} [2021-06-10 11:37:41,032 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 10 predicate places. [2021-06-10 11:37:41,032 INFO L480 AbstractCegarLoop]: Abstraction has has 629 places, 588 transitions, 1382 flow [2021-06-10 11:37:41,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,032 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:41,032 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:41,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2021-06-10 11:37:41,032 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash -774311753, now seen corresponding path program 1 times [2021-06-10 11:37:41,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:41,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065252545] [2021-06-10 11:37:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:41,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:41,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:41,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065252545] [2021-06-10 11:37:41,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:41,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:41,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563222978] [2021-06-10 11:37:41,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:41,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:41,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:41,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:41,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 588 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:41,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:41,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:41,209 INFO L129 PetriNetUnfolder]: 42/681 cut-off events. [2021-06-10 11:37:41,209 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:41,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 681 events. 42/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2822 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 809. Up to 24 conditions per place. [2021-06-10 11:37:41,238 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2021-06-10 11:37:41,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 586 transitions, 1395 flow [2021-06-10 11:37:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:41,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:41,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:41,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:41,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:41,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:41,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:41,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,241 INFO L185 Difference]: Start difference. First operand has 629 places, 588 transitions, 1382 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 586 transitions, 1395 flow [2021-06-10 11:37:41,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 586 transitions, 1394 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:41,246 INFO L241 Difference]: Finished difference. Result has 628 places, 586 transitions, 1378 flow [2021-06-10 11:37:41,246 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=628, PETRI_TRANSITIONS=586} [2021-06-10 11:37:41,247 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 9 predicate places. [2021-06-10 11:37:41,247 INFO L480 AbstractCegarLoop]: Abstraction has has 628 places, 586 transitions, 1378 flow [2021-06-10 11:37:41,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:41,247 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:41,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2021-06-10 11:37:41,247 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -388048182, now seen corresponding path program 1 times [2021-06-10 11:37:41,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:41,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897565863] [2021-06-10 11:37:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:41,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:41,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:41,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897565863] [2021-06-10 11:37:41,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:41,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:41,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323358955] [2021-06-10 11:37:41,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:41,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:41,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:41,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:41,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:41,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:41,425 INFO L129 PetriNetUnfolder]: 40/686 cut-off events. [2021-06-10 11:37:41,425 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:41,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 686 events. 40/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2874 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 812. Up to 24 conditions per place. [2021-06-10 11:37:41,453 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2021-06-10 11:37:41,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 587 transitions, 1394 flow [2021-06-10 11:37:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:41,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:41,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:41,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:41,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:41,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:41,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,457 INFO L185 Difference]: Start difference. First operand has 628 places, 586 transitions, 1378 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:41,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 587 transitions, 1394 flow [2021-06-10 11:37:41,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:41,462 INFO L241 Difference]: Finished difference. Result has 631 places, 587 transitions, 1391 flow [2021-06-10 11:37:41,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1391, PETRI_PLACES=631, PETRI_TRANSITIONS=587} [2021-06-10 11:37:41,462 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 12 predicate places. [2021-06-10 11:37:41,462 INFO L480 AbstractCegarLoop]: Abstraction has has 631 places, 587 transitions, 1391 flow [2021-06-10 11:37:41,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:41,463 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:41,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2021-06-10 11:37:41,463 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash -388049205, now seen corresponding path program 1 times [2021-06-10 11:37:41,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:41,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310926660] [2021-06-10 11:37:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:41,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:41,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:41,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310926660] [2021-06-10 11:37:41,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:41,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:41,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773964724] [2021-06-10 11:37:41,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:41,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:41,480 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:41,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 587 transitions, 1391 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:41,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:41,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:41,650 INFO L129 PetriNetUnfolder]: 40/687 cut-off events. [2021-06-10 11:37:41,650 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:41,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 687 events. 40/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2881 event pairs, 0 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 820. Up to 24 conditions per place. [2021-06-10 11:37:41,679 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/588 dead transitions. [2021-06-10 11:37:41,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 588 transitions, 1417 flow [2021-06-10 11:37:41,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:41,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:41,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:41,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:41,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:41,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:41,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,682 INFO L185 Difference]: Start difference. First operand has 631 places, 587 transitions, 1391 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 588 transitions, 1417 flow [2021-06-10 11:37:41,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 588 transitions, 1415 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:41,687 INFO L241 Difference]: Finished difference. Result has 634 places, 588 transitions, 1407 flow [2021-06-10 11:37:41,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=634, PETRI_TRANSITIONS=588} [2021-06-10 11:37:41,688 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 15 predicate places. [2021-06-10 11:37:41,688 INFO L480 AbstractCegarLoop]: Abstraction has has 634 places, 588 transitions, 1407 flow [2021-06-10 11:37:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:41,688 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:41,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2021-06-10 11:37:41,688 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -387095893, now seen corresponding path program 1 times [2021-06-10 11:37:41,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:41,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722733913] [2021-06-10 11:37:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:41,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:41,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:41,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722733913] [2021-06-10 11:37:41,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:41,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:41,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056725822] [2021-06-10 11:37:41,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:41,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:41,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:41,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:41,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:41,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 588 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:41,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:41,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:41,865 INFO L129 PetriNetUnfolder]: 39/683 cut-off events. [2021-06-10 11:37:41,865 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:41,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 683 events. 39/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2858 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 813. Up to 24 conditions per place. [2021-06-10 11:37:41,893 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2021-06-10 11:37:41,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 585 transitions, 1404 flow [2021-06-10 11:37:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:41,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:41,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:41,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:41,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,896 INFO L185 Difference]: Start difference. First operand has 634 places, 588 transitions, 1407 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:41,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 585 transitions, 1404 flow [2021-06-10 11:37:41,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 585 transitions, 1396 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:41,902 INFO L241 Difference]: Finished difference. Result has 633 places, 585 transitions, 1386 flow [2021-06-10 11:37:41,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1386, PETRI_PLACES=633, PETRI_TRANSITIONS=585} [2021-06-10 11:37:41,902 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 14 predicate places. [2021-06-10 11:37:41,902 INFO L480 AbstractCegarLoop]: Abstraction has has 633 places, 585 transitions, 1386 flow [2021-06-10 11:37:41,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:41,902 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:41,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2021-06-10 11:37:41,902 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash -387094870, now seen corresponding path program 1 times [2021-06-10 11:37:41,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:41,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714537001] [2021-06-10 11:37:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:41,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:41,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:41,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:41,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714537001] [2021-06-10 11:37:41,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:41,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:41,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413778311] [2021-06-10 11:37:41,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:41,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:41,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:41,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:41,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 585 transitions, 1386 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:41,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:41,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:41,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:42,082 INFO L129 PetriNetUnfolder]: 39/681 cut-off events. [2021-06-10 11:37:42,082 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:42,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 681 events. 39/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2840 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 816. Up to 24 conditions per place. [2021-06-10 11:37:42,110 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2021-06-10 11:37:42,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 583 transitions, 1399 flow [2021-06-10 11:37:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:42,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:42,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:42,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:42,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:42,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:42,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:42,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,113 INFO L185 Difference]: Start difference. First operand has 633 places, 585 transitions, 1386 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:42,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 583 transitions, 1399 flow [2021-06-10 11:37:42,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 583 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:42,119 INFO L241 Difference]: Finished difference. Result has 632 places, 583 transitions, 1382 flow [2021-06-10 11:37:42,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=632, PETRI_TRANSITIONS=583} [2021-06-10 11:37:42,119 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 13 predicate places. [2021-06-10 11:37:42,119 INFO L480 AbstractCegarLoop]: Abstraction has has 632 places, 583 transitions, 1382 flow [2021-06-10 11:37:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:42,119 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:42,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2021-06-10 11:37:42,119 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1111510079, now seen corresponding path program 1 times [2021-06-10 11:37:42,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:42,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200092652] [2021-06-10 11:37:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:42,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:42,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:42,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200092652] [2021-06-10 11:37:42,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:42,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:42,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904507983] [2021-06-10 11:37:42,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:42,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:42,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:42,135 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:42,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 583 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:42,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:42,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:42,327 INFO L129 PetriNetUnfolder]: 38/689 cut-off events. [2021-06-10 11:37:42,328 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:42,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 689 events. 38/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2908 event pairs, 0 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 828. Up to 24 conditions per place. [2021-06-10 11:37:42,349 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2021-06-10 11:37:42,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 585 transitions, 1412 flow [2021-06-10 11:37:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:42,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:42,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:42,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:42,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:42,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:42,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,353 INFO L185 Difference]: Start difference. First operand has 632 places, 583 transitions, 1382 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:42,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 585 transitions, 1412 flow [2021-06-10 11:37:42,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 585 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:42,357 INFO L241 Difference]: Finished difference. Result has 635 places, 585 transitions, 1405 flow [2021-06-10 11:37:42,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1405, PETRI_PLACES=635, PETRI_TRANSITIONS=585} [2021-06-10 11:37:42,358 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 16 predicate places. [2021-06-10 11:37:42,358 INFO L480 AbstractCegarLoop]: Abstraction has has 635 places, 585 transitions, 1405 flow [2021-06-10 11:37:42,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:42,358 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:42,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2021-06-10 11:37:42,358 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1111511102, now seen corresponding path program 1 times [2021-06-10 11:37:42,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:42,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919149393] [2021-06-10 11:37:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:42,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:42,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:42,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919149393] [2021-06-10 11:37:42,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:42,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:42,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654591019] [2021-06-10 11:37:42,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:42,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:42,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:42,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 585 transitions, 1405 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:42,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:42,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:42,543 INFO L129 PetriNetUnfolder]: 37/687 cut-off events. [2021-06-10 11:37:42,544 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:42,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 687 events. 37/687 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2898 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 825. Up to 24 conditions per place. [2021-06-10 11:37:42,572 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2021-06-10 11:37:42,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 585 transitions, 1417 flow [2021-06-10 11:37:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:42,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:42,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:42,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:42,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:42,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:42,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,575 INFO L185 Difference]: Start difference. First operand has 635 places, 585 transitions, 1405 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:42,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 585 transitions, 1417 flow [2021-06-10 11:37:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 585 transitions, 1412 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:42,581 INFO L241 Difference]: Finished difference. Result has 638 places, 585 transitions, 1410 flow [2021-06-10 11:37:42,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=638, PETRI_TRANSITIONS=585} [2021-06-10 11:37:42,581 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 19 predicate places. [2021-06-10 11:37:42,581 INFO L480 AbstractCegarLoop]: Abstraction has has 638 places, 585 transitions, 1410 flow [2021-06-10 11:37:42,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:42,581 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:42,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2021-06-10 11:37:42,582 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1112463391, now seen corresponding path program 1 times [2021-06-10 11:37:42,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:42,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546230165] [2021-06-10 11:37:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:42,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:42,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:42,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546230165] [2021-06-10 11:37:42,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:42,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:42,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95991206] [2021-06-10 11:37:42,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:42,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:42,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:42,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 585 transitions, 1410 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:42,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:42,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:42,763 INFO L129 PetriNetUnfolder]: 36/683 cut-off events. [2021-06-10 11:37:42,764 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:42,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 683 events. 36/683 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2871 event pairs, 0 based on Foata normal form. 1/626 useless extension candidates. Maximal degree in co-relation 822. Up to 24 conditions per place. [2021-06-10 11:37:42,792 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/582 dead transitions. [2021-06-10 11:37:42,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 582 transitions, 1407 flow [2021-06-10 11:37:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:42,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:42,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:42,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:42,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:42,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:42,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,795 INFO L185 Difference]: Start difference. First operand has 638 places, 585 transitions, 1410 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:42,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 582 transitions, 1407 flow [2021-06-10 11:37:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 582 transitions, 1400 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:42,801 INFO L241 Difference]: Finished difference. Result has 637 places, 582 transitions, 1390 flow [2021-06-10 11:37:42,801 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=637, PETRI_TRANSITIONS=582} [2021-06-10 11:37:42,801 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 18 predicate places. [2021-06-10 11:37:42,801 INFO L480 AbstractCegarLoop]: Abstraction has has 637 places, 582 transitions, 1390 flow [2021-06-10 11:37:42,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:42,801 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:42,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2021-06-10 11:37:42,802 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1112464414, now seen corresponding path program 1 times [2021-06-10 11:37:42,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:42,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865814777] [2021-06-10 11:37:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:42,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:42,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:42,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:37:42,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865814777] [2021-06-10 11:37:42,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:42,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:42,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238789736] [2021-06-10 11:37:42,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:42,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:42,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:42,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 582 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:42,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:42,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:42,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:42,983 INFO L129 PetriNetUnfolder]: 36/681 cut-off events. [2021-06-10 11:37:42,983 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:43,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 681 events. 36/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2855 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 823. Up to 24 conditions per place. [2021-06-10 11:37:43,011 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2021-06-10 11:37:43,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 580 transitions, 1403 flow [2021-06-10 11:37:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:43,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:43,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:43,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:43,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,014 INFO L185 Difference]: Start difference. First operand has 637 places, 582 transitions, 1390 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 637 places, 580 transitions, 1403 flow [2021-06-10 11:37:43,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 580 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:43,020 INFO L241 Difference]: Finished difference. Result has 636 places, 580 transitions, 1386 flow [2021-06-10 11:37:43,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1386, PETRI_PLACES=636, PETRI_TRANSITIONS=580} [2021-06-10 11:37:43,020 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 17 predicate places. [2021-06-10 11:37:43,020 INFO L480 AbstractCegarLoop]: Abstraction has has 636 places, 580 transitions, 1386 flow [2021-06-10 11:37:43,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:43,020 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:43,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2021-06-10 11:37:43,020 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1259332275, now seen corresponding path program 1 times [2021-06-10 11:37:43,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:43,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356601148] [2021-06-10 11:37:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:43,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:43,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:43,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356601148] [2021-06-10 11:37:43,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:43,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:43,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620742253] [2021-06-10 11:37:43,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:43,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:43,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:43,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 580 transitions, 1386 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:43,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:43,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:43,201 INFO L129 PetriNetUnfolder]: 34/686 cut-off events. [2021-06-10 11:37:43,202 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:43,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 686 events. 34/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2908 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 826. Up to 24 conditions per place. [2021-06-10 11:37:43,230 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2021-06-10 11:37:43,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 581 transitions, 1402 flow [2021-06-10 11:37:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:43,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:43,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:43,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:43,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:43,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:43,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,233 INFO L185 Difference]: Start difference. First operand has 636 places, 580 transitions, 1386 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:43,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 581 transitions, 1402 flow [2021-06-10 11:37:43,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 581 transitions, 1401 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:43,238 INFO L241 Difference]: Finished difference. Result has 639 places, 581 transitions, 1399 flow [2021-06-10 11:37:43,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=639, PETRI_TRANSITIONS=581} [2021-06-10 11:37:43,239 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 20 predicate places. [2021-06-10 11:37:43,239 INFO L480 AbstractCegarLoop]: Abstraction has has 639 places, 581 transitions, 1399 flow [2021-06-10 11:37:43,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:43,239 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:43,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2021-06-10 11:37:43,239 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1259331252, now seen corresponding path program 1 times [2021-06-10 11:37:43,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:43,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838533661] [2021-06-10 11:37:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:43,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:43,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:43,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838533661] [2021-06-10 11:37:43,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:43,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:43,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363644485] [2021-06-10 11:37:43,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:43,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:43,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:43,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:43,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:43,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 581 transitions, 1399 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:43,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:43,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:43,428 INFO L129 PetriNetUnfolder]: 34/687 cut-off events. [2021-06-10 11:37:43,428 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:43,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 687 events. 34/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2915 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2021-06-10 11:37:43,458 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/582 dead transitions. [2021-06-10 11:37:43,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 582 transitions, 1425 flow [2021-06-10 11:37:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:43,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:43,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:43,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:43,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:43,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:43,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,467 INFO L185 Difference]: Start difference. First operand has 639 places, 581 transitions, 1399 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:43,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 582 transitions, 1425 flow [2021-06-10 11:37:43,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 582 transitions, 1423 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:43,472 INFO L241 Difference]: Finished difference. Result has 642 places, 582 transitions, 1415 flow [2021-06-10 11:37:43,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=642, PETRI_TRANSITIONS=582} [2021-06-10 11:37:43,473 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 23 predicate places. [2021-06-10 11:37:43,473 INFO L480 AbstractCegarLoop]: Abstraction has has 642 places, 582 transitions, 1415 flow [2021-06-10 11:37:43,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:43,473 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:43,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2021-06-10 11:37:43,473 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1260284564, now seen corresponding path program 1 times [2021-06-10 11:37:43,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:43,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528220744] [2021-06-10 11:37:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:43,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:43,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:43,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528220744] [2021-06-10 11:37:43,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:43,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:43,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436324582] [2021-06-10 11:37:43,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:43,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:43,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:43,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 582 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:43,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:43,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:43,684 INFO L129 PetriNetUnfolder]: 33/683 cut-off events. [2021-06-10 11:37:43,684 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:43,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 683 events. 33/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2891 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 827. Up to 24 conditions per place. [2021-06-10 11:37:43,704 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2021-06-10 11:37:43,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 579 transitions, 1412 flow [2021-06-10 11:37:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:43,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:43,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:43,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:43,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:43,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:43,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,707 INFO L185 Difference]: Start difference. First operand has 642 places, 582 transitions, 1415 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 579 transitions, 1412 flow [2021-06-10 11:37:43,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 579 transitions, 1404 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:43,712 INFO L241 Difference]: Finished difference. Result has 641 places, 579 transitions, 1394 flow [2021-06-10 11:37:43,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=641, PETRI_TRANSITIONS=579} [2021-06-10 11:37:43,712 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 22 predicate places. [2021-06-10 11:37:43,712 INFO L480 AbstractCegarLoop]: Abstraction has has 641 places, 579 transitions, 1394 flow [2021-06-10 11:37:43,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,712 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:43,713 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:43,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2021-06-10 11:37:43,713 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1260285587, now seen corresponding path program 1 times [2021-06-10 11:37:43,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:43,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215789029] [2021-06-10 11:37:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:43,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:43,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:37:43,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215789029] [2021-06-10 11:37:43,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:43,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:43,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755367328] [2021-06-10 11:37:43,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:43,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:43,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:43,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 579 transitions, 1394 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:43,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:43,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:43,905 INFO L129 PetriNetUnfolder]: 33/681 cut-off events. [2021-06-10 11:37:43,905 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:43,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 681 events. 33/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2873 event pairs, 0 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 830. Up to 24 conditions per place. [2021-06-10 11:37:43,935 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2021-06-10 11:37:43,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 577 transitions, 1407 flow [2021-06-10 11:37:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:43,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:43,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:43,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:43,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:43,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,938 INFO L185 Difference]: Start difference. First operand has 641 places, 579 transitions, 1394 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:43,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 577 transitions, 1407 flow [2021-06-10 11:37:43,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 577 transitions, 1406 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:43,943 INFO L241 Difference]: Finished difference. Result has 640 places, 577 transitions, 1390 flow [2021-06-10 11:37:43,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=640, PETRI_TRANSITIONS=577} [2021-06-10 11:37:43,943 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 21 predicate places. [2021-06-10 11:37:43,944 INFO L480 AbstractCegarLoop]: Abstraction has has 640 places, 577 transitions, 1390 flow [2021-06-10 11:37:43,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:43,944 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:43,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2021-06-10 11:37:43,944 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash -573792598, now seen corresponding path program 1 times [2021-06-10 11:37:43,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:43,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052706149] [2021-06-10 11:37:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:43,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:43,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:43,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:43,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052706149] [2021-06-10 11:37:43,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:43,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:43,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309687004] [2021-06-10 11:37:43,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:43,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:43,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:43,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 577 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:43,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:43,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:43,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:44,136 INFO L129 PetriNetUnfolder]: 32/689 cut-off events. [2021-06-10 11:37:44,136 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:44,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 689 events. 32/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2944 event pairs, 0 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 842. Up to 24 conditions per place. [2021-06-10 11:37:44,164 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/579 dead transitions. [2021-06-10 11:37:44,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 579 transitions, 1420 flow [2021-06-10 11:37:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:44,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:44,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:44,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:44,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:44,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:44,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,168 INFO L185 Difference]: Start difference. First operand has 640 places, 577 transitions, 1390 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:44,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 579 transitions, 1420 flow [2021-06-10 11:37:44,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 579 transitions, 1419 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:44,173 INFO L241 Difference]: Finished difference. Result has 643 places, 579 transitions, 1413 flow [2021-06-10 11:37:44,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1413, PETRI_PLACES=643, PETRI_TRANSITIONS=579} [2021-06-10 11:37:44,173 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 24 predicate places. [2021-06-10 11:37:44,173 INFO L480 AbstractCegarLoop]: Abstraction has has 643 places, 579 transitions, 1413 flow [2021-06-10 11:37:44,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:44,174 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:44,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2021-06-10 11:37:44,174 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash -573791575, now seen corresponding path program 1 times [2021-06-10 11:37:44,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:44,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484500715] [2021-06-10 11:37:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:44,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:44,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:44,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484500715] [2021-06-10 11:37:44,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:44,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:44,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506474502] [2021-06-10 11:37:44,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:44,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:44,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:44,190 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:44,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 579 transitions, 1413 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:44,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:44,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:44,358 INFO L129 PetriNetUnfolder]: 31/687 cut-off events. [2021-06-10 11:37:44,358 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:44,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 687 events. 31/687 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2935 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 839. Up to 24 conditions per place. [2021-06-10 11:37:44,387 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2021-06-10 11:37:44,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 579 transitions, 1425 flow [2021-06-10 11:37:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:44,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:44,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:44,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:44,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:44,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:44,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,390 INFO L185 Difference]: Start difference. First operand has 643 places, 579 transitions, 1413 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:44,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 579 transitions, 1425 flow [2021-06-10 11:37:44,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 579 transitions, 1420 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:44,396 INFO L241 Difference]: Finished difference. Result has 646 places, 579 transitions, 1418 flow [2021-06-10 11:37:44,396 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=646, PETRI_TRANSITIONS=579} [2021-06-10 11:37:44,396 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 27 predicate places. [2021-06-10 11:37:44,396 INFO L480 AbstractCegarLoop]: Abstraction has has 646 places, 579 transitions, 1418 flow [2021-06-10 11:37:44,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,396 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:44,396 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:44,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2021-06-10 11:37:44,396 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -572839286, now seen corresponding path program 1 times [2021-06-10 11:37:44,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:44,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649932612] [2021-06-10 11:37:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:44,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:44,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:44,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649932612] [2021-06-10 11:37:44,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:44,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:44,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438735645] [2021-06-10 11:37:44,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:44,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:44,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:44,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 579 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:44,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:44,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:44,581 INFO L129 PetriNetUnfolder]: 30/683 cut-off events. [2021-06-10 11:37:44,581 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:44,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 683 events. 30/683 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2907 event pairs, 0 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 836. Up to 24 conditions per place. [2021-06-10 11:37:44,609 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2021-06-10 11:37:44,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 576 transitions, 1415 flow [2021-06-10 11:37:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:44,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:44,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:44,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:44,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:44,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:44,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,612 INFO L185 Difference]: Start difference. First operand has 646 places, 579 transitions, 1418 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:44,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 576 transitions, 1415 flow [2021-06-10 11:37:44,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 576 transitions, 1408 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:44,618 INFO L241 Difference]: Finished difference. Result has 645 places, 576 transitions, 1398 flow [2021-06-10 11:37:44,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=645, PETRI_TRANSITIONS=576} [2021-06-10 11:37:44,618 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 26 predicate places. [2021-06-10 11:37:44,618 INFO L480 AbstractCegarLoop]: Abstraction has has 645 places, 576 transitions, 1398 flow [2021-06-10 11:37:44,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:44,618 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:44,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2021-06-10 11:37:44,619 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash -572838263, now seen corresponding path program 1 times [2021-06-10 11:37:44,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:44,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985834681] [2021-06-10 11:37:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:44,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:44,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:37:44,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985834681] [2021-06-10 11:37:44,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:44,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:44,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974057942] [2021-06-10 11:37:44,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:44,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:44,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:44,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 576 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:44,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:44,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:44,805 INFO L129 PetriNetUnfolder]: 30/681 cut-off events. [2021-06-10 11:37:44,805 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:44,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 681 events. 30/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2891 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 837. Up to 24 conditions per place. [2021-06-10 11:37:44,833 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2021-06-10 11:37:44,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 574 transitions, 1411 flow [2021-06-10 11:37:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:44,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:44,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:44,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:44,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:44,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:44,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:44,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,836 INFO L185 Difference]: Start difference. First operand has 645 places, 576 transitions, 1398 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:44,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 574 transitions, 1411 flow [2021-06-10 11:37:44,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 574 transitions, 1410 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:44,842 INFO L241 Difference]: Finished difference. Result has 644 places, 574 transitions, 1394 flow [2021-06-10 11:37:44,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=644, PETRI_TRANSITIONS=574} [2021-06-10 11:37:44,842 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 25 predicate places. [2021-06-10 11:37:44,842 INFO L480 AbstractCegarLoop]: Abstraction has has 644 places, 574 transitions, 1394 flow [2021-06-10 11:37:44,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:44,842 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:44,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2021-06-10 11:37:44,842 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash 199968928, now seen corresponding path program 1 times [2021-06-10 11:37:44,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:44,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966174543] [2021-06-10 11:37:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:44,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:44,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:44,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:44,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966174543] [2021-06-10 11:37:44,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:44,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:44,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003794802] [2021-06-10 11:37:44,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:44,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:44,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:44,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:44,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:44,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 574 transitions, 1394 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:44,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:44,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:44,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:45,040 INFO L129 PetriNetUnfolder]: 28/686 cut-off events. [2021-06-10 11:37:45,040 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:45,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 686 events. 28/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2943 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 840. Up to 24 conditions per place. [2021-06-10 11:37:45,061 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2021-06-10 11:37:45,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 575 transitions, 1410 flow [2021-06-10 11:37:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:45,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:45,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:45,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,064 INFO L185 Difference]: Start difference. First operand has 644 places, 574 transitions, 1394 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:45,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 575 transitions, 1410 flow [2021-06-10 11:37:45,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 575 transitions, 1409 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:45,069 INFO L241 Difference]: Finished difference. Result has 647 places, 575 transitions, 1407 flow [2021-06-10 11:37:45,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=647, PETRI_TRANSITIONS=575} [2021-06-10 11:37:45,069 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 28 predicate places. [2021-06-10 11:37:45,069 INFO L480 AbstractCegarLoop]: Abstraction has has 647 places, 575 transitions, 1407 flow [2021-06-10 11:37:45,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:45,070 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:45,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2021-06-10 11:37:45,070 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:45,070 INFO L82 PathProgramCache]: Analyzing trace with hash 199967905, now seen corresponding path program 1 times [2021-06-10 11:37:45,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:45,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362153485] [2021-06-10 11:37:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:45,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:45,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:45,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362153485] [2021-06-10 11:37:45,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:45,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:45,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707549834] [2021-06-10 11:37:45,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:45,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:45,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:45,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 575 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:45,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:45,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:45,262 INFO L129 PetriNetUnfolder]: 28/687 cut-off events. [2021-06-10 11:37:45,262 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:45,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 687 events. 28/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2950 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 848. Up to 24 conditions per place. [2021-06-10 11:37:45,290 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/576 dead transitions. [2021-06-10 11:37:45,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 576 transitions, 1433 flow [2021-06-10 11:37:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:45,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:45,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:45,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:45,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:45,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:45,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,293 INFO L185 Difference]: Start difference. First operand has 647 places, 575 transitions, 1407 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:45,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 576 transitions, 1433 flow [2021-06-10 11:37:45,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 576 transitions, 1431 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:45,299 INFO L241 Difference]: Finished difference. Result has 650 places, 576 transitions, 1423 flow [2021-06-10 11:37:45,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=650, PETRI_TRANSITIONS=576} [2021-06-10 11:37:45,299 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 31 predicate places. [2021-06-10 11:37:45,299 INFO L480 AbstractCegarLoop]: Abstraction has has 650 places, 576 transitions, 1423 flow [2021-06-10 11:37:45,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:45,299 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:45,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2021-06-10 11:37:45,299 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 200922240, now seen corresponding path program 1 times [2021-06-10 11:37:45,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:45,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982734285] [2021-06-10 11:37:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:45,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:45,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:45,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982734285] [2021-06-10 11:37:45,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:45,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:45,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914983662] [2021-06-10 11:37:45,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:45,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:45,316 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:45,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 576 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:45,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:45,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:45,491 INFO L129 PetriNetUnfolder]: 27/684 cut-off events. [2021-06-10 11:37:45,491 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:37:45,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 684 events. 27/684 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2933 event pairs, 0 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 847. Up to 24 conditions per place. [2021-06-10 11:37:45,519 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 9 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2021-06-10 11:37:45,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 574 transitions, 1431 flow [2021-06-10 11:37:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2021-06-10 11:37:45,521 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172932330827067 [2021-06-10 11:37:45,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1830 transitions. [2021-06-10 11:37:45,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1830 transitions. [2021-06-10 11:37:45,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:45,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1830 transitions. [2021-06-10 11:37:45,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.0) internal successors, (1830), 3 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,523 INFO L185 Difference]: Start difference. First operand has 650 places, 576 transitions, 1423 flow. Second operand 3 states and 1830 transitions. [2021-06-10 11:37:45,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 574 transitions, 1431 flow [2021-06-10 11:37:45,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 574 transitions, 1430 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:45,528 INFO L241 Difference]: Finished difference. Result has 651 places, 574 transitions, 1412 flow [2021-06-10 11:37:45,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1412, PETRI_PLACES=651, PETRI_TRANSITIONS=574} [2021-06-10 11:37:45,528 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 32 predicate places. [2021-06-10 11:37:45,529 INFO L480 AbstractCegarLoop]: Abstraction has has 651 places, 574 transitions, 1412 flow [2021-06-10 11:37:45,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:45,529 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:45,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2021-06-10 11:37:45,529 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash 200921217, now seen corresponding path program 1 times [2021-06-10 11:37:45,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:45,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310734717] [2021-06-10 11:37:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:45,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:45,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:37:45,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310734717] [2021-06-10 11:37:45,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:45,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:45,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702748263] [2021-06-10 11:37:45,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:45,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:45,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:45,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 574 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:45,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:45,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:45,714 INFO L129 PetriNetUnfolder]: 27/681 cut-off events. [2021-06-10 11:37:45,715 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:45,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 681 events. 27/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2909 event pairs, 0 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 841. Up to 24 conditions per place. [2021-06-10 11:37:45,743 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/571 dead transitions. [2021-06-10 11:37:45,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 571 transitions, 1413 flow [2021-06-10 11:37:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:45,746 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:45,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:45,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:45,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:45,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:45,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,748 INFO L185 Difference]: Start difference. First operand has 651 places, 574 transitions, 1412 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:45,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 571 transitions, 1413 flow [2021-06-10 11:37:45,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 571 transitions, 1408 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:45,753 INFO L241 Difference]: Finished difference. Result has 648 places, 571 transitions, 1398 flow [2021-06-10 11:37:45,754 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=648, PETRI_TRANSITIONS=571} [2021-06-10 11:37:45,754 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 29 predicate places. [2021-06-10 11:37:45,754 INFO L480 AbstractCegarLoop]: Abstraction has has 648 places, 571 transitions, 1398 flow [2021-06-10 11:37:45,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:45,754 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:45,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2021-06-10 11:37:45,754 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:45,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1704098809, now seen corresponding path program 1 times [2021-06-10 11:37:45,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:45,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88831492] [2021-06-10 11:37:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:45,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:45,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:45,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88831492] [2021-06-10 11:37:45,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:45,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:45,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251394032] [2021-06-10 11:37:45,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:45,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:45,771 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:45,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 571 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:45,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:45,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:45,945 INFO L129 PetriNetUnfolder]: 26/688 cut-off events. [2021-06-10 11:37:45,945 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:45,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 688 events. 26/688 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2969 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 851. Up to 24 conditions per place. [2021-06-10 11:37:45,974 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/572 dead transitions. [2021-06-10 11:37:45,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 572 transitions, 1414 flow [2021-06-10 11:37:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:45,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:45,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:45,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:45,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,977 INFO L185 Difference]: Start difference. First operand has 648 places, 571 transitions, 1398 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:45,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 572 transitions, 1414 flow [2021-06-10 11:37:45,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 572 transitions, 1413 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:45,982 INFO L241 Difference]: Finished difference. Result has 650 places, 571 transitions, 1402 flow [2021-06-10 11:37:45,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1402, PETRI_PLACES=650, PETRI_TRANSITIONS=571} [2021-06-10 11:37:45,983 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 31 predicate places. [2021-06-10 11:37:45,983 INFO L480 AbstractCegarLoop]: Abstraction has has 650 places, 571 transitions, 1402 flow [2021-06-10 11:37:45,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:45,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:45,983 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:45,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2021-06-10 11:37:45,983 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1704099832, now seen corresponding path program 1 times [2021-06-10 11:37:45,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:45,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275363736] [2021-06-10 11:37:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:45,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:45,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:45,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:45,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275363736] [2021-06-10 11:37:45,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:45,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:45,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330413853] [2021-06-10 11:37:45,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:45,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:46,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:46,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 571 transitions, 1402 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:46,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:46,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:46,181 INFO L129 PetriNetUnfolder]: 24/690 cut-off events. [2021-06-10 11:37:46,181 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:46,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 690 events. 24/690 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2999 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 860. Up to 24 conditions per place. [2021-06-10 11:37:46,209 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/572 dead transitions. [2021-06-10 11:37:46,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 572 transitions, 1428 flow [2021-06-10 11:37:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:46,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:46,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:46,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:46,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:46,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:46,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,212 INFO L185 Difference]: Start difference. First operand has 650 places, 571 transitions, 1402 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:46,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 572 transitions, 1428 flow [2021-06-10 11:37:46,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 572 transitions, 1427 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:46,218 INFO L241 Difference]: Finished difference. Result has 653 places, 572 transitions, 1419 flow [2021-06-10 11:37:46,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1419, PETRI_PLACES=653, PETRI_TRANSITIONS=572} [2021-06-10 11:37:46,218 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 34 predicate places. [2021-06-10 11:37:46,218 INFO L480 AbstractCegarLoop]: Abstraction has has 653 places, 572 transitions, 1419 flow [2021-06-10 11:37:46,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:46,218 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:46,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2021-06-10 11:37:46,219 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1703146520, now seen corresponding path program 1 times [2021-06-10 11:37:46,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:46,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517054588] [2021-06-10 11:37:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:46,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:46,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:46,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517054588] [2021-06-10 11:37:46,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:46,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:46,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743369045] [2021-06-10 11:37:46,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:46,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:46,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:46,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:46,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:46,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 572 transitions, 1419 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:46,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:46,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:46,413 INFO L129 PetriNetUnfolder]: 24/683 cut-off events. [2021-06-10 11:37:46,413 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:46,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 683 events. 24/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2941 event pairs, 0 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 846. Up to 24 conditions per place. [2021-06-10 11:37:46,435 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2021-06-10 11:37:46,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 570 transitions, 1421 flow [2021-06-10 11:37:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:46,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:46,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:46,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:46,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:46,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:46,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,438 INFO L185 Difference]: Start difference. First operand has 653 places, 572 transitions, 1419 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:46,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 570 transitions, 1421 flow [2021-06-10 11:37:46,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 570 transitions, 1413 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:46,443 INFO L241 Difference]: Finished difference. Result has 653 places, 570 transitions, 1406 flow [2021-06-10 11:37:46,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=653, PETRI_TRANSITIONS=570} [2021-06-10 11:37:46,444 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 34 predicate places. [2021-06-10 11:37:46,444 INFO L480 AbstractCegarLoop]: Abstraction has has 653 places, 570 transitions, 1406 flow [2021-06-10 11:37:46,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:46,444 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:46,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2021-06-10 11:37:46,444 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:46,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1703145497, now seen corresponding path program 1 times [2021-06-10 11:37:46,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:46,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879551279] [2021-06-10 11:37:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:46,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:46,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:37:46,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879551279] [2021-06-10 11:37:46,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:46,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:46,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468620283] [2021-06-10 11:37:46,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:46,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:46,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:46,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:46,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:46,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 570 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:46,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:46,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:46,635 INFO L129 PetriNetUnfolder]: 24/681 cut-off events. [2021-06-10 11:37:46,635 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:46,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 681 events. 24/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2925 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 850. Up to 24 conditions per place. [2021-06-10 11:37:46,662 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/568 dead transitions. [2021-06-10 11:37:46,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 568 transitions, 1419 flow [2021-06-10 11:37:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:46,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:46,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:46,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:46,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:46,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,665 INFO L185 Difference]: Start difference. First operand has 653 places, 570 transitions, 1406 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:46,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 568 transitions, 1419 flow [2021-06-10 11:37:46,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 568 transitions, 1418 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:46,671 INFO L241 Difference]: Finished difference. Result has 652 places, 568 transitions, 1402 flow [2021-06-10 11:37:46,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1402, PETRI_PLACES=652, PETRI_TRANSITIONS=568} [2021-06-10 11:37:46,671 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 33 predicate places. [2021-06-10 11:37:46,671 INFO L480 AbstractCegarLoop]: Abstraction has has 652 places, 568 transitions, 1402 flow [2021-06-10 11:37:46,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,671 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:46,671 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:46,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2021-06-10 11:37:46,671 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash -898201967, now seen corresponding path program 1 times [2021-06-10 11:37:46,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:46,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843953207] [2021-06-10 11:37:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:46,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:46,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:46,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843953207] [2021-06-10 11:37:46,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:46,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:46,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302399812] [2021-06-10 11:37:46,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:46,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:46,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:46,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 568 transitions, 1402 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:46,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:46,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:46,861 INFO L129 PetriNetUnfolder]: 22/686 cut-off events. [2021-06-10 11:37:46,861 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:46,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 686 events. 22/686 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2977 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 853. Up to 24 conditions per place. [2021-06-10 11:37:46,888 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2021-06-10 11:37:46,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 569 transitions, 1418 flow [2021-06-10 11:37:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:46,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:46,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:46,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:46,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:46,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:46,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,891 INFO L185 Difference]: Start difference. First operand has 652 places, 568 transitions, 1402 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:46,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 569 transitions, 1418 flow [2021-06-10 11:37:46,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 569 transitions, 1417 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:46,897 INFO L241 Difference]: Finished difference. Result has 655 places, 569 transitions, 1415 flow [2021-06-10 11:37:46,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=655, PETRI_TRANSITIONS=569} [2021-06-10 11:37:46,897 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 36 predicate places. [2021-06-10 11:37:46,897 INFO L480 AbstractCegarLoop]: Abstraction has has 655 places, 569 transitions, 1415 flow [2021-06-10 11:37:46,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:46,897 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:46,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2021-06-10 11:37:46,898 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -898202990, now seen corresponding path program 1 times [2021-06-10 11:37:46,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:46,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467658291] [2021-06-10 11:37:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:46,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:46,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:46,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:46,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467658291] [2021-06-10 11:37:46,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:46,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:46,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418343085] [2021-06-10 11:37:46,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:46,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:46,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:46,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 569 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:46,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:46,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:46,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:47,095 INFO L129 PetriNetUnfolder]: 22/687 cut-off events. [2021-06-10 11:37:47,095 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:47,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 687 events. 22/687 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2985 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 861. Up to 24 conditions per place. [2021-06-10 11:37:47,122 INFO L132 encePairwiseOnDemand]: 661/665 looper letters, 9 selfloop transitions, 3 changer transitions 0/570 dead transitions. [2021-06-10 11:37:47,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 570 transitions, 1441 flow [2021-06-10 11:37:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2021-06-10 11:37:47,124 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177944862155388 [2021-06-10 11:37:47,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2021-06-10 11:37:47,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2021-06-10 11:37:47,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:47,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2021-06-10 11:37:47,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,126 INFO L185 Difference]: Start difference. First operand has 655 places, 569 transitions, 1415 flow. Second operand 3 states and 1831 transitions. [2021-06-10 11:37:47,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 570 transitions, 1441 flow [2021-06-10 11:37:47,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 570 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:47,131 INFO L241 Difference]: Finished difference. Result has 658 places, 570 transitions, 1431 flow [2021-06-10 11:37:47,131 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=658, PETRI_TRANSITIONS=570} [2021-06-10 11:37:47,131 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 39 predicate places. [2021-06-10 11:37:47,131 INFO L480 AbstractCegarLoop]: Abstraction has has 658 places, 570 transitions, 1431 flow [2021-06-10 11:37:47,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:47,132 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:47,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2021-06-10 11:37:47,132 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -897249678, now seen corresponding path program 1 times [2021-06-10 11:37:47,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:47,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602890978] [2021-06-10 11:37:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:47,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:47,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:47,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602890978] [2021-06-10 11:37:47,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:47,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:47,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312824242] [2021-06-10 11:37:47,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:47,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:47,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:47,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 570 transitions, 1431 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:47,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:47,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:47,322 INFO L129 PetriNetUnfolder]: 21/683 cut-off events. [2021-06-10 11:37:47,322 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:47,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 683 events. 21/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 854. Up to 24 conditions per place. [2021-06-10 11:37:47,350 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2021-06-10 11:37:47,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 567 transitions, 1428 flow [2021-06-10 11:37:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:47,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:47,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:47,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:47,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:47,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:47,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,353 INFO L185 Difference]: Start difference. First operand has 658 places, 570 transitions, 1431 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:47,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 567 transitions, 1428 flow [2021-06-10 11:37:47,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 567 transitions, 1420 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:47,358 INFO L241 Difference]: Finished difference. Result has 657 places, 567 transitions, 1410 flow [2021-06-10 11:37:47,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=657, PETRI_TRANSITIONS=567} [2021-06-10 11:37:47,358 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 38 predicate places. [2021-06-10 11:37:47,359 INFO L480 AbstractCegarLoop]: Abstraction has has 657 places, 567 transitions, 1410 flow [2021-06-10 11:37:47,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:47,359 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:47,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2021-06-10 11:37:47,359 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -897248655, now seen corresponding path program 1 times [2021-06-10 11:37:47,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:47,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039486579] [2021-06-10 11:37:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:47,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:47,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:37:47,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039486579] [2021-06-10 11:37:47,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:47,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:47,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757011654] [2021-06-10 11:37:47,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:47,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:47,376 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:47,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 567 transitions, 1410 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:47,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:47,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:47,555 INFO L129 PetriNetUnfolder]: 21/681 cut-off events. [2021-06-10 11:37:47,555 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:47,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 681 events. 21/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2943 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 857. Up to 24 conditions per place. [2021-06-10 11:37:47,582 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2021-06-10 11:37:47,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 565 transitions, 1423 flow [2021-06-10 11:37:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:47,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:47,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:47,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:47,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:47,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:47,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:47,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,585 INFO L185 Difference]: Start difference. First operand has 657 places, 567 transitions, 1410 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:47,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 565 transitions, 1423 flow [2021-06-10 11:37:47,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 565 transitions, 1422 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:47,590 INFO L241 Difference]: Finished difference. Result has 656 places, 565 transitions, 1406 flow [2021-06-10 11:37:47,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=656, PETRI_TRANSITIONS=565} [2021-06-10 11:37:47,591 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 37 predicate places. [2021-06-10 11:37:47,591 INFO L480 AbstractCegarLoop]: Abstraction has has 656 places, 565 transitions, 1406 flow [2021-06-10 11:37:47,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:47,591 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:47,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2021-06-10 11:37:47,591 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -103804020, now seen corresponding path program 1 times [2021-06-10 11:37:47,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:47,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822406475] [2021-06-10 11:37:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:47,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:47,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:47,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822406475] [2021-06-10 11:37:47,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:47,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:47,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416952837] [2021-06-10 11:37:47,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:47,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:47,608 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:47,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 565 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:47,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:47,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:47,792 INFO L129 PetriNetUnfolder]: 20/689 cut-off events. [2021-06-10 11:37:47,792 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:47,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 689 events. 20/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3014 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 869. Up to 24 conditions per place. [2021-06-10 11:37:47,816 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/567 dead transitions. [2021-06-10 11:37:47,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 567 transitions, 1436 flow [2021-06-10 11:37:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:47,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:47,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:47,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:47,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:47,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:47,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,820 INFO L185 Difference]: Start difference. First operand has 656 places, 565 transitions, 1406 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:47,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 567 transitions, 1436 flow [2021-06-10 11:37:47,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 567 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:47,825 INFO L241 Difference]: Finished difference. Result has 659 places, 567 transitions, 1429 flow [2021-06-10 11:37:47,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1429, PETRI_PLACES=659, PETRI_TRANSITIONS=567} [2021-06-10 11:37:47,825 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 40 predicate places. [2021-06-10 11:37:47,825 INFO L480 AbstractCegarLoop]: Abstraction has has 659 places, 567 transitions, 1429 flow [2021-06-10 11:37:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:47,825 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:47,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2021-06-10 11:37:47,825 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -103802997, now seen corresponding path program 1 times [2021-06-10 11:37:47,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:47,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620427149] [2021-06-10 11:37:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:47,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:47,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:47,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:47,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620427149] [2021-06-10 11:37:47,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:47,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:47,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282661089] [2021-06-10 11:37:47,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:47,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:47,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:47,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 567 transitions, 1429 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:47,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:47,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:47,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:48,016 INFO L129 PetriNetUnfolder]: 19/687 cut-off events. [2021-06-10 11:37:48,016 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:48,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 687 events. 19/687 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3005 event pairs, 0 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 866. Up to 24 conditions per place. [2021-06-10 11:37:48,043 INFO L132 encePairwiseOnDemand]: 662/665 looper letters, 5 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2021-06-10 11:37:48,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 567 transitions, 1441 flow [2021-06-10 11:37:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:48,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:48,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:48,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,046 INFO L185 Difference]: Start difference. First operand has 659 places, 567 transitions, 1429 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:48,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 567 transitions, 1441 flow [2021-06-10 11:37:48,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 567 transitions, 1436 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:48,052 INFO L241 Difference]: Finished difference. Result has 662 places, 567 transitions, 1434 flow [2021-06-10 11:37:48,052 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=662, PETRI_TRANSITIONS=567} [2021-06-10 11:37:48,052 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 43 predicate places. [2021-06-10 11:37:48,052 INFO L480 AbstractCegarLoop]: Abstraction has has 662 places, 567 transitions, 1434 flow [2021-06-10 11:37:48,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:48,053 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:48,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2021-06-10 11:37:48,053 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash -102850708, now seen corresponding path program 1 times [2021-06-10 11:37:48,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:48,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199460761] [2021-06-10 11:37:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:48,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:48,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:48,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199460761] [2021-06-10 11:37:48,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:48,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:48,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255904837] [2021-06-10 11:37:48,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:48,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:48,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:48,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 567 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:48,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:48,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:48,241 INFO L129 PetriNetUnfolder]: 18/683 cut-off events. [2021-06-10 11:37:48,242 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:48,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 683 events. 18/683 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2978 event pairs, 0 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 863. Up to 24 conditions per place. [2021-06-10 11:37:48,268 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/564 dead transitions. [2021-06-10 11:37:48,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 564 transitions, 1431 flow [2021-06-10 11:37:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:48,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:48,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:48,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:48,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:48,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:48,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,271 INFO L185 Difference]: Start difference. First operand has 662 places, 567 transitions, 1434 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:48,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 564 transitions, 1431 flow [2021-06-10 11:37:48,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 564 transitions, 1424 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:48,277 INFO L241 Difference]: Finished difference. Result has 661 places, 564 transitions, 1414 flow [2021-06-10 11:37:48,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=661, PETRI_TRANSITIONS=564} [2021-06-10 11:37:48,277 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 42 predicate places. [2021-06-10 11:37:48,277 INFO L480 AbstractCegarLoop]: Abstraction has has 661 places, 564 transitions, 1414 flow [2021-06-10 11:37:48,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:48,278 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:48,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2021-06-10 11:37:48,278 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash -102849685, now seen corresponding path program 1 times [2021-06-10 11:37:48,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:48,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658388421] [2021-06-10 11:37:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:48,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:48,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:37:48,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658388421] [2021-06-10 11:37:48,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:48,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:48,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044077800] [2021-06-10 11:37:48,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:48,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:48,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:48,297 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:48,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 564 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:48,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:48,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:48,482 INFO L129 PetriNetUnfolder]: 18/681 cut-off events. [2021-06-10 11:37:48,482 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:48,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 681 events. 18/681 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 864. Up to 24 conditions per place. [2021-06-10 11:37:48,508 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2021-06-10 11:37:48,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 562 transitions, 1427 flow [2021-06-10 11:37:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:48,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:48,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:48,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:48,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:48,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:48,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:48,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,511 INFO L185 Difference]: Start difference. First operand has 661 places, 564 transitions, 1414 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:48,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 562 transitions, 1427 flow [2021-06-10 11:37:48,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 562 transitions, 1426 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:48,517 INFO L241 Difference]: Finished difference. Result has 660 places, 562 transitions, 1410 flow [2021-06-10 11:37:48,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1410, PETRI_PLACES=660, PETRI_TRANSITIONS=562} [2021-06-10 11:37:48,517 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 41 predicate places. [2021-06-10 11:37:48,517 INFO L480 AbstractCegarLoop]: Abstraction has has 660 places, 562 transitions, 1410 flow [2021-06-10 11:37:48,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:48,518 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:48,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2021-06-10 11:37:48,518 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1058512282, now seen corresponding path program 1 times [2021-06-10 11:37:48,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:48,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473313405] [2021-06-10 11:37:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:48,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:48,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:48,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473313405] [2021-06-10 11:37:48,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:48,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:48,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477143395] [2021-06-10 11:37:48,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:48,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:48,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:48,535 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:48,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 562 transitions, 1410 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:48,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:48,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:48,722 INFO L129 PetriNetUnfolder]: 17/689 cut-off events. [2021-06-10 11:37:48,722 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:48,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 689 events. 17/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3031 event pairs, 0 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2021-06-10 11:37:48,749 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/564 dead transitions. [2021-06-10 11:37:48,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 564 transitions, 1440 flow [2021-06-10 11:37:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:48,750 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:48,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:48,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:48,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:48,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:48,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,752 INFO L185 Difference]: Start difference. First operand has 660 places, 562 transitions, 1410 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:48,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 564 transitions, 1440 flow [2021-06-10 11:37:48,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 564 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:48,757 INFO L241 Difference]: Finished difference. Result has 663 places, 564 transitions, 1433 flow [2021-06-10 11:37:48,758 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1433, PETRI_PLACES=663, PETRI_TRANSITIONS=564} [2021-06-10 11:37:48,758 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 44 predicate places. [2021-06-10 11:37:48,758 INFO L480 AbstractCegarLoop]: Abstraction has has 663 places, 564 transitions, 1433 flow [2021-06-10 11:37:48,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:48,758 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:48,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2021-06-10 11:37:48,758 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:48,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1058513305, now seen corresponding path program 1 times [2021-06-10 11:37:48,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:48,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660668070] [2021-06-10 11:37:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:48,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:48,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:48,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:48,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660668070] [2021-06-10 11:37:48,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:48,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:48,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515022754] [2021-06-10 11:37:48,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:48,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:48,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:48,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 564 transitions, 1433 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:48,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:48,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:48,953 INFO L129 PetriNetUnfolder]: 15/690 cut-off events. [2021-06-10 11:37:48,953 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:48,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 690 events. 15/690 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3052 event pairs, 0 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2021-06-10 11:37:48,980 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/564 dead transitions. [2021-06-10 11:37:48,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 564 transitions, 1445 flow [2021-06-10 11:37:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:48,981 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:48,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:48,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:48,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:48,983 INFO L185 Difference]: Start difference. First operand has 663 places, 564 transitions, 1433 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:48,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 564 transitions, 1445 flow [2021-06-10 11:37:49,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 564 transitions, 1440 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:49,016 INFO L241 Difference]: Finished difference. Result has 665 places, 563 transitions, 1429 flow [2021-06-10 11:37:49,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1429, PETRI_PLACES=665, PETRI_TRANSITIONS=563} [2021-06-10 11:37:49,016 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 46 predicate places. [2021-06-10 11:37:49,016 INFO L480 AbstractCegarLoop]: Abstraction has has 665 places, 563 transitions, 1429 flow [2021-06-10 11:37:49,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:49,017 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:49,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2021-06-10 11:37:49,017 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:49,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1059465594, now seen corresponding path program 1 times [2021-06-10 11:37:49,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:49,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229193512] [2021-06-10 11:37:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:49,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:49,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:49,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229193512] [2021-06-10 11:37:49,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:49,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:49,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346958350] [2021-06-10 11:37:49,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:49,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:49,035 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:49,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 563 transitions, 1429 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:49,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:49,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:49,210 INFO L129 PetriNetUnfolder]: 15/683 cut-off events. [2021-06-10 11:37:49,210 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:49,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 683 events. 15/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2996 event pairs, 0 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 870. Up to 24 conditions per place. [2021-06-10 11:37:49,236 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2021-06-10 11:37:49,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 561 transitions, 1432 flow [2021-06-10 11:37:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:49,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:49,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:49,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:49,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:49,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:49,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,239 INFO L185 Difference]: Start difference. First operand has 665 places, 563 transitions, 1429 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:49,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 561 transitions, 1432 flow [2021-06-10 11:37:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 561 transitions, 1425 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:49,245 INFO L241 Difference]: Finished difference. Result has 665 places, 561 transitions, 1418 flow [2021-06-10 11:37:49,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=665, PETRI_TRANSITIONS=561} [2021-06-10 11:37:49,245 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 46 predicate places. [2021-06-10 11:37:49,245 INFO L480 AbstractCegarLoop]: Abstraction has has 665 places, 561 transitions, 1418 flow [2021-06-10 11:37:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:49,245 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:49,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2021-06-10 11:37:49,245 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1059466617, now seen corresponding path program 1 times [2021-06-10 11:37:49,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:49,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536799033] [2021-06-10 11:37:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:49,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:49,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:37:49,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536799033] [2021-06-10 11:37:49,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:49,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:49,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361033443] [2021-06-10 11:37:49,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:49,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:49,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:49,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 561 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:49,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:49,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:49,441 INFO L129 PetriNetUnfolder]: 15/681 cut-off events. [2021-06-10 11:37:49,442 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:49,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 681 events. 15/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2978 event pairs, 0 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 870. Up to 24 conditions per place. [2021-06-10 11:37:49,468 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2021-06-10 11:37:49,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 559 transitions, 1431 flow [2021-06-10 11:37:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:49,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:49,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:49,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:49,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:49,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:49,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:49,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,471 INFO L185 Difference]: Start difference. First operand has 665 places, 561 transitions, 1418 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 559 transitions, 1431 flow [2021-06-10 11:37:49,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 559 transitions, 1430 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:49,477 INFO L241 Difference]: Finished difference. Result has 664 places, 559 transitions, 1414 flow [2021-06-10 11:37:49,477 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=664, PETRI_TRANSITIONS=559} [2021-06-10 11:37:49,477 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 45 predicate places. [2021-06-10 11:37:49,477 INFO L480 AbstractCegarLoop]: Abstraction has has 664 places, 559 transitions, 1414 flow [2021-06-10 11:37:49,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:49,477 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:49,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2021-06-10 11:37:49,477 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1591967714, now seen corresponding path program 1 times [2021-06-10 11:37:49,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:49,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436540526] [2021-06-10 11:37:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:49,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:49,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:37:49,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436540526] [2021-06-10 11:37:49,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:49,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:49,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205165160] [2021-06-10 11:37:49,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:49,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:49,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:49,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 559 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:49,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:49,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:49,682 INFO L129 PetriNetUnfolder]: 14/689 cut-off events. [2021-06-10 11:37:49,682 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-10 11:37:49,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 689 events. 14/689 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3050 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 882. Up to 24 conditions per place. [2021-06-10 11:37:49,709 INFO L132 encePairwiseOnDemand]: 660/665 looper letters, 10 selfloop transitions, 3 changer transitions 0/561 dead transitions. [2021-06-10 11:37:49,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 561 transitions, 1444 flow [2021-06-10 11:37:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1833 transitions. [2021-06-10 11:37:49,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187969924812031 [2021-06-10 11:37:49,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1833 transitions. [2021-06-10 11:37:49,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1833 transitions. [2021-06-10 11:37:49,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:49,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1833 transitions. [2021-06-10 11:37:49,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,712 INFO L185 Difference]: Start difference. First operand has 664 places, 559 transitions, 1414 flow. Second operand 3 states and 1833 transitions. [2021-06-10 11:37:49,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 561 transitions, 1444 flow [2021-06-10 11:37:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 561 transitions, 1443 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:49,718 INFO L241 Difference]: Finished difference. Result has 667 places, 561 transitions, 1437 flow [2021-06-10 11:37:49,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=667, PETRI_TRANSITIONS=561} [2021-06-10 11:37:49,718 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 48 predicate places. [2021-06-10 11:37:49,718 INFO L480 AbstractCegarLoop]: Abstraction has has 667 places, 561 transitions, 1437 flow [2021-06-10 11:37:49,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:49,718 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:49,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2021-06-10 11:37:49,718 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:49,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1591966691, now seen corresponding path program 1 times [2021-06-10 11:37:49,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:49,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825968516] [2021-06-10 11:37:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:49,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:49,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:37:49,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825968516] [2021-06-10 11:37:49,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:49,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:49,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915773279] [2021-06-10 11:37:49,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:49,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:49,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:49,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 561 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:49,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:49,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:49,920 INFO L129 PetriNetUnfolder]: 12/690 cut-off events. [2021-06-10 11:37:49,920 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:49,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 690 events. 12/690 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3071 event pairs, 0 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 882. Up to 24 conditions per place. [2021-06-10 11:37:49,948 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 6 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2021-06-10 11:37:49,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 561 transitions, 1449 flow [2021-06-10 11:37:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1841 transitions. [2021-06-10 11:37:49,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2021-06-10 11:37:49,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1841 transitions. [2021-06-10 11:37:49,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1841 transitions. [2021-06-10 11:37:49,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:49,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1841 transitions. [2021-06-10 11:37:49,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.6666666666666) internal successors, (1841), 3 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,951 INFO L185 Difference]: Start difference. First operand has 667 places, 561 transitions, 1437 flow. Second operand 3 states and 1841 transitions. [2021-06-10 11:37:49,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 561 transitions, 1449 flow [2021-06-10 11:37:49,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 561 transitions, 1444 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:49,957 INFO L241 Difference]: Finished difference. Result has 669 places, 560 transitions, 1433 flow [2021-06-10 11:37:49,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1433, PETRI_PLACES=669, PETRI_TRANSITIONS=560} [2021-06-10 11:37:49,957 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 50 predicate places. [2021-06-10 11:37:49,957 INFO L480 AbstractCegarLoop]: Abstraction has has 669 places, 560 transitions, 1433 flow [2021-06-10 11:37:49,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:49,958 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:49,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2021-06-10 11:37:49,958 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1591014402, now seen corresponding path program 1 times [2021-06-10 11:37:49,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:49,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180573313] [2021-06-10 11:37:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:49,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:49,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:49,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:37:49,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180573313] [2021-06-10 11:37:49,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:49,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:49,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110716203] [2021-06-10 11:37:49,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:49,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:49,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 665 [2021-06-10 11:37:49,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 560 transitions, 1433 flow. Second operand has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:49,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:49,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 665 [2021-06-10 11:37:49,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:50,154 INFO L129 PetriNetUnfolder]: 12/683 cut-off events. [2021-06-10 11:37:50,154 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:50,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 683 events. 12/683 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3014 event pairs, 0 based on Foata normal form. 1/650 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2021-06-10 11:37:50,180 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 5 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2021-06-10 11:37:50,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 558 transitions, 1436 flow [2021-06-10 11:37:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1840 transitions. [2021-06-10 11:37:50,181 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9223057644110275 [2021-06-10 11:37:50,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1840 transitions. [2021-06-10 11:37:50,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1840 transitions. [2021-06-10 11:37:50,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:50,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1840 transitions. [2021-06-10 11:37:50,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 613.3333333333334) internal successors, (1840), 3 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,183 INFO L185 Difference]: Start difference. First operand has 669 places, 560 transitions, 1433 flow. Second operand 3 states and 1840 transitions. [2021-06-10 11:37:50,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 558 transitions, 1436 flow [2021-06-10 11:37:50,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 558 transitions, 1429 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:50,188 INFO L241 Difference]: Finished difference. Result has 669 places, 558 transitions, 1422 flow [2021-06-10 11:37:50,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1422, PETRI_PLACES=669, PETRI_TRANSITIONS=558} [2021-06-10 11:37:50,189 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 50 predicate places. [2021-06-10 11:37:50,189 INFO L480 AbstractCegarLoop]: Abstraction has has 669 places, 558 transitions, 1422 flow [2021-06-10 11:37:50,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 612.3333333333334) internal successors, (1837), 3 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,189 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:50,189 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:50,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2021-06-10 11:37:50,189 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1591013379, now seen corresponding path program 1 times [2021-06-10 11:37:50,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:50,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505713988] [2021-06-10 11:37:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:50,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:50,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:50,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:37:50,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505713988] [2021-06-10 11:37:50,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:50,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:50,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144998754] [2021-06-10 11:37:50,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:50,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:50,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:50,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 606 out of 665 [2021-06-10 11:37:50,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 558 transitions, 1422 flow. Second operand has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:50,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 606 of 665 [2021-06-10 11:37:50,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:50,395 INFO L129 PetriNetUnfolder]: 12/681 cut-off events. [2021-06-10 11:37:50,395 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:50,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 681 events. 12/681 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2997 event pairs, 0 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2021-06-10 11:37:50,416 INFO L132 encePairwiseOnDemand]: 663/665 looper letters, 8 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2021-06-10 11:37:50,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 556 transitions, 1435 flow [2021-06-10 11:37:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1828 transitions. [2021-06-10 11:37:50,417 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9162907268170426 [2021-06-10 11:37:50,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1828 transitions. [2021-06-10 11:37:50,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1828 transitions. [2021-06-10 11:37:50,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:50,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1828 transitions. [2021-06-10 11:37:50,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 609.3333333333334) internal successors, (1828), 3 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-06-10 11:37:50,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 665.0) internal successors, (2660), 4 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,419 INFO L185 Difference]: Start difference. First operand has 669 places, 558 transitions, 1422 flow. Second operand 3 states and 1828 transitions. [2021-06-10 11:37:50,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 556 transitions, 1435 flow [2021-06-10 11:37:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 556 transitions, 1434 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:50,424 INFO L241 Difference]: Finished difference. Result has 668 places, 556 transitions, 1418 flow [2021-06-10 11:37:50,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=665, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=668, PETRI_TRANSITIONS=556} [2021-06-10 11:37:50,424 INFO L343 CegarLoopForPetriNet]: 619 programPoint places, 49 predicate places. [2021-06-10 11:37:50,424 INFO L480 AbstractCegarLoop]: Abstraction has has 668 places, 556 transitions, 1418 flow [2021-06-10 11:37:50,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 608.3333333333334) internal successors, (1825), 3 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:50,425 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:50,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2021-06-10 11:37:50,425 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash 593402394, now seen corresponding path program 1 times [2021-06-10 11:37:50,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:50,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802583438] [2021-06-10 11:37:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:50,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:37:50,444 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:37:50,456 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:37:50,456 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:37:50,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2021-06-10 11:37:50,456 WARN L342 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:37:50,456 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,500 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,501 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,507 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of24ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of24ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:37:50,585 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:37:50,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-06-10 11:37:50,586 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:37:50,586 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:37:50,586 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:37:50,586 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:37:50,586 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:37:50,586 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:37:50,586 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:37:50,586 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:37:50,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 645 places, 693 transitions, 2058 flow [2021-06-10 11:37:50,788 INFO L129 PetriNetUnfolder]: 121/908 cut-off events. [2021-06-10 11:37:50,788 INFO L130 PetriNetUnfolder]: For 2576/2576 co-relation queries the response was YES. [2021-06-10 11:37:50,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 908 events. 121/908 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3837 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 1207. Up to 50 conditions per place. [2021-06-10 11:37:50,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 645 places, 693 transitions, 2058 flow [2021-06-10 11:37:50,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 645 places, 693 transitions, 2058 flow [2021-06-10 11:37:50,847 INFO L129 PetriNetUnfolder]: 9/103 cut-off events. [2021-06-10 11:37:50,847 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:37:50,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:50,847 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-06-10 11:37:50,847 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1021477598, now seen corresponding path program 1 times [2021-06-10 11:37:50,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:50,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213777919] [2021-06-10 11:37:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:50,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:50,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:50,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:50,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:50,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213777919] [2021-06-10 11:37:50,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:50,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:50,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682309705] [2021-06-10 11:37:50,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:50,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:50,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:50,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 693 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:50,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:50,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:50,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:51,031 INFO L129 PetriNetUnfolder]: 70/715 cut-off events. [2021-06-10 11:37:51,031 INFO L130 PetriNetUnfolder]: For 2577/2577 co-relation queries the response was YES. [2021-06-10 11:37:51,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 715 events. 70/715 cut-off events. For 2577/2577 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2836 event pairs, 0 based on Foata normal form. 98/717 useless extension candidates. Maximal degree in co-relation 1026. Up to 25 conditions per place. [2021-06-10 11:37:51,070 INFO L132 encePairwiseOnDemand]: 664/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2021-06-10 11:37:51,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 640 transitions, 1966 flow [2021-06-10 11:37:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1971 transitions. [2021-06-10 11:37:51,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.948051948051948 [2021-06-10 11:37:51,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1971 transitions. [2021-06-10 11:37:51,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1971 transitions. [2021-06-10 11:37:51,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:51,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1971 transitions. [2021-06-10 11:37:51,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,074 INFO L185 Difference]: Start difference. First operand has 645 places, 693 transitions, 2058 flow. Second operand 3 states and 1971 transitions. [2021-06-10 11:37:51,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 640 transitions, 1966 flow [2021-06-10 11:37:51,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 640 transitions, 1414 flow, removed 276 selfloop flow, removed 0 redundant places. [2021-06-10 11:37:51,081 INFO L241 Difference]: Finished difference. Result has 620 places, 640 transitions, 1412 flow [2021-06-10 11:37:51,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1412, PETRI_PLACES=620, PETRI_TRANSITIONS=640} [2021-06-10 11:37:51,081 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -25 predicate places. [2021-06-10 11:37:51,081 INFO L480 AbstractCegarLoop]: Abstraction has has 620 places, 640 transitions, 1412 flow [2021-06-10 11:37:51,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:51,082 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-06-10 11:37:51,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2021-06-10 11:37:51,082 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1021476575, now seen corresponding path program 1 times [2021-06-10 11:37:51,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:51,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346805713] [2021-06-10 11:37:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:51,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:51,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:51,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346805713] [2021-06-10 11:37:51,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:51,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:51,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727836318] [2021-06-10 11:37:51,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:51,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:51,097 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:51,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 640 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:51,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:51,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:51,260 INFO L129 PetriNetUnfolder]: 70/716 cut-off events. [2021-06-10 11:37:51,260 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:51,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 716 events. 70/716 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2845 event pairs, 0 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 788. Up to 25 conditions per place. [2021-06-10 11:37:51,294 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/641 dead transitions. [2021-06-10 11:37:51,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 641 transitions, 1438 flow [2021-06-10 11:37:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:37:51,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:37:51,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:37:51,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:37:51,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:51,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:37:51,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,298 INFO L185 Difference]: Start difference. First operand has 620 places, 640 transitions, 1412 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:37:51,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 641 transitions, 1438 flow [2021-06-10 11:37:51,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 641 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:51,303 INFO L241 Difference]: Finished difference. Result has 623 places, 641 transitions, 1428 flow [2021-06-10 11:37:51,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=623, PETRI_TRANSITIONS=641} [2021-06-10 11:37:51,304 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -22 predicate places. [2021-06-10 11:37:51,304 INFO L480 AbstractCegarLoop]: Abstraction has has 623 places, 641 transitions, 1428 flow [2021-06-10 11:37:51,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:51,304 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-06-10 11:37:51,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2021-06-10 11:37:51,304 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1022430910, now seen corresponding path program 1 times [2021-06-10 11:37:51,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:51,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707879932] [2021-06-10 11:37:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:51,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:51,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:51,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707879932] [2021-06-10 11:37:51,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:51,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:51,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114148112] [2021-06-10 11:37:51,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:51,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:51,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:51,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:51,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 641 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:51,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:51,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:51,480 INFO L129 PetriNetUnfolder]: 69/713 cut-off events. [2021-06-10 11:37:51,481 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:37:51,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 713 events. 69/713 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2826 event pairs, 0 based on Foata normal form. 2/622 useless extension candidates. Maximal degree in co-relation 790. Up to 25 conditions per place. [2021-06-10 11:37:51,514 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 9 selfloop transitions, 1 changer transitions 0/639 dead transitions. [2021-06-10 11:37:51,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 639 transitions, 1436 flow [2021-06-10 11:37:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2021-06-10 11:37:51,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:37:51,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2021-06-10 11:37:51,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2021-06-10 11:37:51,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:51,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2021-06-10 11:37:51,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,518 INFO L185 Difference]: Start difference. First operand has 623 places, 641 transitions, 1428 flow. Second operand 3 states and 1908 transitions. [2021-06-10 11:37:51,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 639 transitions, 1436 flow [2021-06-10 11:37:51,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 639 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:51,523 INFO L241 Difference]: Finished difference. Result has 624 places, 639 transitions, 1417 flow [2021-06-10 11:37:51,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1417, PETRI_PLACES=624, PETRI_TRANSITIONS=639} [2021-06-10 11:37:51,524 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -21 predicate places. [2021-06-10 11:37:51,524 INFO L480 AbstractCegarLoop]: Abstraction has has 624 places, 639 transitions, 1417 flow [2021-06-10 11:37:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:51,524 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-06-10 11:37:51,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2021-06-10 11:37:51,524 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1022429887, now seen corresponding path program 1 times [2021-06-10 11:37:51,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:51,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261406874] [2021-06-10 11:37:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:51,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:51,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:37:51,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261406874] [2021-06-10 11:37:51,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:51,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:51,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947047609] [2021-06-10 11:37:51,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:51,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:51,539 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:51,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 639 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:51,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:51,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:51,698 INFO L129 PetriNetUnfolder]: 69/710 cut-off events. [2021-06-10 11:37:51,698 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:51,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 710 events. 69/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2806 event pairs, 0 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 785. Up to 25 conditions per place. [2021-06-10 11:37:51,757 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/636 dead transitions. [2021-06-10 11:37:51,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 636 transitions, 1418 flow [2021-06-10 11:37:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:51,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:51,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:51,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:51,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:51,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:51,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,761 INFO L185 Difference]: Start difference. First operand has 624 places, 639 transitions, 1417 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:51,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 636 transitions, 1418 flow [2021-06-10 11:37:51,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 636 transitions, 1413 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:51,765 INFO L241 Difference]: Finished difference. Result has 621 places, 636 transitions, 1403 flow [2021-06-10 11:37:51,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1403, PETRI_PLACES=621, PETRI_TRANSITIONS=636} [2021-06-10 11:37:51,766 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -24 predicate places. [2021-06-10 11:37:51,766 INFO L480 AbstractCegarLoop]: Abstraction has has 621 places, 636 transitions, 1403 flow [2021-06-10 11:37:51,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,766 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:51,766 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:51,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2021-06-10 11:37:51,766 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1998877860, now seen corresponding path program 1 times [2021-06-10 11:37:51,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:51,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76801571] [2021-06-10 11:37:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:51,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:51,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:51,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:51,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76801571] [2021-06-10 11:37:51,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:51,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:51,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271629178] [2021-06-10 11:37:51,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:51,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:51,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:51,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 636 transitions, 1403 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:51,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:51,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:51,937 INFO L129 PetriNetUnfolder]: 67/715 cut-off events. [2021-06-10 11:37:51,938 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:51,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 715 events. 67/715 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2854 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 793. Up to 25 conditions per place. [2021-06-10 11:37:51,972 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/637 dead transitions. [2021-06-10 11:37:51,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 637 transitions, 1419 flow [2021-06-10 11:37:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:51,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:51,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:51,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:51,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:51,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:51,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,975 INFO L185 Difference]: Start difference. First operand has 621 places, 636 transitions, 1403 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:51,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 637 transitions, 1419 flow [2021-06-10 11:37:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 637 transitions, 1418 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:51,980 INFO L241 Difference]: Finished difference. Result has 624 places, 637 transitions, 1416 flow [2021-06-10 11:37:51,981 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1416, PETRI_PLACES=624, PETRI_TRANSITIONS=637} [2021-06-10 11:37:51,981 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -21 predicate places. [2021-06-10 11:37:51,981 INFO L480 AbstractCegarLoop]: Abstraction has has 624 places, 637 transitions, 1416 flow [2021-06-10 11:37:51,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:51,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:51,981 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:51,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2021-06-10 11:37:51,981 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1998876837, now seen corresponding path program 1 times [2021-06-10 11:37:51,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:51,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279197221] [2021-06-10 11:37:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:51,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:52,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:52,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279197221] [2021-06-10 11:37:52,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:52,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:52,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319673362] [2021-06-10 11:37:52,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:52,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:52,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:52,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 637 transitions, 1416 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:52,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:52,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:52,178 INFO L129 PetriNetUnfolder]: 67/716 cut-off events. [2021-06-10 11:37:52,178 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:52,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 716 events. 67/716 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2863 event pairs, 0 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 798. Up to 25 conditions per place. [2021-06-10 11:37:52,212 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/638 dead transitions. [2021-06-10 11:37:52,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 638 transitions, 1442 flow [2021-06-10 11:37:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:37:52,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:37:52,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:37:52,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:37:52,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:52,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:37:52,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,216 INFO L185 Difference]: Start difference. First operand has 624 places, 637 transitions, 1416 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:37:52,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 638 transitions, 1442 flow [2021-06-10 11:37:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 638 transitions, 1440 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:52,221 INFO L241 Difference]: Finished difference. Result has 627 places, 638 transitions, 1432 flow [2021-06-10 11:37:52,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=627, PETRI_TRANSITIONS=638} [2021-06-10 11:37:52,221 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -18 predicate places. [2021-06-10 11:37:52,221 INFO L480 AbstractCegarLoop]: Abstraction has has 627 places, 638 transitions, 1432 flow [2021-06-10 11:37:52,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:52,222 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:52,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2021-06-10 11:37:52,222 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1999830149, now seen corresponding path program 1 times [2021-06-10 11:37:52,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:52,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368239623] [2021-06-10 11:37:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:52,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:52,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:52,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368239623] [2021-06-10 11:37:52,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:52,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:52,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559553833] [2021-06-10 11:37:52,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:52,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:52,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:52,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 638 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:52,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:52,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:52,403 INFO L129 PetriNetUnfolder]: 66/712 cut-off events. [2021-06-10 11:37:52,403 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:52,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 712 events. 66/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2840 event pairs, 0 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 791. Up to 25 conditions per place. [2021-06-10 11:37:52,437 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/635 dead transitions. [2021-06-10 11:37:52,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 635 transitions, 1429 flow [2021-06-10 11:37:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:52,439 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:52,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:52,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:52,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:52,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:52,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,441 INFO L185 Difference]: Start difference. First operand has 627 places, 638 transitions, 1432 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:52,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 635 transitions, 1429 flow [2021-06-10 11:37:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 635 transitions, 1421 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:52,446 INFO L241 Difference]: Finished difference. Result has 626 places, 635 transitions, 1411 flow [2021-06-10 11:37:52,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1411, PETRI_PLACES=626, PETRI_TRANSITIONS=635} [2021-06-10 11:37:52,446 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -19 predicate places. [2021-06-10 11:37:52,447 INFO L480 AbstractCegarLoop]: Abstraction has has 626 places, 635 transitions, 1411 flow [2021-06-10 11:37:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,447 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:52,447 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:52,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2021-06-10 11:37:52,447 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1999831172, now seen corresponding path program 1 times [2021-06-10 11:37:52,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:52,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076015874] [2021-06-10 11:37:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:52,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:52,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:37:52,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076015874] [2021-06-10 11:37:52,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:52,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:52,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062655111] [2021-06-10 11:37:52,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:52,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:52,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:52,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 635 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:52,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:52,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:52,622 INFO L129 PetriNetUnfolder]: 66/710 cut-off events. [2021-06-10 11:37:52,622 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:52,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 710 events. 66/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2824 event pairs, 0 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 795. Up to 25 conditions per place. [2021-06-10 11:37:52,655 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2021-06-10 11:37:52,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 633 transitions, 1424 flow [2021-06-10 11:37:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:52,656 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:52,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:52,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:52,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:52,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:52,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,658 INFO L185 Difference]: Start difference. First operand has 626 places, 635 transitions, 1411 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:52,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 633 transitions, 1424 flow [2021-06-10 11:37:52,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 633 transitions, 1423 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:52,664 INFO L241 Difference]: Finished difference. Result has 625 places, 633 transitions, 1407 flow [2021-06-10 11:37:52,664 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1407, PETRI_PLACES=625, PETRI_TRANSITIONS=633} [2021-06-10 11:37:52,664 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -20 predicate places. [2021-06-10 11:37:52,664 INFO L480 AbstractCegarLoop]: Abstraction has has 625 places, 633 transitions, 1407 flow [2021-06-10 11:37:52,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,664 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:52,664 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:52,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2021-06-10 11:37:52,664 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1415963500, now seen corresponding path program 1 times [2021-06-10 11:37:52,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:52,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455777879] [2021-06-10 11:37:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:52,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:52,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:52,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455777879] [2021-06-10 11:37:52,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:52,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:52,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540147670] [2021-06-10 11:37:52,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:52,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:52,682 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:52,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 633 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:52,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:52,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:52,863 INFO L129 PetriNetUnfolder]: 65/718 cut-off events. [2021-06-10 11:37:52,863 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:52,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 718 events. 65/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2891 event pairs, 0 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 807. Up to 25 conditions per place. [2021-06-10 11:37:52,897 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/635 dead transitions. [2021-06-10 11:37:52,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 635 transitions, 1437 flow [2021-06-10 11:37:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:52,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:52,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:52,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:52,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:52,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:52,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,900 INFO L185 Difference]: Start difference. First operand has 625 places, 633 transitions, 1407 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:52,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 635 transitions, 1437 flow [2021-06-10 11:37:52,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 635 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:52,906 INFO L241 Difference]: Finished difference. Result has 628 places, 635 transitions, 1430 flow [2021-06-10 11:37:52,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=628, PETRI_TRANSITIONS=635} [2021-06-10 11:37:52,906 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -17 predicate places. [2021-06-10 11:37:52,906 INFO L480 AbstractCegarLoop]: Abstraction has has 628 places, 635 transitions, 1430 flow [2021-06-10 11:37:52,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:52,906 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:52,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2021-06-10 11:37:52,906 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1415964523, now seen corresponding path program 1 times [2021-06-10 11:37:52,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:52,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906340833] [2021-06-10 11:37:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:52,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:52,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:52,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:52,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906340833] [2021-06-10 11:37:52,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:52,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:52,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573192098] [2021-06-10 11:37:52,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:52,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:52,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:52,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 635 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:52,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:52,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:52,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:53,083 INFO L129 PetriNetUnfolder]: 64/716 cut-off events. [2021-06-10 11:37:53,084 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:53,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 716 events. 64/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2880 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 803. Up to 25 conditions per place. [2021-06-10 11:37:53,117 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2021-06-10 11:37:53,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 635 transitions, 1442 flow [2021-06-10 11:37:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:53,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:53,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:53,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:53,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:53,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:53,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,121 INFO L185 Difference]: Start difference. First operand has 628 places, 635 transitions, 1430 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 635 transitions, 1442 flow [2021-06-10 11:37:53,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 635 transitions, 1437 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:53,126 INFO L241 Difference]: Finished difference. Result has 631 places, 635 transitions, 1435 flow [2021-06-10 11:37:53,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=631, PETRI_TRANSITIONS=635} [2021-06-10 11:37:53,127 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -14 predicate places. [2021-06-10 11:37:53,127 INFO L480 AbstractCegarLoop]: Abstraction has has 631 places, 635 transitions, 1435 flow [2021-06-10 11:37:53,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:53,127 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:53,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2021-06-10 11:37:53,127 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1416916812, now seen corresponding path program 1 times [2021-06-10 11:37:53,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:53,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146695173] [2021-06-10 11:37:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:53,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:53,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:53,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146695173] [2021-06-10 11:37:53,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:53,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:53,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010612482] [2021-06-10 11:37:53,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:53,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:53,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:53,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:53,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 635 transitions, 1435 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:53,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:53,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:53,314 INFO L129 PetriNetUnfolder]: 63/712 cut-off events. [2021-06-10 11:37:53,314 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:37:53,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 712 events. 63/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2856 event pairs, 0 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 801. Up to 25 conditions per place. [2021-06-10 11:37:53,346 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/632 dead transitions. [2021-06-10 11:37:53,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 632 transitions, 1432 flow [2021-06-10 11:37:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:53,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:53,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:53,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:53,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:53,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,350 INFO L185 Difference]: Start difference. First operand has 631 places, 635 transitions, 1435 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:53,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 632 transitions, 1432 flow [2021-06-10 11:37:53,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 632 transitions, 1425 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:53,355 INFO L241 Difference]: Finished difference. Result has 630 places, 632 transitions, 1415 flow [2021-06-10 11:37:53,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=630, PETRI_TRANSITIONS=632} [2021-06-10 11:37:53,355 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -15 predicate places. [2021-06-10 11:37:53,355 INFO L480 AbstractCegarLoop]: Abstraction has has 630 places, 632 transitions, 1415 flow [2021-06-10 11:37:53,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:53,356 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:53,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2021-06-10 11:37:53,356 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1416917835, now seen corresponding path program 1 times [2021-06-10 11:37:53,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:53,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244272783] [2021-06-10 11:37:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:53,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:53,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:37:53,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244272783] [2021-06-10 11:37:53,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:53,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:53,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354148960] [2021-06-10 11:37:53,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:53,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:53,370 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:53,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 632 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:53,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:53,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:53,535 INFO L129 PetriNetUnfolder]: 63/710 cut-off events. [2021-06-10 11:37:53,535 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:53,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 710 events. 63/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2838 event pairs, 0 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 802. Up to 25 conditions per place. [2021-06-10 11:37:53,566 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2021-06-10 11:37:53,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 630 transitions, 1428 flow [2021-06-10 11:37:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:53,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:53,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:53,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:53,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:53,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:53,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,570 INFO L185 Difference]: Start difference. First operand has 630 places, 632 transitions, 1415 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 630 transitions, 1428 flow [2021-06-10 11:37:53,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 630 transitions, 1427 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:53,575 INFO L241 Difference]: Finished difference. Result has 629 places, 630 transitions, 1411 flow [2021-06-10 11:37:53,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1411, PETRI_PLACES=629, PETRI_TRANSITIONS=630} [2021-06-10 11:37:53,575 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -16 predicate places. [2021-06-10 11:37:53,575 INFO L480 AbstractCegarLoop]: Abstraction has has 629 places, 630 transitions, 1411 flow [2021-06-10 11:37:53,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,575 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:53,576 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:53,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2021-06-10 11:37:53,576 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1430279277, now seen corresponding path program 1 times [2021-06-10 11:37:53,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:53,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928954908] [2021-06-10 11:37:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:53,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:53,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:53,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928954908] [2021-06-10 11:37:53,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:53,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:53,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044993132] [2021-06-10 11:37:53,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:53,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:53,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:53,590 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:53,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 630 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:53,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:53,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:53,757 INFO L129 PetriNetUnfolder]: 62/718 cut-off events. [2021-06-10 11:37:53,757 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:53,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 718 events. 62/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2911 event pairs, 0 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 814. Up to 25 conditions per place. [2021-06-10 11:37:53,790 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/632 dead transitions. [2021-06-10 11:37:53,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 632 transitions, 1441 flow [2021-06-10 11:37:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:53,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:53,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:53,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:53,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:53,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:53,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,794 INFO L185 Difference]: Start difference. First operand has 629 places, 630 transitions, 1411 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:53,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 632 transitions, 1441 flow [2021-06-10 11:37:53,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 632 transitions, 1440 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:53,799 INFO L241 Difference]: Finished difference. Result has 632 places, 632 transitions, 1434 flow [2021-06-10 11:37:53,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=632, PETRI_TRANSITIONS=632} [2021-06-10 11:37:53,799 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -13 predicate places. [2021-06-10 11:37:53,799 INFO L480 AbstractCegarLoop]: Abstraction has has 632 places, 632 transitions, 1434 flow [2021-06-10 11:37:53,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:53,800 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:53,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2021-06-10 11:37:53,800 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1430280300, now seen corresponding path program 1 times [2021-06-10 11:37:53,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:53,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335904606] [2021-06-10 11:37:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:53,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:53,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:53,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:53,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335904606] [2021-06-10 11:37:53,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:53,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:53,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61966227] [2021-06-10 11:37:53,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:53,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:53,814 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:53,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 632 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:53,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:53,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:53,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:53,977 INFO L129 PetriNetUnfolder]: 60/719 cut-off events. [2021-06-10 11:37:53,977 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:54,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 719 events. 60/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2932 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 813. Up to 25 conditions per place. [2021-06-10 11:37:54,010 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/632 dead transitions. [2021-06-10 11:37:54,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 632 transitions, 1446 flow [2021-06-10 11:37:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:54,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:54,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:54,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,014 INFO L185 Difference]: Start difference. First operand has 632 places, 632 transitions, 1434 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:54,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 632 transitions, 1446 flow [2021-06-10 11:37:54,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 632 transitions, 1441 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:54,019 INFO L241 Difference]: Finished difference. Result has 634 places, 631 transitions, 1430 flow [2021-06-10 11:37:54,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=634, PETRI_TRANSITIONS=631} [2021-06-10 11:37:54,019 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -11 predicate places. [2021-06-10 11:37:54,019 INFO L480 AbstractCegarLoop]: Abstraction has has 634 places, 631 transitions, 1430 flow [2021-06-10 11:37:54,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:54,020 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:54,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2021-06-10 11:37:54,020 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1431233612, now seen corresponding path program 1 times [2021-06-10 11:37:54,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:54,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432642190] [2021-06-10 11:37:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:54,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:54,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:54,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432642190] [2021-06-10 11:37:54,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:54,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:54,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845018947] [2021-06-10 11:37:54,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:54,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:54,034 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:54,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 631 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:54,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:54,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:54,198 INFO L129 PetriNetUnfolder]: 60/713 cut-off events. [2021-06-10 11:37:54,199 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:37:54,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 713 events. 60/713 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2884 event pairs, 0 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 813. Up to 25 conditions per place. [2021-06-10 11:37:54,233 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 9 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2021-06-10 11:37:54,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 629 transitions, 1440 flow [2021-06-10 11:37:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1908 transitions. [2021-06-10 11:37:54,242 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9177489177489178 [2021-06-10 11:37:54,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1908 transitions. [2021-06-10 11:37:54,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1908 transitions. [2021-06-10 11:37:54,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:54,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1908 transitions. [2021-06-10 11:37:54,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,244 INFO L185 Difference]: Start difference. First operand has 634 places, 631 transitions, 1430 flow. Second operand 3 states and 1908 transitions. [2021-06-10 11:37:54,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 629 transitions, 1440 flow [2021-06-10 11:37:54,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 629 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:54,249 INFO L241 Difference]: Finished difference. Result has 635 places, 629 transitions, 1421 flow [2021-06-10 11:37:54,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1421, PETRI_PLACES=635, PETRI_TRANSITIONS=629} [2021-06-10 11:37:54,250 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -10 predicate places. [2021-06-10 11:37:54,250 INFO L480 AbstractCegarLoop]: Abstraction has has 635 places, 629 transitions, 1421 flow [2021-06-10 11:37:54,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:54,250 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:54,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2021-06-10 11:37:54,250 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1431232589, now seen corresponding path program 1 times [2021-06-10 11:37:54,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:54,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445664833] [2021-06-10 11:37:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:54,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:54,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:37:54,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445664833] [2021-06-10 11:37:54,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:54,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:54,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876446675] [2021-06-10 11:37:54,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:54,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:54,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:54,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 629 transitions, 1421 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:54,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:54,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:54,431 INFO L129 PetriNetUnfolder]: 60/710 cut-off events. [2021-06-10 11:37:54,431 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:54,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 710 events. 60/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2858 event pairs, 0 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 804. Up to 25 conditions per place. [2021-06-10 11:37:54,463 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/627 dead transitions. [2021-06-10 11:37:54,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 627 transitions, 1427 flow [2021-06-10 11:37:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:54,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:54,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:54,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:54,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:54,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:54,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,466 INFO L185 Difference]: Start difference. First operand has 635 places, 629 transitions, 1421 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:54,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 627 transitions, 1427 flow [2021-06-10 11:37:54,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 627 transitions, 1422 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:54,471 INFO L241 Difference]: Finished difference. Result has 633 places, 627 transitions, 1415 flow [2021-06-10 11:37:54,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=633, PETRI_TRANSITIONS=627} [2021-06-10 11:37:54,471 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -12 predicate places. [2021-06-10 11:37:54,471 INFO L480 AbstractCegarLoop]: Abstraction has has 633 places, 627 transitions, 1415 flow [2021-06-10 11:37:54,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,472 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:54,472 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:54,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2021-06-10 11:37:54,472 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1736079613, now seen corresponding path program 1 times [2021-06-10 11:37:54,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:54,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358766507] [2021-06-10 11:37:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:54,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:54,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:54,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358766507] [2021-06-10 11:37:54,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:54,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:54,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572490129] [2021-06-10 11:37:54,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:54,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:54,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:54,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 627 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:54,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:54,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:54,662 INFO L129 PetriNetUnfolder]: 59/718 cut-off events. [2021-06-10 11:37:54,663 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:54,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 718 events. 59/718 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2929 event pairs, 0 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 822. Up to 25 conditions per place. [2021-06-10 11:37:54,693 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/629 dead transitions. [2021-06-10 11:37:54,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 629 transitions, 1445 flow [2021-06-10 11:37:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:54,695 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:54,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:54,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:54,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:54,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:54,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,697 INFO L185 Difference]: Start difference. First operand has 633 places, 627 transitions, 1415 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:54,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 629 transitions, 1445 flow [2021-06-10 11:37:54,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 629 transitions, 1444 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:54,702 INFO L241 Difference]: Finished difference. Result has 636 places, 629 transitions, 1438 flow [2021-06-10 11:37:54,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=636, PETRI_TRANSITIONS=629} [2021-06-10 11:37:54,702 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -9 predicate places. [2021-06-10 11:37:54,702 INFO L480 AbstractCegarLoop]: Abstraction has has 636 places, 629 transitions, 1438 flow [2021-06-10 11:37:54,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:54,703 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:54,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2021-06-10 11:37:54,703 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1736080636, now seen corresponding path program 1 times [2021-06-10 11:37:54,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:54,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924301091] [2021-06-10 11:37:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:54,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:54,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:54,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924301091] [2021-06-10 11:37:54,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:54,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:54,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249355735] [2021-06-10 11:37:54,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:54,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:54,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:54,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:54,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 629 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:54,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:54,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:54,893 INFO L129 PetriNetUnfolder]: 58/716 cut-off events. [2021-06-10 11:37:54,894 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:54,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 716 events. 58/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2919 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 817. Up to 25 conditions per place. [2021-06-10 11:37:54,927 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2021-06-10 11:37:54,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 629 transitions, 1450 flow [2021-06-10 11:37:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:54,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:54,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:54,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:54,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,930 INFO L185 Difference]: Start difference. First operand has 636 places, 629 transitions, 1438 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:54,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 629 transitions, 1450 flow [2021-06-10 11:37:54,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 629 transitions, 1445 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:54,936 INFO L241 Difference]: Finished difference. Result has 639 places, 629 transitions, 1443 flow [2021-06-10 11:37:54,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=639, PETRI_TRANSITIONS=629} [2021-06-10 11:37:54,936 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -6 predicate places. [2021-06-10 11:37:54,936 INFO L480 AbstractCegarLoop]: Abstraction has has 639 places, 629 transitions, 1443 flow [2021-06-10 11:37:54,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:54,937 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:54,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2021-06-10 11:37:54,937 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1737032925, now seen corresponding path program 1 times [2021-06-10 11:37:54,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:54,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022945560] [2021-06-10 11:37:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:54,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:54,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:54,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:54,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022945560] [2021-06-10 11:37:54,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:54,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:54,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456616363] [2021-06-10 11:37:54,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:54,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:54,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:54,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 629 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:54,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:54,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:54,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:55,116 INFO L129 PetriNetUnfolder]: 57/712 cut-off events. [2021-06-10 11:37:55,116 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:37:55,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 712 events. 57/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2893 event pairs, 0 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 814. Up to 25 conditions per place. [2021-06-10 11:37:55,148 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2021-06-10 11:37:55,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 626 transitions, 1440 flow [2021-06-10 11:37:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:55,149 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:55,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:55,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:55,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:55,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:55,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,151 INFO L185 Difference]: Start difference. First operand has 639 places, 629 transitions, 1443 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:55,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 626 transitions, 1440 flow [2021-06-10 11:37:55,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 626 transitions, 1433 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:55,156 INFO L241 Difference]: Finished difference. Result has 638 places, 626 transitions, 1423 flow [2021-06-10 11:37:55,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=638, PETRI_TRANSITIONS=626} [2021-06-10 11:37:55,157 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -7 predicate places. [2021-06-10 11:37:55,157 INFO L480 AbstractCegarLoop]: Abstraction has has 638 places, 626 transitions, 1423 flow [2021-06-10 11:37:55,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:55,157 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:55,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2021-06-10 11:37:55,157 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1737033948, now seen corresponding path program 1 times [2021-06-10 11:37:55,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:55,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226827600] [2021-06-10 11:37:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:55,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:55,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:37:55,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226827600] [2021-06-10 11:37:55,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:55,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:55,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401599270] [2021-06-10 11:37:55,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:55,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:55,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:55,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 626 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:55,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:55,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:55,344 INFO L129 PetriNetUnfolder]: 57/710 cut-off events. [2021-06-10 11:37:55,344 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:55,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 710 events. 57/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2876 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 815. Up to 25 conditions per place. [2021-06-10 11:37:55,376 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/624 dead transitions. [2021-06-10 11:37:55,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 624 transitions, 1436 flow [2021-06-10 11:37:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:55,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:55,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:55,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:55,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:55,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:55,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,380 INFO L185 Difference]: Start difference. First operand has 638 places, 626 transitions, 1423 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:55,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 624 transitions, 1436 flow [2021-06-10 11:37:55,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 624 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:55,385 INFO L241 Difference]: Finished difference. Result has 637 places, 624 transitions, 1419 flow [2021-06-10 11:37:55,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1419, PETRI_PLACES=637, PETRI_TRANSITIONS=624} [2021-06-10 11:37:55,385 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -8 predicate places. [2021-06-10 11:37:55,385 INFO L480 AbstractCegarLoop]: Abstraction has has 637 places, 624 transitions, 1419 flow [2021-06-10 11:37:55,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:55,385 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:55,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2021-06-10 11:37:55,386 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 392876454, now seen corresponding path program 1 times [2021-06-10 11:37:55,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:55,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103711775] [2021-06-10 11:37:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:55,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:55,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:55,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103711775] [2021-06-10 11:37:55,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:55,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:55,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299328291] [2021-06-10 11:37:55,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:55,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:55,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:55,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 624 transitions, 1419 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:55,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:55,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:55,571 INFO L129 PetriNetUnfolder]: 56/718 cut-off events. [2021-06-10 11:37:55,572 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:55,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 718 events. 56/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2947 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 827. Up to 25 conditions per place. [2021-06-10 11:37:55,604 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2021-06-10 11:37:55,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 626 transitions, 1449 flow [2021-06-10 11:37:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:55,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:55,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:55,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:55,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:55,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:55,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,607 INFO L185 Difference]: Start difference. First operand has 637 places, 624 transitions, 1419 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 626 transitions, 1449 flow [2021-06-10 11:37:55,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 626 transitions, 1448 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:55,613 INFO L241 Difference]: Finished difference. Result has 640 places, 626 transitions, 1442 flow [2021-06-10 11:37:55,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=640, PETRI_TRANSITIONS=626} [2021-06-10 11:37:55,613 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -5 predicate places. [2021-06-10 11:37:55,613 INFO L480 AbstractCegarLoop]: Abstraction has has 640 places, 626 transitions, 1442 flow [2021-06-10 11:37:55,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:55,613 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:55,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2021-06-10 11:37:55,613 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:55,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 392875431, now seen corresponding path program 1 times [2021-06-10 11:37:55,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:55,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146199974] [2021-06-10 11:37:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:55,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:55,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:55,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146199974] [2021-06-10 11:37:55,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:55,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:55,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010860495] [2021-06-10 11:37:55,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:55,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:55,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:55,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 626 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:55,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:55,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:55,795 INFO L129 PetriNetUnfolder]: 54/719 cut-off events. [2021-06-10 11:37:55,795 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:55,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 719 events. 54/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2968 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 827. Up to 25 conditions per place. [2021-06-10 11:37:55,828 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2021-06-10 11:37:55,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 626 transitions, 1454 flow [2021-06-10 11:37:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:55,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:55,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:55,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:55,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:55,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:55,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,832 INFO L185 Difference]: Start difference. First operand has 640 places, 626 transitions, 1442 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:55,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 626 transitions, 1454 flow [2021-06-10 11:37:55,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 626 transitions, 1449 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:55,838 INFO L241 Difference]: Finished difference. Result has 642 places, 625 transitions, 1438 flow [2021-06-10 11:37:55,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=642, PETRI_TRANSITIONS=625} [2021-06-10 11:37:55,838 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -3 predicate places. [2021-06-10 11:37:55,838 INFO L480 AbstractCegarLoop]: Abstraction has has 642 places, 625 transitions, 1438 flow [2021-06-10 11:37:55,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,838 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:55,838 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:55,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2021-06-10 11:37:55,839 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 391923142, now seen corresponding path program 1 times [2021-06-10 11:37:55,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:55,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99599913] [2021-06-10 11:37:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:55,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:55,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:55,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:55,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99599913] [2021-06-10 11:37:55,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:55,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:55,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600675153] [2021-06-10 11:37:55,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:55,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:55,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:55,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 625 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:55,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:55,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:55,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:56,020 INFO L129 PetriNetUnfolder]: 54/712 cut-off events. [2021-06-10 11:37:56,020 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:56,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 712 events. 54/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2912 event pairs, 0 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 821. Up to 25 conditions per place. [2021-06-10 11:37:56,046 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/623 dead transitions. [2021-06-10 11:37:56,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 623 transitions, 1441 flow [2021-06-10 11:37:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:56,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:56,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:56,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,050 INFO L185 Difference]: Start difference. First operand has 642 places, 625 transitions, 1438 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:56,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 623 transitions, 1441 flow [2021-06-10 11:37:56,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 623 transitions, 1434 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:56,055 INFO L241 Difference]: Finished difference. Result has 642 places, 623 transitions, 1427 flow [2021-06-10 11:37:56,055 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=642, PETRI_TRANSITIONS=623} [2021-06-10 11:37:56,055 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -3 predicate places. [2021-06-10 11:37:56,055 INFO L480 AbstractCegarLoop]: Abstraction has has 642 places, 623 transitions, 1427 flow [2021-06-10 11:37:56,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:56,055 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:56,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2021-06-10 11:37:56,055 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 391922119, now seen corresponding path program 1 times [2021-06-10 11:37:56,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:56,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675340597] [2021-06-10 11:37:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:56,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:56,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:37:56,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675340597] [2021-06-10 11:37:56,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:56,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:56,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326290974] [2021-06-10 11:37:56,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:56,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:56,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:56,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 623 transitions, 1427 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:56,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:56,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:56,236 INFO L129 PetriNetUnfolder]: 54/710 cut-off events. [2021-06-10 11:37:56,237 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:56,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 710 events. 54/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2894 event pairs, 0 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 821. Up to 25 conditions per place. [2021-06-10 11:37:56,268 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/621 dead transitions. [2021-06-10 11:37:56,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 621 transitions, 1440 flow [2021-06-10 11:37:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:56,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:56,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:56,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:56,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:56,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:56,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,271 INFO L185 Difference]: Start difference. First operand has 642 places, 623 transitions, 1427 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:56,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 621 transitions, 1440 flow [2021-06-10 11:37:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 621 transitions, 1439 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:56,276 INFO L241 Difference]: Finished difference. Result has 641 places, 621 transitions, 1423 flow [2021-06-10 11:37:56,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1423, PETRI_PLACES=641, PETRI_TRANSITIONS=621} [2021-06-10 11:37:56,277 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -4 predicate places. [2021-06-10 11:37:56,277 INFO L480 AbstractCegarLoop]: Abstraction has has 641 places, 621 transitions, 1423 flow [2021-06-10 11:37:56,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:56,277 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:56,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2021-06-10 11:37:56,277 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash -106463854, now seen corresponding path program 1 times [2021-06-10 11:37:56,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:56,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834782000] [2021-06-10 11:37:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:56,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:56,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:56,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834782000] [2021-06-10 11:37:56,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:56,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:56,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148715185] [2021-06-10 11:37:56,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:56,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:56,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:56,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:56,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 621 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:56,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:56,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:56,474 INFO L129 PetriNetUnfolder]: 53/718 cut-off events. [2021-06-10 11:37:56,474 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:56,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 718 events. 53/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2964 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 833. Up to 25 conditions per place. [2021-06-10 11:37:56,507 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/623 dead transitions. [2021-06-10 11:37:56,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 623 transitions, 1453 flow [2021-06-10 11:37:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:56,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:56,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:56,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:56,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:56,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:56,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,510 INFO L185 Difference]: Start difference. First operand has 641 places, 621 transitions, 1423 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 623 transitions, 1453 flow [2021-06-10 11:37:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 642 places, 623 transitions, 1452 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:56,516 INFO L241 Difference]: Finished difference. Result has 644 places, 623 transitions, 1446 flow [2021-06-10 11:37:56,516 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1446, PETRI_PLACES=644, PETRI_TRANSITIONS=623} [2021-06-10 11:37:56,516 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, -1 predicate places. [2021-06-10 11:37:56,516 INFO L480 AbstractCegarLoop]: Abstraction has has 644 places, 623 transitions, 1446 flow [2021-06-10 11:37:56,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:56,517 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:56,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2021-06-10 11:37:56,517 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -106462831, now seen corresponding path program 1 times [2021-06-10 11:37:56,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:56,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287229472] [2021-06-10 11:37:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:56,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:56,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:56,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287229472] [2021-06-10 11:37:56,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:56,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:56,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927490541] [2021-06-10 11:37:56,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:56,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:56,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:56,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 623 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:56,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:56,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:56,700 INFO L129 PetriNetUnfolder]: 52/716 cut-off events. [2021-06-10 11:37:56,700 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:56,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 716 events. 52/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2954 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 830. Up to 25 conditions per place. [2021-06-10 11:37:56,731 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2021-06-10 11:37:56,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 623 transitions, 1458 flow [2021-06-10 11:37:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:56,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:56,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:56,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:56,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:56,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:56,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,735 INFO L185 Difference]: Start difference. First operand has 644 places, 623 transitions, 1446 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:56,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 623 transitions, 1458 flow [2021-06-10 11:37:56,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 623 transitions, 1453 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:56,741 INFO L241 Difference]: Finished difference. Result has 647 places, 623 transitions, 1451 flow [2021-06-10 11:37:56,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=647, PETRI_TRANSITIONS=623} [2021-06-10 11:37:56,741 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 2 predicate places. [2021-06-10 11:37:56,741 INFO L480 AbstractCegarLoop]: Abstraction has has 647 places, 623 transitions, 1451 flow [2021-06-10 11:37:56,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:56,741 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:56,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2021-06-10 11:37:56,741 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -105510542, now seen corresponding path program 1 times [2021-06-10 11:37:56,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:56,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959574053] [2021-06-10 11:37:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:56,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:56,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:56,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959574053] [2021-06-10 11:37:56,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:56,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:56,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316826489] [2021-06-10 11:37:56,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:56,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:56,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:56,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 623 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:56,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:56,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:56,925 INFO L129 PetriNetUnfolder]: 51/712 cut-off events. [2021-06-10 11:37:56,925 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:37:56,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 712 events. 51/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2927 event pairs, 0 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 827. Up to 25 conditions per place. [2021-06-10 11:37:56,959 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/620 dead transitions. [2021-06-10 11:37:56,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 620 transitions, 1448 flow [2021-06-10 11:37:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:56,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:56,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:56,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:56,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,962 INFO L185 Difference]: Start difference. First operand has 647 places, 623 transitions, 1451 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:56,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 620 transitions, 1448 flow [2021-06-10 11:37:56,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 620 transitions, 1441 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:56,967 INFO L241 Difference]: Finished difference. Result has 646 places, 620 transitions, 1431 flow [2021-06-10 11:37:56,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=646, PETRI_TRANSITIONS=620} [2021-06-10 11:37:56,968 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 1 predicate places. [2021-06-10 11:37:56,968 INFO L480 AbstractCegarLoop]: Abstraction has has 646 places, 620 transitions, 1431 flow [2021-06-10 11:37:56,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:56,968 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:56,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2021-06-10 11:37:56,968 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:56,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:56,968 INFO L82 PathProgramCache]: Analyzing trace with hash -105509519, now seen corresponding path program 1 times [2021-06-10 11:37:56,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:56,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368807641] [2021-06-10 11:37:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:56,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:56,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:56,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:37:56,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368807641] [2021-06-10 11:37:56,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:56,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:56,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340141939] [2021-06-10 11:37:56,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:56,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:56,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:56,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 620 transitions, 1431 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:56,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:56,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:56,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:57,154 INFO L129 PetriNetUnfolder]: 51/710 cut-off events. [2021-06-10 11:37:57,154 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:57,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 710 events. 51/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2911 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 828. Up to 25 conditions per place. [2021-06-10 11:37:57,186 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/618 dead transitions. [2021-06-10 11:37:57,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 618 transitions, 1444 flow [2021-06-10 11:37:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:57,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:57,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:57,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:57,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:57,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:57,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,189 INFO L185 Difference]: Start difference. First operand has 646 places, 620 transitions, 1431 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:57,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 618 transitions, 1444 flow [2021-06-10 11:37:57,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 618 transitions, 1443 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:57,194 INFO L241 Difference]: Finished difference. Result has 645 places, 618 transitions, 1427 flow [2021-06-10 11:37:57,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=645, PETRI_TRANSITIONS=618} [2021-06-10 11:37:57,195 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 0 predicate places. [2021-06-10 11:37:57,195 INFO L480 AbstractCegarLoop]: Abstraction has has 645 places, 618 transitions, 1427 flow [2021-06-10 11:37:57,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:57,195 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:57,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2021-06-10 11:37:57,195 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash -588654403, now seen corresponding path program 1 times [2021-06-10 11:37:57,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:57,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443226364] [2021-06-10 11:37:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:57,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:57,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:57,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443226364] [2021-06-10 11:37:57,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:57,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:57,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836255084] [2021-06-10 11:37:57,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:57,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:57,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:57,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:57,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 618 transitions, 1427 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:57,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:57,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:57,394 INFO L129 PetriNetUnfolder]: 50/718 cut-off events. [2021-06-10 11:37:57,394 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:57,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 718 events. 50/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2980 event pairs, 0 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 840. Up to 25 conditions per place. [2021-06-10 11:37:57,421 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/620 dead transitions. [2021-06-10 11:37:57,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 620 transitions, 1457 flow [2021-06-10 11:37:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:37:57,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:37:57,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:37:57,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:37:57,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:57,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:37:57,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,424 INFO L185 Difference]: Start difference. First operand has 645 places, 618 transitions, 1427 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:37:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 620 transitions, 1457 flow [2021-06-10 11:37:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 620 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:57,429 INFO L241 Difference]: Finished difference. Result has 648 places, 620 transitions, 1450 flow [2021-06-10 11:37:57,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=648, PETRI_TRANSITIONS=620} [2021-06-10 11:37:57,430 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 3 predicate places. [2021-06-10 11:37:57,430 INFO L480 AbstractCegarLoop]: Abstraction has has 648 places, 620 transitions, 1450 flow [2021-06-10 11:37:57,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:57,430 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:57,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2021-06-10 11:37:57,430 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash -588655426, now seen corresponding path program 1 times [2021-06-10 11:37:57,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:57,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644070480] [2021-06-10 11:37:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:57,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:57,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:57,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644070480] [2021-06-10 11:37:57,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:57,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:57,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635328557] [2021-06-10 11:37:57,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:57,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:57,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:57,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 620 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:57,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:57,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:57,615 INFO L129 PetriNetUnfolder]: 48/719 cut-off events. [2021-06-10 11:37:57,615 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:57,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 719 events. 48/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3002 event pairs, 0 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 840. Up to 25 conditions per place. [2021-06-10 11:37:57,646 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/620 dead transitions. [2021-06-10 11:37:57,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 620 transitions, 1462 flow [2021-06-10 11:37:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:57,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:57,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:57,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:57,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:57,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:57,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,649 INFO L185 Difference]: Start difference. First operand has 648 places, 620 transitions, 1450 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:57,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 620 transitions, 1462 flow [2021-06-10 11:37:57,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 620 transitions, 1457 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:57,655 INFO L241 Difference]: Finished difference. Result has 650 places, 619 transitions, 1446 flow [2021-06-10 11:37:57,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1446, PETRI_PLACES=650, PETRI_TRANSITIONS=619} [2021-06-10 11:37:57,655 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 5 predicate places. [2021-06-10 11:37:57,655 INFO L480 AbstractCegarLoop]: Abstraction has has 650 places, 619 transitions, 1446 flow [2021-06-10 11:37:57,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:57,655 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:57,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2021-06-10 11:37:57,655 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -589607715, now seen corresponding path program 1 times [2021-06-10 11:37:57,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:57,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814571810] [2021-06-10 11:37:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:57,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:57,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:57,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814571810] [2021-06-10 11:37:57,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:57,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:57,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354279155] [2021-06-10 11:37:57,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:57,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:57,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:57,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:57,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 619 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:57,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:57,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:57,841 INFO L129 PetriNetUnfolder]: 48/712 cut-off events. [2021-06-10 11:37:57,841 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:57,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 712 events. 48/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2945 event pairs, 0 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 834. Up to 25 conditions per place. [2021-06-10 11:37:57,874 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2021-06-10 11:37:57,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 617 transitions, 1449 flow [2021-06-10 11:37:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:57,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:57,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:57,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:57,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:57,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:57,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,877 INFO L185 Difference]: Start difference. First operand has 650 places, 619 transitions, 1446 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 617 transitions, 1449 flow [2021-06-10 11:37:57,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 617 transitions, 1442 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:57,882 INFO L241 Difference]: Finished difference. Result has 650 places, 617 transitions, 1435 flow [2021-06-10 11:37:57,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=650, PETRI_TRANSITIONS=617} [2021-06-10 11:37:57,883 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 5 predicate places. [2021-06-10 11:37:57,883 INFO L480 AbstractCegarLoop]: Abstraction has has 650 places, 617 transitions, 1435 flow [2021-06-10 11:37:57,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:57,883 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:57,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2021-06-10 11:37:57,883 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash -589608738, now seen corresponding path program 1 times [2021-06-10 11:37:57,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:57,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735927341] [2021-06-10 11:37:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:57,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:57,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:57,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:37:57,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735927341] [2021-06-10 11:37:57,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:57,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:57,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066157032] [2021-06-10 11:37:57,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:57,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:57,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:57,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 617 transitions, 1435 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:57,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:57,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:57,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:58,069 INFO L129 PetriNetUnfolder]: 48/710 cut-off events. [2021-06-10 11:37:58,069 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:58,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 710 events. 48/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2927 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 834. Up to 25 conditions per place. [2021-06-10 11:37:58,100 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/615 dead transitions. [2021-06-10 11:37:58,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 615 transitions, 1448 flow [2021-06-10 11:37:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:58,101 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:58,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:58,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:58,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:58,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:58,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,104 INFO L185 Difference]: Start difference. First operand has 650 places, 617 transitions, 1435 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:58,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 615 transitions, 1448 flow [2021-06-10 11:37:58,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 615 transitions, 1447 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:58,109 INFO L241 Difference]: Finished difference. Result has 649 places, 615 transitions, 1431 flow [2021-06-10 11:37:58,109 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1431, PETRI_PLACES=649, PETRI_TRANSITIONS=615} [2021-06-10 11:37:58,109 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 4 predicate places. [2021-06-10 11:37:58,109 INFO L480 AbstractCegarLoop]: Abstraction has has 649 places, 615 transitions, 1431 flow [2021-06-10 11:37:58,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,110 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:58,110 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:58,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2021-06-10 11:37:58,110 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2069774806, now seen corresponding path program 1 times [2021-06-10 11:37:58,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:58,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139875914] [2021-06-10 11:37:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:58,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:58,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:58,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139875914] [2021-06-10 11:37:58,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:58,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:58,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958650612] [2021-06-10 11:37:58,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:58,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:58,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:58,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 615 transitions, 1431 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:58,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:58,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:58,295 INFO L129 PetriNetUnfolder]: 46/715 cut-off events. [2021-06-10 11:37:58,295 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:58,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 715 events. 46/715 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2977 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 837. Up to 25 conditions per place. [2021-06-10 11:37:58,326 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/616 dead transitions. [2021-06-10 11:37:58,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 616 transitions, 1447 flow [2021-06-10 11:37:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:58,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:58,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:58,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:58,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:58,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:58,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,329 INFO L185 Difference]: Start difference. First operand has 649 places, 615 transitions, 1431 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:58,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 616 transitions, 1447 flow [2021-06-10 11:37:58,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 616 transitions, 1446 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:58,334 INFO L241 Difference]: Finished difference. Result has 652 places, 616 transitions, 1444 flow [2021-06-10 11:37:58,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=652, PETRI_TRANSITIONS=616} [2021-06-10 11:37:58,335 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 7 predicate places. [2021-06-10 11:37:58,335 INFO L480 AbstractCegarLoop]: Abstraction has has 652 places, 616 transitions, 1444 flow [2021-06-10 11:37:58,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:58,335 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:58,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2021-06-10 11:37:58,335 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2069775829, now seen corresponding path program 1 times [2021-06-10 11:37:58,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:58,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632522666] [2021-06-10 11:37:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:58,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:58,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:58,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632522666] [2021-06-10 11:37:58,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:58,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:58,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809895611] [2021-06-10 11:37:58,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:58,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:58,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:58,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 616 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:58,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:58,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:58,529 INFO L129 PetriNetUnfolder]: 46/716 cut-off events. [2021-06-10 11:37:58,529 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:37:58,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 716 events. 46/716 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2987 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 845. Up to 25 conditions per place. [2021-06-10 11:37:58,561 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/617 dead transitions. [2021-06-10 11:37:58,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 617 transitions, 1470 flow [2021-06-10 11:37:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:37:58,569 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:37:58,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:37:58,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:37:58,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:58,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:37:58,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,571 INFO L185 Difference]: Start difference. First operand has 652 places, 616 transitions, 1444 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:37:58,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 617 transitions, 1470 flow [2021-06-10 11:37:58,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 617 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:58,577 INFO L241 Difference]: Finished difference. Result has 655 places, 617 transitions, 1460 flow [2021-06-10 11:37:58,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=655, PETRI_TRANSITIONS=617} [2021-06-10 11:37:58,577 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 10 predicate places. [2021-06-10 11:37:58,577 INFO L480 AbstractCegarLoop]: Abstraction has has 655 places, 617 transitions, 1460 flow [2021-06-10 11:37:58,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:58,578 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:58,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2021-06-10 11:37:58,578 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2068822517, now seen corresponding path program 1 times [2021-06-10 11:37:58,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:58,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887620] [2021-06-10 11:37:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:58,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:58,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:58,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887620] [2021-06-10 11:37:58,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:58,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:58,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019882720] [2021-06-10 11:37:58,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:58,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:58,595 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:58,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 617 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:58,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:58,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:58,782 INFO L129 PetriNetUnfolder]: 45/712 cut-off events. [2021-06-10 11:37:58,782 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:58,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 712 events. 45/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 838. Up to 25 conditions per place. [2021-06-10 11:37:58,811 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/614 dead transitions. [2021-06-10 11:37:58,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 614 transitions, 1457 flow [2021-06-10 11:37:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:58,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:58,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:58,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:58,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:58,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:58,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,814 INFO L185 Difference]: Start difference. First operand has 655 places, 617 transitions, 1460 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:58,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 614 transitions, 1457 flow [2021-06-10 11:37:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 614 transitions, 1449 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:58,819 INFO L241 Difference]: Finished difference. Result has 654 places, 614 transitions, 1439 flow [2021-06-10 11:37:58,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=654, PETRI_TRANSITIONS=614} [2021-06-10 11:37:58,819 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 9 predicate places. [2021-06-10 11:37:58,819 INFO L480 AbstractCegarLoop]: Abstraction has has 654 places, 614 transitions, 1439 flow [2021-06-10 11:37:58,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,820 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:58,820 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:58,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2021-06-10 11:37:58,820 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2068821494, now seen corresponding path program 1 times [2021-06-10 11:37:58,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:58,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696557731] [2021-06-10 11:37:58,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:58,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:58,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:58,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:37:58,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696557731] [2021-06-10 11:37:58,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:58,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:58,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686099700] [2021-06-10 11:37:58,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:58,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:58,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:58,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:58,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 614 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:58,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:58,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:58,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:59,007 INFO L129 PetriNetUnfolder]: 45/710 cut-off events. [2021-06-10 11:37:59,007 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:59,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 710 events. 45/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2945 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 841. Up to 25 conditions per place. [2021-06-10 11:37:59,038 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/612 dead transitions. [2021-06-10 11:37:59,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 612 transitions, 1452 flow [2021-06-10 11:37:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:37:59,039 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:37:59,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:37:59,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:37:59,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:59,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:37:59,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,041 INFO L185 Difference]: Start difference. First operand has 654 places, 614 transitions, 1439 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:37:59,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 612 transitions, 1452 flow [2021-06-10 11:37:59,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 612 transitions, 1451 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:59,047 INFO L241 Difference]: Finished difference. Result has 653 places, 612 transitions, 1435 flow [2021-06-10 11:37:59,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1435, PETRI_PLACES=653, PETRI_TRANSITIONS=612} [2021-06-10 11:37:59,060 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 8 predicate places. [2021-06-10 11:37:59,061 INFO L480 AbstractCegarLoop]: Abstraction has has 653 places, 612 transitions, 1435 flow [2021-06-10 11:37:59,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,061 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:59,061 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:59,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2021-06-10 11:37:59,061 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1675310553, now seen corresponding path program 1 times [2021-06-10 11:37:59,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:59,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440089791] [2021-06-10 11:37:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:59,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:59,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:59,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440089791] [2021-06-10 11:37:59,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:59,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:59,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271083329] [2021-06-10 11:37:59,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:59,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:59,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:59,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 612 transitions, 1435 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:59,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:59,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:59,280 INFO L129 PetriNetUnfolder]: 44/717 cut-off events. [2021-06-10 11:37:59,280 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:37:59,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 717 events. 44/717 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3004 event pairs, 0 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 846. Up to 25 conditions per place. [2021-06-10 11:37:59,312 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2021-06-10 11:37:59,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 613 transitions, 1451 flow [2021-06-10 11:37:59,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:37:59,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:37:59,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:37:59,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:37:59,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:59,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:37:59,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,316 INFO L185 Difference]: Start difference. First operand has 653 places, 612 transitions, 1435 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:37:59,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 613 transitions, 1451 flow [2021-06-10 11:37:59,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 613 transitions, 1450 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:59,321 INFO L241 Difference]: Finished difference. Result has 655 places, 612 transitions, 1439 flow [2021-06-10 11:37:59,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=655, PETRI_TRANSITIONS=612} [2021-06-10 11:37:59,321 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 10 predicate places. [2021-06-10 11:37:59,321 INFO L480 AbstractCegarLoop]: Abstraction has has 655 places, 612 transitions, 1439 flow [2021-06-10 11:37:59,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:59,322 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:59,322 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2021-06-10 11:37:59,322 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1675311576, now seen corresponding path program 1 times [2021-06-10 11:37:59,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:59,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266390510] [2021-06-10 11:37:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:59,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:37:59,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:59,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266390510] [2021-06-10 11:37:59,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:59,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:59,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427478292] [2021-06-10 11:37:59,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:59,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:59,362 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:59,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 612 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:59,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:59,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:59,627 INFO L129 PetriNetUnfolder]: 42/719 cut-off events. [2021-06-10 11:37:59,627 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:37:59,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 719 events. 42/719 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3038 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 857. Up to 25 conditions per place. [2021-06-10 11:37:59,659 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/613 dead transitions. [2021-06-10 11:37:59,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 613 transitions, 1465 flow [2021-06-10 11:37:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:37:59,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:37:59,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:37:59,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:37:59,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:59,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:37:59,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,662 INFO L185 Difference]: Start difference. First operand has 655 places, 612 transitions, 1439 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:37:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 613 transitions, 1465 flow [2021-06-10 11:37:59,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 613 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:37:59,667 INFO L241 Difference]: Finished difference. Result has 658 places, 613 transitions, 1456 flow [2021-06-10 11:37:59,668 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=658, PETRI_TRANSITIONS=613} [2021-06-10 11:37:59,676 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 13 predicate places. [2021-06-10 11:37:59,676 INFO L480 AbstractCegarLoop]: Abstraction has has 658 places, 613 transitions, 1456 flow [2021-06-10 11:37:59,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:59,676 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:59,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2021-06-10 11:37:59,676 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1674358264, now seen corresponding path program 1 times [2021-06-10 11:37:59,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:59,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465622429] [2021-06-10 11:37:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:59,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:37:59,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:59,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465622429] [2021-06-10 11:37:59,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:59,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:59,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067566674] [2021-06-10 11:37:59,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:59,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:59,692 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:37:59,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 613 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:59,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:37:59,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:37:59,865 INFO L129 PetriNetUnfolder]: 42/712 cut-off events. [2021-06-10 11:37:59,865 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:37:59,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 712 events. 42/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2981 event pairs, 0 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 843. Up to 25 conditions per place. [2021-06-10 11:37:59,895 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2021-06-10 11:37:59,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 611 transitions, 1458 flow [2021-06-10 11:37:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:37:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:37:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:37:59,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:37:59,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:37:59,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:37:59,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:37:59,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:37:59,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,899 INFO L185 Difference]: Start difference. First operand has 658 places, 613 transitions, 1456 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:37:59,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 611 transitions, 1458 flow [2021-06-10 11:37:59,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 611 transitions, 1450 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:37:59,904 INFO L241 Difference]: Finished difference. Result has 658 places, 611 transitions, 1443 flow [2021-06-10 11:37:59,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=658, PETRI_TRANSITIONS=611} [2021-06-10 11:37:59,905 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 13 predicate places. [2021-06-10 11:37:59,905 INFO L480 AbstractCegarLoop]: Abstraction has has 658 places, 611 transitions, 1443 flow [2021-06-10 11:37:59,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:37:59,905 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:37:59,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2021-06-10 11:37:59,905 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:37:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:37:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1674357241, now seen corresponding path program 1 times [2021-06-10 11:37:59,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:37:59,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451230409] [2021-06-10 11:37:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:37:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:37:59,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:37:59,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:37:59,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:37:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:37:59,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451230409] [2021-06-10 11:37:59,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:37:59,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:37:59,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560317952] [2021-06-10 11:37:59,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:37:59,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:37:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:37:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:37:59,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:37:59,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 611 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:37:59,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:37:59,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:37:59,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:00,097 INFO L129 PetriNetUnfolder]: 42/710 cut-off events. [2021-06-10 11:38:00,097 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:00,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 710 events. 42/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2966 event pairs, 0 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 847. Up to 25 conditions per place. [2021-06-10 11:38:00,128 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2021-06-10 11:38:00,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 609 transitions, 1456 flow [2021-06-10 11:38:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:00,129 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:00,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:00,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:00,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:00,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:00,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,131 INFO L185 Difference]: Start difference. First operand has 658 places, 611 transitions, 1443 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:00,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 609 transitions, 1456 flow [2021-06-10 11:38:00,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 609 transitions, 1455 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:00,136 INFO L241 Difference]: Finished difference. Result has 657 places, 609 transitions, 1439 flow [2021-06-10 11:38:00,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=657, PETRI_TRANSITIONS=609} [2021-06-10 11:38:00,137 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 12 predicate places. [2021-06-10 11:38:00,137 INFO L480 AbstractCegarLoop]: Abstraction has has 657 places, 609 transitions, 1439 flow [2021-06-10 11:38:00,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:00,137 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:00,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2021-06-10 11:38:00,137 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552408, now seen corresponding path program 1 times [2021-06-10 11:38:00,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:00,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111847295] [2021-06-10 11:38:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:00,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:00,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:00,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111847295] [2021-06-10 11:38:00,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:00,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:00,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212206563] [2021-06-10 11:38:00,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:00,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:00,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:00,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 609 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:00,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:00,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:00,341 INFO L129 PetriNetUnfolder]: 41/717 cut-off events. [2021-06-10 11:38:00,341 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:00,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 717 events. 41/717 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3023 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 852. Up to 25 conditions per place. [2021-06-10 11:38:00,372 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2021-06-10 11:38:00,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 610 transitions, 1455 flow [2021-06-10 11:38:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:00,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:00,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:00,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:00,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:00,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:00,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,375 INFO L185 Difference]: Start difference. First operand has 657 places, 609 transitions, 1439 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:00,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 610 transitions, 1455 flow [2021-06-10 11:38:00,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 610 transitions, 1454 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:00,380 INFO L241 Difference]: Finished difference. Result has 659 places, 609 transitions, 1443 flow [2021-06-10 11:38:00,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=659, PETRI_TRANSITIONS=609} [2021-06-10 11:38:00,380 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 14 predicate places. [2021-06-10 11:38:00,380 INFO L480 AbstractCegarLoop]: Abstraction has has 659 places, 609 transitions, 1443 flow [2021-06-10 11:38:00,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,381 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:00,381 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:00,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2021-06-10 11:38:00,381 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1538551385, now seen corresponding path program 1 times [2021-06-10 11:38:00,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:00,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801217997] [2021-06-10 11:38:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:00,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:00,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:00,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801217997] [2021-06-10 11:38:00,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:00,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:00,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653043843] [2021-06-10 11:38:00,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:00,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:00,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:00,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 609 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:00,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:00,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:00,580 INFO L129 PetriNetUnfolder]: 39/719 cut-off events. [2021-06-10 11:38:00,580 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:00,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 719 events. 39/719 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3059 event pairs, 0 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 863. Up to 25 conditions per place. [2021-06-10 11:38:00,613 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/610 dead transitions. [2021-06-10 11:38:00,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 610 transitions, 1469 flow [2021-06-10 11:38:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:38:00,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:38:00,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:38:00,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:38:00,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:00,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:38:00,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,616 INFO L185 Difference]: Start difference. First operand has 659 places, 609 transitions, 1443 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:38:00,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 610 transitions, 1469 flow [2021-06-10 11:38:00,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 610 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:00,622 INFO L241 Difference]: Finished difference. Result has 662 places, 610 transitions, 1460 flow [2021-06-10 11:38:00,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=662, PETRI_TRANSITIONS=610} [2021-06-10 11:38:00,622 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 17 predicate places. [2021-06-10 11:38:00,622 INFO L480 AbstractCegarLoop]: Abstraction has has 662 places, 610 transitions, 1460 flow [2021-06-10 11:38:00,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:00,622 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:00,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2021-06-10 11:38:00,622 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1539504697, now seen corresponding path program 1 times [2021-06-10 11:38:00,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:00,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503518048] [2021-06-10 11:38:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:00,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:00,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503518048] [2021-06-10 11:38:00,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:00,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:00,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224777609] [2021-06-10 11:38:00,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:00,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:00,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:00,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 610 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:00,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:00,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:00,840 INFO L129 PetriNetUnfolder]: 39/712 cut-off events. [2021-06-10 11:38:00,841 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:00,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 712 events. 39/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2998 event pairs, 0 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 849. Up to 25 conditions per place. [2021-06-10 11:38:00,872 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2021-06-10 11:38:00,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 608 transitions, 1462 flow [2021-06-10 11:38:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:00,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:00,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:00,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:00,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:00,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,875 INFO L185 Difference]: Start difference. First operand has 662 places, 610 transitions, 1460 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:00,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 608 transitions, 1462 flow [2021-06-10 11:38:00,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 608 transitions, 1454 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:00,881 INFO L241 Difference]: Finished difference. Result has 662 places, 608 transitions, 1447 flow [2021-06-10 11:38:00,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=662, PETRI_TRANSITIONS=608} [2021-06-10 11:38:00,881 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 17 predicate places. [2021-06-10 11:38:00,881 INFO L480 AbstractCegarLoop]: Abstraction has has 662 places, 608 transitions, 1447 flow [2021-06-10 11:38:00,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:00,881 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:00,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2021-06-10 11:38:00,881 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1539505720, now seen corresponding path program 1 times [2021-06-10 11:38:00,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:00,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487972229] [2021-06-10 11:38:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:00,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:00,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:00,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:00,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487972229] [2021-06-10 11:38:00,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:00,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:00,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273799864] [2021-06-10 11:38:00,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:00,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:00,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:00,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:00,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 608 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:00,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:00,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:00,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:01,081 INFO L129 PetriNetUnfolder]: 39/710 cut-off events. [2021-06-10 11:38:01,081 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:01,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 710 events. 39/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2981 event pairs, 0 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 853. Up to 25 conditions per place. [2021-06-10 11:38:01,113 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/606 dead transitions. [2021-06-10 11:38:01,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 606 transitions, 1460 flow [2021-06-10 11:38:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:01,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:01,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:01,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:01,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:01,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:01,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,117 INFO L185 Difference]: Start difference. First operand has 662 places, 608 transitions, 1447 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:01,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 606 transitions, 1460 flow [2021-06-10 11:38:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 606 transitions, 1459 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:01,122 INFO L241 Difference]: Finished difference. Result has 661 places, 606 transitions, 1443 flow [2021-06-10 11:38:01,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=661, PETRI_TRANSITIONS=606} [2021-06-10 11:38:01,123 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 16 predicate places. [2021-06-10 11:38:01,123 INFO L480 AbstractCegarLoop]: Abstraction has has 661 places, 606 transitions, 1443 flow [2021-06-10 11:38:01,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,123 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:01,123 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:01,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2021-06-10 11:38:01,123 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1253800712, now seen corresponding path program 1 times [2021-06-10 11:38:01,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:01,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453099457] [2021-06-10 11:38:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:01,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:01,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:01,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453099457] [2021-06-10 11:38:01,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:01,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:01,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435812088] [2021-06-10 11:38:01,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:01,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:01,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:01,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 606 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:01,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:01,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:01,324 INFO L129 PetriNetUnfolder]: 38/717 cut-off events. [2021-06-10 11:38:01,324 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:01,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 717 events. 38/717 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3042 event pairs, 0 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 858. Up to 25 conditions per place. [2021-06-10 11:38:01,355 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2021-06-10 11:38:01,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 607 transitions, 1459 flow [2021-06-10 11:38:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:01,357 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:01,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:01,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:01,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:01,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:01,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,359 INFO L185 Difference]: Start difference. First operand has 661 places, 606 transitions, 1443 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:01,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 607 transitions, 1459 flow [2021-06-10 11:38:01,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 607 transitions, 1458 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:01,364 INFO L241 Difference]: Finished difference. Result has 663 places, 606 transitions, 1447 flow [2021-06-10 11:38:01,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=663, PETRI_TRANSITIONS=606} [2021-06-10 11:38:01,365 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 18 predicate places. [2021-06-10 11:38:01,365 INFO L480 AbstractCegarLoop]: Abstraction has has 663 places, 606 transitions, 1447 flow [2021-06-10 11:38:01,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,365 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:01,365 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:01,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2021-06-10 11:38:01,365 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1253799689, now seen corresponding path program 1 times [2021-06-10 11:38:01,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:01,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453061425] [2021-06-10 11:38:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:01,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:01,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:01,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453061425] [2021-06-10 11:38:01,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:01,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:01,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850838423] [2021-06-10 11:38:01,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:01,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:01,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:01,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 606 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:01,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:01,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:01,617 INFO L129 PetriNetUnfolder]: 36/719 cut-off events. [2021-06-10 11:38:01,617 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:01,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 719 events. 36/719 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3074 event pairs, 0 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 869. Up to 25 conditions per place. [2021-06-10 11:38:01,637 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/607 dead transitions. [2021-06-10 11:38:01,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 607 transitions, 1473 flow [2021-06-10 11:38:01,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:38:01,638 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:38:01,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:38:01,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:38:01,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:01,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:38:01,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,640 INFO L185 Difference]: Start difference. First operand has 663 places, 606 transitions, 1447 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:38:01,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 607 transitions, 1473 flow [2021-06-10 11:38:01,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 607 transitions, 1472 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:01,646 INFO L241 Difference]: Finished difference. Result has 666 places, 607 transitions, 1464 flow [2021-06-10 11:38:01,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=666, PETRI_TRANSITIONS=607} [2021-06-10 11:38:01,646 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 21 predicate places. [2021-06-10 11:38:01,646 INFO L480 AbstractCegarLoop]: Abstraction has has 666 places, 607 transitions, 1464 flow [2021-06-10 11:38:01,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:01,646 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:01,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2021-06-10 11:38:01,646 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1254753001, now seen corresponding path program 1 times [2021-06-10 11:38:01,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:01,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825515592] [2021-06-10 11:38:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:01,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:01,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:01,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825515592] [2021-06-10 11:38:01,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:01,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:01,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835865542] [2021-06-10 11:38:01,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:01,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:01,663 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:01,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 607 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:01,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:01,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:01,840 INFO L129 PetriNetUnfolder]: 36/712 cut-off events. [2021-06-10 11:38:01,840 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:01,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 712 events. 36/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3015 event pairs, 0 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 855. Up to 25 conditions per place. [2021-06-10 11:38:01,871 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2021-06-10 11:38:01,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 605 transitions, 1466 flow [2021-06-10 11:38:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:01,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:01,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:01,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:01,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:01,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:01,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,874 INFO L185 Difference]: Start difference. First operand has 666 places, 607 transitions, 1464 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:01,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 605 transitions, 1466 flow [2021-06-10 11:38:01,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 605 transitions, 1458 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:01,879 INFO L241 Difference]: Finished difference. Result has 666 places, 605 transitions, 1451 flow [2021-06-10 11:38:01,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=666, PETRI_TRANSITIONS=605} [2021-06-10 11:38:01,879 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 21 predicate places. [2021-06-10 11:38:01,879 INFO L480 AbstractCegarLoop]: Abstraction has has 666 places, 605 transitions, 1451 flow [2021-06-10 11:38:01,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:01,880 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:01,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2021-06-10 11:38:01,880 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1254754024, now seen corresponding path program 1 times [2021-06-10 11:38:01,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:01,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12210809] [2021-06-10 11:38:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:01,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:01,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:01,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:01,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12210809] [2021-06-10 11:38:01,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:01,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:01,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742720653] [2021-06-10 11:38:01,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:01,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:01,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:01,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 605 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:01,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:01,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:01,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:02,074 INFO L129 PetriNetUnfolder]: 36/710 cut-off events. [2021-06-10 11:38:02,074 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:02,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 710 events. 36/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2997 event pairs, 0 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 859. Up to 25 conditions per place. [2021-06-10 11:38:02,104 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/603 dead transitions. [2021-06-10 11:38:02,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 603 transitions, 1464 flow [2021-06-10 11:38:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:02,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:02,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:02,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:02,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:02,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:02,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,107 INFO L185 Difference]: Start difference. First operand has 666 places, 605 transitions, 1451 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:02,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 603 transitions, 1464 flow [2021-06-10 11:38:02,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 603 transitions, 1463 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:02,112 INFO L241 Difference]: Finished difference. Result has 665 places, 603 transitions, 1447 flow [2021-06-10 11:38:02,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1447, PETRI_PLACES=665, PETRI_TRANSITIONS=603} [2021-06-10 11:38:02,113 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 20 predicate places. [2021-06-10 11:38:02,113 INFO L480 AbstractCegarLoop]: Abstraction has has 665 places, 603 transitions, 1447 flow [2021-06-10 11:38:02,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,113 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:02,113 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:02,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2021-06-10 11:38:02,113 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -681490071, now seen corresponding path program 1 times [2021-06-10 11:38:02,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:02,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213018333] [2021-06-10 11:38:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:02,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:02,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213018333] [2021-06-10 11:38:02,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:02,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:02,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744472489] [2021-06-10 11:38:02,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:02,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:02,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:02,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 603 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:02,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:02,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:02,316 INFO L129 PetriNetUnfolder]: 35/718 cut-off events. [2021-06-10 11:38:02,317 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:02,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 718 events. 35/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3067 event pairs, 0 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 871. Up to 25 conditions per place. [2021-06-10 11:38:02,348 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/605 dead transitions. [2021-06-10 11:38:02,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 605 transitions, 1477 flow [2021-06-10 11:38:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:02,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:02,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:02,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:02,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:02,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:02,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,351 INFO L185 Difference]: Start difference. First operand has 665 places, 603 transitions, 1447 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:02,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 605 transitions, 1477 flow [2021-06-10 11:38:02,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 605 transitions, 1476 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:02,356 INFO L241 Difference]: Finished difference. Result has 668 places, 605 transitions, 1470 flow [2021-06-10 11:38:02,356 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=668, PETRI_TRANSITIONS=605} [2021-06-10 11:38:02,357 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 23 predicate places. [2021-06-10 11:38:02,357 INFO L480 AbstractCegarLoop]: Abstraction has has 668 places, 605 transitions, 1470 flow [2021-06-10 11:38:02,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:02,357 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:02,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2021-06-10 11:38:02,357 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash -681489048, now seen corresponding path program 1 times [2021-06-10 11:38:02,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:02,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23831070] [2021-06-10 11:38:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:02,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:02,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:02,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23831070] [2021-06-10 11:38:02,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:02,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:02,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953806741] [2021-06-10 11:38:02,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:02,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:02,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:02,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 605 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:02,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:02,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:02,553 INFO L129 PetriNetUnfolder]: 34/716 cut-off events. [2021-06-10 11:38:02,553 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:02,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 716 events. 34/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3058 event pairs, 0 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 868. Up to 25 conditions per place. [2021-06-10 11:38:02,584 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2021-06-10 11:38:02,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 605 transitions, 1482 flow [2021-06-10 11:38:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:02,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:02,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:02,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:02,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:02,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:02,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,587 INFO L185 Difference]: Start difference. First operand has 668 places, 605 transitions, 1470 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:02,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 605 transitions, 1482 flow [2021-06-10 11:38:02,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 605 transitions, 1477 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:02,593 INFO L241 Difference]: Finished difference. Result has 671 places, 605 transitions, 1475 flow [2021-06-10 11:38:02,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=667, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=671, PETRI_TRANSITIONS=605} [2021-06-10 11:38:02,593 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 26 predicate places. [2021-06-10 11:38:02,593 INFO L480 AbstractCegarLoop]: Abstraction has has 671 places, 605 transitions, 1475 flow [2021-06-10 11:38:02,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:02,593 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:02,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2021-06-10 11:38:02,593 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash -680536759, now seen corresponding path program 1 times [2021-06-10 11:38:02,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:02,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607639631] [2021-06-10 11:38:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:02,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:02,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:02,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607639631] [2021-06-10 11:38:02,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:02,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:02,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716416552] [2021-06-10 11:38:02,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:02,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:02,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:02,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:02,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 605 transitions, 1475 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:02,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:02,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:02,790 INFO L129 PetriNetUnfolder]: 33/712 cut-off events. [2021-06-10 11:38:02,790 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:02,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 712 events. 33/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3030 event pairs, 0 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 865. Up to 25 conditions per place. [2021-06-10 11:38:02,820 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2021-06-10 11:38:02,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 602 transitions, 1472 flow [2021-06-10 11:38:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:02,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:02,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:02,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:02,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:02,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:02,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,823 INFO L185 Difference]: Start difference. First operand has 671 places, 605 transitions, 1475 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 602 transitions, 1472 flow [2021-06-10 11:38:02,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 602 transitions, 1465 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:02,829 INFO L241 Difference]: Finished difference. Result has 670 places, 602 transitions, 1455 flow [2021-06-10 11:38:02,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=670, PETRI_TRANSITIONS=602} [2021-06-10 11:38:02,829 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 25 predicate places. [2021-06-10 11:38:02,829 INFO L480 AbstractCegarLoop]: Abstraction has has 670 places, 602 transitions, 1455 flow [2021-06-10 11:38:02,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:02,829 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:02,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2021-06-10 11:38:02,829 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash -680535736, now seen corresponding path program 1 times [2021-06-10 11:38:02,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:02,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140113937] [2021-06-10 11:38:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:02,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:02,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:02,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:02,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140113937] [2021-06-10 11:38:02,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:02,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:02,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427604516] [2021-06-10 11:38:02,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:02,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:02,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:02,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 602 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:02,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:02,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:02,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:03,052 INFO L129 PetriNetUnfolder]: 33/710 cut-off events. [2021-06-10 11:38:03,052 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:03,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 710 events. 33/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3014 event pairs, 0 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 866. Up to 25 conditions per place. [2021-06-10 11:38:03,082 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/600 dead transitions. [2021-06-10 11:38:03,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 600 transitions, 1468 flow [2021-06-10 11:38:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:03,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:03,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:03,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:03,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:03,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:03,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,086 INFO L185 Difference]: Start difference. First operand has 670 places, 602 transitions, 1455 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:03,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 600 transitions, 1468 flow [2021-06-10 11:38:03,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 669 places, 600 transitions, 1467 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:03,091 INFO L241 Difference]: Finished difference. Result has 669 places, 600 transitions, 1451 flow [2021-06-10 11:38:03,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=667, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=669, PETRI_TRANSITIONS=600} [2021-06-10 11:38:03,092 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 24 predicate places. [2021-06-10 11:38:03,092 INFO L480 AbstractCegarLoop]: Abstraction has has 669 places, 600 transitions, 1451 flow [2021-06-10 11:38:03,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:03,092 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:03,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2021-06-10 11:38:03,092 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:03,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash 883428122, now seen corresponding path program 1 times [2021-06-10 11:38:03,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:03,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786182774] [2021-06-10 11:38:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:03,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:03,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:03,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786182774] [2021-06-10 11:38:03,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:03,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:03,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900350406] [2021-06-10 11:38:03,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:03,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:03,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 600 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:03,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:03,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:03,337 INFO L129 PetriNetUnfolder]: 32/718 cut-off events. [2021-06-10 11:38:03,337 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:03,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 718 events. 32/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3085 event pairs, 0 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 878. Up to 25 conditions per place. [2021-06-10 11:38:03,369 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/602 dead transitions. [2021-06-10 11:38:03,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 602 transitions, 1481 flow [2021-06-10 11:38:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:03,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:03,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:03,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:03,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:03,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:03,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,373 INFO L185 Difference]: Start difference. First operand has 669 places, 600 transitions, 1451 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:03,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 602 transitions, 1481 flow [2021-06-10 11:38:03,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 602 transitions, 1480 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:03,379 INFO L241 Difference]: Finished difference. Result has 672 places, 602 transitions, 1474 flow [2021-06-10 11:38:03,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=672, PETRI_TRANSITIONS=602} [2021-06-10 11:38:03,379 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 27 predicate places. [2021-06-10 11:38:03,379 INFO L480 AbstractCegarLoop]: Abstraction has has 672 places, 602 transitions, 1474 flow [2021-06-10 11:38:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:03,379 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:03,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2021-06-10 11:38:03,380 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash 883427099, now seen corresponding path program 1 times [2021-06-10 11:38:03,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:03,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111895375] [2021-06-10 11:38:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:03,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:03,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:03,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111895375] [2021-06-10 11:38:03,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:03,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:03,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944612603] [2021-06-10 11:38:03,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:03,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:03,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:03,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 602 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:03,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:03,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:03,596 INFO L129 PetriNetUnfolder]: 30/719 cut-off events. [2021-06-10 11:38:03,596 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:03,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 719 events. 30/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3106 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 878. Up to 25 conditions per place. [2021-06-10 11:38:03,626 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2021-06-10 11:38:03,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 602 transitions, 1486 flow [2021-06-10 11:38:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:03,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:03,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:03,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:03,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:03,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:03,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,629 INFO L185 Difference]: Start difference. First operand has 672 places, 602 transitions, 1474 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:03,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 602 transitions, 1486 flow [2021-06-10 11:38:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 602 transitions, 1481 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:03,635 INFO L241 Difference]: Finished difference. Result has 674 places, 601 transitions, 1470 flow [2021-06-10 11:38:03,635 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=674, PETRI_TRANSITIONS=601} [2021-06-10 11:38:03,635 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 29 predicate places. [2021-06-10 11:38:03,635 INFO L480 AbstractCegarLoop]: Abstraction has has 674 places, 601 transitions, 1470 flow [2021-06-10 11:38:03,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:03,635 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:03,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2021-06-10 11:38:03,635 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash 882474810, now seen corresponding path program 1 times [2021-06-10 11:38:03,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:03,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075952696] [2021-06-10 11:38:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:03,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:03,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:03,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075952696] [2021-06-10 11:38:03,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:03,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:03,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236995229] [2021-06-10 11:38:03,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:03,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:03,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:03,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 601 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:03,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:03,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:03,831 INFO L129 PetriNetUnfolder]: 30/712 cut-off events. [2021-06-10 11:38:03,831 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:03,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 712 events. 30/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3050 event pairs, 0 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 872. Up to 25 conditions per place. [2021-06-10 11:38:03,862 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2021-06-10 11:38:03,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 599 transitions, 1473 flow [2021-06-10 11:38:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:03,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:03,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:03,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:03,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:03,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:03,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,865 INFO L185 Difference]: Start difference. First operand has 674 places, 601 transitions, 1470 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:03,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 599 transitions, 1473 flow [2021-06-10 11:38:03,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 599 transitions, 1466 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:03,871 INFO L241 Difference]: Finished difference. Result has 674 places, 599 transitions, 1459 flow [2021-06-10 11:38:03,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1459, PETRI_PLACES=674, PETRI_TRANSITIONS=599} [2021-06-10 11:38:03,871 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 29 predicate places. [2021-06-10 11:38:03,871 INFO L480 AbstractCegarLoop]: Abstraction has has 674 places, 599 transitions, 1459 flow [2021-06-10 11:38:03,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:03,871 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:03,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2021-06-10 11:38:03,871 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash 882473787, now seen corresponding path program 1 times [2021-06-10 11:38:03,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:03,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201401793] [2021-06-10 11:38:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:03,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:03,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:03,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:03,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201401793] [2021-06-10 11:38:03,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:03,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:03,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44396179] [2021-06-10 11:38:03,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:03,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:03,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:03,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 599 transitions, 1459 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:03,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:03,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:03,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:04,071 INFO L129 PetriNetUnfolder]: 30/710 cut-off events. [2021-06-10 11:38:04,071 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:04,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 710 events. 30/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3032 event pairs, 0 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 872. Up to 25 conditions per place. [2021-06-10 11:38:04,102 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/597 dead transitions. [2021-06-10 11:38:04,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 597 transitions, 1472 flow [2021-06-10 11:38:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:04,103 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:04,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:04,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:04,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:04,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:04,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,105 INFO L185 Difference]: Start difference. First operand has 674 places, 599 transitions, 1459 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 597 transitions, 1472 flow [2021-06-10 11:38:04,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 597 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:04,111 INFO L241 Difference]: Finished difference. Result has 673 places, 597 transitions, 1455 flow [2021-06-10 11:38:04,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=673, PETRI_TRANSITIONS=597} [2021-06-10 11:38:04,111 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 28 predicate places. [2021-06-10 11:38:04,111 INFO L480 AbstractCegarLoop]: Abstraction has has 673 places, 597 transitions, 1455 flow [2021-06-10 11:38:04,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:04,112 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:04,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2021-06-10 11:38:04,112 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1899614957, now seen corresponding path program 1 times [2021-06-10 11:38:04,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:04,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337348047] [2021-06-10 11:38:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:04,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:04,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:04,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337348047] [2021-06-10 11:38:04,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:04,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:04,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992764828] [2021-06-10 11:38:04,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:04,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:04,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:04,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 597 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:04,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:04,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:04,320 INFO L129 PetriNetUnfolder]: 29/718 cut-off events. [2021-06-10 11:38:04,320 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:04,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 718 events. 29/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3102 event pairs, 0 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 884. Up to 25 conditions per place. [2021-06-10 11:38:04,351 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/599 dead transitions. [2021-06-10 11:38:04,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 599 transitions, 1485 flow [2021-06-10 11:38:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:04,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:04,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:04,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:04,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:04,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:04,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,354 INFO L185 Difference]: Start difference. First operand has 673 places, 597 transitions, 1455 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:04,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 599 transitions, 1485 flow [2021-06-10 11:38:04,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 674 places, 599 transitions, 1484 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:04,359 INFO L241 Difference]: Finished difference. Result has 676 places, 599 transitions, 1478 flow [2021-06-10 11:38:04,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=676, PETRI_TRANSITIONS=599} [2021-06-10 11:38:04,360 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 31 predicate places. [2021-06-10 11:38:04,360 INFO L480 AbstractCegarLoop]: Abstraction has has 676 places, 599 transitions, 1478 flow [2021-06-10 11:38:04,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:04,360 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:04,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2021-06-10 11:38:04,360 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1899613934, now seen corresponding path program 1 times [2021-06-10 11:38:04,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:04,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951137832] [2021-06-10 11:38:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:04,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:04,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:04,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951137832] [2021-06-10 11:38:04,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:04,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:04,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519614370] [2021-06-10 11:38:04,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:04,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:04,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:04,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 599 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:04,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:04,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:04,562 INFO L129 PetriNetUnfolder]: 27/719 cut-off events. [2021-06-10 11:38:04,562 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:04,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 719 events. 27/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3122 event pairs, 0 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 884. Up to 25 conditions per place. [2021-06-10 11:38:04,593 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/599 dead transitions. [2021-06-10 11:38:04,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 599 transitions, 1490 flow [2021-06-10 11:38:04,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:04,594 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:04,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:04,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:04,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:04,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:04,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,624 INFO L185 Difference]: Start difference. First operand has 676 places, 599 transitions, 1478 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:04,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 599 transitions, 1490 flow [2021-06-10 11:38:04,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 599 transitions, 1485 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:04,629 INFO L241 Difference]: Finished difference. Result has 678 places, 598 transitions, 1474 flow [2021-06-10 11:38:04,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=678, PETRI_TRANSITIONS=598} [2021-06-10 11:38:04,629 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 33 predicate places. [2021-06-10 11:38:04,629 INFO L480 AbstractCegarLoop]: Abstraction has has 678 places, 598 transitions, 1474 flow [2021-06-10 11:38:04,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:04,629 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:04,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2021-06-10 11:38:04,629 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1898661645, now seen corresponding path program 1 times [2021-06-10 11:38:04,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:04,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143200167] [2021-06-10 11:38:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:04,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:04,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:04,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143200167] [2021-06-10 11:38:04,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:04,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:04,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232879371] [2021-06-10 11:38:04,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:04,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:04,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:04,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 598 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:04,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:04,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:04,825 INFO L129 PetriNetUnfolder]: 27/712 cut-off events. [2021-06-10 11:38:04,825 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:04,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 712 events. 27/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3066 event pairs, 0 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 878. Up to 25 conditions per place. [2021-06-10 11:38:04,854 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/596 dead transitions. [2021-06-10 11:38:04,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 596 transitions, 1477 flow [2021-06-10 11:38:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:04,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:04,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:04,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:04,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:04,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:04,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,858 INFO L185 Difference]: Start difference. First operand has 678 places, 598 transitions, 1474 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:04,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 596 transitions, 1477 flow [2021-06-10 11:38:04,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 596 transitions, 1470 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:04,863 INFO L241 Difference]: Finished difference. Result has 678 places, 596 transitions, 1463 flow [2021-06-10 11:38:04,863 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=678, PETRI_TRANSITIONS=596} [2021-06-10 11:38:04,863 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 33 predicate places. [2021-06-10 11:38:04,863 INFO L480 AbstractCegarLoop]: Abstraction has has 678 places, 596 transitions, 1463 flow [2021-06-10 11:38:04,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:04,864 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:04,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2021-06-10 11:38:04,864 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1898660622, now seen corresponding path program 1 times [2021-06-10 11:38:04,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:04,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078325511] [2021-06-10 11:38:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:04,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:04,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:04,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:04,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078325511] [2021-06-10 11:38:04,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:04,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:04,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635474478] [2021-06-10 11:38:04,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:04,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:04,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:04,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 596 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:04,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:04,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:04,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:05,063 INFO L129 PetriNetUnfolder]: 27/710 cut-off events. [2021-06-10 11:38:05,063 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:05,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 710 events. 27/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3049 event pairs, 0 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 878. Up to 25 conditions per place. [2021-06-10 11:38:05,092 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/594 dead transitions. [2021-06-10 11:38:05,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 594 transitions, 1476 flow [2021-06-10 11:38:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:05,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:05,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:05,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:05,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:05,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:05,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,095 INFO L185 Difference]: Start difference. First operand has 678 places, 596 transitions, 1463 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:05,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 594 transitions, 1476 flow [2021-06-10 11:38:05,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 594 transitions, 1475 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:05,100 INFO L241 Difference]: Finished difference. Result has 677 places, 594 transitions, 1459 flow [2021-06-10 11:38:05,101 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1459, PETRI_PLACES=677, PETRI_TRANSITIONS=594} [2021-06-10 11:38:05,101 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 32 predicate places. [2021-06-10 11:38:05,101 INFO L480 AbstractCegarLoop]: Abstraction has has 677 places, 594 transitions, 1459 flow [2021-06-10 11:38:05,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:05,101 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:05,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2021-06-10 11:38:05,101 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1591393694, now seen corresponding path program 1 times [2021-06-10 11:38:05,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:05,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023825446] [2021-06-10 11:38:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:05,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:05,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:05,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023825446] [2021-06-10 11:38:05,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:05,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:05,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357038563] [2021-06-10 11:38:05,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:05,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:05,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:05,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:05,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:05,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 594 transitions, 1459 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:05,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:05,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:05,329 INFO L129 PetriNetUnfolder]: 26/718 cut-off events. [2021-06-10 11:38:05,329 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:05,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 718 events. 26/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3118 event pairs, 0 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 890. Up to 25 conditions per place. [2021-06-10 11:38:05,360 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/596 dead transitions. [2021-06-10 11:38:05,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 596 transitions, 1489 flow [2021-06-10 11:38:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:05,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:05,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:05,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:05,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:05,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:05,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,363 INFO L185 Difference]: Start difference. First operand has 677 places, 594 transitions, 1459 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:05,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 596 transitions, 1489 flow [2021-06-10 11:38:05,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 596 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:05,368 INFO L241 Difference]: Finished difference. Result has 680 places, 596 transitions, 1482 flow [2021-06-10 11:38:05,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=680, PETRI_TRANSITIONS=596} [2021-06-10 11:38:05,369 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 35 predicate places. [2021-06-10 11:38:05,369 INFO L480 AbstractCegarLoop]: Abstraction has has 680 places, 596 transitions, 1482 flow [2021-06-10 11:38:05,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:05,369 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:05,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2021-06-10 11:38:05,369 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1591392671, now seen corresponding path program 1 times [2021-06-10 11:38:05,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:05,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192729520] [2021-06-10 11:38:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:05,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:05,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:05,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192729520] [2021-06-10 11:38:05,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:05,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:05,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20637131] [2021-06-10 11:38:05,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:05,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:05,386 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:05,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 596 transitions, 1482 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:05,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:05,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:05,575 INFO L129 PetriNetUnfolder]: 25/716 cut-off events. [2021-06-10 11:38:05,575 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:05,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 716 events. 25/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3109 event pairs, 0 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 887. Up to 25 conditions per place. [2021-06-10 11:38:05,605 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/596 dead transitions. [2021-06-10 11:38:05,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 596 transitions, 1494 flow [2021-06-10 11:38:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:05,607 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:05,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:05,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:05,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:05,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:05,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,609 INFO L185 Difference]: Start difference. First operand has 680 places, 596 transitions, 1482 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:05,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 596 transitions, 1494 flow [2021-06-10 11:38:05,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 596 transitions, 1489 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:05,614 INFO L241 Difference]: Finished difference. Result has 683 places, 596 transitions, 1487 flow [2021-06-10 11:38:05,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1487, PETRI_PLACES=683, PETRI_TRANSITIONS=596} [2021-06-10 11:38:05,615 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 38 predicate places. [2021-06-10 11:38:05,615 INFO L480 AbstractCegarLoop]: Abstraction has has 683 places, 596 transitions, 1487 flow [2021-06-10 11:38:05,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:05,615 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:05,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2021-06-10 11:38:05,615 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1590440382, now seen corresponding path program 1 times [2021-06-10 11:38:05,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:05,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849806005] [2021-06-10 11:38:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:05,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:05,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:05,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849806005] [2021-06-10 11:38:05,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:05,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:05,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975419566] [2021-06-10 11:38:05,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:05,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:05,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:05,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:05,632 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:05,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 596 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:05,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:05,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:05,814 INFO L129 PetriNetUnfolder]: 24/712 cut-off events. [2021-06-10 11:38:05,814 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:05,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 712 events. 24/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3085 event pairs, 0 based on Foata normal form. 1/666 useless extension candidates. Maximal degree in co-relation 884. Up to 25 conditions per place. [2021-06-10 11:38:05,844 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2021-06-10 11:38:05,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 593 transitions, 1484 flow [2021-06-10 11:38:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:05,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:05,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:05,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:05,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:05,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:05,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,847 INFO L185 Difference]: Start difference. First operand has 683 places, 596 transitions, 1487 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:05,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 593 transitions, 1484 flow [2021-06-10 11:38:05,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 593 transitions, 1477 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:05,853 INFO L241 Difference]: Finished difference. Result has 682 places, 593 transitions, 1467 flow [2021-06-10 11:38:05,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=682, PETRI_TRANSITIONS=593} [2021-06-10 11:38:05,853 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 37 predicate places. [2021-06-10 11:38:05,853 INFO L480 AbstractCegarLoop]: Abstraction has has 682 places, 593 transitions, 1467 flow [2021-06-10 11:38:05,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:05,854 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:05,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2021-06-10 11:38:05,854 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1590439359, now seen corresponding path program 1 times [2021-06-10 11:38:05,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:05,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292708723] [2021-06-10 11:38:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:05,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:05,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:05,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:05,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292708723] [2021-06-10 11:38:05,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:05,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:05,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250321383] [2021-06-10 11:38:05,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:05,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:05,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:05,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 593 transitions, 1467 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:05,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:05,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:05,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:06,058 INFO L129 PetriNetUnfolder]: 24/710 cut-off events. [2021-06-10 11:38:06,058 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:06,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 710 events. 24/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3070 event pairs, 0 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 885. Up to 25 conditions per place. [2021-06-10 11:38:06,087 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/591 dead transitions. [2021-06-10 11:38:06,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 591 transitions, 1480 flow [2021-06-10 11:38:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:06,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:06,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:06,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:06,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:06,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:06,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,090 INFO L185 Difference]: Start difference. First operand has 682 places, 593 transitions, 1467 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:06,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 591 transitions, 1480 flow [2021-06-10 11:38:06,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 591 transitions, 1479 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:06,096 INFO L241 Difference]: Finished difference. Result has 681 places, 591 transitions, 1463 flow [2021-06-10 11:38:06,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1463, PETRI_PLACES=681, PETRI_TRANSITIONS=591} [2021-06-10 11:38:06,096 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 36 predicate places. [2021-06-10 11:38:06,096 INFO L480 AbstractCegarLoop]: Abstraction has has 681 places, 591 transitions, 1463 flow [2021-06-10 11:38:06,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:06,097 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:06,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2021-06-10 11:38:06,097 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash -811549033, now seen corresponding path program 1 times [2021-06-10 11:38:06,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:06,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051335233] [2021-06-10 11:38:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:06,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:06,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:06,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051335233] [2021-06-10 11:38:06,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:06,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:06,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837342074] [2021-06-10 11:38:06,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:06,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:06,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:06,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 591 transitions, 1463 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:06,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:06,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:06,301 INFO L129 PetriNetUnfolder]: 23/717 cut-off events. [2021-06-10 11:38:06,301 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:06,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 717 events. 23/717 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3126 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 890. Up to 25 conditions per place. [2021-06-10 11:38:06,326 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2021-06-10 11:38:06,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 592 transitions, 1479 flow [2021-06-10 11:38:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:06,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:06,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:06,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:06,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:06,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:06,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,329 INFO L185 Difference]: Start difference. First operand has 681 places, 591 transitions, 1463 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 592 transitions, 1479 flow [2021-06-10 11:38:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 592 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:06,334 INFO L241 Difference]: Finished difference. Result has 683 places, 591 transitions, 1467 flow [2021-06-10 11:38:06,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=683, PETRI_TRANSITIONS=591} [2021-06-10 11:38:06,334 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 38 predicate places. [2021-06-10 11:38:06,334 INFO L480 AbstractCegarLoop]: Abstraction has has 683 places, 591 transitions, 1467 flow [2021-06-10 11:38:06,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:06,335 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:06,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2021-06-10 11:38:06,335 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -811548010, now seen corresponding path program 1 times [2021-06-10 11:38:06,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:06,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437864994] [2021-06-10 11:38:06,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:06,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:06,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:06,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437864994] [2021-06-10 11:38:06,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:06,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:06,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331118728] [2021-06-10 11:38:06,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:06,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:06,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:06,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:06,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 591 transitions, 1467 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:06,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:06,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:06,544 INFO L129 PetriNetUnfolder]: 21/719 cut-off events. [2021-06-10 11:38:06,544 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:06,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 719 events. 21/719 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3162 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 901. Up to 25 conditions per place. [2021-06-10 11:38:06,573 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/592 dead transitions. [2021-06-10 11:38:06,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 592 transitions, 1493 flow [2021-06-10 11:38:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:38:06,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:38:06,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:38:06,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:38:06,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:06,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:38:06,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,576 INFO L185 Difference]: Start difference. First operand has 683 places, 591 transitions, 1467 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:38:06,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 592 transitions, 1493 flow [2021-06-10 11:38:06,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 592 transitions, 1492 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:06,582 INFO L241 Difference]: Finished difference. Result has 686 places, 592 transitions, 1484 flow [2021-06-10 11:38:06,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=686, PETRI_TRANSITIONS=592} [2021-06-10 11:38:06,582 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 41 predicate places. [2021-06-10 11:38:06,582 INFO L480 AbstractCegarLoop]: Abstraction has has 686 places, 592 transitions, 1484 flow [2021-06-10 11:38:06,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:06,583 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:06,583 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2021-06-10 11:38:06,583 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash -812501322, now seen corresponding path program 1 times [2021-06-10 11:38:06,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:06,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674692448] [2021-06-10 11:38:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:06,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:06,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:06,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674692448] [2021-06-10 11:38:06,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:06,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:06,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490149538] [2021-06-10 11:38:06,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:06,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:06,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:06,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 592 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:06,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:06,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:06,783 INFO L129 PetriNetUnfolder]: 21/712 cut-off events. [2021-06-10 11:38:06,783 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:06,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 712 events. 21/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3100 event pairs, 0 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 887. Up to 25 conditions per place. [2021-06-10 11:38:06,812 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/590 dead transitions. [2021-06-10 11:38:06,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 590 transitions, 1486 flow [2021-06-10 11:38:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:06,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:06,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:06,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:06,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:06,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:06,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,816 INFO L185 Difference]: Start difference. First operand has 686 places, 592 transitions, 1484 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:06,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 590 transitions, 1486 flow [2021-06-10 11:38:06,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 590 transitions, 1478 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:06,821 INFO L241 Difference]: Finished difference. Result has 686 places, 590 transitions, 1471 flow [2021-06-10 11:38:06,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=686, PETRI_TRANSITIONS=590} [2021-06-10 11:38:06,821 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 41 predicate places. [2021-06-10 11:38:06,821 INFO L480 AbstractCegarLoop]: Abstraction has has 686 places, 590 transitions, 1471 flow [2021-06-10 11:38:06,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:06,822 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:06,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2021-06-10 11:38:06,822 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -812502345, now seen corresponding path program 1 times [2021-06-10 11:38:06,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:06,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970797170] [2021-06-10 11:38:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:06,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:06,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:06,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:06,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970797170] [2021-06-10 11:38:06,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:06,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:06,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767287911] [2021-06-10 11:38:06,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:06,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:06,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:06,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 590 transitions, 1471 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:06,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:06,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:06,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:07,040 INFO L129 PetriNetUnfolder]: 21/710 cut-off events. [2021-06-10 11:38:07,040 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:07,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 710 events. 21/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3084 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 891. Up to 25 conditions per place. [2021-06-10 11:38:07,069 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/588 dead transitions. [2021-06-10 11:38:07,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 588 transitions, 1484 flow [2021-06-10 11:38:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:07,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:07,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:07,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:07,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:07,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:07,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,072 INFO L185 Difference]: Start difference. First operand has 686 places, 590 transitions, 1471 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:07,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 588 transitions, 1484 flow [2021-06-10 11:38:07,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 588 transitions, 1483 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:07,078 INFO L241 Difference]: Finished difference. Result has 685 places, 588 transitions, 1467 flow [2021-06-10 11:38:07,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1467, PETRI_PLACES=685, PETRI_TRANSITIONS=588} [2021-06-10 11:38:07,078 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 40 predicate places. [2021-06-10 11:38:07,078 INFO L480 AbstractCegarLoop]: Abstraction has has 685 places, 588 transitions, 1467 flow [2021-06-10 11:38:07,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:07,078 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:07,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2021-06-10 11:38:07,078 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 37015181, now seen corresponding path program 1 times [2021-06-10 11:38:07,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:07,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155296568] [2021-06-10 11:38:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:07,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:07,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:07,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155296568] [2021-06-10 11:38:07,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:07,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:07,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010180399] [2021-06-10 11:38:07,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:07,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:07,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:07,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 588 transitions, 1467 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:07,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:07,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:07,291 INFO L129 PetriNetUnfolder]: 20/718 cut-off events. [2021-06-10 11:38:07,291 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:07,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 718 events. 20/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3156 event pairs, 0 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 903. Up to 25 conditions per place. [2021-06-10 11:38:07,321 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/590 dead transitions. [2021-06-10 11:38:07,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 590 transitions, 1497 flow [2021-06-10 11:38:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:07,322 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:07,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:07,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:07,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:07,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:07,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,324 INFO L185 Difference]: Start difference. First operand has 685 places, 588 transitions, 1467 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:07,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 590 transitions, 1497 flow [2021-06-10 11:38:07,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 590 transitions, 1496 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:07,330 INFO L241 Difference]: Finished difference. Result has 688 places, 590 transitions, 1490 flow [2021-06-10 11:38:07,330 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=688, PETRI_TRANSITIONS=590} [2021-06-10 11:38:07,330 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 43 predicate places. [2021-06-10 11:38:07,330 INFO L480 AbstractCegarLoop]: Abstraction has has 688 places, 590 transitions, 1490 flow [2021-06-10 11:38:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:07,330 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:07,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2021-06-10 11:38:07,331 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash 37016204, now seen corresponding path program 1 times [2021-06-10 11:38:07,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:07,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376347109] [2021-06-10 11:38:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:07,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:07,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:07,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376347109] [2021-06-10 11:38:07,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:07,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:07,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742772076] [2021-06-10 11:38:07,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:07,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:07,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:07,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:07,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 590 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:07,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:07,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:07,540 INFO L129 PetriNetUnfolder]: 19/716 cut-off events. [2021-06-10 11:38:07,541 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:07,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 716 events. 19/716 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3146 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 900. Up to 25 conditions per place. [2021-06-10 11:38:07,570 INFO L132 encePairwiseOnDemand]: 690/693 looper letters, 5 selfloop transitions, 2 changer transitions 0/590 dead transitions. [2021-06-10 11:38:07,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 590 transitions, 1502 flow [2021-06-10 11:38:07,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:07,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:07,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:07,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:07,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:07,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:07,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,574 INFO L185 Difference]: Start difference. First operand has 688 places, 590 transitions, 1490 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:07,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 590 transitions, 1502 flow [2021-06-10 11:38:07,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 590 transitions, 1497 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:07,579 INFO L241 Difference]: Finished difference. Result has 691 places, 590 transitions, 1495 flow [2021-06-10 11:38:07,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1495, PETRI_PLACES=691, PETRI_TRANSITIONS=590} [2021-06-10 11:38:07,580 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 46 predicate places. [2021-06-10 11:38:07,580 INFO L480 AbstractCegarLoop]: Abstraction has has 691 places, 590 transitions, 1495 flow [2021-06-10 11:38:07,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:07,580 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:07,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2021-06-10 11:38:07,580 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash 37968493, now seen corresponding path program 1 times [2021-06-10 11:38:07,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:07,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6167790] [2021-06-10 11:38:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:07,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:07,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:07,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6167790] [2021-06-10 11:38:07,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:07,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:07,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040027590] [2021-06-10 11:38:07,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:07,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:07,598 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:07,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 590 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:07,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:07,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:07,805 INFO L129 PetriNetUnfolder]: 18/712 cut-off events. [2021-06-10 11:38:07,805 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:07,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 712 events. 18/712 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3118 event pairs, 0 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 897. Up to 25 conditions per place. [2021-06-10 11:38:07,824 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2021-06-10 11:38:07,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 587 transitions, 1492 flow [2021-06-10 11:38:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:07,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:07,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:07,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:07,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:07,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:07,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,828 INFO L185 Difference]: Start difference. First operand has 691 places, 590 transitions, 1495 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:07,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 587 transitions, 1492 flow [2021-06-10 11:38:07,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 587 transitions, 1485 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:07,833 INFO L241 Difference]: Finished difference. Result has 690 places, 587 transitions, 1475 flow [2021-06-10 11:38:07,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=690, PETRI_TRANSITIONS=587} [2021-06-10 11:38:07,833 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 45 predicate places. [2021-06-10 11:38:07,833 INFO L480 AbstractCegarLoop]: Abstraction has has 690 places, 587 transitions, 1475 flow [2021-06-10 11:38:07,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:07,833 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:07,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2021-06-10 11:38:07,834 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash 37969516, now seen corresponding path program 1 times [2021-06-10 11:38:07,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:07,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601882163] [2021-06-10 11:38:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:07,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:07,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:07,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:07,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601882163] [2021-06-10 11:38:07,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:07,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:07,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632742483] [2021-06-10 11:38:07,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:07,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:07,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:07,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 587 transitions, 1475 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:07,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:07,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:07,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:08,045 INFO L129 PetriNetUnfolder]: 18/710 cut-off events. [2021-06-10 11:38:08,045 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:08,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 710 events. 18/710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3101 event pairs, 0 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 898. Up to 25 conditions per place. [2021-06-10 11:38:08,074 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/585 dead transitions. [2021-06-10 11:38:08,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 585 transitions, 1488 flow [2021-06-10 11:38:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:08,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:08,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:08,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:08,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:08,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:08,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,077 INFO L185 Difference]: Start difference. First operand has 690 places, 587 transitions, 1475 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:08,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 585 transitions, 1488 flow [2021-06-10 11:38:08,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 585 transitions, 1487 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:08,083 INFO L241 Difference]: Finished difference. Result has 689 places, 585 transitions, 1471 flow [2021-06-10 11:38:08,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=689, PETRI_TRANSITIONS=585} [2021-06-10 11:38:08,083 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 44 predicate places. [2021-06-10 11:38:08,083 INFO L480 AbstractCegarLoop]: Abstraction has has 689 places, 585 transitions, 1471 flow [2021-06-10 11:38:08,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:08,083 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:08,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2021-06-10 11:38:08,083 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 771713604, now seen corresponding path program 1 times [2021-06-10 11:38:08,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:08,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897876542] [2021-06-10 11:38:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:08,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:08,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:08,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897876542] [2021-06-10 11:38:08,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:08,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:08,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719501591] [2021-06-10 11:38:08,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:08,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:08,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:08,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 585 transitions, 1471 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:08,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:08,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:08,289 INFO L129 PetriNetUnfolder]: 17/717 cut-off events. [2021-06-10 11:38:08,289 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:08,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 717 events. 17/717 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3162 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 903. Up to 25 conditions per place. [2021-06-10 11:38:08,318 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2021-06-10 11:38:08,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 586 transitions, 1487 flow [2021-06-10 11:38:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:08,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:08,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:08,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:08,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:08,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:08,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,321 INFO L185 Difference]: Start difference. First operand has 689 places, 585 transitions, 1471 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:08,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 586 transitions, 1487 flow [2021-06-10 11:38:08,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 586 transitions, 1486 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:08,327 INFO L241 Difference]: Finished difference. Result has 691 places, 585 transitions, 1475 flow [2021-06-10 11:38:08,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=691, PETRI_TRANSITIONS=585} [2021-06-10 11:38:08,327 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 46 predicate places. [2021-06-10 11:38:08,327 INFO L480 AbstractCegarLoop]: Abstraction has has 691 places, 585 transitions, 1475 flow [2021-06-10 11:38:08,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:08,328 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:08,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2021-06-10 11:38:08,328 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 771714627, now seen corresponding path program 1 times [2021-06-10 11:38:08,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:08,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200639914] [2021-06-10 11:38:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:08,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:08,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:08,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200639914] [2021-06-10 11:38:08,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:08,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:08,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630446906] [2021-06-10 11:38:08,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:08,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:08,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:08,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 585 transitions, 1475 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:08,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:08,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:08,543 INFO L129 PetriNetUnfolder]: 15/719 cut-off events. [2021-06-10 11:38:08,543 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:08,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 719 events. 15/719 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3190 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 914. Up to 25 conditions per place. [2021-06-10 11:38:08,573 INFO L132 encePairwiseOnDemand]: 689/693 looper letters, 9 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2021-06-10 11:38:08,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 586 transitions, 1501 flow [2021-06-10 11:38:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1909 transitions. [2021-06-10 11:38:08,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9182299182299183 [2021-06-10 11:38:08,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1909 transitions. [2021-06-10 11:38:08,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1909 transitions. [2021-06-10 11:38:08,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:08,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1909 transitions. [2021-06-10 11:38:08,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,576 INFO L185 Difference]: Start difference. First operand has 691 places, 585 transitions, 1475 flow. Second operand 3 states and 1909 transitions. [2021-06-10 11:38:08,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 586 transitions, 1501 flow [2021-06-10 11:38:08,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 586 transitions, 1500 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:08,582 INFO L241 Difference]: Finished difference. Result has 694 places, 586 transitions, 1492 flow [2021-06-10 11:38:08,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=694, PETRI_TRANSITIONS=586} [2021-06-10 11:38:08,582 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 49 predicate places. [2021-06-10 11:38:08,582 INFO L480 AbstractCegarLoop]: Abstraction has has 694 places, 586 transitions, 1492 flow [2021-06-10 11:38:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:08,582 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:08,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2021-06-10 11:38:08,582 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 770761315, now seen corresponding path program 1 times [2021-06-10 11:38:08,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:08,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784087557] [2021-06-10 11:38:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:08,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:08,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:08,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784087557] [2021-06-10 11:38:08,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:08,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:08,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414294241] [2021-06-10 11:38:08,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:08,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:08,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:08,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:08,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 586 transitions, 1492 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:08,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:08,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:08,788 INFO L129 PetriNetUnfolder]: 15/712 cut-off events. [2021-06-10 11:38:08,788 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:08,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 712 events. 15/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3134 event pairs, 0 based on Foata normal form. 1/675 useless extension candidates. Maximal degree in co-relation 900. Up to 25 conditions per place. [2021-06-10 11:38:08,817 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2021-06-10 11:38:08,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 584 transitions, 1494 flow [2021-06-10 11:38:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:08,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:08,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:08,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:08,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:08,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:08,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,820 INFO L185 Difference]: Start difference. First operand has 694 places, 586 transitions, 1492 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:08,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 584 transitions, 1494 flow [2021-06-10 11:38:08,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 584 transitions, 1486 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:08,826 INFO L241 Difference]: Finished difference. Result has 694 places, 584 transitions, 1479 flow [2021-06-10 11:38:08,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=694, PETRI_TRANSITIONS=584} [2021-06-10 11:38:08,826 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 49 predicate places. [2021-06-10 11:38:08,826 INFO L480 AbstractCegarLoop]: Abstraction has has 694 places, 584 transitions, 1479 flow [2021-06-10 11:38:08,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,826 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:08,826 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:08,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2021-06-10 11:38:08,826 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:08,827 INFO L82 PathProgramCache]: Analyzing trace with hash 770760292, now seen corresponding path program 1 times [2021-06-10 11:38:08,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:08,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731168882] [2021-06-10 11:38:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:08,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:08,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:08,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:08,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731168882] [2021-06-10 11:38:08,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:08,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:08,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95780814] [2021-06-10 11:38:08,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:08,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:08,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:08,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 584 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:08,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:08,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:08,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:09,037 INFO L129 PetriNetUnfolder]: 15/710 cut-off events. [2021-06-10 11:38:09,037 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:09,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 710 events. 15/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3118 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 904. Up to 25 conditions per place. [2021-06-10 11:38:09,065 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/582 dead transitions. [2021-06-10 11:38:09,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 582 transitions, 1492 flow [2021-06-10 11:38:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:09,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:09,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:09,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:09,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:09,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:09,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,068 INFO L185 Difference]: Start difference. First operand has 694 places, 584 transitions, 1479 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:09,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 582 transitions, 1492 flow [2021-06-10 11:38:09,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 582 transitions, 1491 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:09,074 INFO L241 Difference]: Finished difference. Result has 693 places, 582 transitions, 1475 flow [2021-06-10 11:38:09,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1475, PETRI_PLACES=693, PETRI_TRANSITIONS=582} [2021-06-10 11:38:09,074 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 48 predicate places. [2021-06-10 11:38:09,074 INFO L480 AbstractCegarLoop]: Abstraction has has 693 places, 582 transitions, 1475 flow [2021-06-10 11:38:09,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:09,075 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:09,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2021-06-10 11:38:09,075 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 135046299, now seen corresponding path program 1 times [2021-06-10 11:38:09,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:09,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774627372] [2021-06-10 11:38:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:09,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:09,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:09,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774627372] [2021-06-10 11:38:09,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:09,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:09,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601555863] [2021-06-10 11:38:09,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:09,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:09,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:09,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 582 transitions, 1475 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:09,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:09,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:09,294 INFO L129 PetriNetUnfolder]: 14/718 cut-off events. [2021-06-10 11:38:09,294 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:09,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 718 events. 14/718 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3189 event pairs, 0 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 916. Up to 25 conditions per place. [2021-06-10 11:38:09,323 INFO L132 encePairwiseOnDemand]: 688/693 looper letters, 10 selfloop transitions, 3 changer transitions 0/584 dead transitions. [2021-06-10 11:38:09,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 584 transitions, 1505 flow [2021-06-10 11:38:09,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1911 transitions. [2021-06-10 11:38:09,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9191919191919192 [2021-06-10 11:38:09,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1911 transitions. [2021-06-10 11:38:09,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1911 transitions. [2021-06-10 11:38:09,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:09,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1911 transitions. [2021-06-10 11:38:09,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 637.0) internal successors, (1911), 3 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,326 INFO L185 Difference]: Start difference. First operand has 693 places, 582 transitions, 1475 flow. Second operand 3 states and 1911 transitions. [2021-06-10 11:38:09,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 584 transitions, 1505 flow [2021-06-10 11:38:09,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 584 transitions, 1504 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:09,359 INFO L241 Difference]: Finished difference. Result has 696 places, 584 transitions, 1498 flow [2021-06-10 11:38:09,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=696, PETRI_TRANSITIONS=584} [2021-06-10 11:38:09,360 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 51 predicate places. [2021-06-10 11:38:09,360 INFO L480 AbstractCegarLoop]: Abstraction has has 696 places, 584 transitions, 1498 flow [2021-06-10 11:38:09,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:09,360 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:09,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2021-06-10 11:38:09,360 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 135045276, now seen corresponding path program 1 times [2021-06-10 11:38:09,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:09,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710352334] [2021-06-10 11:38:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:09,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:09,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:09,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710352334] [2021-06-10 11:38:09,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:09,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:09,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401329012] [2021-06-10 11:38:09,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:09,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:09,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:09,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:09,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:09,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 584 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:09,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:09,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:09,574 INFO L129 PetriNetUnfolder]: 12/719 cut-off events. [2021-06-10 11:38:09,575 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:09,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 719 events. 12/719 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3212 event pairs, 0 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 916. Up to 25 conditions per place. [2021-06-10 11:38:09,604 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 6 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2021-06-10 11:38:09,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 584 transitions, 1510 flow [2021-06-10 11:38:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1919 transitions. [2021-06-10 11:38:09,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923039923039923 [2021-06-10 11:38:09,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1919 transitions. [2021-06-10 11:38:09,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1919 transitions. [2021-06-10 11:38:09,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:09,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1919 transitions. [2021-06-10 11:38:09,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.6666666666666) internal successors, (1919), 3 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,607 INFO L185 Difference]: Start difference. First operand has 696 places, 584 transitions, 1498 flow. Second operand 3 states and 1919 transitions. [2021-06-10 11:38:09,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 584 transitions, 1510 flow [2021-06-10 11:38:09,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 584 transitions, 1505 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:09,613 INFO L241 Difference]: Finished difference. Result has 698 places, 583 transitions, 1494 flow [2021-06-10 11:38:09,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=698, PETRI_TRANSITIONS=583} [2021-06-10 11:38:09,614 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 53 predicate places. [2021-06-10 11:38:09,614 INFO L480 AbstractCegarLoop]: Abstraction has has 698 places, 583 transitions, 1494 flow [2021-06-10 11:38:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:09,614 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:09,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2021-06-10 11:38:09,614 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 134092987, now seen corresponding path program 1 times [2021-06-10 11:38:09,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:09,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805871018] [2021-06-10 11:38:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:09,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:09,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:09,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805871018] [2021-06-10 11:38:09,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:09,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:09,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098053144] [2021-06-10 11:38:09,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:09,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:09,632 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 693 [2021-06-10 11:38:09,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 583 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:09,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 693 [2021-06-10 11:38:09,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:09,824 INFO L129 PetriNetUnfolder]: 12/712 cut-off events. [2021-06-10 11:38:09,824 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:09,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 712 events. 12/712 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3154 event pairs, 0 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 910. Up to 25 conditions per place. [2021-06-10 11:38:09,853 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 5 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2021-06-10 11:38:09,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 581 transitions, 1497 flow [2021-06-10 11:38:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1918 transitions. [2021-06-10 11:38:09,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225589225589226 [2021-06-10 11:38:09,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1918 transitions. [2021-06-10 11:38:09,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1918 transitions. [2021-06-10 11:38:09,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:09,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1918 transitions. [2021-06-10 11:38:09,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 639.3333333333334) internal successors, (1918), 3 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,856 INFO L185 Difference]: Start difference. First operand has 698 places, 583 transitions, 1494 flow. Second operand 3 states and 1918 transitions. [2021-06-10 11:38:09,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 581 transitions, 1497 flow [2021-06-10 11:38:09,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 581 transitions, 1490 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:09,862 INFO L241 Difference]: Finished difference. Result has 698 places, 581 transitions, 1483 flow [2021-06-10 11:38:09,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1483, PETRI_PLACES=698, PETRI_TRANSITIONS=581} [2021-06-10 11:38:09,862 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 53 predicate places. [2021-06-10 11:38:09,862 INFO L480 AbstractCegarLoop]: Abstraction has has 698 places, 581 transitions, 1483 flow [2021-06-10 11:38:09,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 638.3333333333334) internal successors, (1915), 3 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:09,862 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:09,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2021-06-10 11:38:09,862 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 134091964, now seen corresponding path program 1 times [2021-06-10 11:38:09,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:09,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584542903] [2021-06-10 11:38:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:09,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:09,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:09,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:09,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584542903] [2021-06-10 11:38:09,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:09,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:09,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018223116] [2021-06-10 11:38:09,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:09,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:09,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 632 out of 693 [2021-06-10 11:38:09,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 581 transitions, 1483 flow. Second operand has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:09,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:09,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 632 of 693 [2021-06-10 11:38:09,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:10,074 INFO L129 PetriNetUnfolder]: 12/710 cut-off events. [2021-06-10 11:38:10,075 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:10,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 710 events. 12/710 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3136 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 910. Up to 25 conditions per place. [2021-06-10 11:38:10,103 INFO L132 encePairwiseOnDemand]: 691/693 looper letters, 8 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2021-06-10 11:38:10,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 579 transitions, 1496 flow [2021-06-10 11:38:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1906 transitions. [2021-06-10 11:38:10,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9167869167869168 [2021-06-10 11:38:10,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1906 transitions. [2021-06-10 11:38:10,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1906 transitions. [2021-06-10 11:38:10,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:10,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1906 transitions. [2021-06-10 11:38:10,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.3333333333334) internal successors, (1906), 3 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 693.0) internal successors, (2772), 4 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,106 INFO L185 Difference]: Start difference. First operand has 698 places, 581 transitions, 1483 flow. Second operand 3 states and 1906 transitions. [2021-06-10 11:38:10,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 579 transitions, 1496 flow [2021-06-10 11:38:10,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 579 transitions, 1495 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:10,112 INFO L241 Difference]: Finished difference. Result has 697 places, 579 transitions, 1479 flow [2021-06-10 11:38:10,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=693, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=697, PETRI_TRANSITIONS=579} [2021-06-10 11:38:10,112 INFO L343 CegarLoopForPetriNet]: 645 programPoint places, 52 predicate places. [2021-06-10 11:38:10,112 INFO L480 AbstractCegarLoop]: Abstraction has has 697 places, 579 transitions, 1479 flow [2021-06-10 11:38:10,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 634.3333333333334) internal successors, (1903), 3 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:10,112 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:10,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2021-06-10 11:38:10,113 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1652319714, now seen corresponding path program 1 times [2021-06-10 11:38:10,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:10,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148243908] [2021-06-10 11:38:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:10,124 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:10,129 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:10,140 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:38:10,141 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:38:10,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2021-06-10 11:38:10,141 WARN L342 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:38:10,141 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2021-06-10 11:38:10,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,193 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,220 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,221 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,222 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,224 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,243 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,245 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,246 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,247 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,253 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,254 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,255 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,256 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,257 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,258 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,259 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,260 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,261 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,262 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,263 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of25ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of25ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:10,279 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:38:10,280 INFO L253 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2021-06-10 11:38:10,280 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:38:10,280 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:38:10,280 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:38:10,280 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:38:10,280 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:38:10,280 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:38:10,280 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:38:10,280 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:38:10,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 671 places, 721 transitions, 2167 flow [2021-06-10 11:38:10,492 INFO L129 PetriNetUnfolder]: 126/945 cut-off events. [2021-06-10 11:38:10,492 INFO L130 PetriNetUnfolder]: For 2900/2900 co-relation queries the response was YES. [2021-06-10 11:38:10,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 945 events. 126/945 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4012 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1271. Up to 52 conditions per place. [2021-06-10 11:38:10,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 671 places, 721 transitions, 2167 flow [2021-06-10 11:38:10,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 671 places, 721 transitions, 2167 flow [2021-06-10 11:38:10,555 INFO L129 PetriNetUnfolder]: 8/98 cut-off events. [2021-06-10 11:38:10,555 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:38:10,555 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:10,555 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-06-10 11:38:10,555 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash -464428070, now seen corresponding path program 1 times [2021-06-10 11:38:10,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:10,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460269661] [2021-06-10 11:38:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:10,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:10,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:10,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:10,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460269661] [2021-06-10 11:38:10,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:10,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:10,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91588456] [2021-06-10 11:38:10,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:10,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:10,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:10,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 721 transitions, 2167 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:10,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:10,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:10,754 INFO L129 PetriNetUnfolder]: 74/747 cut-off events. [2021-06-10 11:38:10,754 INFO L130 PetriNetUnfolder]: For 2901/2901 co-relation queries the response was YES. [2021-06-10 11:38:10,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 747 events. 74/747 cut-off events. For 2901/2901 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2958 event pairs, 0 based on Foata normal form. 108/754 useless extension candidates. Maximal degree in co-relation 1086. Up to 26 conditions per place. [2021-06-10 11:38:10,794 INFO L132 encePairwiseOnDemand]: 689/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/667 dead transitions. [2021-06-10 11:38:10,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 667 transitions, 2085 flow [2021-06-10 11:38:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2043 transitions. [2021-06-10 11:38:10,796 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9445214979195562 [2021-06-10 11:38:10,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2043 transitions. [2021-06-10 11:38:10,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2043 transitions. [2021-06-10 11:38:10,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:10,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2043 transitions. [2021-06-10 11:38:10,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 681.0) internal successors, (2043), 3 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,798 INFO L185 Difference]: Start difference. First operand has 671 places, 721 transitions, 2167 flow. Second operand 3 states and 2043 transitions. [2021-06-10 11:38:10,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 667 transitions, 2085 flow [2021-06-10 11:38:10,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 667 transitions, 1485 flow, removed 300 selfloop flow, removed 0 redundant places. [2021-06-10 11:38:10,806 INFO L241 Difference]: Finished difference. Result has 645 places, 667 transitions, 1479 flow [2021-06-10 11:38:10,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=645, PETRI_TRANSITIONS=667} [2021-06-10 11:38:10,806 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -26 predicate places. [2021-06-10 11:38:10,806 INFO L480 AbstractCegarLoop]: Abstraction has has 645 places, 667 transitions, 1479 flow [2021-06-10 11:38:10,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,806 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:10,806 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-06-10 11:38:10,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2021-06-10 11:38:10,806 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -463473735, now seen corresponding path program 1 times [2021-06-10 11:38:10,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:10,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956279853] [2021-06-10 11:38:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:10,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:10,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:10,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:10,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:10,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956279853] [2021-06-10 11:38:10,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:10,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:10,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045607567] [2021-06-10 11:38:10,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:10,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:10,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:10,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:10,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:10,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 667 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:10,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:10,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:10,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:11,014 INFO L129 PetriNetUnfolder]: 72/745 cut-off events. [2021-06-10 11:38:11,014 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:11,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 745 events. 72/745 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2953 event pairs, 0 based on Foata normal form. 2/649 useless extension candidates. Maximal degree in co-relation 820. Up to 26 conditions per place. [2021-06-10 11:38:11,038 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 10 selfloop transitions, 1 changer transitions 0/665 dead transitions. [2021-06-10 11:38:11,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 665 transitions, 1489 flow [2021-06-10 11:38:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:11,039 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:11,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:11,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,041 INFO L185 Difference]: Start difference. First operand has 645 places, 667 transitions, 1479 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:11,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 665 transitions, 1489 flow [2021-06-10 11:38:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 665 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:11,046 INFO L241 Difference]: Finished difference. Result has 646 places, 665 transitions, 1468 flow [2021-06-10 11:38:11,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=646, PETRI_TRANSITIONS=665} [2021-06-10 11:38:11,046 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -25 predicate places. [2021-06-10 11:38:11,046 INFO L480 AbstractCegarLoop]: Abstraction has has 646 places, 665 transitions, 1468 flow [2021-06-10 11:38:11,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:11,047 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-06-10 11:38:11,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2021-06-10 11:38:11,047 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash -463474758, now seen corresponding path program 1 times [2021-06-10 11:38:11,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:11,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599677413] [2021-06-10 11:38:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:11,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:11,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:11,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599677413] [2021-06-10 11:38:11,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:11,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:11,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524502028] [2021-06-10 11:38:11,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:11,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:11,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:11,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 665 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:11,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:11,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:11,223 INFO L129 PetriNetUnfolder]: 72/742 cut-off events. [2021-06-10 11:38:11,223 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-10 11:38:11,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 742 events. 72/742 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2928 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 819. Up to 26 conditions per place. [2021-06-10 11:38:11,258 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/665 dead transitions. [2021-06-10 11:38:11,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 665 transitions, 1480 flow [2021-06-10 11:38:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:11,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:11,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:11,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,262 INFO L185 Difference]: Start difference. First operand has 646 places, 665 transitions, 1468 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:11,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 665 transitions, 1480 flow [2021-06-10 11:38:11,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 665 transitions, 1477 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:11,267 INFO L241 Difference]: Finished difference. Result has 648 places, 664 transitions, 1466 flow [2021-06-10 11:38:11,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=648, PETRI_TRANSITIONS=664} [2021-06-10 11:38:11,267 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -23 predicate places. [2021-06-10 11:38:11,267 INFO L480 AbstractCegarLoop]: Abstraction has has 648 places, 664 transitions, 1466 flow [2021-06-10 11:38:11,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:11,268 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-06-10 11:38:11,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2021-06-10 11:38:11,268 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash -464427047, now seen corresponding path program 1 times [2021-06-10 11:38:11,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:11,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691207418] [2021-06-10 11:38:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:11,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:11,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:11,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691207418] [2021-06-10 11:38:11,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:11,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:11,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908616892] [2021-06-10 11:38:11,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:11,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:11,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:11,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 664 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:11,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:11,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:11,443 INFO L129 PetriNetUnfolder]: 72/739 cut-off events. [2021-06-10 11:38:11,444 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:11,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 739 events. 72/739 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2912 event pairs, 0 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 816. Up to 26 conditions per place. [2021-06-10 11:38:11,478 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/662 dead transitions. [2021-06-10 11:38:11,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 662 transitions, 1472 flow [2021-06-10 11:38:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:11,480 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:11,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:11,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:11,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:11,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:11,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,482 INFO L185 Difference]: Start difference. First operand has 648 places, 664 transitions, 1466 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:11,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 662 transitions, 1472 flow [2021-06-10 11:38:11,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 662 transitions, 1468 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:38:11,487 INFO L241 Difference]: Finished difference. Result has 647 places, 662 transitions, 1461 flow [2021-06-10 11:38:11,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=647, PETRI_TRANSITIONS=662} [2021-06-10 11:38:11,487 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -24 predicate places. [2021-06-10 11:38:11,487 INFO L480 AbstractCegarLoop]: Abstraction has has 647 places, 662 transitions, 1461 flow [2021-06-10 11:38:11,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:11,488 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:11,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2021-06-10 11:38:11,488 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:11,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1759443109, now seen corresponding path program 1 times [2021-06-10 11:38:11,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:11,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828448470] [2021-06-10 11:38:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:11,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:11,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:11,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828448470] [2021-06-10 11:38:11,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:11,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:11,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137586178] [2021-06-10 11:38:11,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:11,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:11,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:11,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 662 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:11,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:11,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:11,669 INFO L129 PetriNetUnfolder]: 71/746 cut-off events. [2021-06-10 11:38:11,669 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:11,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 746 events. 71/746 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2970 event pairs, 0 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 827. Up to 26 conditions per place. [2021-06-10 11:38:11,704 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/663 dead transitions. [2021-06-10 11:38:11,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 663 transitions, 1477 flow [2021-06-10 11:38:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:11,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:11,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:11,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:11,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,707 INFO L185 Difference]: Start difference. First operand has 647 places, 662 transitions, 1461 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:11,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 663 transitions, 1477 flow [2021-06-10 11:38:11,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 663 transitions, 1476 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:11,713 INFO L241 Difference]: Finished difference. Result has 649 places, 662 transitions, 1465 flow [2021-06-10 11:38:11,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1465, PETRI_PLACES=649, PETRI_TRANSITIONS=662} [2021-06-10 11:38:11,713 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -22 predicate places. [2021-06-10 11:38:11,713 INFO L480 AbstractCegarLoop]: Abstraction has has 649 places, 662 transitions, 1465 flow [2021-06-10 11:38:11,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:11,713 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:11,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2021-06-10 11:38:11,714 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1759442086, now seen corresponding path program 1 times [2021-06-10 11:38:11,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:11,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706151724] [2021-06-10 11:38:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:11,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:11,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:11,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706151724] [2021-06-10 11:38:11,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:11,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:11,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555510522] [2021-06-10 11:38:11,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:11,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:11,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:11,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 662 transitions, 1465 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:11,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:11,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:11,904 INFO L129 PetriNetUnfolder]: 69/748 cut-off events. [2021-06-10 11:38:11,904 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:11,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 748 events. 69/748 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3004 event pairs, 0 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 836. Up to 26 conditions per place. [2021-06-10 11:38:11,941 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/663 dead transitions. [2021-06-10 11:38:11,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 663 transitions, 1491 flow [2021-06-10 11:38:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:11,942 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:11,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:11,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:11,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,944 INFO L185 Difference]: Start difference. First operand has 649 places, 662 transitions, 1465 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:11,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 663 transitions, 1491 flow [2021-06-10 11:38:11,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 663 transitions, 1490 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:11,950 INFO L241 Difference]: Finished difference. Result has 652 places, 663 transitions, 1482 flow [2021-06-10 11:38:11,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=652, PETRI_TRANSITIONS=663} [2021-06-10 11:38:11,950 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -19 predicate places. [2021-06-10 11:38:11,950 INFO L480 AbstractCegarLoop]: Abstraction has has 652 places, 663 transitions, 1482 flow [2021-06-10 11:38:11,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:11,950 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:11,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2021-06-10 11:38:11,951 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1760395398, now seen corresponding path program 1 times [2021-06-10 11:38:11,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:11,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346083915] [2021-06-10 11:38:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:11,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:11,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:11,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:11,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346083915] [2021-06-10 11:38:11,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:11,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:11,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571584858] [2021-06-10 11:38:11,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:11,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:11,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:11,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 663 transitions, 1482 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:11,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:11,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:11,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:12,135 INFO L129 PetriNetUnfolder]: 69/741 cut-off events. [2021-06-10 11:38:12,135 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:12,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 741 events. 69/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2941 event pairs, 0 based on Foata normal form. 1/649 useless extension candidates. Maximal degree in co-relation 822. Up to 26 conditions per place. [2021-06-10 11:38:12,171 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/661 dead transitions. [2021-06-10 11:38:12,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 661 transitions, 1484 flow [2021-06-10 11:38:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:12,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:12,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:12,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:12,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:12,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:12,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,175 INFO L185 Difference]: Start difference. First operand has 652 places, 663 transitions, 1482 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:12,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 661 transitions, 1484 flow [2021-06-10 11:38:12,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 661 transitions, 1476 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:12,180 INFO L241 Difference]: Finished difference. Result has 652 places, 661 transitions, 1469 flow [2021-06-10 11:38:12,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1469, PETRI_PLACES=652, PETRI_TRANSITIONS=661} [2021-06-10 11:38:12,181 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -19 predicate places. [2021-06-10 11:38:12,181 INFO L480 AbstractCegarLoop]: Abstraction has has 652 places, 661 transitions, 1469 flow [2021-06-10 11:38:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:12,181 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:12,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2021-06-10 11:38:12,181 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:12,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1760396421, now seen corresponding path program 1 times [2021-06-10 11:38:12,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:12,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135228909] [2021-06-10 11:38:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:12,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:12,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:12,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135228909] [2021-06-10 11:38:12,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:12,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:12,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249944211] [2021-06-10 11:38:12,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:12,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:12,196 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:12,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 661 transitions, 1469 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:12,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:12,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:12,368 INFO L129 PetriNetUnfolder]: 69/739 cut-off events. [2021-06-10 11:38:12,368 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:12,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 739 events. 69/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2929 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 826. Up to 26 conditions per place. [2021-06-10 11:38:12,404 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2021-06-10 11:38:12,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 659 transitions, 1482 flow [2021-06-10 11:38:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:12,405 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:12,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:12,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:12,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:12,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:12,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,407 INFO L185 Difference]: Start difference. First operand has 652 places, 661 transitions, 1469 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:12,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 659 transitions, 1482 flow [2021-06-10 11:38:12,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 659 transitions, 1481 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:12,413 INFO L241 Difference]: Finished difference. Result has 651 places, 659 transitions, 1465 flow [2021-06-10 11:38:12,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1465, PETRI_PLACES=651, PETRI_TRANSITIONS=659} [2021-06-10 11:38:12,413 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -20 predicate places. [2021-06-10 11:38:12,413 INFO L480 AbstractCegarLoop]: Abstraction has has 651 places, 659 transitions, 1465 flow [2021-06-10 11:38:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:12,413 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:12,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2021-06-10 11:38:12,414 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1381456996, now seen corresponding path program 1 times [2021-06-10 11:38:12,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:12,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924972331] [2021-06-10 11:38:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:12,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:12,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:12,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924972331] [2021-06-10 11:38:12,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:12,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:12,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505644209] [2021-06-10 11:38:12,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:12,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:12,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:12,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:12,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:12,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 659 transitions, 1465 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:12,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:12,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:12,623 INFO L129 PetriNetUnfolder]: 67/744 cut-off events. [2021-06-10 11:38:12,623 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:12,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 744 events. 67/744 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2979 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 829. Up to 26 conditions per place. [2021-06-10 11:38:12,646 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2021-06-10 11:38:12,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 660 transitions, 1481 flow [2021-06-10 11:38:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:12,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:12,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:12,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:12,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:12,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:12,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,649 INFO L185 Difference]: Start difference. First operand has 651 places, 659 transitions, 1465 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:12,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 660 transitions, 1481 flow [2021-06-10 11:38:12,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 660 transitions, 1480 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:12,654 INFO L241 Difference]: Finished difference. Result has 654 places, 660 transitions, 1478 flow [2021-06-10 11:38:12,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=654, PETRI_TRANSITIONS=660} [2021-06-10 11:38:12,654 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -17 predicate places. [2021-06-10 11:38:12,654 INFO L480 AbstractCegarLoop]: Abstraction has has 654 places, 660 transitions, 1478 flow [2021-06-10 11:38:12,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:12,655 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:12,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2021-06-10 11:38:12,655 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:12,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1381458019, now seen corresponding path program 1 times [2021-06-10 11:38:12,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:12,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681557072] [2021-06-10 11:38:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:12,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:12,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:12,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681557072] [2021-06-10 11:38:12,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:12,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:12,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15414555] [2021-06-10 11:38:12,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:12,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:12,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:12,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:12,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 660 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:12,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:12,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:12,846 INFO L129 PetriNetUnfolder]: 67/745 cut-off events. [2021-06-10 11:38:12,846 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:12,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 745 events. 67/745 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2986 event pairs, 0 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 837. Up to 26 conditions per place. [2021-06-10 11:38:12,883 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2021-06-10 11:38:12,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 661 transitions, 1504 flow [2021-06-10 11:38:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:12,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:12,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:12,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:12,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:12,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:12,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,886 INFO L185 Difference]: Start difference. First operand has 654 places, 660 transitions, 1478 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:12,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 661 transitions, 1504 flow [2021-06-10 11:38:12,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 661 transitions, 1502 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:12,891 INFO L241 Difference]: Finished difference. Result has 657 places, 661 transitions, 1494 flow [2021-06-10 11:38:12,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=657, PETRI_TRANSITIONS=661} [2021-06-10 11:38:12,892 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -14 predicate places. [2021-06-10 11:38:12,892 INFO L480 AbstractCegarLoop]: Abstraction has has 657 places, 661 transitions, 1494 flow [2021-06-10 11:38:12,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:12,892 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:12,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2021-06-10 11:38:12,892 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1380504707, now seen corresponding path program 1 times [2021-06-10 11:38:12,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:12,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184554393] [2021-06-10 11:38:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:12,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:12,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:12,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:12,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184554393] [2021-06-10 11:38:12,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:12,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:12,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461106581] [2021-06-10 11:38:12,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:12,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:12,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:12,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 661 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:12,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:12,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:12,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:13,077 INFO L129 PetriNetUnfolder]: 66/741 cut-off events. [2021-06-10 11:38:13,077 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:13,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 741 events. 66/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2961 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 830. Up to 26 conditions per place. [2021-06-10 11:38:13,114 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/658 dead transitions. [2021-06-10 11:38:13,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 658 transitions, 1491 flow [2021-06-10 11:38:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:13,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:13,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:13,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:13,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:13,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:13,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,117 INFO L185 Difference]: Start difference. First operand has 657 places, 661 transitions, 1494 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:13,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 658 transitions, 1491 flow [2021-06-10 11:38:13,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 658 transitions, 1483 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:13,123 INFO L241 Difference]: Finished difference. Result has 656 places, 658 transitions, 1473 flow [2021-06-10 11:38:13,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1473, PETRI_PLACES=656, PETRI_TRANSITIONS=658} [2021-06-10 11:38:13,123 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -15 predicate places. [2021-06-10 11:38:13,123 INFO L480 AbstractCegarLoop]: Abstraction has has 656 places, 658 transitions, 1473 flow [2021-06-10 11:38:13,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:13,124 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:13,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2021-06-10 11:38:13,124 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1380503684, now seen corresponding path program 1 times [2021-06-10 11:38:13,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:13,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348559816] [2021-06-10 11:38:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:13,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:13,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:13,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348559816] [2021-06-10 11:38:13,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:13,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:13,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159723371] [2021-06-10 11:38:13,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:13,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:13,139 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:13,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 658 transitions, 1473 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:13,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:13,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:13,313 INFO L129 PetriNetUnfolder]: 66/739 cut-off events. [2021-06-10 11:38:13,313 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:13,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 739 events. 66/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2946 event pairs, 0 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 833. Up to 26 conditions per place. [2021-06-10 11:38:13,349 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2021-06-10 11:38:13,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 656 transitions, 1486 flow [2021-06-10 11:38:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:13,350 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:13,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:13,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:13,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:13,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:13,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,352 INFO L185 Difference]: Start difference. First operand has 656 places, 658 transitions, 1473 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:13,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 656 transitions, 1486 flow [2021-06-10 11:38:13,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 656 transitions, 1485 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:13,358 INFO L241 Difference]: Finished difference. Result has 655 places, 656 transitions, 1469 flow [2021-06-10 11:38:13,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1469, PETRI_PLACES=655, PETRI_TRANSITIONS=656} [2021-06-10 11:38:13,358 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -16 predicate places. [2021-06-10 11:38:13,358 INFO L480 AbstractCegarLoop]: Abstraction has has 655 places, 656 transitions, 1469 flow [2021-06-10 11:38:13,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:13,358 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:13,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2021-06-10 11:38:13,358 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1114171807, now seen corresponding path program 1 times [2021-06-10 11:38:13,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:13,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049487808] [2021-06-10 11:38:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:13,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:13,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:13,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049487808] [2021-06-10 11:38:13,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:13,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:13,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417247671] [2021-06-10 11:38:13,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:13,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:13,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:13,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 656 transitions, 1469 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:13,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:13,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:13,554 INFO L129 PetriNetUnfolder]: 65/747 cut-off events. [2021-06-10 11:38:13,554 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:13,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 747 events. 65/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3016 event pairs, 0 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 845. Up to 26 conditions per place. [2021-06-10 11:38:13,590 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/658 dead transitions. [2021-06-10 11:38:13,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 658 transitions, 1499 flow [2021-06-10 11:38:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:13,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:13,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:13,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:13,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:13,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:13,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,593 INFO L185 Difference]: Start difference. First operand has 655 places, 656 transitions, 1469 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:13,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 658 transitions, 1499 flow [2021-06-10 11:38:13,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 658 transitions, 1498 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:13,599 INFO L241 Difference]: Finished difference. Result has 658 places, 658 transitions, 1492 flow [2021-06-10 11:38:13,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=658, PETRI_TRANSITIONS=658} [2021-06-10 11:38:13,599 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -13 predicate places. [2021-06-10 11:38:13,599 INFO L480 AbstractCegarLoop]: Abstraction has has 658 places, 658 transitions, 1492 flow [2021-06-10 11:38:13,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:13,599 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:13,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2021-06-10 11:38:13,599 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1114170784, now seen corresponding path program 1 times [2021-06-10 11:38:13,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:13,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997440701] [2021-06-10 11:38:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:13,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:13,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:13,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997440701] [2021-06-10 11:38:13,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:13,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:13,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124941666] [2021-06-10 11:38:13,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:13,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:13,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:13,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 658 transitions, 1492 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:13,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:13,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:13,791 INFO L129 PetriNetUnfolder]: 63/748 cut-off events. [2021-06-10 11:38:13,791 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:13,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 748 events. 63/748 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3037 event pairs, 0 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 845. Up to 26 conditions per place. [2021-06-10 11:38:13,827 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/658 dead transitions. [2021-06-10 11:38:13,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 658 transitions, 1504 flow [2021-06-10 11:38:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:13,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:13,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:13,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:13,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:13,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:13,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,831 INFO L185 Difference]: Start difference. First operand has 658 places, 658 transitions, 1492 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:13,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 658 transitions, 1504 flow [2021-06-10 11:38:13,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 658 transitions, 1499 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:13,836 INFO L241 Difference]: Finished difference. Result has 660 places, 657 transitions, 1488 flow [2021-06-10 11:38:13,837 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=660, PETRI_TRANSITIONS=657} [2021-06-10 11:38:13,837 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -11 predicate places. [2021-06-10 11:38:13,837 INFO L480 AbstractCegarLoop]: Abstraction has has 660 places, 657 transitions, 1488 flow [2021-06-10 11:38:13,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:13,837 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:13,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2021-06-10 11:38:13,837 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1113218495, now seen corresponding path program 1 times [2021-06-10 11:38:13,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:13,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344509844] [2021-06-10 11:38:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:13,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:13,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:13,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:13,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344509844] [2021-06-10 11:38:13,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:13,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:13,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085812395] [2021-06-10 11:38:13,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:13,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:13,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:13,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 657 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:13,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:13,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:13,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:14,025 INFO L129 PetriNetUnfolder]: 63/741 cut-off events. [2021-06-10 11:38:14,025 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:14,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 741 events. 63/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2979 event pairs, 0 based on Foata normal form. 1/655 useless extension candidates. Maximal degree in co-relation 839. Up to 26 conditions per place. [2021-06-10 11:38:14,060 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2021-06-10 11:38:14,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 655 transitions, 1491 flow [2021-06-10 11:38:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:14,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:14,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:14,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:14,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:14,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:14,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,064 INFO L185 Difference]: Start difference. First operand has 660 places, 657 transitions, 1488 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:14,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 655 transitions, 1491 flow [2021-06-10 11:38:14,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 655 transitions, 1484 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:14,070 INFO L241 Difference]: Finished difference. Result has 660 places, 655 transitions, 1477 flow [2021-06-10 11:38:14,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=660, PETRI_TRANSITIONS=655} [2021-06-10 11:38:14,070 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -11 predicate places. [2021-06-10 11:38:14,070 INFO L480 AbstractCegarLoop]: Abstraction has has 660 places, 655 transitions, 1477 flow [2021-06-10 11:38:14,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:14,070 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:14,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2021-06-10 11:38:14,070 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:14,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1113217472, now seen corresponding path program 1 times [2021-06-10 11:38:14,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:14,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243523755] [2021-06-10 11:38:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:14,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:14,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:14,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243523755] [2021-06-10 11:38:14,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:14,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:14,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443709124] [2021-06-10 11:38:14,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:14,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:14,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:14,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 655 transitions, 1477 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:14,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:14,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:14,278 INFO L129 PetriNetUnfolder]: 63/739 cut-off events. [2021-06-10 11:38:14,278 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:14,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 739 events. 63/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2964 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 839. Up to 26 conditions per place. [2021-06-10 11:38:14,304 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2021-06-10 11:38:14,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 653 transitions, 1490 flow [2021-06-10 11:38:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:14,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:14,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:14,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:14,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:14,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:14,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,307 INFO L185 Difference]: Start difference. First operand has 660 places, 655 transitions, 1477 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:14,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 653 transitions, 1490 flow [2021-06-10 11:38:14,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 653 transitions, 1489 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:14,312 INFO L241 Difference]: Finished difference. Result has 659 places, 653 transitions, 1473 flow [2021-06-10 11:38:14,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1473, PETRI_PLACES=659, PETRI_TRANSITIONS=653} [2021-06-10 11:38:14,312 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -12 predicate places. [2021-06-10 11:38:14,312 INFO L480 AbstractCegarLoop]: Abstraction has has 659 places, 653 transitions, 1473 flow [2021-06-10 11:38:14,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:14,313 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:14,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2021-06-10 11:38:14,313 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -554745500, now seen corresponding path program 1 times [2021-06-10 11:38:14,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:14,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096589541] [2021-06-10 11:38:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:14,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:14,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:14,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096589541] [2021-06-10 11:38:14,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:14,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:14,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982069379] [2021-06-10 11:38:14,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:14,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:14,328 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:14,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 653 transitions, 1473 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:14,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:14,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:14,511 INFO L129 PetriNetUnfolder]: 62/747 cut-off events. [2021-06-10 11:38:14,511 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:14,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 747 events. 62/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3032 event pairs, 0 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 851. Up to 26 conditions per place. [2021-06-10 11:38:14,548 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/655 dead transitions. [2021-06-10 11:38:14,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 655 transitions, 1503 flow [2021-06-10 11:38:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:14,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:14,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:14,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:14,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:14,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:14,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,552 INFO L185 Difference]: Start difference. First operand has 659 places, 653 transitions, 1473 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:14,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 655 transitions, 1503 flow [2021-06-10 11:38:14,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 655 transitions, 1502 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:14,557 INFO L241 Difference]: Finished difference. Result has 662 places, 655 transitions, 1496 flow [2021-06-10 11:38:14,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=662, PETRI_TRANSITIONS=655} [2021-06-10 11:38:14,558 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -9 predicate places. [2021-06-10 11:38:14,558 INFO L480 AbstractCegarLoop]: Abstraction has has 662 places, 655 transitions, 1496 flow [2021-06-10 11:38:14,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:14,558 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:14,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2021-06-10 11:38:14,558 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash -554744477, now seen corresponding path program 1 times [2021-06-10 11:38:14,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:14,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043203576] [2021-06-10 11:38:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:14,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:14,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:14,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043203576] [2021-06-10 11:38:14,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:14,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:14,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243469125] [2021-06-10 11:38:14,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:14,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:14,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:14,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:14,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 655 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:14,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:14,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:14,750 INFO L129 PetriNetUnfolder]: 61/745 cut-off events. [2021-06-10 11:38:14,750 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:14,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 745 events. 61/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3021 event pairs, 0 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 848. Up to 26 conditions per place. [2021-06-10 11:38:14,786 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2021-06-10 11:38:14,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 655 transitions, 1508 flow [2021-06-10 11:38:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:14,787 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:14,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:14,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:14,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:14,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:14,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,789 INFO L185 Difference]: Start difference. First operand has 662 places, 655 transitions, 1496 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:14,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 655 transitions, 1508 flow [2021-06-10 11:38:14,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 655 transitions, 1503 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:14,795 INFO L241 Difference]: Finished difference. Result has 665 places, 655 transitions, 1501 flow [2021-06-10 11:38:14,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=665, PETRI_TRANSITIONS=655} [2021-06-10 11:38:14,795 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -6 predicate places. [2021-06-10 11:38:14,795 INFO L480 AbstractCegarLoop]: Abstraction has has 665 places, 655 transitions, 1501 flow [2021-06-10 11:38:14,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:14,795 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:14,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2021-06-10 11:38:14,795 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash -553791165, now seen corresponding path program 1 times [2021-06-10 11:38:14,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:14,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433597351] [2021-06-10 11:38:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:14,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:14,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:14,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:14,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433597351] [2021-06-10 11:38:14,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:14,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:14,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328157021] [2021-06-10 11:38:14,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:14,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:14,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:14,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 655 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:14,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:14,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:14,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:14,997 INFO L129 PetriNetUnfolder]: 60/742 cut-off events. [2021-06-10 11:38:14,997 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:38:15,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 742 events. 60/742 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3004 event pairs, 0 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 849. Up to 26 conditions per place. [2021-06-10 11:38:15,034 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 9 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2021-06-10 11:38:15,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 653 transitions, 1511 flow [2021-06-10 11:38:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2021-06-10 11:38:15,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9181692094313454 [2021-06-10 11:38:15,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2021-06-10 11:38:15,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2021-06-10 11:38:15,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:15,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2021-06-10 11:38:15,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,039 INFO L185 Difference]: Start difference. First operand has 665 places, 655 transitions, 1501 flow. Second operand 3 states and 1986 transitions. [2021-06-10 11:38:15,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 653 transitions, 1511 flow [2021-06-10 11:38:15,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 653 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:15,045 INFO L241 Difference]: Finished difference. Result has 666 places, 653 transitions, 1491 flow [2021-06-10 11:38:15,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1491, PETRI_PLACES=666, PETRI_TRANSITIONS=653} [2021-06-10 11:38:15,046 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -5 predicate places. [2021-06-10 11:38:15,046 INFO L480 AbstractCegarLoop]: Abstraction has has 666 places, 653 transitions, 1491 flow [2021-06-10 11:38:15,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:15,046 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:15,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2021-06-10 11:38:15,046 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -553792188, now seen corresponding path program 1 times [2021-06-10 11:38:15,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:15,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714795048] [2021-06-10 11:38:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:15,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:15,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:15,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714795048] [2021-06-10 11:38:15,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:15,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:15,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921914722] [2021-06-10 11:38:15,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:15,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:15,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:15,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 653 transitions, 1491 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:15,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:15,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:15,243 INFO L129 PetriNetUnfolder]: 60/739 cut-off events. [2021-06-10 11:38:15,243 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:15,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 739 events. 60/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2978 event pairs, 0 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 843. Up to 26 conditions per place. [2021-06-10 11:38:15,278 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2021-06-10 11:38:15,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 650 transitions, 1492 flow [2021-06-10 11:38:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:15,279 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:15,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:15,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:15,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:15,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:15,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,281 INFO L185 Difference]: Start difference. First operand has 666 places, 653 transitions, 1491 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:15,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 650 transitions, 1492 flow [2021-06-10 11:38:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 650 transitions, 1487 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:15,287 INFO L241 Difference]: Finished difference. Result has 663 places, 650 transitions, 1477 flow [2021-06-10 11:38:15,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=663, PETRI_TRANSITIONS=650} [2021-06-10 11:38:15,287 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -8 predicate places. [2021-06-10 11:38:15,287 INFO L480 AbstractCegarLoop]: Abstraction has has 663 places, 650 transitions, 1477 flow [2021-06-10 11:38:15,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:15,288 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:15,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2021-06-10 11:38:15,288 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 180988169, now seen corresponding path program 1 times [2021-06-10 11:38:15,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:15,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118470494] [2021-06-10 11:38:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:15,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:15,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:15,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118470494] [2021-06-10 11:38:15,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:15,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:15,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830260112] [2021-06-10 11:38:15,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:15,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:15,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:15,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:15,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 650 transitions, 1477 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:15,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:15,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:15,486 INFO L129 PetriNetUnfolder]: 59/747 cut-off events. [2021-06-10 11:38:15,487 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:15,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 747 events. 59/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3053 event pairs, 0 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 860. Up to 26 conditions per place. [2021-06-10 11:38:15,522 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/652 dead transitions. [2021-06-10 11:38:15,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 652 transitions, 1507 flow [2021-06-10 11:38:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:15,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:15,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:15,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:15,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:15,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:15,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,525 INFO L185 Difference]: Start difference. First operand has 663 places, 650 transitions, 1477 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:15,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 652 transitions, 1507 flow [2021-06-10 11:38:15,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 652 transitions, 1506 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:15,531 INFO L241 Difference]: Finished difference. Result has 666 places, 652 transitions, 1500 flow [2021-06-10 11:38:15,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=666, PETRI_TRANSITIONS=652} [2021-06-10 11:38:15,531 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -5 predicate places. [2021-06-10 11:38:15,531 INFO L480 AbstractCegarLoop]: Abstraction has has 666 places, 652 transitions, 1500 flow [2021-06-10 11:38:15,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:15,532 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:15,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2021-06-10 11:38:15,532 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 180989192, now seen corresponding path program 1 times [2021-06-10 11:38:15,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:15,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269647524] [2021-06-10 11:38:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:15,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:15,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:15,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269647524] [2021-06-10 11:38:15,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:15,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:15,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294063762] [2021-06-10 11:38:15,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:15,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:15,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:15,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:15,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 652 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:15,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:15,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:15,726 INFO L129 PetriNetUnfolder]: 58/745 cut-off events. [2021-06-10 11:38:15,726 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:15,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 745 events. 58/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3039 event pairs, 0 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 855. Up to 26 conditions per place. [2021-06-10 11:38:15,761 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/652 dead transitions. [2021-06-10 11:38:15,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 652 transitions, 1512 flow [2021-06-10 11:38:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:15,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:15,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:15,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:15,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:15,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:15,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,764 INFO L185 Difference]: Start difference. First operand has 666 places, 652 transitions, 1500 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:15,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 652 transitions, 1512 flow [2021-06-10 11:38:15,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 652 transitions, 1507 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:15,770 INFO L241 Difference]: Finished difference. Result has 669 places, 652 transitions, 1505 flow [2021-06-10 11:38:15,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=669, PETRI_TRANSITIONS=652} [2021-06-10 11:38:15,770 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -2 predicate places. [2021-06-10 11:38:15,770 INFO L480 AbstractCegarLoop]: Abstraction has has 669 places, 652 transitions, 1505 flow [2021-06-10 11:38:15,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:15,770 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:15,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2021-06-10 11:38:15,771 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 181941481, now seen corresponding path program 1 times [2021-06-10 11:38:15,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:15,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781987402] [2021-06-10 11:38:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:15,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:15,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:15,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:15,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781987402] [2021-06-10 11:38:15,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:15,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:15,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866195827] [2021-06-10 11:38:15,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:15,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:15,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:15,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:15,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 652 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:15,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:15,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:15,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:15,971 INFO L129 PetriNetUnfolder]: 57/741 cut-off events. [2021-06-10 11:38:15,971 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:15,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 741 events. 57/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3016 event pairs, 0 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 852. Up to 26 conditions per place. [2021-06-10 11:38:16,001 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2021-06-10 11:38:16,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 649 transitions, 1502 flow [2021-06-10 11:38:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:16,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:16,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:16,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,004 INFO L185 Difference]: Start difference. First operand has 669 places, 652 transitions, 1505 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:16,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 649 transitions, 1502 flow [2021-06-10 11:38:16,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 649 transitions, 1495 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:16,009 INFO L241 Difference]: Finished difference. Result has 668 places, 649 transitions, 1485 flow [2021-06-10 11:38:16,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=668, PETRI_TRANSITIONS=649} [2021-06-10 11:38:16,010 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -3 predicate places. [2021-06-10 11:38:16,010 INFO L480 AbstractCegarLoop]: Abstraction has has 668 places, 649 transitions, 1485 flow [2021-06-10 11:38:16,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:16,010 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:16,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2021-06-10 11:38:16,010 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash 181942504, now seen corresponding path program 1 times [2021-06-10 11:38:16,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:16,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652949168] [2021-06-10 11:38:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:16,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:16,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:16,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652949168] [2021-06-10 11:38:16,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:16,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:16,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255389763] [2021-06-10 11:38:16,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:16,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:16,026 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:16,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 649 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:16,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:16,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:16,204 INFO L129 PetriNetUnfolder]: 57/739 cut-off events. [2021-06-10 11:38:16,204 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:16,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 739 events. 57/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3001 event pairs, 0 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 853. Up to 26 conditions per place. [2021-06-10 11:38:16,238 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/647 dead transitions. [2021-06-10 11:38:16,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 647 transitions, 1498 flow [2021-06-10 11:38:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:16,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:16,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:16,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:16,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:16,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:16,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,242 INFO L185 Difference]: Start difference. First operand has 668 places, 649 transitions, 1485 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:16,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 647 transitions, 1498 flow [2021-06-10 11:38:16,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 647 transitions, 1497 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:16,247 INFO L241 Difference]: Finished difference. Result has 667 places, 647 transitions, 1481 flow [2021-06-10 11:38:16,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=667, PETRI_TRANSITIONS=647} [2021-06-10 11:38:16,248 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -4 predicate places. [2021-06-10 11:38:16,248 INFO L480 AbstractCegarLoop]: Abstraction has has 667 places, 647 transitions, 1481 flow [2021-06-10 11:38:16,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:16,248 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:16,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2021-06-10 11:38:16,248 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1795131634, now seen corresponding path program 1 times [2021-06-10 11:38:16,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:16,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386261428] [2021-06-10 11:38:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:16,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:16,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:16,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386261428] [2021-06-10 11:38:16,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:16,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:16,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352200325] [2021-06-10 11:38:16,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:16,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:16,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:16,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:16,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 647 transitions, 1481 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:16,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:16,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:16,448 INFO L129 PetriNetUnfolder]: 56/747 cut-off events. [2021-06-10 11:38:16,448 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:16,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 747 events. 56/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3069 event pairs, 0 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 865. Up to 26 conditions per place. [2021-06-10 11:38:16,484 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/649 dead transitions. [2021-06-10 11:38:16,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 649 transitions, 1511 flow [2021-06-10 11:38:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:16,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:16,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:16,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:16,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:16,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:16,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,487 INFO L185 Difference]: Start difference. First operand has 667 places, 647 transitions, 1481 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:16,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 649 transitions, 1511 flow [2021-06-10 11:38:16,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 649 transitions, 1510 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:16,493 INFO L241 Difference]: Finished difference. Result has 670 places, 649 transitions, 1504 flow [2021-06-10 11:38:16,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1504, PETRI_PLACES=670, PETRI_TRANSITIONS=649} [2021-06-10 11:38:16,493 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, -1 predicate places. [2021-06-10 11:38:16,493 INFO L480 AbstractCegarLoop]: Abstraction has has 670 places, 649 transitions, 1504 flow [2021-06-10 11:38:16,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:16,494 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:16,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2021-06-10 11:38:16,494 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1795132657, now seen corresponding path program 1 times [2021-06-10 11:38:16,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:16,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235478819] [2021-06-10 11:38:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:16,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:16,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:16,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235478819] [2021-06-10 11:38:16,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:16,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:16,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886358211] [2021-06-10 11:38:16,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:16,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:16,510 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:16,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 649 transitions, 1504 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:16,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:16,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:16,692 INFO L129 PetriNetUnfolder]: 54/748 cut-off events. [2021-06-10 11:38:16,692 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:16,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 748 events. 54/748 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3093 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 865. Up to 26 conditions per place. [2021-06-10 11:38:16,726 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2021-06-10 11:38:16,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 649 transitions, 1516 flow [2021-06-10 11:38:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:16,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:16,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:16,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:16,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:16,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:16,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,730 INFO L185 Difference]: Start difference. First operand has 670 places, 649 transitions, 1504 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:16,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 649 transitions, 1516 flow [2021-06-10 11:38:16,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 649 transitions, 1511 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:16,736 INFO L241 Difference]: Finished difference. Result has 672 places, 648 transitions, 1500 flow [2021-06-10 11:38:16,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=672, PETRI_TRANSITIONS=648} [2021-06-10 11:38:16,736 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 1 predicate places. [2021-06-10 11:38:16,736 INFO L480 AbstractCegarLoop]: Abstraction has has 672 places, 648 transitions, 1500 flow [2021-06-10 11:38:16,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:16,736 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:16,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2021-06-10 11:38:16,736 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1796084946, now seen corresponding path program 1 times [2021-06-10 11:38:16,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:16,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895268417] [2021-06-10 11:38:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:16,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:16,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:16,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895268417] [2021-06-10 11:38:16,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:16,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:16,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601752625] [2021-06-10 11:38:16,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:16,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:16,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:16,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 648 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:16,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:16,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:16,930 INFO L129 PetriNetUnfolder]: 54/741 cut-off events. [2021-06-10 11:38:16,930 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:16,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 741 events. 54/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3032 event pairs, 0 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 859. Up to 26 conditions per place. [2021-06-10 11:38:16,965 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/646 dead transitions. [2021-06-10 11:38:16,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 646 transitions, 1503 flow [2021-06-10 11:38:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:16,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:16,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:16,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:16,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,968 INFO L185 Difference]: Start difference. First operand has 672 places, 648 transitions, 1500 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:16,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 646 transitions, 1503 flow [2021-06-10 11:38:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 646 transitions, 1496 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:16,974 INFO L241 Difference]: Finished difference. Result has 672 places, 646 transitions, 1489 flow [2021-06-10 11:38:16,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1489, PETRI_PLACES=672, PETRI_TRANSITIONS=646} [2021-06-10 11:38:16,974 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 1 predicate places. [2021-06-10 11:38:16,974 INFO L480 AbstractCegarLoop]: Abstraction has has 672 places, 646 transitions, 1489 flow [2021-06-10 11:38:16,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,974 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:16,974 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:16,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2021-06-10 11:38:16,974 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1796085969, now seen corresponding path program 1 times [2021-06-10 11:38:16,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:16,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865729242] [2021-06-10 11:38:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:16,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:16,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:16,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:16,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865729242] [2021-06-10 11:38:16,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:16,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:16,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185905014] [2021-06-10 11:38:16,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:16,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:16,990 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:16,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 646 transitions, 1489 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:16,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:16,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:16,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:17,172 INFO L129 PetriNetUnfolder]: 54/739 cut-off events. [2021-06-10 11:38:17,172 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:17,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 739 events. 54/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3019 event pairs, 0 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 859. Up to 26 conditions per place. [2021-06-10 11:38:17,207 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/644 dead transitions. [2021-06-10 11:38:17,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 644 transitions, 1502 flow [2021-06-10 11:38:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:17,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:17,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:17,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:17,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:17,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:17,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,210 INFO L185 Difference]: Start difference. First operand has 672 places, 646 transitions, 1489 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:17,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 644 transitions, 1502 flow [2021-06-10 11:38:17,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 644 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:17,216 INFO L241 Difference]: Finished difference. Result has 671 places, 644 transitions, 1485 flow [2021-06-10 11:38:17,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1485, PETRI_PLACES=671, PETRI_TRANSITIONS=644} [2021-06-10 11:38:17,216 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 0 predicate places. [2021-06-10 11:38:17,216 INFO L480 AbstractCegarLoop]: Abstraction has has 671 places, 644 transitions, 1485 flow [2021-06-10 11:38:17,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:17,217 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:17,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2021-06-10 11:38:17,217 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash 725746773, now seen corresponding path program 1 times [2021-06-10 11:38:17,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:17,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367028474] [2021-06-10 11:38:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:17,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:17,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:17,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367028474] [2021-06-10 11:38:17,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:17,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:17,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809622606] [2021-06-10 11:38:17,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:17,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:17,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:17,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 644 transitions, 1485 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:17,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:17,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:17,424 INFO L129 PetriNetUnfolder]: 52/744 cut-off events. [2021-06-10 11:38:17,424 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:17,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 744 events. 52/744 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3067 event pairs, 0 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 862. Up to 26 conditions per place. [2021-06-10 11:38:17,460 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/645 dead transitions. [2021-06-10 11:38:17,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 645 transitions, 1501 flow [2021-06-10 11:38:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:17,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:17,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:17,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:17,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:17,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:17,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,463 INFO L185 Difference]: Start difference. First operand has 671 places, 644 transitions, 1485 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:17,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 645 transitions, 1501 flow [2021-06-10 11:38:17,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 645 transitions, 1500 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:17,469 INFO L241 Difference]: Finished difference. Result has 674 places, 645 transitions, 1498 flow [2021-06-10 11:38:17,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=674, PETRI_TRANSITIONS=645} [2021-06-10 11:38:17,469 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 3 predicate places. [2021-06-10 11:38:17,469 INFO L480 AbstractCegarLoop]: Abstraction has has 674 places, 645 transitions, 1498 flow [2021-06-10 11:38:17,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:17,469 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:17,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2021-06-10 11:38:17,470 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 725745750, now seen corresponding path program 1 times [2021-06-10 11:38:17,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:17,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755570417] [2021-06-10 11:38:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:17,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:17,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:17,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755570417] [2021-06-10 11:38:17,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:17,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:17,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128898533] [2021-06-10 11:38:17,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:17,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:17,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:17,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:17,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:17,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 645 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:17,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:17,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:17,677 INFO L129 PetriNetUnfolder]: 52/745 cut-off events. [2021-06-10 11:38:17,677 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:17,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 745 events. 52/745 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3077 event pairs, 0 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 870. Up to 26 conditions per place. [2021-06-10 11:38:17,711 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/646 dead transitions. [2021-06-10 11:38:17,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 646 transitions, 1524 flow [2021-06-10 11:38:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:17,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:17,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:17,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:17,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:17,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:17,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,714 INFO L185 Difference]: Start difference. First operand has 674 places, 645 transitions, 1498 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:17,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 646 transitions, 1524 flow [2021-06-10 11:38:17,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 646 transitions, 1522 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:17,720 INFO L241 Difference]: Finished difference. Result has 677 places, 646 transitions, 1514 flow [2021-06-10 11:38:17,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=677, PETRI_TRANSITIONS=646} [2021-06-10 11:38:17,720 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 6 predicate places. [2021-06-10 11:38:17,720 INFO L480 AbstractCegarLoop]: Abstraction has has 677 places, 646 transitions, 1514 flow [2021-06-10 11:38:17,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:17,720 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:17,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2021-06-10 11:38:17,721 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:17,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash 726699062, now seen corresponding path program 1 times [2021-06-10 11:38:17,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:17,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680863281] [2021-06-10 11:38:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:17,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:17,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:17,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680863281] [2021-06-10 11:38:17,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:17,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:17,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39020430] [2021-06-10 11:38:17,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:17,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:17,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:17,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:17,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 646 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:17,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:17,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:17,915 INFO L129 PetriNetUnfolder]: 51/741 cut-off events. [2021-06-10 11:38:17,915 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:17,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 741 events. 51/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3050 event pairs, 0 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 863. Up to 26 conditions per place. [2021-06-10 11:38:17,948 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/643 dead transitions. [2021-06-10 11:38:17,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 643 transitions, 1511 flow [2021-06-10 11:38:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:17,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:17,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:17,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:17,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:17,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,952 INFO L185 Difference]: Start difference. First operand has 677 places, 646 transitions, 1514 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:17,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 643 transitions, 1511 flow [2021-06-10 11:38:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 643 transitions, 1503 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:17,957 INFO L241 Difference]: Finished difference. Result has 676 places, 643 transitions, 1493 flow [2021-06-10 11:38:17,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=676, PETRI_TRANSITIONS=643} [2021-06-10 11:38:17,958 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 5 predicate places. [2021-06-10 11:38:17,958 INFO L480 AbstractCegarLoop]: Abstraction has has 676 places, 643 transitions, 1493 flow [2021-06-10 11:38:17,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:17,958 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:17,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2021-06-10 11:38:17,958 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash 726700085, now seen corresponding path program 1 times [2021-06-10 11:38:17,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:17,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572367165] [2021-06-10 11:38:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:17,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:17,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:17,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:17,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572367165] [2021-06-10 11:38:17,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:17,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:17,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88949347] [2021-06-10 11:38:17,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:17,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:17,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:17,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 643 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:17,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:17,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:17,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:18,159 INFO L129 PetriNetUnfolder]: 51/739 cut-off events. [2021-06-10 11:38:18,159 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:18,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 739 events. 51/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3032 event pairs, 0 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 866. Up to 26 conditions per place. [2021-06-10 11:38:18,192 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/641 dead transitions. [2021-06-10 11:38:18,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 641 transitions, 1506 flow [2021-06-10 11:38:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:18,194 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:18,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:18,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:18,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:18,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:18,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,196 INFO L185 Difference]: Start difference. First operand has 676 places, 643 transitions, 1493 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 641 transitions, 1506 flow [2021-06-10 11:38:18,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 641 transitions, 1505 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:18,201 INFO L241 Difference]: Finished difference. Result has 675 places, 641 transitions, 1489 flow [2021-06-10 11:38:18,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1489, PETRI_PLACES=675, PETRI_TRANSITIONS=641} [2021-06-10 11:38:18,201 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 4 predicate places. [2021-06-10 11:38:18,201 INFO L480 AbstractCegarLoop]: Abstraction has has 675 places, 641 transitions, 1489 flow [2021-06-10 11:38:18,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,202 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:18,202 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:18,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2021-06-10 11:38:18,202 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 90580222, now seen corresponding path program 1 times [2021-06-10 11:38:18,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:18,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041280293] [2021-06-10 11:38:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:18,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:18,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:18,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041280293] [2021-06-10 11:38:18,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:18,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:18,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252394632] [2021-06-10 11:38:18,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:18,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:18,218 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:18,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 641 transitions, 1489 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:18,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:18,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:18,416 INFO L129 PetriNetUnfolder]: 50/747 cut-off events. [2021-06-10 11:38:18,417 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:18,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 747 events. 50/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3106 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 878. Up to 26 conditions per place. [2021-06-10 11:38:18,453 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/643 dead transitions. [2021-06-10 11:38:18,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 643 transitions, 1519 flow [2021-06-10 11:38:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:18,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:18,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:18,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:18,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:18,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:18,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,456 INFO L185 Difference]: Start difference. First operand has 675 places, 641 transitions, 1489 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 643 transitions, 1519 flow [2021-06-10 11:38:18,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 643 transitions, 1518 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:18,462 INFO L241 Difference]: Finished difference. Result has 678 places, 643 transitions, 1512 flow [2021-06-10 11:38:18,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=678, PETRI_TRANSITIONS=643} [2021-06-10 11:38:18,462 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 7 predicate places. [2021-06-10 11:38:18,462 INFO L480 AbstractCegarLoop]: Abstraction has has 678 places, 643 transitions, 1512 flow [2021-06-10 11:38:18,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:18,463 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:18,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2021-06-10 11:38:18,463 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 90581245, now seen corresponding path program 1 times [2021-06-10 11:38:18,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:18,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441475122] [2021-06-10 11:38:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:18,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:18,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:18,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441475122] [2021-06-10 11:38:18,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:18,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607967495] [2021-06-10 11:38:18,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:18,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:18,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:18,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:18,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:18,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 643 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:18,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:18,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:18,675 INFO L129 PetriNetUnfolder]: 49/745 cut-off events. [2021-06-10 11:38:18,675 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:18,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 745 events. 49/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3091 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 875. Up to 26 conditions per place. [2021-06-10 11:38:18,709 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/643 dead transitions. [2021-06-10 11:38:18,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 643 transitions, 1524 flow [2021-06-10 11:38:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:18,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:18,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:18,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:18,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:18,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:18,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,712 INFO L185 Difference]: Start difference. First operand has 678 places, 643 transitions, 1512 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:18,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 643 transitions, 1524 flow [2021-06-10 11:38:18,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 643 transitions, 1519 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:18,718 INFO L241 Difference]: Finished difference. Result has 681 places, 643 transitions, 1517 flow [2021-06-10 11:38:18,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=681, PETRI_TRANSITIONS=643} [2021-06-10 11:38:18,718 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 10 predicate places. [2021-06-10 11:38:18,718 INFO L480 AbstractCegarLoop]: Abstraction has has 681 places, 643 transitions, 1517 flow [2021-06-10 11:38:18,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:18,718 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:18,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2021-06-10 11:38:18,719 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 91533534, now seen corresponding path program 1 times [2021-06-10 11:38:18,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:18,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177949218] [2021-06-10 11:38:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:18,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:18,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:18,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177949218] [2021-06-10 11:38:18,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:18,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:18,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342417722] [2021-06-10 11:38:18,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:18,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:18,734 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:18,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 643 transitions, 1517 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:18,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:18,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:18,917 INFO L129 PetriNetUnfolder]: 48/741 cut-off events. [2021-06-10 11:38:18,917 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:18,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 741 events. 48/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3065 event pairs, 0 based on Foata normal form. 1/670 useless extension candidates. Maximal degree in co-relation 872. Up to 26 conditions per place. [2021-06-10 11:38:18,951 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2021-06-10 11:38:18,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 640 transitions, 1514 flow [2021-06-10 11:38:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:18,952 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:18,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:18,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:18,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:18,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:18,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,955 INFO L185 Difference]: Start difference. First operand has 681 places, 643 transitions, 1517 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:18,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 640 transitions, 1514 flow [2021-06-10 11:38:18,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 640 transitions, 1507 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:18,960 INFO L241 Difference]: Finished difference. Result has 680 places, 640 transitions, 1497 flow [2021-06-10 11:38:18,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=680, PETRI_TRANSITIONS=640} [2021-06-10 11:38:18,961 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 9 predicate places. [2021-06-10 11:38:18,961 INFO L480 AbstractCegarLoop]: Abstraction has has 680 places, 640 transitions, 1497 flow [2021-06-10 11:38:18,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:18,961 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:18,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2021-06-10 11:38:18,961 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 91534557, now seen corresponding path program 1 times [2021-06-10 11:38:18,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:18,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085488656] [2021-06-10 11:38:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:18,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:18,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:18,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:18,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085488656] [2021-06-10 11:38:18,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:18,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:18,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033680724] [2021-06-10 11:38:18,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:18,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:18,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:18,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:18,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:18,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 640 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:18,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:18,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:18,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:19,187 INFO L129 PetriNetUnfolder]: 48/739 cut-off events. [2021-06-10 11:38:19,188 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:19,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 739 events. 48/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3053 event pairs, 0 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 873. Up to 26 conditions per place. [2021-06-10 11:38:19,210 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/638 dead transitions. [2021-06-10 11:38:19,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 638 transitions, 1510 flow [2021-06-10 11:38:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:19,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:19,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:19,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:19,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:19,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:19,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,214 INFO L185 Difference]: Start difference. First operand has 680 places, 640 transitions, 1497 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:19,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 638 transitions, 1510 flow [2021-06-10 11:38:19,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 638 transitions, 1509 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:19,219 INFO L241 Difference]: Finished difference. Result has 679 places, 638 transitions, 1493 flow [2021-06-10 11:38:19,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=679, PETRI_TRANSITIONS=638} [2021-06-10 11:38:19,219 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 8 predicate places. [2021-06-10 11:38:19,219 INFO L480 AbstractCegarLoop]: Abstraction has has 679 places, 638 transitions, 1493 flow [2021-06-10 11:38:19,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:19,220 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:19,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2021-06-10 11:38:19,220 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash -817984345, now seen corresponding path program 1 times [2021-06-10 11:38:19,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:19,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477057280] [2021-06-10 11:38:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:19,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:19,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:19,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477057280] [2021-06-10 11:38:19,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:19,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:19,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173696821] [2021-06-10 11:38:19,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:19,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:19,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:19,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 638 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:19,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:19,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:19,430 INFO L129 PetriNetUnfolder]: 47/747 cut-off events. [2021-06-10 11:38:19,430 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:19,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 747 events. 47/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3123 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 885. Up to 26 conditions per place. [2021-06-10 11:38:19,464 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/640 dead transitions. [2021-06-10 11:38:19,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 640 transitions, 1523 flow [2021-06-10 11:38:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:19,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:19,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:19,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:19,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:19,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:19,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,468 INFO L185 Difference]: Start difference. First operand has 679 places, 638 transitions, 1493 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:19,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 640 transitions, 1523 flow [2021-06-10 11:38:19,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 640 transitions, 1522 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:19,473 INFO L241 Difference]: Finished difference. Result has 682 places, 640 transitions, 1516 flow [2021-06-10 11:38:19,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=682, PETRI_TRANSITIONS=640} [2021-06-10 11:38:19,474 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 11 predicate places. [2021-06-10 11:38:19,474 INFO L480 AbstractCegarLoop]: Abstraction has has 682 places, 640 transitions, 1516 flow [2021-06-10 11:38:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:19,474 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:19,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2021-06-10 11:38:19,474 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash -817983322, now seen corresponding path program 1 times [2021-06-10 11:38:19,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:19,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87035497] [2021-06-10 11:38:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:19,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:19,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:19,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87035497] [2021-06-10 11:38:19,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:19,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:19,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826782751] [2021-06-10 11:38:19,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:19,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:19,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:19,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:19,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 640 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:19,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:19,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:19,677 INFO L129 PetriNetUnfolder]: 46/745 cut-off events. [2021-06-10 11:38:19,677 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:19,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 745 events. 46/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3115 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 882. Up to 26 conditions per place. [2021-06-10 11:38:19,711 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/640 dead transitions. [2021-06-10 11:38:19,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 640 transitions, 1528 flow [2021-06-10 11:38:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:19,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:19,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:19,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:19,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:19,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:19,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,715 INFO L185 Difference]: Start difference. First operand has 682 places, 640 transitions, 1516 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 640 transitions, 1528 flow [2021-06-10 11:38:19,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 640 transitions, 1523 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:19,720 INFO L241 Difference]: Finished difference. Result has 685 places, 640 transitions, 1521 flow [2021-06-10 11:38:19,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=685, PETRI_TRANSITIONS=640} [2021-06-10 11:38:19,721 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 14 predicate places. [2021-06-10 11:38:19,721 INFO L480 AbstractCegarLoop]: Abstraction has has 685 places, 640 transitions, 1521 flow [2021-06-10 11:38:19,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,721 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:19,721 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:19,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2021-06-10 11:38:19,721 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -817031033, now seen corresponding path program 1 times [2021-06-10 11:38:19,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:19,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580253281] [2021-06-10 11:38:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:19,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:19,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:19,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580253281] [2021-06-10 11:38:19,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:19,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:19,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77959860] [2021-06-10 11:38:19,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:19,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:19,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:19,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:19,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:19,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 640 transitions, 1521 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:19,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:19,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:19,925 INFO L129 PetriNetUnfolder]: 45/741 cut-off events. [2021-06-10 11:38:19,925 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:19,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 741 events. 45/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3087 event pairs, 0 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 879. Up to 26 conditions per place. [2021-06-10 11:38:19,958 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2021-06-10 11:38:19,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 637 transitions, 1518 flow [2021-06-10 11:38:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:19,959 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:19,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:19,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:19,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:19,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:19,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,962 INFO L185 Difference]: Start difference. First operand has 685 places, 640 transitions, 1521 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:19,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 637 transitions, 1518 flow [2021-06-10 11:38:19,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 637 transitions, 1511 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:19,967 INFO L241 Difference]: Finished difference. Result has 684 places, 637 transitions, 1501 flow [2021-06-10 11:38:19,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=684, PETRI_TRANSITIONS=637} [2021-06-10 11:38:19,967 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 13 predicate places. [2021-06-10 11:38:19,967 INFO L480 AbstractCegarLoop]: Abstraction has has 684 places, 637 transitions, 1501 flow [2021-06-10 11:38:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:19,968 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:19,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2021-06-10 11:38:19,968 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -817030010, now seen corresponding path program 1 times [2021-06-10 11:38:19,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:19,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713402589] [2021-06-10 11:38:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:19,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:19,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:19,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:19,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713402589] [2021-06-10 11:38:19,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:19,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:19,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450692810] [2021-06-10 11:38:19,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:19,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:19,984 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:19,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 637 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:19,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:19,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:19,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:20,171 INFO L129 PetriNetUnfolder]: 45/739 cut-off events. [2021-06-10 11:38:20,171 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:20,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 739 events. 45/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3073 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 880. Up to 26 conditions per place. [2021-06-10 11:38:20,204 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/635 dead transitions. [2021-06-10 11:38:20,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 635 transitions, 1514 flow [2021-06-10 11:38:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:20,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:20,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:20,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:20,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:20,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,208 INFO L185 Difference]: Start difference. First operand has 684 places, 637 transitions, 1501 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:20,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 635 transitions, 1514 flow [2021-06-10 11:38:20,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 635 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:20,214 INFO L241 Difference]: Finished difference. Result has 683 places, 635 transitions, 1497 flow [2021-06-10 11:38:20,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=683, PETRI_TRANSITIONS=635} [2021-06-10 11:38:20,214 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 12 predicate places. [2021-06-10 11:38:20,214 INFO L480 AbstractCegarLoop]: Abstraction has has 683 places, 635 transitions, 1497 flow [2021-06-10 11:38:20,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:20,214 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:20,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2021-06-10 11:38:20,214 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1364141104, now seen corresponding path program 1 times [2021-06-10 11:38:20,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:20,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242095546] [2021-06-10 11:38:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:20,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:20,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:20,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242095546] [2021-06-10 11:38:20,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:20,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:20,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795109145] [2021-06-10 11:38:20,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:20,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:20,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:20,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 635 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:20,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:20,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:20,416 INFO L129 PetriNetUnfolder]: 43/744 cut-off events. [2021-06-10 11:38:20,416 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:20,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 744 events. 43/744 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3121 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 883. Up to 26 conditions per place. [2021-06-10 11:38:20,450 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2021-06-10 11:38:20,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 636 transitions, 1513 flow [2021-06-10 11:38:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:20,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:20,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:20,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:20,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:20,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:20,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,453 INFO L185 Difference]: Start difference. First operand has 683 places, 635 transitions, 1497 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:20,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 636 transitions, 1513 flow [2021-06-10 11:38:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 636 transitions, 1512 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:20,459 INFO L241 Difference]: Finished difference. Result has 686 places, 636 transitions, 1510 flow [2021-06-10 11:38:20,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1510, PETRI_PLACES=686, PETRI_TRANSITIONS=636} [2021-06-10 11:38:20,459 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 15 predicate places. [2021-06-10 11:38:20,459 INFO L480 AbstractCegarLoop]: Abstraction has has 686 places, 636 transitions, 1510 flow [2021-06-10 11:38:20,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:20,459 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:20,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2021-06-10 11:38:20,459 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1364142127, now seen corresponding path program 1 times [2021-06-10 11:38:20,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:20,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058489363] [2021-06-10 11:38:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:20,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:20,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:20,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058489363] [2021-06-10 11:38:20,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:20,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:20,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51532506] [2021-06-10 11:38:20,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:20,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:20,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:20,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:20,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 636 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:20,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:20,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:20,704 INFO L129 PetriNetUnfolder]: 43/745 cut-off events. [2021-06-10 11:38:20,704 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:20,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 745 events. 43/745 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3127 event pairs, 0 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 891. Up to 26 conditions per place. [2021-06-10 11:38:20,738 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/637 dead transitions. [2021-06-10 11:38:20,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 637 transitions, 1536 flow [2021-06-10 11:38:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:20,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:20,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:20,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:20,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:20,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:20,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,742 INFO L185 Difference]: Start difference. First operand has 686 places, 636 transitions, 1510 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:20,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 637 transitions, 1536 flow [2021-06-10 11:38:20,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 637 transitions, 1534 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:20,747 INFO L241 Difference]: Finished difference. Result has 689 places, 637 transitions, 1526 flow [2021-06-10 11:38:20,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1526, PETRI_PLACES=689, PETRI_TRANSITIONS=637} [2021-06-10 11:38:20,748 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 18 predicate places. [2021-06-10 11:38:20,748 INFO L480 AbstractCegarLoop]: Abstraction has has 689 places, 637 transitions, 1526 flow [2021-06-10 11:38:20,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:20,748 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:20,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2021-06-10 11:38:20,748 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1363188815, now seen corresponding path program 1 times [2021-06-10 11:38:20,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:20,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805008290] [2021-06-10 11:38:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:20,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:20,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:20,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:20,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805008290] [2021-06-10 11:38:20,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:20,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:20,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298632288] [2021-06-10 11:38:20,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:20,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:20,765 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:20,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 637 transitions, 1526 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:20,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:20,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:20,952 INFO L129 PetriNetUnfolder]: 42/741 cut-off events. [2021-06-10 11:38:20,952 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:20,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 741 events. 42/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3102 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 884. Up to 26 conditions per place. [2021-06-10 11:38:20,984 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/634 dead transitions. [2021-06-10 11:38:20,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 634 transitions, 1523 flow [2021-06-10 11:38:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:20,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:20,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:20,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:20,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:20,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:20,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,987 INFO L185 Difference]: Start difference. First operand has 689 places, 637 transitions, 1526 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 634 transitions, 1523 flow [2021-06-10 11:38:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 634 transitions, 1515 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:20,993 INFO L241 Difference]: Finished difference. Result has 688 places, 634 transitions, 1505 flow [2021-06-10 11:38:20,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=688, PETRI_TRANSITIONS=634} [2021-06-10 11:38:20,993 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 17 predicate places. [2021-06-10 11:38:20,993 INFO L480 AbstractCegarLoop]: Abstraction has has 688 places, 634 transitions, 1505 flow [2021-06-10 11:38:20,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:20,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:20,993 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:20,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2021-06-10 11:38:20,993 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1363187792, now seen corresponding path program 1 times [2021-06-10 11:38:20,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:20,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315308899] [2021-06-10 11:38:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:21,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:21,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:21,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315308899] [2021-06-10 11:38:21,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:21,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:21,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494703272] [2021-06-10 11:38:21,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:21,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:21,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:21,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 634 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:21,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:21,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:21,197 INFO L129 PetriNetUnfolder]: 42/739 cut-off events. [2021-06-10 11:38:21,197 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:21,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 739 events. 42/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3085 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 887. Up to 26 conditions per place. [2021-06-10 11:38:21,230 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/632 dead transitions. [2021-06-10 11:38:21,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 632 transitions, 1518 flow [2021-06-10 11:38:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:21,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:21,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:21,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:21,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:21,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:21,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,234 INFO L185 Difference]: Start difference. First operand has 688 places, 634 transitions, 1505 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:21,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 632 transitions, 1518 flow [2021-06-10 11:38:21,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 632 transitions, 1517 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:21,239 INFO L241 Difference]: Finished difference. Result has 687 places, 632 transitions, 1501 flow [2021-06-10 11:38:21,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=687, PETRI_TRANSITIONS=632} [2021-06-10 11:38:21,239 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 16 predicate places. [2021-06-10 11:38:21,239 INFO L480 AbstractCegarLoop]: Abstraction has has 687 places, 632 transitions, 1501 flow [2021-06-10 11:38:21,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:21,240 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:21,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2021-06-10 11:38:21,240 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1027620091, now seen corresponding path program 1 times [2021-06-10 11:38:21,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:21,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132131177] [2021-06-10 11:38:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:21,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:21,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:21,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132131177] [2021-06-10 11:38:21,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:21,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:21,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926548395] [2021-06-10 11:38:21,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:21,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:21,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:21,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 632 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:21,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:21,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:21,444 INFO L129 PetriNetUnfolder]: 40/744 cut-off events. [2021-06-10 11:38:21,445 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:21,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 744 events. 40/744 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3140 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 890. Up to 26 conditions per place. [2021-06-10 11:38:21,478 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2021-06-10 11:38:21,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 633 transitions, 1517 flow [2021-06-10 11:38:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:21,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:21,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:21,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:21,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:21,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:21,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,481 INFO L185 Difference]: Start difference. First operand has 687 places, 632 transitions, 1501 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:21,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 633 transitions, 1517 flow [2021-06-10 11:38:21,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 633 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:21,487 INFO L241 Difference]: Finished difference. Result has 690 places, 633 transitions, 1514 flow [2021-06-10 11:38:21,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=690, PETRI_TRANSITIONS=633} [2021-06-10 11:38:21,487 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 19 predicate places. [2021-06-10 11:38:21,487 INFO L480 AbstractCegarLoop]: Abstraction has has 690 places, 633 transitions, 1514 flow [2021-06-10 11:38:21,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:21,488 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:21,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2021-06-10 11:38:21,488 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1027619068, now seen corresponding path program 1 times [2021-06-10 11:38:21,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:21,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086456715] [2021-06-10 11:38:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:21,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:21,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:21,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086456715] [2021-06-10 11:38:21,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:21,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:21,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121525101] [2021-06-10 11:38:21,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:21,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:21,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:21,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:21,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:21,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 633 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:21,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:21,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:21,701 INFO L129 PetriNetUnfolder]: 40/745 cut-off events. [2021-06-10 11:38:21,701 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:21,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 745 events. 40/745 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3147 event pairs, 0 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 898. Up to 26 conditions per place. [2021-06-10 11:38:21,736 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/634 dead transitions. [2021-06-10 11:38:21,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 634 transitions, 1540 flow [2021-06-10 11:38:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:21,738 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:21,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:21,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:21,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:21,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:21,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,740 INFO L185 Difference]: Start difference. First operand has 690 places, 633 transitions, 1514 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:21,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 634 transitions, 1540 flow [2021-06-10 11:38:21,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 634 transitions, 1538 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:21,746 INFO L241 Difference]: Finished difference. Result has 693 places, 634 transitions, 1530 flow [2021-06-10 11:38:21,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=693, PETRI_TRANSITIONS=634} [2021-06-10 11:38:21,746 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 22 predicate places. [2021-06-10 11:38:21,746 INFO L480 AbstractCegarLoop]: Abstraction has has 693 places, 634 transitions, 1530 flow [2021-06-10 11:38:21,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:21,746 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:21,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2021-06-10 11:38:21,747 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1028572380, now seen corresponding path program 1 times [2021-06-10 11:38:21,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:21,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664861635] [2021-06-10 11:38:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:21,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:21,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:21,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:21,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664861635] [2021-06-10 11:38:21,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:21,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:21,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242698662] [2021-06-10 11:38:21,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:21,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:21,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:21,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:21,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 634 transitions, 1530 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:21,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:21,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:21,953 INFO L129 PetriNetUnfolder]: 39/741 cut-off events. [2021-06-10 11:38:21,953 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:21,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 741 events. 39/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3122 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 891. Up to 26 conditions per place. [2021-06-10 11:38:21,986 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2021-06-10 11:38:21,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 631 transitions, 1527 flow [2021-06-10 11:38:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:21,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:21,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:21,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:21,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:21,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:21,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,989 INFO L185 Difference]: Start difference. First operand has 693 places, 634 transitions, 1530 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:21,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 631 transitions, 1527 flow [2021-06-10 11:38:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 631 transitions, 1519 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:21,995 INFO L241 Difference]: Finished difference. Result has 692 places, 631 transitions, 1509 flow [2021-06-10 11:38:21,995 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1509, PETRI_PLACES=692, PETRI_TRANSITIONS=631} [2021-06-10 11:38:21,995 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 21 predicate places. [2021-06-10 11:38:21,995 INFO L480 AbstractCegarLoop]: Abstraction has has 692 places, 631 transitions, 1509 flow [2021-06-10 11:38:21,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:21,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:21,996 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:21,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2021-06-10 11:38:21,996 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1028573403, now seen corresponding path program 1 times [2021-06-10 11:38:21,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:21,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815520277] [2021-06-10 11:38:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:22,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:22,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:22,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815520277] [2021-06-10 11:38:22,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:22,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:22,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115113763] [2021-06-10 11:38:22,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:22,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:22,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:22,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 631 transitions, 1509 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:22,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:22,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:22,208 INFO L129 PetriNetUnfolder]: 39/739 cut-off events. [2021-06-10 11:38:22,209 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:22,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 739 events. 39/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3107 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 894. Up to 26 conditions per place. [2021-06-10 11:38:22,243 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2021-06-10 11:38:22,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 629 transitions, 1522 flow [2021-06-10 11:38:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:22,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:22,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:22,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:22,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:22,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:22,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,246 INFO L185 Difference]: Start difference. First operand has 692 places, 631 transitions, 1509 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:22,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 629 transitions, 1522 flow [2021-06-10 11:38:22,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 629 transitions, 1521 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:22,252 INFO L241 Difference]: Finished difference. Result has 691 places, 629 transitions, 1505 flow [2021-06-10 11:38:22,253 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=691, PETRI_TRANSITIONS=629} [2021-06-10 11:38:22,253 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 20 predicate places. [2021-06-10 11:38:22,253 INFO L480 AbstractCegarLoop]: Abstraction has has 691 places, 629 transitions, 1505 flow [2021-06-10 11:38:22,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,253 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:22,253 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:22,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2021-06-10 11:38:22,253 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1827250600, now seen corresponding path program 1 times [2021-06-10 11:38:22,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:22,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962588465] [2021-06-10 11:38:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:22,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:22,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:22,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962588465] [2021-06-10 11:38:22,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:22,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:22,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569810988] [2021-06-10 11:38:22,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:22,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:22,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:22,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 629 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:22,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:22,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:22,490 INFO L129 PetriNetUnfolder]: 38/747 cut-off events. [2021-06-10 11:38:22,491 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:22,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 747 events. 38/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3176 event pairs, 0 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 906. Up to 26 conditions per place. [2021-06-10 11:38:22,516 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/631 dead transitions. [2021-06-10 11:38:22,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 631 transitions, 1535 flow [2021-06-10 11:38:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:22,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:22,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:22,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:22,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:22,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:22,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,520 INFO L185 Difference]: Start difference. First operand has 691 places, 629 transitions, 1505 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:22,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 631 transitions, 1535 flow [2021-06-10 11:38:22,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 631 transitions, 1534 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:22,525 INFO L241 Difference]: Finished difference. Result has 694 places, 631 transitions, 1528 flow [2021-06-10 11:38:22,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=694, PETRI_TRANSITIONS=631} [2021-06-10 11:38:22,525 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 23 predicate places. [2021-06-10 11:38:22,525 INFO L480 AbstractCegarLoop]: Abstraction has has 694 places, 631 transitions, 1528 flow [2021-06-10 11:38:22,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:22,526 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:22,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2021-06-10 11:38:22,526 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1827251623, now seen corresponding path program 1 times [2021-06-10 11:38:22,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:22,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351506419] [2021-06-10 11:38:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:22,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:22,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:22,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351506419] [2021-06-10 11:38:22,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:22,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:22,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505890774] [2021-06-10 11:38:22,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:22,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:22,543 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:22,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 631 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:22,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:22,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:22,735 INFO L129 PetriNetUnfolder]: 37/745 cut-off events. [2021-06-10 11:38:22,735 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:22,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 745 events. 37/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3163 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 903. Up to 26 conditions per place. [2021-06-10 11:38:22,771 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2021-06-10 11:38:22,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 631 transitions, 1540 flow [2021-06-10 11:38:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:22,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:22,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:22,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:22,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:22,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:22,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,774 INFO L185 Difference]: Start difference. First operand has 694 places, 631 transitions, 1528 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:22,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 631 transitions, 1540 flow [2021-06-10 11:38:22,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 631 transitions, 1535 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:22,780 INFO L241 Difference]: Finished difference. Result has 697 places, 631 transitions, 1533 flow [2021-06-10 11:38:22,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=697, PETRI_TRANSITIONS=631} [2021-06-10 11:38:22,781 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 26 predicate places. [2021-06-10 11:38:22,781 INFO L480 AbstractCegarLoop]: Abstraction has has 697 places, 631 transitions, 1533 flow [2021-06-10 11:38:22,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:22,781 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:22,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2021-06-10 11:38:22,781 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:22,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:22,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1828203912, now seen corresponding path program 1 times [2021-06-10 11:38:22,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:22,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955115498] [2021-06-10 11:38:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:22,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:22,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:22,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:22,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955115498] [2021-06-10 11:38:22,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:22,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:22,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715761232] [2021-06-10 11:38:22,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:22,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:22,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:22,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:22,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 631 transitions, 1533 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:22,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:22,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:22,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:22,988 INFO L129 PetriNetUnfolder]: 36/741 cut-off events. [2021-06-10 11:38:22,988 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:23,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 741 events. 36/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3139 event pairs, 0 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 900. Up to 26 conditions per place. [2021-06-10 11:38:23,021 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/628 dead transitions. [2021-06-10 11:38:23,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 628 transitions, 1530 flow [2021-06-10 11:38:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:23,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:23,022 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:23,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:23,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:23,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:23,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,024 INFO L185 Difference]: Start difference. First operand has 697 places, 631 transitions, 1533 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:23,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 628 transitions, 1530 flow [2021-06-10 11:38:23,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 628 transitions, 1523 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:23,030 INFO L241 Difference]: Finished difference. Result has 696 places, 628 transitions, 1513 flow [2021-06-10 11:38:23,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=696, PETRI_TRANSITIONS=628} [2021-06-10 11:38:23,030 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 25 predicate places. [2021-06-10 11:38:23,030 INFO L480 AbstractCegarLoop]: Abstraction has has 696 places, 628 transitions, 1513 flow [2021-06-10 11:38:23,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:23,031 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:23,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2021-06-10 11:38:23,031 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1828204935, now seen corresponding path program 1 times [2021-06-10 11:38:23,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:23,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898342950] [2021-06-10 11:38:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:23,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:23,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:23,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898342950] [2021-06-10 11:38:23,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:23,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:23,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632223652] [2021-06-10 11:38:23,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:23,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:23,062 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:23,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 628 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:23,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:23,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:23,255 INFO L129 PetriNetUnfolder]: 36/739 cut-off events. [2021-06-10 11:38:23,255 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:23,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 739 events. 36/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3126 event pairs, 0 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 901. Up to 26 conditions per place. [2021-06-10 11:38:23,288 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2021-06-10 11:38:23,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 626 transitions, 1526 flow [2021-06-10 11:38:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:23,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:23,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:23,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:23,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:23,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:23,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,291 INFO L185 Difference]: Start difference. First operand has 696 places, 628 transitions, 1513 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:23,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 626 transitions, 1526 flow [2021-06-10 11:38:23,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 626 transitions, 1525 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:23,297 INFO L241 Difference]: Finished difference. Result has 695 places, 626 transitions, 1509 flow [2021-06-10 11:38:23,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1509, PETRI_PLACES=695, PETRI_TRANSITIONS=626} [2021-06-10 11:38:23,297 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 24 predicate places. [2021-06-10 11:38:23,297 INFO L480 AbstractCegarLoop]: Abstraction has has 695 places, 626 transitions, 1509 flow [2021-06-10 11:38:23,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:23,298 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:23,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2021-06-10 11:38:23,298 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2030495660, now seen corresponding path program 1 times [2021-06-10 11:38:23,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:23,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727222688] [2021-06-10 11:38:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:23,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:23,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:23,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727222688] [2021-06-10 11:38:23,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:23,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:23,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936250520] [2021-06-10 11:38:23,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:23,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:23,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:23,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 626 transitions, 1509 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:23,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:23,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:23,510 INFO L129 PetriNetUnfolder]: 34/744 cut-off events. [2021-06-10 11:38:23,510 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:23,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 744 events. 34/744 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3175 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 904. Up to 26 conditions per place. [2021-06-10 11:38:23,543 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/627 dead transitions. [2021-06-10 11:38:23,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 627 transitions, 1525 flow [2021-06-10 11:38:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:23,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:23,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:23,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:23,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:23,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:23,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,546 INFO L185 Difference]: Start difference. First operand has 695 places, 626 transitions, 1509 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:23,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 627 transitions, 1525 flow [2021-06-10 11:38:23,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 627 transitions, 1524 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:23,552 INFO L241 Difference]: Finished difference. Result has 698 places, 627 transitions, 1522 flow [2021-06-10 11:38:23,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1522, PETRI_PLACES=698, PETRI_TRANSITIONS=627} [2021-06-10 11:38:23,552 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 27 predicate places. [2021-06-10 11:38:23,552 INFO L480 AbstractCegarLoop]: Abstraction has has 698 places, 627 transitions, 1522 flow [2021-06-10 11:38:23,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:23,552 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:23,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2021-06-10 11:38:23,553 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2030496683, now seen corresponding path program 1 times [2021-06-10 11:38:23,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:23,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131043988] [2021-06-10 11:38:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:23,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:23,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:23,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131043988] [2021-06-10 11:38:23,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:23,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:23,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392591170] [2021-06-10 11:38:23,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:23,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:23,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:23,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 627 transitions, 1522 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:23,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:23,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:23,787 INFO L129 PetriNetUnfolder]: 34/745 cut-off events. [2021-06-10 11:38:23,787 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:23,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 745 events. 34/745 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3181 event pairs, 0 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 912. Up to 26 conditions per place. [2021-06-10 11:38:23,820 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/628 dead transitions. [2021-06-10 11:38:23,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 628 transitions, 1548 flow [2021-06-10 11:38:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:23,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:23,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:23,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:23,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:23,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:23,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,823 INFO L185 Difference]: Start difference. First operand has 698 places, 627 transitions, 1522 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 628 transitions, 1548 flow [2021-06-10 11:38:23,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 628 transitions, 1546 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:23,829 INFO L241 Difference]: Finished difference. Result has 701 places, 628 transitions, 1538 flow [2021-06-10 11:38:23,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1538, PETRI_PLACES=701, PETRI_TRANSITIONS=628} [2021-06-10 11:38:23,829 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 30 predicate places. [2021-06-10 11:38:23,829 INFO L480 AbstractCegarLoop]: Abstraction has has 701 places, 628 transitions, 1538 flow [2021-06-10 11:38:23,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:23,830 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:23,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2021-06-10 11:38:23,830 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2029542348, now seen corresponding path program 1 times [2021-06-10 11:38:23,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:23,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809796896] [2021-06-10 11:38:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:23,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:23,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:23,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:23,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809796896] [2021-06-10 11:38:23,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:23,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:23,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851797709] [2021-06-10 11:38:23,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:23,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:23,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:23,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 628 transitions, 1538 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:23,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:23,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:23,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:24,072 INFO L129 PetriNetUnfolder]: 33/742 cut-off events. [2021-06-10 11:38:24,072 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:38:24,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 742 events. 33/742 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3164 event pairs, 0 based on Foata normal form. 2/686 useless extension candidates. Maximal degree in co-relation 911. Up to 26 conditions per place. [2021-06-10 11:38:24,093 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 9 selfloop transitions, 1 changer transitions 0/626 dead transitions. [2021-06-10 11:38:24,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 626 transitions, 1546 flow [2021-06-10 11:38:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2021-06-10 11:38:24,094 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9181692094313454 [2021-06-10 11:38:24,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2021-06-10 11:38:24,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2021-06-10 11:38:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:24,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2021-06-10 11:38:24,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,096 INFO L185 Difference]: Start difference. First operand has 701 places, 628 transitions, 1538 flow. Second operand 3 states and 1986 transitions. [2021-06-10 11:38:24,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 626 transitions, 1546 flow [2021-06-10 11:38:24,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 626 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:24,101 INFO L241 Difference]: Finished difference. Result has 702 places, 626 transitions, 1527 flow [2021-06-10 11:38:24,101 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=702, PETRI_TRANSITIONS=626} [2021-06-10 11:38:24,101 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 31 predicate places. [2021-06-10 11:38:24,101 INFO L480 AbstractCegarLoop]: Abstraction has has 702 places, 626 transitions, 1527 flow [2021-06-10 11:38:24,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:24,102 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:24,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2021-06-10 11:38:24,102 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2029543371, now seen corresponding path program 1 times [2021-06-10 11:38:24,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:24,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338767780] [2021-06-10 11:38:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:24,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:24,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:24,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338767780] [2021-06-10 11:38:24,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:24,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:24,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935349122] [2021-06-10 11:38:24,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:24,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:24,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:24,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 626 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:24,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:24,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:24,310 INFO L129 PetriNetUnfolder]: 33/739 cut-off events. [2021-06-10 11:38:24,310 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:24,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 739 events. 33/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3139 event pairs, 0 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 905. Up to 26 conditions per place. [2021-06-10 11:38:24,342 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/623 dead transitions. [2021-06-10 11:38:24,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 623 transitions, 1528 flow [2021-06-10 11:38:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:24,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:24,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:24,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:24,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:24,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:24,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,346 INFO L185 Difference]: Start difference. First operand has 702 places, 626 transitions, 1527 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:24,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 623 transitions, 1528 flow [2021-06-10 11:38:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 623 transitions, 1523 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:24,351 INFO L241 Difference]: Finished difference. Result has 699 places, 623 transitions, 1513 flow [2021-06-10 11:38:24,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=699, PETRI_TRANSITIONS=623} [2021-06-10 11:38:24,352 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 28 predicate places. [2021-06-10 11:38:24,352 INFO L480 AbstractCegarLoop]: Abstraction has has 699 places, 623 transitions, 1513 flow [2021-06-10 11:38:24,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,352 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:24,352 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:24,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2021-06-10 11:38:24,352 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 679540867, now seen corresponding path program 1 times [2021-06-10 11:38:24,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:24,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901063826] [2021-06-10 11:38:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:24,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:24,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:24,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901063826] [2021-06-10 11:38:24,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:24,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:24,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977479813] [2021-06-10 11:38:24,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:24,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:24,369 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:24,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 623 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:24,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:24,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:24,572 INFO L129 PetriNetUnfolder]: 32/747 cut-off events. [2021-06-10 11:38:24,572 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:24,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 747 events. 32/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3210 event pairs, 0 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 922. Up to 26 conditions per place. [2021-06-10 11:38:24,606 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/625 dead transitions. [2021-06-10 11:38:24,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 625 transitions, 1543 flow [2021-06-10 11:38:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:24,607 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:24,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:24,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:24,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:24,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:24,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,609 INFO L185 Difference]: Start difference. First operand has 699 places, 623 transitions, 1513 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:24,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 625 transitions, 1543 flow [2021-06-10 11:38:24,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 625 transitions, 1542 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:24,615 INFO L241 Difference]: Finished difference. Result has 702 places, 625 transitions, 1536 flow [2021-06-10 11:38:24,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=702, PETRI_TRANSITIONS=625} [2021-06-10 11:38:24,615 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 31 predicate places. [2021-06-10 11:38:24,615 INFO L480 AbstractCegarLoop]: Abstraction has has 702 places, 625 transitions, 1536 flow [2021-06-10 11:38:24,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:24,615 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:24,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2021-06-10 11:38:24,616 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 679541890, now seen corresponding path program 1 times [2021-06-10 11:38:24,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:24,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989451491] [2021-06-10 11:38:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:24,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:24,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:24,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989451491] [2021-06-10 11:38:24,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:24,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:24,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532073914] [2021-06-10 11:38:24,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:24,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:24,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:24,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 625 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:24,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:24,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:24,831 INFO L129 PetriNetUnfolder]: 31/745 cut-off events. [2021-06-10 11:38:24,831 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:24,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 745 events. 31/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3196 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 917. Up to 26 conditions per place. [2021-06-10 11:38:24,864 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2021-06-10 11:38:24,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 625 transitions, 1548 flow [2021-06-10 11:38:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:24,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:24,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:24,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:24,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:24,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:24,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,867 INFO L185 Difference]: Start difference. First operand has 702 places, 625 transitions, 1536 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:24,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 625 transitions, 1548 flow [2021-06-10 11:38:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 625 transitions, 1543 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:24,874 INFO L241 Difference]: Finished difference. Result has 705 places, 625 transitions, 1541 flow [2021-06-10 11:38:24,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=705, PETRI_TRANSITIONS=625} [2021-06-10 11:38:24,874 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 34 predicate places. [2021-06-10 11:38:24,874 INFO L480 AbstractCegarLoop]: Abstraction has has 705 places, 625 transitions, 1541 flow [2021-06-10 11:38:24,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:24,874 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:24,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2021-06-10 11:38:24,874 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:24,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:24,875 INFO L82 PathProgramCache]: Analyzing trace with hash 680494179, now seen corresponding path program 1 times [2021-06-10 11:38:24,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:24,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765521297] [2021-06-10 11:38:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:24,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:24,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:24,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:24,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765521297] [2021-06-10 11:38:24,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:24,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:24,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649235396] [2021-06-10 11:38:24,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:24,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:24,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:24,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:24,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 625 transitions, 1541 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:24,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:24,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:24,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:25,087 INFO L129 PetriNetUnfolder]: 30/741 cut-off events. [2021-06-10 11:38:25,088 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:25,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 741 events. 30/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3170 event pairs, 0 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 914. Up to 26 conditions per place. [2021-06-10 11:38:25,120 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2021-06-10 11:38:25,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 622 transitions, 1538 flow [2021-06-10 11:38:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:25,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:25,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:25,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:25,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:25,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:25,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,124 INFO L185 Difference]: Start difference. First operand has 705 places, 625 transitions, 1541 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:25,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 622 transitions, 1538 flow [2021-06-10 11:38:25,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 622 transitions, 1531 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:25,130 INFO L241 Difference]: Finished difference. Result has 704 places, 622 transitions, 1521 flow [2021-06-10 11:38:25,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=704, PETRI_TRANSITIONS=622} [2021-06-10 11:38:25,130 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 33 predicate places. [2021-06-10 11:38:25,130 INFO L480 AbstractCegarLoop]: Abstraction has has 704 places, 622 transitions, 1521 flow [2021-06-10 11:38:25,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:25,130 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:25,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2021-06-10 11:38:25,130 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 680495202, now seen corresponding path program 1 times [2021-06-10 11:38:25,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:25,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741252123] [2021-06-10 11:38:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:25,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:25,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:25,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741252123] [2021-06-10 11:38:25,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:25,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:25,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256201675] [2021-06-10 11:38:25,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:25,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:25,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:25,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 622 transitions, 1521 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:25,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:25,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:25,347 INFO L129 PetriNetUnfolder]: 30/739 cut-off events. [2021-06-10 11:38:25,348 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:25,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 739 events. 30/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3154 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 915. Up to 26 conditions per place. [2021-06-10 11:38:25,380 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/620 dead transitions. [2021-06-10 11:38:25,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 620 transitions, 1534 flow [2021-06-10 11:38:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:25,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:25,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:25,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:25,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:25,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:25,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,383 INFO L185 Difference]: Start difference. First operand has 704 places, 622 transitions, 1521 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:25,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 620 transitions, 1534 flow [2021-06-10 11:38:25,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 620 transitions, 1533 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:25,389 INFO L241 Difference]: Finished difference. Result has 703 places, 620 transitions, 1517 flow [2021-06-10 11:38:25,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=703, PETRI_TRANSITIONS=620} [2021-06-10 11:38:25,389 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 32 predicate places. [2021-06-10 11:38:25,389 INFO L480 AbstractCegarLoop]: Abstraction has has 703 places, 620 transitions, 1517 flow [2021-06-10 11:38:25,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:25,389 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:25,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2021-06-10 11:38:25,390 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash -458375791, now seen corresponding path program 1 times [2021-06-10 11:38:25,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:25,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87473884] [2021-06-10 11:38:25,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:25,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:25,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:25,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87473884] [2021-06-10 11:38:25,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:25,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:25,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118392367] [2021-06-10 11:38:25,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:25,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:25,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:25,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 620 transitions, 1517 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:25,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:25,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:25,613 INFO L129 PetriNetUnfolder]: 29/747 cut-off events. [2021-06-10 11:38:25,613 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:25,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 747 events. 29/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3226 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 927. Up to 26 conditions per place. [2021-06-10 11:38:25,673 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2021-06-10 11:38:25,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 622 transitions, 1547 flow [2021-06-10 11:38:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:25,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:25,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:25,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:25,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:25,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:25,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,676 INFO L185 Difference]: Start difference. First operand has 703 places, 620 transitions, 1517 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:25,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 622 transitions, 1547 flow [2021-06-10 11:38:25,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 622 transitions, 1546 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:25,682 INFO L241 Difference]: Finished difference. Result has 706 places, 622 transitions, 1540 flow [2021-06-10 11:38:25,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1540, PETRI_PLACES=706, PETRI_TRANSITIONS=622} [2021-06-10 11:38:25,682 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 35 predicate places. [2021-06-10 11:38:25,682 INFO L480 AbstractCegarLoop]: Abstraction has has 706 places, 622 transitions, 1540 flow [2021-06-10 11:38:25,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:25,682 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:25,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2021-06-10 11:38:25,683 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash -458376814, now seen corresponding path program 1 times [2021-06-10 11:38:25,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:25,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133360189] [2021-06-10 11:38:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:25,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:25,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:25,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133360189] [2021-06-10 11:38:25,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:25,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:25,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607049413] [2021-06-10 11:38:25,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:25,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:25,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:25,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 622 transitions, 1540 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:25,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:25,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:25,898 INFO L129 PetriNetUnfolder]: 27/748 cut-off events. [2021-06-10 11:38:25,898 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:25,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 748 events. 27/748 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3252 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 927. Up to 26 conditions per place. [2021-06-10 11:38:25,931 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/622 dead transitions. [2021-06-10 11:38:25,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 622 transitions, 1552 flow [2021-06-10 11:38:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:25,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:25,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:25,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:25,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:25,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:25,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,934 INFO L185 Difference]: Start difference. First operand has 706 places, 622 transitions, 1540 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:25,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 622 transitions, 1552 flow [2021-06-10 11:38:25,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 622 transitions, 1547 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:25,940 INFO L241 Difference]: Finished difference. Result has 708 places, 621 transitions, 1536 flow [2021-06-10 11:38:25,940 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=708, PETRI_TRANSITIONS=621} [2021-06-10 11:38:25,940 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 37 predicate places. [2021-06-10 11:38:25,940 INFO L480 AbstractCegarLoop]: Abstraction has has 708 places, 621 transitions, 1536 flow [2021-06-10 11:38:25,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,941 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:25,941 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:25,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2021-06-10 11:38:25,941 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash -459329103, now seen corresponding path program 1 times [2021-06-10 11:38:25,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:25,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266018455] [2021-06-10 11:38:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:25,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:25,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:25,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:25,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266018455] [2021-06-10 11:38:25,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:25,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:25,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275794800] [2021-06-10 11:38:25,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:25,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:25,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:25,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 621 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:25,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:25,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:25,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:26,153 INFO L129 PetriNetUnfolder]: 27/741 cut-off events. [2021-06-10 11:38:26,153 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:26,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 741 events. 27/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3193 event pairs, 0 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 921. Up to 26 conditions per place. [2021-06-10 11:38:26,185 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/619 dead transitions. [2021-06-10 11:38:26,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 619 transitions, 1539 flow [2021-06-10 11:38:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:26,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:26,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:26,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:26,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:26,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:26,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,188 INFO L185 Difference]: Start difference. First operand has 708 places, 621 transitions, 1536 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:26,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 619 transitions, 1539 flow [2021-06-10 11:38:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 619 transitions, 1532 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:26,194 INFO L241 Difference]: Finished difference. Result has 708 places, 619 transitions, 1525 flow [2021-06-10 11:38:26,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=708, PETRI_TRANSITIONS=619} [2021-06-10 11:38:26,194 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 37 predicate places. [2021-06-10 11:38:26,194 INFO L480 AbstractCegarLoop]: Abstraction has has 708 places, 619 transitions, 1525 flow [2021-06-10 11:38:26,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,194 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:26,195 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:26,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2021-06-10 11:38:26,195 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -459330126, now seen corresponding path program 1 times [2021-06-10 11:38:26,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:26,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302579478] [2021-06-10 11:38:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:26,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:26,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:26,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302579478] [2021-06-10 11:38:26,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:26,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:26,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822414404] [2021-06-10 11:38:26,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:26,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:26,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:26,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:26,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:26,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 619 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:26,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:26,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:26,412 INFO L129 PetriNetUnfolder]: 27/739 cut-off events. [2021-06-10 11:38:26,412 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:26,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 739 events. 27/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3178 event pairs, 0 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 921. Up to 26 conditions per place. [2021-06-10 11:38:26,444 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2021-06-10 11:38:26,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 617 transitions, 1538 flow [2021-06-10 11:38:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:26,445 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:26,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:26,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:26,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:26,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:26,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,447 INFO L185 Difference]: Start difference. First operand has 708 places, 619 transitions, 1525 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:26,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 617 transitions, 1538 flow [2021-06-10 11:38:26,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 617 transitions, 1537 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:26,453 INFO L241 Difference]: Finished difference. Result has 707 places, 617 transitions, 1521 flow [2021-06-10 11:38:26,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=707, PETRI_TRANSITIONS=617} [2021-06-10 11:38:26,453 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 36 predicate places. [2021-06-10 11:38:26,453 INFO L480 AbstractCegarLoop]: Abstraction has has 707 places, 617 transitions, 1521 flow [2021-06-10 11:38:26,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:26,453 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:26,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2021-06-10 11:38:26,454 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -963208350, now seen corresponding path program 1 times [2021-06-10 11:38:26,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:26,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967192570] [2021-06-10 11:38:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:26,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:26,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:26,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967192570] [2021-06-10 11:38:26,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:26,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:26,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222217020] [2021-06-10 11:38:26,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:26,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:26,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:26,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 617 transitions, 1521 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:26,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:26,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:26,681 INFO L129 PetriNetUnfolder]: 26/747 cut-off events. [2021-06-10 11:38:26,681 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:26,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 747 events. 26/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3246 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 933. Up to 26 conditions per place. [2021-06-10 11:38:26,715 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/619 dead transitions. [2021-06-10 11:38:26,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 619 transitions, 1551 flow [2021-06-10 11:38:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:26,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:26,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:26,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:26,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:26,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:26,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,718 INFO L185 Difference]: Start difference. First operand has 707 places, 617 transitions, 1521 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:26,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 619 transitions, 1551 flow [2021-06-10 11:38:26,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 619 transitions, 1550 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:26,724 INFO L241 Difference]: Finished difference. Result has 710 places, 619 transitions, 1544 flow [2021-06-10 11:38:26,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1544, PETRI_PLACES=710, PETRI_TRANSITIONS=619} [2021-06-10 11:38:26,724 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 39 predicate places. [2021-06-10 11:38:26,724 INFO L480 AbstractCegarLoop]: Abstraction has has 710 places, 619 transitions, 1544 flow [2021-06-10 11:38:26,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:26,724 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:26,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2021-06-10 11:38:26,725 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -963207327, now seen corresponding path program 1 times [2021-06-10 11:38:26,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:26,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222230906] [2021-06-10 11:38:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:26,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:26,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:26,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:26,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222230906] [2021-06-10 11:38:26,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:26,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:26,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185786665] [2021-06-10 11:38:26,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:26,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:26,742 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:26,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 619 transitions, 1544 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:26,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:26,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:26,943 INFO L129 PetriNetUnfolder]: 25/745 cut-off events. [2021-06-10 11:38:26,943 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:26,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 745 events. 25/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3233 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 930. Up to 26 conditions per place. [2021-06-10 11:38:26,976 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/619 dead transitions. [2021-06-10 11:38:26,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 619 transitions, 1556 flow [2021-06-10 11:38:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:26,977 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:26,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:26,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:26,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:26,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:26,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,979 INFO L185 Difference]: Start difference. First operand has 710 places, 619 transitions, 1544 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:26,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 619 transitions, 1556 flow [2021-06-10 11:38:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 619 transitions, 1551 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:26,985 INFO L241 Difference]: Finished difference. Result has 713 places, 619 transitions, 1549 flow [2021-06-10 11:38:26,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=713, PETRI_TRANSITIONS=619} [2021-06-10 11:38:26,985 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 42 predicate places. [2021-06-10 11:38:26,985 INFO L480 AbstractCegarLoop]: Abstraction has has 713 places, 619 transitions, 1549 flow [2021-06-10 11:38:26,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:26,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:26,986 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:26,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2021-06-10 11:38:26,986 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -962255038, now seen corresponding path program 1 times [2021-06-10 11:38:26,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:26,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663295767] [2021-06-10 11:38:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:27,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:27,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:27,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663295767] [2021-06-10 11:38:27,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:27,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:27,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758394852] [2021-06-10 11:38:27,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:27,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:27,004 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:27,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 619 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:27,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:27,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:27,202 INFO L129 PetriNetUnfolder]: 24/741 cut-off events. [2021-06-10 11:38:27,202 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:27,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 741 events. 24/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3209 event pairs, 0 based on Foata normal form. 1/694 useless extension candidates. Maximal degree in co-relation 927. Up to 26 conditions per place. [2021-06-10 11:38:27,259 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2021-06-10 11:38:27,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 616 transitions, 1546 flow [2021-06-10 11:38:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:27,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:27,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:27,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:27,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:27,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:27,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,262 INFO L185 Difference]: Start difference. First operand has 713 places, 619 transitions, 1549 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:27,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 616 transitions, 1546 flow [2021-06-10 11:38:27,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 616 transitions, 1539 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:27,268 INFO L241 Difference]: Finished difference. Result has 712 places, 616 transitions, 1529 flow [2021-06-10 11:38:27,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=712, PETRI_TRANSITIONS=616} [2021-06-10 11:38:27,268 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 41 predicate places. [2021-06-10 11:38:27,268 INFO L480 AbstractCegarLoop]: Abstraction has has 712 places, 616 transitions, 1529 flow [2021-06-10 11:38:27,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:27,268 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:27,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2021-06-10 11:38:27,269 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash -962254015, now seen corresponding path program 1 times [2021-06-10 11:38:27,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:27,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102515435] [2021-06-10 11:38:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:27,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:27,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:27,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102515435] [2021-06-10 11:38:27,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:27,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:27,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503005764] [2021-06-10 11:38:27,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:27,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:27,287 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:27,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 616 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:27,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:27,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:27,489 INFO L129 PetriNetUnfolder]: 24/739 cut-off events. [2021-06-10 11:38:27,490 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:27,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 739 events. 24/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3196 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 928. Up to 26 conditions per place. [2021-06-10 11:38:27,523 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/614 dead transitions. [2021-06-10 11:38:27,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 614 transitions, 1542 flow [2021-06-10 11:38:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:27,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:27,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:27,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:27,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:27,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:27,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,526 INFO L185 Difference]: Start difference. First operand has 712 places, 616 transitions, 1529 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:27,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 614 transitions, 1542 flow [2021-06-10 11:38:27,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 614 transitions, 1541 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:27,532 INFO L241 Difference]: Finished difference. Result has 711 places, 614 transitions, 1525 flow [2021-06-10 11:38:27,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=711, PETRI_TRANSITIONS=614} [2021-06-10 11:38:27,532 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 40 predicate places. [2021-06-10 11:38:27,532 INFO L480 AbstractCegarLoop]: Abstraction has has 711 places, 614 transitions, 1525 flow [2021-06-10 11:38:27,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,533 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:27,533 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:27,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2021-06-10 11:38:27,533 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:27,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1251993102, now seen corresponding path program 1 times [2021-06-10 11:38:27,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:27,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979564345] [2021-06-10 11:38:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:27,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:27,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:27,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979564345] [2021-06-10 11:38:27,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:27,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:27,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753143915] [2021-06-10 11:38:27,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:27,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:27,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:27,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 614 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:27,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:27,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:27,764 INFO L129 PetriNetUnfolder]: 23/747 cut-off events. [2021-06-10 11:38:27,764 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:27,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 747 events. 23/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3262 event pairs, 0 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 940. Up to 26 conditions per place. [2021-06-10 11:38:27,797 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/616 dead transitions. [2021-06-10 11:38:27,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 616 transitions, 1555 flow [2021-06-10 11:38:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:27,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:27,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:27,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:27,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:27,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:27,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,800 INFO L185 Difference]: Start difference. First operand has 711 places, 614 transitions, 1525 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:27,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 616 transitions, 1555 flow [2021-06-10 11:38:27,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 616 transitions, 1554 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:27,806 INFO L241 Difference]: Finished difference. Result has 714 places, 616 transitions, 1548 flow [2021-06-10 11:38:27,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=714, PETRI_TRANSITIONS=616} [2021-06-10 11:38:27,807 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 43 predicate places. [2021-06-10 11:38:27,807 INFO L480 AbstractCegarLoop]: Abstraction has has 714 places, 616 transitions, 1548 flow [2021-06-10 11:38:27,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:27,807 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:27,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2021-06-10 11:38:27,807 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1251994125, now seen corresponding path program 1 times [2021-06-10 11:38:27,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:27,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236890084] [2021-06-10 11:38:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:27,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:27,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:27,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:27,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236890084] [2021-06-10 11:38:27,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:27,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:27,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562678283] [2021-06-10 11:38:27,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:27,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:27,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:27,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 616 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:27,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:27,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:27,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:28,029 INFO L129 PetriNetUnfolder]: 21/748 cut-off events. [2021-06-10 11:38:28,029 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:28,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 748 events. 21/748 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3289 event pairs, 0 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 940. Up to 26 conditions per place. [2021-06-10 11:38:28,061 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2021-06-10 11:38:28,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 616 transitions, 1560 flow [2021-06-10 11:38:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:28,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:28,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:28,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:28,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:28,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:28,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,064 INFO L185 Difference]: Start difference. First operand has 714 places, 616 transitions, 1548 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:28,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 616 transitions, 1560 flow [2021-06-10 11:38:28,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 616 transitions, 1555 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:28,070 INFO L241 Difference]: Finished difference. Result has 716 places, 615 transitions, 1544 flow [2021-06-10 11:38:28,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1544, PETRI_PLACES=716, PETRI_TRANSITIONS=615} [2021-06-10 11:38:28,070 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 45 predicate places. [2021-06-10 11:38:28,070 INFO L480 AbstractCegarLoop]: Abstraction has has 716 places, 615 transitions, 1544 flow [2021-06-10 11:38:28,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:28,071 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:28,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2021-06-10 11:38:28,071 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:28,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1252946414, now seen corresponding path program 1 times [2021-06-10 11:38:28,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:28,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082417939] [2021-06-10 11:38:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:28,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:28,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:28,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082417939] [2021-06-10 11:38:28,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:28,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:28,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292225571] [2021-06-10 11:38:28,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:28,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:28,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:28,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:28,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 615 transitions, 1544 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:28,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:28,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:28,286 INFO L129 PetriNetUnfolder]: 21/741 cut-off events. [2021-06-10 11:38:28,287 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:28,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 741 events. 21/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3226 event pairs, 0 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 934. Up to 26 conditions per place. [2021-06-10 11:38:28,318 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2021-06-10 11:38:28,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 613 transitions, 1547 flow [2021-06-10 11:38:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:28,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:28,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:28,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:28,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:28,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:28,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,321 INFO L185 Difference]: Start difference. First operand has 716 places, 615 transitions, 1544 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:28,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 613 transitions, 1547 flow [2021-06-10 11:38:28,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 613 transitions, 1540 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:28,327 INFO L241 Difference]: Finished difference. Result has 716 places, 613 transitions, 1533 flow [2021-06-10 11:38:28,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=716, PETRI_TRANSITIONS=613} [2021-06-10 11:38:28,327 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 45 predicate places. [2021-06-10 11:38:28,328 INFO L480 AbstractCegarLoop]: Abstraction has has 716 places, 613 transitions, 1533 flow [2021-06-10 11:38:28,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:28,328 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:28,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2021-06-10 11:38:28,328 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1252947437, now seen corresponding path program 1 times [2021-06-10 11:38:28,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:28,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023264688] [2021-06-10 11:38:28,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:28,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:28,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:28,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023264688] [2021-06-10 11:38:28,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:28,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:28,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108340595] [2021-06-10 11:38:28,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:28,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:28,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:28,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:28,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 613 transitions, 1533 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:28,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:28,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:28,558 INFO L129 PetriNetUnfolder]: 21/739 cut-off events. [2021-06-10 11:38:28,558 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:28,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 739 events. 21/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3208 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 934. Up to 26 conditions per place. [2021-06-10 11:38:28,589 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2021-06-10 11:38:28,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 611 transitions, 1546 flow [2021-06-10 11:38:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:28,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:28,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:28,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:28,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:28,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:28,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,593 INFO L185 Difference]: Start difference. First operand has 716 places, 613 transitions, 1533 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:28,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 611 transitions, 1546 flow [2021-06-10 11:38:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 611 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:28,599 INFO L241 Difference]: Finished difference. Result has 715 places, 611 transitions, 1529 flow [2021-06-10 11:38:28,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=715, PETRI_TRANSITIONS=611} [2021-06-10 11:38:28,599 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 44 predicate places. [2021-06-10 11:38:28,599 INFO L480 AbstractCegarLoop]: Abstraction has has 715 places, 611 transitions, 1529 flow [2021-06-10 11:38:28,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:28,599 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:28,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2021-06-10 11:38:28,599 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1869305052, now seen corresponding path program 1 times [2021-06-10 11:38:28,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:28,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032117053] [2021-06-10 11:38:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:28,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:28,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:28,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032117053] [2021-06-10 11:38:28,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:28,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:28,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520826678] [2021-06-10 11:38:28,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:28,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:28,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:28,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 611 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:28,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:28,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:28,853 INFO L129 PetriNetUnfolder]: 20/747 cut-off events. [2021-06-10 11:38:28,853 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:28,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 747 events. 20/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3282 event pairs, 0 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 946. Up to 26 conditions per place. [2021-06-10 11:38:28,874 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/613 dead transitions. [2021-06-10 11:38:28,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 613 transitions, 1559 flow [2021-06-10 11:38:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:28,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:28,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:28,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:28,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:28,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:28,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,877 INFO L185 Difference]: Start difference. First operand has 715 places, 611 transitions, 1529 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:28,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 613 transitions, 1559 flow [2021-06-10 11:38:28,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 613 transitions, 1558 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:28,882 INFO L241 Difference]: Finished difference. Result has 718 places, 613 transitions, 1552 flow [2021-06-10 11:38:28,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1552, PETRI_PLACES=718, PETRI_TRANSITIONS=613} [2021-06-10 11:38:28,882 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 47 predicate places. [2021-06-10 11:38:28,882 INFO L480 AbstractCegarLoop]: Abstraction has has 718 places, 613 transitions, 1552 flow [2021-06-10 11:38:28,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:28,883 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:28,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2021-06-10 11:38:28,883 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1869306075, now seen corresponding path program 1 times [2021-06-10 11:38:28,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:28,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379564374] [2021-06-10 11:38:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:28,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:28,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:28,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:28,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379564374] [2021-06-10 11:38:28,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:28,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:28,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040119704] [2021-06-10 11:38:28,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:28,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:28,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:28,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 613 transitions, 1552 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:28,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:28,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:28,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:29,104 INFO L129 PetriNetUnfolder]: 18/748 cut-off events. [2021-06-10 11:38:29,104 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:29,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 748 events. 18/748 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3304 event pairs, 0 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 946. Up to 26 conditions per place. [2021-06-10 11:38:29,136 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/613 dead transitions. [2021-06-10 11:38:29,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 613 transitions, 1564 flow [2021-06-10 11:38:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:29,137 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:29,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:29,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,139 INFO L185 Difference]: Start difference. First operand has 718 places, 613 transitions, 1552 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:29,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 613 transitions, 1564 flow [2021-06-10 11:38:29,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 613 transitions, 1559 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:29,145 INFO L241 Difference]: Finished difference. Result has 720 places, 612 transitions, 1548 flow [2021-06-10 11:38:29,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=720, PETRI_TRANSITIONS=612} [2021-06-10 11:38:29,146 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 49 predicate places. [2021-06-10 11:38:29,146 INFO L480 AbstractCegarLoop]: Abstraction has has 720 places, 612 transitions, 1548 flow [2021-06-10 11:38:29,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:29,146 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:29,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2021-06-10 11:38:29,146 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1870258364, now seen corresponding path program 1 times [2021-06-10 11:38:29,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:29,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750456585] [2021-06-10 11:38:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:29,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:29,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:29,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750456585] [2021-06-10 11:38:29,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:29,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:29,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194877190] [2021-06-10 11:38:29,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:29,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:29,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:29,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 612 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:29,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:29,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:29,367 INFO L129 PetriNetUnfolder]: 18/741 cut-off events. [2021-06-10 11:38:29,367 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:29,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 741 events. 18/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3243 event pairs, 0 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 940. Up to 26 conditions per place. [2021-06-10 11:38:29,398 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2021-06-10 11:38:29,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 610 transitions, 1551 flow [2021-06-10 11:38:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:29,399 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:29,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:29,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:29,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:29,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:29,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,401 INFO L185 Difference]: Start difference. First operand has 720 places, 612 transitions, 1548 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 610 transitions, 1551 flow [2021-06-10 11:38:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 610 transitions, 1544 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:29,407 INFO L241 Difference]: Finished difference. Result has 720 places, 610 transitions, 1537 flow [2021-06-10 11:38:29,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=720, PETRI_TRANSITIONS=610} [2021-06-10 11:38:29,408 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 49 predicate places. [2021-06-10 11:38:29,408 INFO L480 AbstractCegarLoop]: Abstraction has has 720 places, 610 transitions, 1537 flow [2021-06-10 11:38:29,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:29,408 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:29,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2021-06-10 11:38:29,408 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1870259387, now seen corresponding path program 1 times [2021-06-10 11:38:29,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:29,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397822904] [2021-06-10 11:38:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:29,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:29,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:29,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397822904] [2021-06-10 11:38:29,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:29,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:29,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678044960] [2021-06-10 11:38:29,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:29,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:29,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:29,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 610 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:29,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:29,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:29,639 INFO L129 PetriNetUnfolder]: 18/739 cut-off events. [2021-06-10 11:38:29,639 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:29,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 739 events. 18/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3229 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 940. Up to 26 conditions per place. [2021-06-10 11:38:29,671 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2021-06-10 11:38:29,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 608 transitions, 1550 flow [2021-06-10 11:38:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:29,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:29,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:29,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:29,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:29,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:29,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,674 INFO L185 Difference]: Start difference. First operand has 720 places, 610 transitions, 1537 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:29,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 608 transitions, 1550 flow [2021-06-10 11:38:29,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 608 transitions, 1549 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:29,680 INFO L241 Difference]: Finished difference. Result has 719 places, 608 transitions, 1533 flow [2021-06-10 11:38:29,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=719, PETRI_TRANSITIONS=608} [2021-06-10 11:38:29,680 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 48 predicate places. [2021-06-10 11:38:29,680 INFO L480 AbstractCegarLoop]: Abstraction has has 719 places, 608 transitions, 1533 flow [2021-06-10 11:38:29,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:29,680 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:29,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2021-06-10 11:38:29,681 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash 165341528, now seen corresponding path program 1 times [2021-06-10 11:38:29,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:29,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485119825] [2021-06-10 11:38:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:29,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:29,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:29,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485119825] [2021-06-10 11:38:29,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:29,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:29,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482320915] [2021-06-10 11:38:29,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:29,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:29,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:29,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 608 transitions, 1533 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:29,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:29,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:29,915 INFO L129 PetriNetUnfolder]: 17/746 cut-off events. [2021-06-10 11:38:29,915 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:29,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 746 events. 17/746 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3288 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 945. Up to 26 conditions per place. [2021-06-10 11:38:29,947 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 6 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2021-06-10 11:38:29,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 609 transitions, 1549 flow [2021-06-10 11:38:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:29,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:29,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:29,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:29,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,950 INFO L185 Difference]: Start difference. First operand has 719 places, 608 transitions, 1533 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 609 transitions, 1549 flow [2021-06-10 11:38:29,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 609 transitions, 1548 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:29,956 INFO L241 Difference]: Finished difference. Result has 721 places, 608 transitions, 1537 flow [2021-06-10 11:38:29,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=721, PETRI_TRANSITIONS=608} [2021-06-10 11:38:29,956 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 50 predicate places. [2021-06-10 11:38:29,956 INFO L480 AbstractCegarLoop]: Abstraction has has 721 places, 608 transitions, 1537 flow [2021-06-10 11:38:29,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,956 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:29,956 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:29,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2021-06-10 11:38:29,956 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 165342551, now seen corresponding path program 1 times [2021-06-10 11:38:29,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:29,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494850091] [2021-06-10 11:38:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:29,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:29,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:29,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:29,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494850091] [2021-06-10 11:38:29,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:29,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:29,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689552911] [2021-06-10 11:38:29,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:29,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:29,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:29,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 608 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:29,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:29,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:29,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:30,190 INFO L129 PetriNetUnfolder]: 15/748 cut-off events. [2021-06-10 11:38:30,190 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:30,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 748 events. 15/748 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3323 event pairs, 0 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 956. Up to 26 conditions per place. [2021-06-10 11:38:30,221 INFO L132 encePairwiseOnDemand]: 717/721 looper letters, 9 selfloop transitions, 3 changer transitions 0/609 dead transitions. [2021-06-10 11:38:30,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 609 transitions, 1563 flow [2021-06-10 11:38:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2021-06-10 11:38:30,222 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9186315302820157 [2021-06-10 11:38:30,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1987 transitions. [2021-06-10 11:38:30,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1987 transitions. [2021-06-10 11:38:30,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:30,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1987 transitions. [2021-06-10 11:38:30,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.3333333333334) internal successors, (1987), 3 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,225 INFO L185 Difference]: Start difference. First operand has 721 places, 608 transitions, 1537 flow. Second operand 3 states and 1987 transitions. [2021-06-10 11:38:30,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 609 transitions, 1563 flow [2021-06-10 11:38:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 609 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:30,230 INFO L241 Difference]: Finished difference. Result has 724 places, 609 transitions, 1554 flow [2021-06-10 11:38:30,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=724, PETRI_TRANSITIONS=609} [2021-06-10 11:38:30,231 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 53 predicate places. [2021-06-10 11:38:30,231 INFO L480 AbstractCegarLoop]: Abstraction has has 724 places, 609 transitions, 1554 flow [2021-06-10 11:38:30,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:30,231 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:30,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2021-06-10 11:38:30,231 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash 164389239, now seen corresponding path program 1 times [2021-06-10 11:38:30,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:30,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382069912] [2021-06-10 11:38:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:30,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:30,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:30,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382069912] [2021-06-10 11:38:30,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:30,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:30,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705194465] [2021-06-10 11:38:30,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:30,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:30,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:30,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 609 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:30,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:30,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:30,464 INFO L129 PetriNetUnfolder]: 15/741 cut-off events. [2021-06-10 11:38:30,464 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:30,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 741 events. 15/741 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3262 event pairs, 0 based on Foata normal form. 1/703 useless extension candidates. Maximal degree in co-relation 942. Up to 26 conditions per place. [2021-06-10 11:38:30,486 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/607 dead transitions. [2021-06-10 11:38:30,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 607 transitions, 1556 flow [2021-06-10 11:38:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:30,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:30,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:30,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:30,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:30,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:30,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,489 INFO L185 Difference]: Start difference. First operand has 724 places, 609 transitions, 1554 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:30,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 607 transitions, 1556 flow [2021-06-10 11:38:30,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 607 transitions, 1548 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:30,495 INFO L241 Difference]: Finished difference. Result has 724 places, 607 transitions, 1541 flow [2021-06-10 11:38:30,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=724, PETRI_TRANSITIONS=607} [2021-06-10 11:38:30,495 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 53 predicate places. [2021-06-10 11:38:30,495 INFO L480 AbstractCegarLoop]: Abstraction has has 724 places, 607 transitions, 1541 flow [2021-06-10 11:38:30,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:30,495 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:30,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2021-06-10 11:38:30,495 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 164388216, now seen corresponding path program 1 times [2021-06-10 11:38:30,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:30,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952340055] [2021-06-10 11:38:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:30,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:30,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:30,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952340055] [2021-06-10 11:38:30,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:30,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:30,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464028973] [2021-06-10 11:38:30,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:30,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:30,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:30,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 607 transitions, 1541 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:30,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:30,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:30,717 INFO L129 PetriNetUnfolder]: 15/739 cut-off events. [2021-06-10 11:38:30,717 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:30,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 739 events. 15/739 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3248 event pairs, 0 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 946. Up to 26 conditions per place. [2021-06-10 11:38:30,747 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2021-06-10 11:38:30,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 605 transitions, 1554 flow [2021-06-10 11:38:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:30,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:30,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:30,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:30,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:30,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:30,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,750 INFO L185 Difference]: Start difference. First operand has 724 places, 607 transitions, 1541 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:30,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 605 transitions, 1554 flow [2021-06-10 11:38:30,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 605 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:30,756 INFO L241 Difference]: Finished difference. Result has 723 places, 605 transitions, 1537 flow [2021-06-10 11:38:30,756 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=723, PETRI_TRANSITIONS=605} [2021-06-10 11:38:30,756 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 52 predicate places. [2021-06-10 11:38:30,756 INFO L480 AbstractCegarLoop]: Abstraction has has 723 places, 605 transitions, 1537 flow [2021-06-10 11:38:30,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,757 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:30,757 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:30,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2021-06-10 11:38:30,757 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1058369236, now seen corresponding path program 1 times [2021-06-10 11:38:30,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:30,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485292900] [2021-06-10 11:38:30,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:30,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:30,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:30,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:30,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485292900] [2021-06-10 11:38:30,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:30,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:30,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694186491] [2021-06-10 11:38:30,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:30,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:30,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:30,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 605 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:30,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:30,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:30,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:30,983 INFO L129 PetriNetUnfolder]: 14/747 cut-off events. [2021-06-10 11:38:30,983 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:31,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 747 events. 14/747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3318 event pairs, 0 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 958. Up to 26 conditions per place. [2021-06-10 11:38:31,013 INFO L132 encePairwiseOnDemand]: 716/721 looper letters, 10 selfloop transitions, 3 changer transitions 0/607 dead transitions. [2021-06-10 11:38:31,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 607 transitions, 1567 flow [2021-06-10 11:38:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1989 transitions. [2021-06-10 11:38:31,014 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195561719833565 [2021-06-10 11:38:31,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1989 transitions. [2021-06-10 11:38:31,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1989 transitions. [2021-06-10 11:38:31,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:31,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1989 transitions. [2021-06-10 11:38:31,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 663.0) internal successors, (1989), 3 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,017 INFO L185 Difference]: Start difference. First operand has 723 places, 605 transitions, 1537 flow. Second operand 3 states and 1989 transitions. [2021-06-10 11:38:31,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 607 transitions, 1567 flow [2021-06-10 11:38:31,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 607 transitions, 1566 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:31,022 INFO L241 Difference]: Finished difference. Result has 726 places, 607 transitions, 1560 flow [2021-06-10 11:38:31,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=726, PETRI_TRANSITIONS=607} [2021-06-10 11:38:31,022 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 55 predicate places. [2021-06-10 11:38:31,022 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 607 transitions, 1560 flow [2021-06-10 11:38:31,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:31,023 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:31,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2021-06-10 11:38:31,023 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1058368213, now seen corresponding path program 1 times [2021-06-10 11:38:31,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:31,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378065776] [2021-06-10 11:38:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:31,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:31,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:31,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378065776] [2021-06-10 11:38:31,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:31,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:31,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507045216] [2021-06-10 11:38:31,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:31,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:31,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:31,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 607 transitions, 1560 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:31,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:31,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:31,243 INFO L129 PetriNetUnfolder]: 13/745 cut-off events. [2021-06-10 11:38:31,243 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:31,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 745 events. 13/745 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3306 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 955. Up to 26 conditions per place. [2021-06-10 11:38:31,275 INFO L132 encePairwiseOnDemand]: 718/721 looper letters, 5 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2021-06-10 11:38:31,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 607 transitions, 1572 flow [2021-06-10 11:38:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2021-06-10 11:38:31,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232547387887193 [2021-06-10 11:38:31,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2021-06-10 11:38:31,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2021-06-10 11:38:31,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:31,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2021-06-10 11:38:31,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,278 INFO L185 Difference]: Start difference. First operand has 726 places, 607 transitions, 1560 flow. Second operand 3 states and 1997 transitions. [2021-06-10 11:38:31,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 607 transitions, 1572 flow [2021-06-10 11:38:31,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 607 transitions, 1567 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:31,284 INFO L241 Difference]: Finished difference. Result has 729 places, 607 transitions, 1565 flow [2021-06-10 11:38:31,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=729, PETRI_TRANSITIONS=607} [2021-06-10 11:38:31,285 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 58 predicate places. [2021-06-10 11:38:31,285 INFO L480 AbstractCegarLoop]: Abstraction has has 729 places, 607 transitions, 1565 flow [2021-06-10 11:38:31,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:31,285 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:31,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2021-06-10 11:38:31,285 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1057415924, now seen corresponding path program 1 times [2021-06-10 11:38:31,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:31,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727960102] [2021-06-10 11:38:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:31,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:31,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:31,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727960102] [2021-06-10 11:38:31,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:31,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:31,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357619621] [2021-06-10 11:38:31,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:31,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:31,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 721 [2021-06-10 11:38:31,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 607 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:31,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 721 [2021-06-10 11:38:31,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:31,513 INFO L129 PetriNetUnfolder]: 12/741 cut-off events. [2021-06-10 11:38:31,513 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:31,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 741 events. 12/741 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3281 event pairs, 0 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2021-06-10 11:38:31,544 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 5 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2021-06-10 11:38:31,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 604 transitions, 1562 flow [2021-06-10 11:38:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1996 transitions. [2021-06-10 11:38:31,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922792417938049 [2021-06-10 11:38:31,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1996 transitions. [2021-06-10 11:38:31,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1996 transitions. [2021-06-10 11:38:31,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:31,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1996 transitions. [2021-06-10 11:38:31,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,547 INFO L185 Difference]: Start difference. First operand has 729 places, 607 transitions, 1565 flow. Second operand 3 states and 1996 transitions. [2021-06-10 11:38:31,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 604 transitions, 1562 flow [2021-06-10 11:38:31,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 604 transitions, 1555 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:31,553 INFO L241 Difference]: Finished difference. Result has 728 places, 604 transitions, 1545 flow [2021-06-10 11:38:31,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=728, PETRI_TRANSITIONS=604} [2021-06-10 11:38:31,553 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 57 predicate places. [2021-06-10 11:38:31,554 INFO L480 AbstractCegarLoop]: Abstraction has has 728 places, 604 transitions, 1545 flow [2021-06-10 11:38:31,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 664.3333333333334) internal successors, (1993), 3 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:31,554 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:31,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2021-06-10 11:38:31,554 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1057414901, now seen corresponding path program 1 times [2021-06-10 11:38:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:31,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049497216] [2021-06-10 11:38:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:31,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:31,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:31,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:31,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049497216] [2021-06-10 11:38:31,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:31,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:31,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903614251] [2021-06-10 11:38:31,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:31,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:31,572 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 721 [2021-06-10 11:38:31,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 604 transitions, 1545 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:31,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 721 [2021-06-10 11:38:31,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:31,778 INFO L129 PetriNetUnfolder]: 12/739 cut-off events. [2021-06-10 11:38:31,778 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:31,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 739 events. 12/739 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3266 event pairs, 0 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 953. Up to 26 conditions per place. [2021-06-10 11:38:31,809 INFO L132 encePairwiseOnDemand]: 719/721 looper letters, 8 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2021-06-10 11:38:31,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 602 transitions, 1558 flow [2021-06-10 11:38:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2021-06-10 11:38:31,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9172445677300046 [2021-06-10 11:38:31,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2021-06-10 11:38:31,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2021-06-10 11:38:31,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:31,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2021-06-10 11:38:31,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 721.0) internal successors, (2884), 4 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,812 INFO L185 Difference]: Start difference. First operand has 728 places, 604 transitions, 1545 flow. Second operand 3 states and 1984 transitions. [2021-06-10 11:38:31,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 602 transitions, 1558 flow [2021-06-10 11:38:31,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 602 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:31,818 INFO L241 Difference]: Finished difference. Result has 727 places, 602 transitions, 1541 flow [2021-06-10 11:38:31,818 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=721, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=727, PETRI_TRANSITIONS=602} [2021-06-10 11:38:31,818 INFO L343 CegarLoopForPetriNet]: 671 programPoint places, 56 predicate places. [2021-06-10 11:38:31,818 INFO L480 AbstractCegarLoop]: Abstraction has has 727 places, 602 transitions, 1541 flow [2021-06-10 11:38:31,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:31,818 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:31,818 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:31,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2021-06-10 11:38:31,819 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash -587323303, now seen corresponding path program 1 times [2021-06-10 11:38:31,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:31,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585204591] [2021-06-10 11:38:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:31,830 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:31,835 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:31,848 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:38:31,848 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:38:31,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2021-06-10 11:38:31,848 WARN L342 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:38:31,848 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,884 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,885 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,886 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,887 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,888 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,889 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,924 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,925 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,926 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,927 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,928 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,929 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,929 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,936 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,940 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,943 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,944 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,945 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,946 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,947 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,948 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,949 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,952 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,954 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,955 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,956 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,957 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,958 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,959 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of26ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of26ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:31,980 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:38:31,980 INFO L253 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-06-10 11:38:31,980 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:38:31,980 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:38:31,980 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:38:31,980 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:38:31,980 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:38:31,980 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:38:31,980 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:38:31,980 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:38:31,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 697 places, 749 transitions, 2278 flow [2021-06-10 11:38:32,219 INFO L129 PetriNetUnfolder]: 131/982 cut-off events. [2021-06-10 11:38:32,219 INFO L130 PetriNetUnfolder]: For 3250/3250 co-relation queries the response was YES. [2021-06-10 11:38:32,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 982 events. 131/982 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4152 event pairs, 0 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1336. Up to 54 conditions per place. [2021-06-10 11:38:32,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 697 places, 749 transitions, 2278 flow [2021-06-10 11:38:32,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 697 places, 749 transitions, 2278 flow [2021-06-10 11:38:32,290 INFO L129 PetriNetUnfolder]: 9/100 cut-off events. [2021-06-10 11:38:32,290 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:38:32,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:32,290 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-06-10 11:38:32,290 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1096038196, now seen corresponding path program 1 times [2021-06-10 11:38:32,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:32,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100338018] [2021-06-10 11:38:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:32,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:32,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:32,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100338018] [2021-06-10 11:38:32,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:32,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:32,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253915072] [2021-06-10 11:38:32,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:32,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:32,305 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:32,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 749 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:32,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:32,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:32,505 INFO L129 PetriNetUnfolder]: 77/776 cut-off events. [2021-06-10 11:38:32,505 INFO L130 PetriNetUnfolder]: For 3251/3251 co-relation queries the response was YES. [2021-06-10 11:38:32,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 776 events. 77/776 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3076 event pairs, 0 based on Foata normal form. 112/783 useless extension candidates. Maximal degree in co-relation 1143. Up to 27 conditions per place. [2021-06-10 11:38:32,548 INFO L132 encePairwiseOnDemand]: 716/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/693 dead transitions. [2021-06-10 11:38:32,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 693 transitions, 2192 flow [2021-06-10 11:38:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2123 transitions. [2021-06-10 11:38:32,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9448153093012907 [2021-06-10 11:38:32,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2123 transitions. [2021-06-10 11:38:32,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2123 transitions. [2021-06-10 11:38:32,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:32,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2123 transitions. [2021-06-10 11:38:32,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 707.6666666666666) internal successors, (2123), 3 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,552 INFO L185 Difference]: Start difference. First operand has 697 places, 749 transitions, 2278 flow. Second operand 3 states and 2123 transitions. [2021-06-10 11:38:32,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 693 transitions, 2192 flow [2021-06-10 11:38:32,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 693 transitions, 1542 flow, removed 325 selfloop flow, removed 0 redundant places. [2021-06-10 11:38:32,562 INFO L241 Difference]: Finished difference. Result has 670 places, 693 transitions, 1536 flow [2021-06-10 11:38:32,562 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=670, PETRI_TRANSITIONS=693} [2021-06-10 11:38:32,562 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -27 predicate places. [2021-06-10 11:38:32,562 INFO L480 AbstractCegarLoop]: Abstraction has has 670 places, 693 transitions, 1536 flow [2021-06-10 11:38:32,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:32,563 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-06-10 11:38:32,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2021-06-10 11:38:32,563 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1095083861, now seen corresponding path program 1 times [2021-06-10 11:38:32,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:32,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966934419] [2021-06-10 11:38:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:32,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:32,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:32,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966934419] [2021-06-10 11:38:32,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:32,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:32,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421974125] [2021-06-10 11:38:32,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:32,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:32,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:32,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 693 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:32,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:32,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:32,761 INFO L129 PetriNetUnfolder]: 75/774 cut-off events. [2021-06-10 11:38:32,761 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:38:32,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 774 events. 75/774 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3074 event pairs, 0 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 852. Up to 27 conditions per place. [2021-06-10 11:38:32,802 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 10 selfloop transitions, 1 changer transitions 0/691 dead transitions. [2021-06-10 11:38:32,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 691 transitions, 1546 flow [2021-06-10 11:38:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:32,804 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:32,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:32,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:32,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:32,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:32,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,806 INFO L185 Difference]: Start difference. First operand has 670 places, 693 transitions, 1536 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 691 transitions, 1546 flow [2021-06-10 11:38:32,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 691 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:32,812 INFO L241 Difference]: Finished difference. Result has 671 places, 691 transitions, 1525 flow [2021-06-10 11:38:32,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=671, PETRI_TRANSITIONS=691} [2021-06-10 11:38:32,812 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -26 predicate places. [2021-06-10 11:38:32,812 INFO L480 AbstractCegarLoop]: Abstraction has has 671 places, 691 transitions, 1525 flow [2021-06-10 11:38:32,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:32,812 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-06-10 11:38:32,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2021-06-10 11:38:32,812 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1096037173, now seen corresponding path program 1 times [2021-06-10 11:38:32,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:32,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428128736] [2021-06-10 11:38:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:32,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:32,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:32,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:32,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428128736] [2021-06-10 11:38:32,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:32,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:32,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685949005] [2021-06-10 11:38:32,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:32,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:32,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:32,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:32,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 691 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:32,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:32,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:32,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:33,019 INFO L129 PetriNetUnfolder]: 75/771 cut-off events. [2021-06-10 11:38:33,020 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-06-10 11:38:33,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 771 events. 75/771 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3051 event pairs, 0 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 846. Up to 27 conditions per place. [2021-06-10 11:38:33,059 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/691 dead transitions. [2021-06-10 11:38:33,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 691 transitions, 1537 flow [2021-06-10 11:38:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:33,060 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:33,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:33,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,062 INFO L185 Difference]: Start difference. First operand has 671 places, 691 transitions, 1525 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:33,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 691 transitions, 1537 flow [2021-06-10 11:38:33,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 691 transitions, 1534 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:33,068 INFO L241 Difference]: Finished difference. Result has 673 places, 690 transitions, 1523 flow [2021-06-10 11:38:33,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1523, PETRI_PLACES=673, PETRI_TRANSITIONS=690} [2021-06-10 11:38:33,068 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -24 predicate places. [2021-06-10 11:38:33,069 INFO L480 AbstractCegarLoop]: Abstraction has has 673 places, 690 transitions, 1523 flow [2021-06-10 11:38:33,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,069 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:33,069 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-06-10 11:38:33,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2021-06-10 11:38:33,069 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1095084884, now seen corresponding path program 1 times [2021-06-10 11:38:33,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:33,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024984447] [2021-06-10 11:38:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:33,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:33,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:33,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024984447] [2021-06-10 11:38:33,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:33,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:33,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538934743] [2021-06-10 11:38:33,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:33,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:33,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:33,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 690 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:33,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:33,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:33,264 INFO L129 PetriNetUnfolder]: 75/768 cut-off events. [2021-06-10 11:38:33,264 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:33,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 889 conditions, 768 events. 75/768 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3031 event pairs, 0 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 848. Up to 27 conditions per place. [2021-06-10 11:38:33,304 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/688 dead transitions. [2021-06-10 11:38:33,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 688 transitions, 1529 flow [2021-06-10 11:38:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:33,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:33,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:33,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:33,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:33,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:33,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,307 INFO L185 Difference]: Start difference. First operand has 673 places, 690 transitions, 1523 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:33,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 688 transitions, 1529 flow [2021-06-10 11:38:33,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 688 transitions, 1524 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:33,313 INFO L241 Difference]: Finished difference. Result has 671 places, 688 transitions, 1517 flow [2021-06-10 11:38:33,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1517, PETRI_PLACES=671, PETRI_TRANSITIONS=688} [2021-06-10 11:38:33,314 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -26 predicate places. [2021-06-10 11:38:33,314 INFO L480 AbstractCegarLoop]: Abstraction has has 671 places, 688 transitions, 1517 flow [2021-06-10 11:38:33,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:33,314 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:33,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2021-06-10 11:38:33,314 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash -464675376, now seen corresponding path program 1 times [2021-06-10 11:38:33,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:33,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645982360] [2021-06-10 11:38:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:33,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:33,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:33,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645982360] [2021-06-10 11:38:33,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:33,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:33,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460407747] [2021-06-10 11:38:33,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:33,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:33,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:33,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 688 transitions, 1517 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:33,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:33,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:33,527 INFO L129 PetriNetUnfolder]: 73/773 cut-off events. [2021-06-10 11:38:33,527 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:33,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 773 events. 73/773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3080 event pairs, 0 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 856. Up to 27 conditions per place. [2021-06-10 11:38:33,566 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2021-06-10 11:38:33,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 689 transitions, 1533 flow [2021-06-10 11:38:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:33,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:33,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:33,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:33,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,570 INFO L185 Difference]: Start difference. First operand has 671 places, 688 transitions, 1517 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:33,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 689 transitions, 1533 flow [2021-06-10 11:38:33,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 672 places, 689 transitions, 1532 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:33,575 INFO L241 Difference]: Finished difference. Result has 674 places, 689 transitions, 1530 flow [2021-06-10 11:38:33,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=674, PETRI_TRANSITIONS=689} [2021-06-10 11:38:33,576 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -23 predicate places. [2021-06-10 11:38:33,576 INFO L480 AbstractCegarLoop]: Abstraction has has 674 places, 689 transitions, 1530 flow [2021-06-10 11:38:33,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,576 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:33,576 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:33,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2021-06-10 11:38:33,576 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash -464676399, now seen corresponding path program 1 times [2021-06-10 11:38:33,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:33,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420582262] [2021-06-10 11:38:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:33,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:33,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:33,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420582262] [2021-06-10 11:38:33,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:33,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:33,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97032575] [2021-06-10 11:38:33,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:33,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:33,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:33,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:33,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 689 transitions, 1530 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:33,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:33,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:33,795 INFO L129 PetriNetUnfolder]: 73/774 cut-off events. [2021-06-10 11:38:33,795 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:33,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 774 events. 73/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3087 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 862. Up to 27 conditions per place. [2021-06-10 11:38:33,827 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/690 dead transitions. [2021-06-10 11:38:33,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 690 transitions, 1556 flow [2021-06-10 11:38:33,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:33,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:33,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:33,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:33,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:33,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:33,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,830 INFO L185 Difference]: Start difference. First operand has 674 places, 689 transitions, 1530 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 690 transitions, 1556 flow [2021-06-10 11:38:33,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 690 transitions, 1554 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:33,835 INFO L241 Difference]: Finished difference. Result has 677 places, 690 transitions, 1546 flow [2021-06-10 11:38:33,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1546, PETRI_PLACES=677, PETRI_TRANSITIONS=690} [2021-06-10 11:38:33,835 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -20 predicate places. [2021-06-10 11:38:33,835 INFO L480 AbstractCegarLoop]: Abstraction has has 677 places, 690 transitions, 1546 flow [2021-06-10 11:38:33,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:33,836 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:33,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2021-06-10 11:38:33,836 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash -463722064, now seen corresponding path program 1 times [2021-06-10 11:38:33,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:33,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644973265] [2021-06-10 11:38:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:33,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:33,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:33,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:33,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644973265] [2021-06-10 11:38:33,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:33,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:33,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173905633] [2021-06-10 11:38:33,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:33,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:33,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:33,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 690 transitions, 1546 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:33,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:33,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:33,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:34,028 INFO L129 PetriNetUnfolder]: 72/771 cut-off events. [2021-06-10 11:38:34,029 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:34,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 771 events. 72/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3069 event pairs, 0 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 861. Up to 27 conditions per place. [2021-06-10 11:38:34,066 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/688 dead transitions. [2021-06-10 11:38:34,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 688 transitions, 1554 flow [2021-06-10 11:38:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:34,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:34,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:34,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:34,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:34,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:34,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,070 INFO L185 Difference]: Start difference. First operand has 677 places, 690 transitions, 1546 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 688 transitions, 1554 flow [2021-06-10 11:38:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 688 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:34,076 INFO L241 Difference]: Finished difference. Result has 678 places, 688 transitions, 1535 flow [2021-06-10 11:38:34,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1535, PETRI_PLACES=678, PETRI_TRANSITIONS=688} [2021-06-10 11:38:34,076 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -19 predicate places. [2021-06-10 11:38:34,076 INFO L480 AbstractCegarLoop]: Abstraction has has 678 places, 688 transitions, 1535 flow [2021-06-10 11:38:34,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:34,076 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:34,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2021-06-10 11:38:34,076 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -463723087, now seen corresponding path program 1 times [2021-06-10 11:38:34,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:34,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633192740] [2021-06-10 11:38:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:34,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:34,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:34,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633192740] [2021-06-10 11:38:34,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:34,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:34,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884876826] [2021-06-10 11:38:34,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:34,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:34,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:34,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:34,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 688 transitions, 1535 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:34,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:34,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:34,284 INFO L129 PetriNetUnfolder]: 72/768 cut-off events. [2021-06-10 11:38:34,284 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:34,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 768 events. 72/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3048 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 855. Up to 27 conditions per place. [2021-06-10 11:38:34,322 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/685 dead transitions. [2021-06-10 11:38:34,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 685 transitions, 1536 flow [2021-06-10 11:38:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:34,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:34,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:34,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:34,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:34,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:34,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,326 INFO L185 Difference]: Start difference. First operand has 678 places, 688 transitions, 1535 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:34,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 685 transitions, 1536 flow [2021-06-10 11:38:34,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 685 transitions, 1531 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:34,331 INFO L241 Difference]: Finished difference. Result has 675 places, 685 transitions, 1521 flow [2021-06-10 11:38:34,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1521, PETRI_PLACES=675, PETRI_TRANSITIONS=685} [2021-06-10 11:38:34,331 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -22 predicate places. [2021-06-10 11:38:34,331 INFO L480 AbstractCegarLoop]: Abstraction has has 675 places, 685 transitions, 1521 flow [2021-06-10 11:38:34,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:34,332 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:34,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2021-06-10 11:38:34,332 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1041273165, now seen corresponding path program 1 times [2021-06-10 11:38:34,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:34,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619958360] [2021-06-10 11:38:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:34,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:34,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:34,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619958360] [2021-06-10 11:38:34,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:34,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:34,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719119291] [2021-06-10 11:38:34,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:34,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:34,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:34,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 685 transitions, 1521 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:34,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:34,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:34,528 INFO L129 PetriNetUnfolder]: 70/773 cut-off events. [2021-06-10 11:38:34,528 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:34,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 773 events. 70/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3099 event pairs, 0 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 863. Up to 27 conditions per place. [2021-06-10 11:38:34,567 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/686 dead transitions. [2021-06-10 11:38:34,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 686 transitions, 1537 flow [2021-06-10 11:38:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:34,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:34,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:34,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:34,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:34,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:34,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,570 INFO L185 Difference]: Start difference. First operand has 675 places, 685 transitions, 1521 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:34,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 686 transitions, 1537 flow [2021-06-10 11:38:34,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 686 transitions, 1536 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:34,576 INFO L241 Difference]: Finished difference. Result has 678 places, 686 transitions, 1534 flow [2021-06-10 11:38:34,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=674, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1534, PETRI_PLACES=678, PETRI_TRANSITIONS=686} [2021-06-10 11:38:34,576 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -19 predicate places. [2021-06-10 11:38:34,576 INFO L480 AbstractCegarLoop]: Abstraction has has 678 places, 686 transitions, 1534 flow [2021-06-10 11:38:34,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:34,577 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:34,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2021-06-10 11:38:34,577 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1041272142, now seen corresponding path program 1 times [2021-06-10 11:38:34,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:34,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508564673] [2021-06-10 11:38:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:34,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:34,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:34,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508564673] [2021-06-10 11:38:34,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:34,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:34,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423227222] [2021-06-10 11:38:34,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:34,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:34,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:34,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 686 transitions, 1534 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:34,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:34,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:34,780 INFO L129 PetriNetUnfolder]: 70/774 cut-off events. [2021-06-10 11:38:34,781 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:34,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 774 events. 70/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3109 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 869. Up to 27 conditions per place. [2021-06-10 11:38:34,820 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/687 dead transitions. [2021-06-10 11:38:34,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 687 transitions, 1560 flow [2021-06-10 11:38:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:34,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:34,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:34,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:34,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:34,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:34,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,823 INFO L185 Difference]: Start difference. First operand has 678 places, 686 transitions, 1534 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:34,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 687 transitions, 1560 flow [2021-06-10 11:38:34,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 687 transitions, 1558 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:34,829 INFO L241 Difference]: Finished difference. Result has 681 places, 687 transitions, 1550 flow [2021-06-10 11:38:34,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=681, PETRI_TRANSITIONS=687} [2021-06-10 11:38:34,829 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -16 predicate places. [2021-06-10 11:38:34,829 INFO L480 AbstractCegarLoop]: Abstraction has has 681 places, 687 transitions, 1550 flow [2021-06-10 11:38:34,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:34,830 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:34,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2021-06-10 11:38:34,830 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:34,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1042226477, now seen corresponding path program 1 times [2021-06-10 11:38:34,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:34,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541569043] [2021-06-10 11:38:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:34,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:34,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:34,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:34,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541569043] [2021-06-10 11:38:34,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:34,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:34,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098766737] [2021-06-10 11:38:34,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:34,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:34,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:34,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 687 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:34,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:34,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:34,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:35,035 INFO L129 PetriNetUnfolder]: 69/771 cut-off events. [2021-06-10 11:38:35,035 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:35,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 771 events. 69/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3086 event pairs, 0 based on Foata normal form. 2/678 useless extension candidates. Maximal degree in co-relation 868. Up to 27 conditions per place. [2021-06-10 11:38:35,074 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/685 dead transitions. [2021-06-10 11:38:35,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 685 transitions, 1558 flow [2021-06-10 11:38:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:35,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:35,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:35,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:35,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:35,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:35,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,078 INFO L185 Difference]: Start difference. First operand has 681 places, 687 transitions, 1550 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:35,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 685 transitions, 1558 flow [2021-06-10 11:38:35,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 685 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:35,083 INFO L241 Difference]: Finished difference. Result has 682 places, 685 transitions, 1539 flow [2021-06-10 11:38:35,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1539, PETRI_PLACES=682, PETRI_TRANSITIONS=685} [2021-06-10 11:38:35,084 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -15 predicate places. [2021-06-10 11:38:35,084 INFO L480 AbstractCegarLoop]: Abstraction has has 682 places, 685 transitions, 1539 flow [2021-06-10 11:38:35,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:35,084 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:35,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2021-06-10 11:38:35,084 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1042225454, now seen corresponding path program 1 times [2021-06-10 11:38:35,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:35,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703184545] [2021-06-10 11:38:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:35,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:35,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:35,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703184545] [2021-06-10 11:38:35,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:35,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:35,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453075481] [2021-06-10 11:38:35,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:35,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:35,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:35,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 685 transitions, 1539 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:35,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:35,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:35,303 INFO L129 PetriNetUnfolder]: 69/768 cut-off events. [2021-06-10 11:38:35,303 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:35,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 768 events. 69/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3066 event pairs, 0 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 862. Up to 27 conditions per place. [2021-06-10 11:38:35,372 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/682 dead transitions. [2021-06-10 11:38:35,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 682 transitions, 1540 flow [2021-06-10 11:38:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:35,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:35,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:35,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:35,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:35,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:35,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,375 INFO L185 Difference]: Start difference. First operand has 682 places, 685 transitions, 1539 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:35,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 682 transitions, 1540 flow [2021-06-10 11:38:35,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 682 transitions, 1535 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:35,380 INFO L241 Difference]: Finished difference. Result has 679 places, 682 transitions, 1525 flow [2021-06-10 11:38:35,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1525, PETRI_PLACES=679, PETRI_TRANSITIONS=682} [2021-06-10 11:38:35,381 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -18 predicate places. [2021-06-10 11:38:35,381 INFO L480 AbstractCegarLoop]: Abstraction has has 679 places, 682 transitions, 1525 flow [2021-06-10 11:38:35,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,381 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:35,381 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:35,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2021-06-10 11:38:35,381 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1782623412, now seen corresponding path program 1 times [2021-06-10 11:38:35,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:35,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253884419] [2021-06-10 11:38:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:35,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:35,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:35,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253884419] [2021-06-10 11:38:35,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:35,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:35,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518277079] [2021-06-10 11:38:35,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:35,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:35,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:35,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 682 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:35,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:35,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:35,589 INFO L129 PetriNetUnfolder]: 68/776 cut-off events. [2021-06-10 11:38:35,589 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:35,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 776 events. 68/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3136 event pairs, 0 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 879. Up to 27 conditions per place. [2021-06-10 11:38:35,628 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2021-06-10 11:38:35,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 684 transitions, 1555 flow [2021-06-10 11:38:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:35,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:35,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:35,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:35,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:35,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:35,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,632 INFO L185 Difference]: Start difference. First operand has 679 places, 682 transitions, 1525 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:35,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 684 transitions, 1555 flow [2021-06-10 11:38:35,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 684 transitions, 1554 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:35,638 INFO L241 Difference]: Finished difference. Result has 682 places, 684 transitions, 1548 flow [2021-06-10 11:38:35,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=682, PETRI_TRANSITIONS=684} [2021-06-10 11:38:35,638 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -15 predicate places. [2021-06-10 11:38:35,638 INFO L480 AbstractCegarLoop]: Abstraction has has 682 places, 684 transitions, 1548 flow [2021-06-10 11:38:35,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:35,638 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:35,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2021-06-10 11:38:35,638 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1782622389, now seen corresponding path program 1 times [2021-06-10 11:38:35,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:35,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052946507] [2021-06-10 11:38:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:35,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:35,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:35,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052946507] [2021-06-10 11:38:35,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:35,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:35,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981673879] [2021-06-10 11:38:35,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:35,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:35,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:35,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 684 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:35,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:35,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:35,842 INFO L129 PetriNetUnfolder]: 67/774 cut-off events. [2021-06-10 11:38:35,842 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:35,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 774 events. 67/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3127 event pairs, 0 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 874. Up to 27 conditions per place. [2021-06-10 11:38:35,880 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/684 dead transitions. [2021-06-10 11:38:35,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 684 transitions, 1560 flow [2021-06-10 11:38:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:35,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:35,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:35,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:35,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:35,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:35,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,883 INFO L185 Difference]: Start difference. First operand has 682 places, 684 transitions, 1548 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:35,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 684 transitions, 1560 flow [2021-06-10 11:38:35,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 684 transitions, 1555 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:35,889 INFO L241 Difference]: Finished difference. Result has 685 places, 684 transitions, 1553 flow [2021-06-10 11:38:35,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=685, PETRI_TRANSITIONS=684} [2021-06-10 11:38:35,889 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -12 predicate places. [2021-06-10 11:38:35,889 INFO L480 AbstractCegarLoop]: Abstraction has has 685 places, 684 transitions, 1553 flow [2021-06-10 11:38:35,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:35,890 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:35,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2021-06-10 11:38:35,890 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1781670100, now seen corresponding path program 1 times [2021-06-10 11:38:35,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:35,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051896140] [2021-06-10 11:38:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:35,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:35,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:35,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:35,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051896140] [2021-06-10 11:38:35,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:35,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:35,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430843912] [2021-06-10 11:38:35,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:35,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:35,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:35,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:35,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 684 transitions, 1553 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:35,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:35,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:35,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:36,092 INFO L129 PetriNetUnfolder]: 66/770 cut-off events. [2021-06-10 11:38:36,093 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:36,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 770 events. 66/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3096 event pairs, 0 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 871. Up to 27 conditions per place. [2021-06-10 11:38:36,131 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/681 dead transitions. [2021-06-10 11:38:36,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 681 transitions, 1550 flow [2021-06-10 11:38:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:36,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:36,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:36,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:36,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:36,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:36,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,134 INFO L185 Difference]: Start difference. First operand has 685 places, 684 transitions, 1553 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:36,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 681 transitions, 1550 flow [2021-06-10 11:38:36,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 681 transitions, 1543 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:36,140 INFO L241 Difference]: Finished difference. Result has 684 places, 681 transitions, 1533 flow [2021-06-10 11:38:36,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=684, PETRI_TRANSITIONS=681} [2021-06-10 11:38:36,140 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -13 predicate places. [2021-06-10 11:38:36,140 INFO L480 AbstractCegarLoop]: Abstraction has has 684 places, 681 transitions, 1533 flow [2021-06-10 11:38:36,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:36,141 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:36,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2021-06-10 11:38:36,141 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1781669077, now seen corresponding path program 1 times [2021-06-10 11:38:36,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:36,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640275065] [2021-06-10 11:38:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:36,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:36,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:36,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640275065] [2021-06-10 11:38:36,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:36,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:36,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632444346] [2021-06-10 11:38:36,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:36,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:36,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:36,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 681 transitions, 1533 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:36,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:36,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:36,344 INFO L129 PetriNetUnfolder]: 66/768 cut-off events. [2021-06-10 11:38:36,345 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:36,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 768 events. 66/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3084 event pairs, 0 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 872. Up to 27 conditions per place. [2021-06-10 11:38:36,383 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/679 dead transitions. [2021-06-10 11:38:36,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 679 transitions, 1546 flow [2021-06-10 11:38:36,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:36,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:36,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:36,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:36,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:36,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:36,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:36,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,387 INFO L185 Difference]: Start difference. First operand has 684 places, 681 transitions, 1533 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 679 transitions, 1546 flow [2021-06-10 11:38:36,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 679 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:36,406 INFO L241 Difference]: Finished difference. Result has 683 places, 679 transitions, 1529 flow [2021-06-10 11:38:36,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=683, PETRI_TRANSITIONS=679} [2021-06-10 11:38:36,407 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -14 predicate places. [2021-06-10 11:38:36,407 INFO L480 AbstractCegarLoop]: Abstraction has has 683 places, 679 transitions, 1529 flow [2021-06-10 11:38:36,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:36,407 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:36,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2021-06-10 11:38:36,407 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -356424374, now seen corresponding path program 1 times [2021-06-10 11:38:36,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:36,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499583584] [2021-06-10 11:38:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:36,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:36,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:36,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499583584] [2021-06-10 11:38:36,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:36,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:36,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751770201] [2021-06-10 11:38:36,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:36,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:36,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:36,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 679 transitions, 1529 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:36,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:36,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:36,617 INFO L129 PetriNetUnfolder]: 64/773 cut-off events. [2021-06-10 11:38:36,617 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:36,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 773 events. 64/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3136 event pairs, 0 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 875. Up to 27 conditions per place. [2021-06-10 11:38:36,658 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/680 dead transitions. [2021-06-10 11:38:36,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 680 transitions, 1545 flow [2021-06-10 11:38:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:36,659 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:36,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:36,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:36,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:36,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:36,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,661 INFO L185 Difference]: Start difference. First operand has 683 places, 679 transitions, 1529 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:36,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 680 transitions, 1545 flow [2021-06-10 11:38:36,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:36,667 INFO L241 Difference]: Finished difference. Result has 686 places, 680 transitions, 1542 flow [2021-06-10 11:38:36,668 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1542, PETRI_PLACES=686, PETRI_TRANSITIONS=680} [2021-06-10 11:38:36,668 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -11 predicate places. [2021-06-10 11:38:36,668 INFO L480 AbstractCegarLoop]: Abstraction has has 686 places, 680 transitions, 1542 flow [2021-06-10 11:38:36,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:36,668 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:36,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2021-06-10 11:38:36,668 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -356425397, now seen corresponding path program 1 times [2021-06-10 11:38:36,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:36,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278532094] [2021-06-10 11:38:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:36,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:36,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:36,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278532094] [2021-06-10 11:38:36,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:36,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:36,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445841817] [2021-06-10 11:38:36,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:36,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:36,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:36,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:36,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 680 transitions, 1542 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:36,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:36,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:36,881 INFO L129 PetriNetUnfolder]: 64/774 cut-off events. [2021-06-10 11:38:36,881 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:36,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 774 events. 64/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3142 event pairs, 0 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 883. Up to 27 conditions per place. [2021-06-10 11:38:36,920 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/681 dead transitions. [2021-06-10 11:38:36,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 681 transitions, 1568 flow [2021-06-10 11:38:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:36,922 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:36,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:36,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:36,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:36,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:36,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,924 INFO L185 Difference]: Start difference. First operand has 686 places, 680 transitions, 1542 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:36,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 681 transitions, 1568 flow [2021-06-10 11:38:36,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 681 transitions, 1566 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:36,930 INFO L241 Difference]: Finished difference. Result has 689 places, 681 transitions, 1558 flow [2021-06-10 11:38:36,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1558, PETRI_PLACES=689, PETRI_TRANSITIONS=681} [2021-06-10 11:38:36,930 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -8 predicate places. [2021-06-10 11:38:36,930 INFO L480 AbstractCegarLoop]: Abstraction has has 689 places, 681 transitions, 1558 flow [2021-06-10 11:38:36,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:36,930 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:36,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2021-06-10 11:38:36,930 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -355471062, now seen corresponding path program 1 times [2021-06-10 11:38:36,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:36,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783830693] [2021-06-10 11:38:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:36,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:36,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:36,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:36,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783830693] [2021-06-10 11:38:36,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:36,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:36,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785317494] [2021-06-10 11:38:36,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:36,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:36,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:36,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 681 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:36,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:36,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:36,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:37,136 INFO L129 PetriNetUnfolder]: 63/771 cut-off events. [2021-06-10 11:38:37,137 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:37,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 771 events. 63/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3124 event pairs, 0 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 882. Up to 27 conditions per place. [2021-06-10 11:38:37,170 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/679 dead transitions. [2021-06-10 11:38:37,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 679 transitions, 1566 flow [2021-06-10 11:38:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:37,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:37,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:37,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:37,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:37,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:37,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,173 INFO L185 Difference]: Start difference. First operand has 689 places, 681 transitions, 1558 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:37,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 679 transitions, 1566 flow [2021-06-10 11:38:37,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 679 transitions, 1565 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:37,179 INFO L241 Difference]: Finished difference. Result has 690 places, 679 transitions, 1547 flow [2021-06-10 11:38:37,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1547, PETRI_PLACES=690, PETRI_TRANSITIONS=679} [2021-06-10 11:38:37,179 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -7 predicate places. [2021-06-10 11:38:37,179 INFO L480 AbstractCegarLoop]: Abstraction has has 690 places, 679 transitions, 1547 flow [2021-06-10 11:38:37,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:37,179 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:37,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2021-06-10 11:38:37,180 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -355472085, now seen corresponding path program 1 times [2021-06-10 11:38:37,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:37,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126554825] [2021-06-10 11:38:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:37,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:37,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:38:37,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126554825] [2021-06-10 11:38:37,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:37,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:37,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874734763] [2021-06-10 11:38:37,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:37,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:37,196 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:37,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 679 transitions, 1547 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:37,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:37,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:37,382 INFO L129 PetriNetUnfolder]: 63/768 cut-off events. [2021-06-10 11:38:37,382 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:37,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 768 events. 63/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3102 event pairs, 0 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 876. Up to 27 conditions per place. [2021-06-10 11:38:37,420 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/676 dead transitions. [2021-06-10 11:38:37,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 676 transitions, 1548 flow [2021-06-10 11:38:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:37,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:37,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:37,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:37,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:37,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:37,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,424 INFO L185 Difference]: Start difference. First operand has 690 places, 679 transitions, 1547 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:37,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 676 transitions, 1548 flow [2021-06-10 11:38:37,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 676 transitions, 1543 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:37,430 INFO L241 Difference]: Finished difference. Result has 687 places, 676 transitions, 1533 flow [2021-06-10 11:38:37,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1533, PETRI_PLACES=687, PETRI_TRANSITIONS=676} [2021-06-10 11:38:37,430 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -10 predicate places. [2021-06-10 11:38:37,430 INFO L480 AbstractCegarLoop]: Abstraction has has 687 places, 676 transitions, 1533 flow [2021-06-10 11:38:37,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:37,430 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:37,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2021-06-10 11:38:37,431 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:37,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1672210005, now seen corresponding path program 1 times [2021-06-10 11:38:37,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:37,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729520320] [2021-06-10 11:38:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:37,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:37,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:37,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729520320] [2021-06-10 11:38:37,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:37,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:37,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509330390] [2021-06-10 11:38:37,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:37,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:37,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:37,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 676 transitions, 1533 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:37,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:37,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:37,638 INFO L129 PetriNetUnfolder]: 62/775 cut-off events. [2021-06-10 11:38:37,638 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:37,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 775 events. 62/775 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3160 event pairs, 0 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 886. Up to 27 conditions per place. [2021-06-10 11:38:37,677 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2021-06-10 11:38:37,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 677 transitions, 1549 flow [2021-06-10 11:38:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:37,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:37,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:37,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:37,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:37,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:37,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,681 INFO L185 Difference]: Start difference. First operand has 687 places, 676 transitions, 1533 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:37,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 677 transitions, 1549 flow [2021-06-10 11:38:37,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 677 transitions, 1548 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:37,687 INFO L241 Difference]: Finished difference. Result has 689 places, 676 transitions, 1537 flow [2021-06-10 11:38:37,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=689, PETRI_TRANSITIONS=676} [2021-06-10 11:38:37,687 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -8 predicate places. [2021-06-10 11:38:37,687 INFO L480 AbstractCegarLoop]: Abstraction has has 689 places, 676 transitions, 1537 flow [2021-06-10 11:38:37,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:37,688 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:37,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2021-06-10 11:38:37,688 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1672208982, now seen corresponding path program 1 times [2021-06-10 11:38:37,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:37,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746721865] [2021-06-10 11:38:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:37,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:37,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:37,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746721865] [2021-06-10 11:38:37,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:37,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:37,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644891586] [2021-06-10 11:38:37,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:37,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:37,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:37,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:37,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:37,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 676 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:37,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:37,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:37,907 INFO L129 PetriNetUnfolder]: 60/777 cut-off events. [2021-06-10 11:38:37,907 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:37,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 777 events. 60/777 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3192 event pairs, 0 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 895. Up to 27 conditions per place. [2021-06-10 11:38:37,945 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/677 dead transitions. [2021-06-10 11:38:37,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 677 transitions, 1563 flow [2021-06-10 11:38:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:37,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:37,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:37,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:37,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:37,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:37,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,949 INFO L185 Difference]: Start difference. First operand has 689 places, 676 transitions, 1537 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:37,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 677 transitions, 1563 flow [2021-06-10 11:38:37,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 677 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:37,955 INFO L241 Difference]: Finished difference. Result has 692 places, 677 transitions, 1554 flow [2021-06-10 11:38:37,955 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=692, PETRI_TRANSITIONS=677} [2021-06-10 11:38:37,955 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -5 predicate places. [2021-06-10 11:38:37,955 INFO L480 AbstractCegarLoop]: Abstraction has has 692 places, 677 transitions, 1554 flow [2021-06-10 11:38:37,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:37,955 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:37,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2021-06-10 11:38:37,955 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1673162294, now seen corresponding path program 1 times [2021-06-10 11:38:37,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:37,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596244063] [2021-06-10 11:38:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:37,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:37,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:37,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:37,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596244063] [2021-06-10 11:38:37,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:37,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:37,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375193801] [2021-06-10 11:38:37,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:37,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:37,972 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:37,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 677 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:37,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:37,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:37,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:38,162 INFO L129 PetriNetUnfolder]: 60/770 cut-off events. [2021-06-10 11:38:38,162 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:38,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 770 events. 60/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3133 event pairs, 0 based on Foata normal form. 1/686 useless extension candidates. Maximal degree in co-relation 881. Up to 27 conditions per place. [2021-06-10 11:38:38,200 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/675 dead transitions. [2021-06-10 11:38:38,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 675 transitions, 1556 flow [2021-06-10 11:38:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:38,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:38,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:38,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:38,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:38,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:38,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,203 INFO L185 Difference]: Start difference. First operand has 692 places, 677 transitions, 1554 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:38,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 675 transitions, 1556 flow [2021-06-10 11:38:38,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 675 transitions, 1548 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:38,209 INFO L241 Difference]: Finished difference. Result has 692 places, 675 transitions, 1541 flow [2021-06-10 11:38:38,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=692, PETRI_TRANSITIONS=675} [2021-06-10 11:38:38,209 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -5 predicate places. [2021-06-10 11:38:38,209 INFO L480 AbstractCegarLoop]: Abstraction has has 692 places, 675 transitions, 1541 flow [2021-06-10 11:38:38,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:38,210 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:38,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2021-06-10 11:38:38,210 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1673163317, now seen corresponding path program 1 times [2021-06-10 11:38:38,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:38,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860782852] [2021-06-10 11:38:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:38,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:38,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:38:38,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860782852] [2021-06-10 11:38:38,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:38,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:38,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230630674] [2021-06-10 11:38:38,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:38,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:38,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:38,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 675 transitions, 1541 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:38,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:38,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:38,417 INFO L129 PetriNetUnfolder]: 60/768 cut-off events. [2021-06-10 11:38:38,417 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:38,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 768 events. 60/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3118 event pairs, 0 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 885. Up to 27 conditions per place. [2021-06-10 11:38:38,453 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/673 dead transitions. [2021-06-10 11:38:38,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 673 transitions, 1554 flow [2021-06-10 11:38:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:38,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:38,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:38,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:38,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:38,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:38,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,456 INFO L185 Difference]: Start difference. First operand has 692 places, 675 transitions, 1541 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:38,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 673 transitions, 1554 flow [2021-06-10 11:38:38,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 673 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:38,462 INFO L241 Difference]: Finished difference. Result has 691 places, 673 transitions, 1537 flow [2021-06-10 11:38:38,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=691, PETRI_TRANSITIONS=673} [2021-06-10 11:38:38,462 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -6 predicate places. [2021-06-10 11:38:38,462 INFO L480 AbstractCegarLoop]: Abstraction has has 691 places, 673 transitions, 1537 flow [2021-06-10 11:38:38,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:38,463 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:38,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2021-06-10 11:38:38,463 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:38,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash -898306996, now seen corresponding path program 1 times [2021-06-10 11:38:38,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:38,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952080685] [2021-06-10 11:38:38,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:38,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:38,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:38,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952080685] [2021-06-10 11:38:38,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:38,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:38,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720427278] [2021-06-10 11:38:38,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:38,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:38,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:38,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 673 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:38,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:38,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:38,692 INFO L129 PetriNetUnfolder]: 59/776 cut-off events. [2021-06-10 11:38:38,692 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:38,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 776 events. 59/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3189 event pairs, 0 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 897. Up to 27 conditions per place. [2021-06-10 11:38:38,718 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2021-06-10 11:38:38,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 675 transitions, 1567 flow [2021-06-10 11:38:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:38,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:38,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:38,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:38,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:38,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:38,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,722 INFO L185 Difference]: Start difference. First operand has 691 places, 673 transitions, 1537 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:38,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 675 transitions, 1567 flow [2021-06-10 11:38:38,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 675 transitions, 1566 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:38,727 INFO L241 Difference]: Finished difference. Result has 694 places, 675 transitions, 1560 flow [2021-06-10 11:38:38,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=694, PETRI_TRANSITIONS=675} [2021-06-10 11:38:38,728 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -3 predicate places. [2021-06-10 11:38:38,728 INFO L480 AbstractCegarLoop]: Abstraction has has 694 places, 675 transitions, 1560 flow [2021-06-10 11:38:38,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:38,728 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:38,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2021-06-10 11:38:38,728 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -898305973, now seen corresponding path program 1 times [2021-06-10 11:38:38,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:38,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291578169] [2021-06-10 11:38:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:38,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:38,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:38,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291578169] [2021-06-10 11:38:38,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:38,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:38,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179135127] [2021-06-10 11:38:38,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:38,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:38,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:38,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:38,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 675 transitions, 1560 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:38,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:38,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:38,935 INFO L129 PetriNetUnfolder]: 58/774 cut-off events. [2021-06-10 11:38:38,935 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:38,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 774 events. 58/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3177 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 894. Up to 27 conditions per place. [2021-06-10 11:38:38,972 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/675 dead transitions. [2021-06-10 11:38:38,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 675 transitions, 1572 flow [2021-06-10 11:38:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:38,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:38,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:38,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:38,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:38,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:38,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,976 INFO L185 Difference]: Start difference. First operand has 694 places, 675 transitions, 1560 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:38,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 675 transitions, 1572 flow [2021-06-10 11:38:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 675 transitions, 1567 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:38,982 INFO L241 Difference]: Finished difference. Result has 697 places, 675 transitions, 1565 flow [2021-06-10 11:38:38,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=697, PETRI_TRANSITIONS=675} [2021-06-10 11:38:38,982 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 0 predicate places. [2021-06-10 11:38:38,982 INFO L480 AbstractCegarLoop]: Abstraction has has 697 places, 675 transitions, 1565 flow [2021-06-10 11:38:38,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:38,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:38,983 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:38,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2021-06-10 11:38:38,983 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:38,983 INFO L82 PathProgramCache]: Analyzing trace with hash -897353684, now seen corresponding path program 1 times [2021-06-10 11:38:38,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:38,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034628112] [2021-06-10 11:38:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:38,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:38,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:38,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:38,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034628112] [2021-06-10 11:38:38,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:38,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:38,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175226750] [2021-06-10 11:38:38,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:38,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:38,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:39,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 675 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:39,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:39,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:39,188 INFO L129 PetriNetUnfolder]: 57/770 cut-off events. [2021-06-10 11:38:39,188 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:39,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 770 events. 57/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3150 event pairs, 0 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 891. Up to 27 conditions per place. [2021-06-10 11:38:39,224 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2021-06-10 11:38:39,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 672 transitions, 1562 flow [2021-06-10 11:38:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:39,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:39,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:39,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:39,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:39,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:39,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,227 INFO L185 Difference]: Start difference. First operand has 697 places, 675 transitions, 1565 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:39,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 672 transitions, 1562 flow [2021-06-10 11:38:39,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 672 transitions, 1555 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:39,233 INFO L241 Difference]: Finished difference. Result has 696 places, 672 transitions, 1545 flow [2021-06-10 11:38:39,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=696, PETRI_TRANSITIONS=672} [2021-06-10 11:38:39,233 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -1 predicate places. [2021-06-10 11:38:39,233 INFO L480 AbstractCegarLoop]: Abstraction has has 696 places, 672 transitions, 1545 flow [2021-06-10 11:38:39,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:39,233 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:39,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2021-06-10 11:38:39,234 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash -897352661, now seen corresponding path program 1 times [2021-06-10 11:38:39,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:39,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912035691] [2021-06-10 11:38:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:39,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:39,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:38:39,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912035691] [2021-06-10 11:38:39,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:39,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:39,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322957985] [2021-06-10 11:38:39,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:39,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:39,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:39,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 672 transitions, 1545 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:39,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:39,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:39,442 INFO L129 PetriNetUnfolder]: 57/768 cut-off events. [2021-06-10 11:38:39,442 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:39,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 768 events. 57/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3137 event pairs, 0 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 892. Up to 27 conditions per place. [2021-06-10 11:38:39,478 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/670 dead transitions. [2021-06-10 11:38:39,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 670 transitions, 1558 flow [2021-06-10 11:38:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:39,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:39,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:39,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:39,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:39,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:39,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,481 INFO L185 Difference]: Start difference. First operand has 696 places, 672 transitions, 1545 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:39,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 670 transitions, 1558 flow [2021-06-10 11:38:39,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 670 transitions, 1557 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:39,487 INFO L241 Difference]: Finished difference. Result has 695 places, 670 transitions, 1541 flow [2021-06-10 11:38:39,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=695, PETRI_TRANSITIONS=670} [2021-06-10 11:38:39,487 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, -2 predicate places. [2021-06-10 11:38:39,487 INFO L480 AbstractCegarLoop]: Abstraction has has 695 places, 670 transitions, 1541 flow [2021-06-10 11:38:39,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:39,488 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:39,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2021-06-10 11:38:39,488 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1496483251, now seen corresponding path program 1 times [2021-06-10 11:38:39,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:39,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758253941] [2021-06-10 11:38:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:39,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:39,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:39,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758253941] [2021-06-10 11:38:39,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:39,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:39,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31441454] [2021-06-10 11:38:39,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:39,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:39,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:39,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 670 transitions, 1541 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:39,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:39,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:39,699 INFO L129 PetriNetUnfolder]: 55/773 cut-off events. [2021-06-10 11:38:39,699 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:39,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 773 events. 55/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3184 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 895. Up to 27 conditions per place. [2021-06-10 11:38:39,736 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/671 dead transitions. [2021-06-10 11:38:39,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 671 transitions, 1557 flow [2021-06-10 11:38:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:39,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:39,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:39,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:39,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:39,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:39,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,739 INFO L185 Difference]: Start difference. First operand has 695 places, 670 transitions, 1541 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:39,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 671 transitions, 1557 flow [2021-06-10 11:38:39,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 671 transitions, 1556 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:39,745 INFO L241 Difference]: Finished difference. Result has 698 places, 671 transitions, 1554 flow [2021-06-10 11:38:39,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=698, PETRI_TRANSITIONS=671} [2021-06-10 11:38:39,746 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 1 predicate places. [2021-06-10 11:38:39,746 INFO L480 AbstractCegarLoop]: Abstraction has has 698 places, 671 transitions, 1554 flow [2021-06-10 11:38:39,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:39,746 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:39,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2021-06-10 11:38:39,746 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1496484274, now seen corresponding path program 1 times [2021-06-10 11:38:39,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:39,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129671557] [2021-06-10 11:38:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:39,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:39,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:39,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:39,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129671557] [2021-06-10 11:38:39,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:39,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:39,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037928389] [2021-06-10 11:38:39,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:39,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:39,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:39,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 671 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:39,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:39,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:39,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:39,962 INFO L129 PetriNetUnfolder]: 55/774 cut-off events. [2021-06-10 11:38:39,963 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:39,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 774 events. 55/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3196 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 903. Up to 27 conditions per place. [2021-06-10 11:38:39,999 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2021-06-10 11:38:39,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 672 transitions, 1580 flow [2021-06-10 11:38:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:40,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:40,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:40,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:40,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:40,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:40,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,003 INFO L185 Difference]: Start difference. First operand has 698 places, 671 transitions, 1554 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:40,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 672 transitions, 1580 flow [2021-06-10 11:38:40,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 672 transitions, 1578 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:40,009 INFO L241 Difference]: Finished difference. Result has 701 places, 672 transitions, 1570 flow [2021-06-10 11:38:40,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1570, PETRI_PLACES=701, PETRI_TRANSITIONS=672} [2021-06-10 11:38:40,009 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 4 predicate places. [2021-06-10 11:38:40,009 INFO L480 AbstractCegarLoop]: Abstraction has has 701 places, 672 transitions, 1570 flow [2021-06-10 11:38:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,009 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:40,009 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:40,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2021-06-10 11:38:40,009 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1495530962, now seen corresponding path program 1 times [2021-06-10 11:38:40,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:40,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876580679] [2021-06-10 11:38:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:40,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:40,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:40,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876580679] [2021-06-10 11:38:40,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:40,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:40,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726104500] [2021-06-10 11:38:40,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:40,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:40,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:40,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 672 transitions, 1570 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:40,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:40,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:40,221 INFO L129 PetriNetUnfolder]: 54/770 cut-off events. [2021-06-10 11:38:40,221 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:40,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 770 events. 54/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3168 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 896. Up to 27 conditions per place. [2021-06-10 11:38:40,283 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/669 dead transitions. [2021-06-10 11:38:40,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 669 transitions, 1567 flow [2021-06-10 11:38:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:40,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:40,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:40,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:40,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:40,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:40,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,287 INFO L185 Difference]: Start difference. First operand has 701 places, 672 transitions, 1570 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:40,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 669 transitions, 1567 flow [2021-06-10 11:38:40,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 669 transitions, 1559 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:40,292 INFO L241 Difference]: Finished difference. Result has 700 places, 669 transitions, 1549 flow [2021-06-10 11:38:40,292 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=700, PETRI_TRANSITIONS=669} [2021-06-10 11:38:40,292 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 3 predicate places. [2021-06-10 11:38:40,292 INFO L480 AbstractCegarLoop]: Abstraction has has 700 places, 669 transitions, 1549 flow [2021-06-10 11:38:40,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,292 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:40,292 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:40,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2021-06-10 11:38:40,292 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1495529939, now seen corresponding path program 1 times [2021-06-10 11:38:40,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:40,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333224497] [2021-06-10 11:38:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:40,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:40,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:38:40,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333224497] [2021-06-10 11:38:40,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:40,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:40,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762298658] [2021-06-10 11:38:40,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:40,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:40,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:40,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 669 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:40,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:40,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:40,502 INFO L129 PetriNetUnfolder]: 54/768 cut-off events. [2021-06-10 11:38:40,502 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:40,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 768 events. 54/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3153 event pairs, 0 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 899. Up to 27 conditions per place. [2021-06-10 11:38:40,539 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/667 dead transitions. [2021-06-10 11:38:40,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 667 transitions, 1562 flow [2021-06-10 11:38:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:40,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:40,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:40,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:40,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:40,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:40,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,542 INFO L185 Difference]: Start difference. First operand has 700 places, 669 transitions, 1549 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:40,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 667 transitions, 1562 flow [2021-06-10 11:38:40,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 667 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:40,548 INFO L241 Difference]: Finished difference. Result has 699 places, 667 transitions, 1545 flow [2021-06-10 11:38:40,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=699, PETRI_TRANSITIONS=667} [2021-06-10 11:38:40,548 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 2 predicate places. [2021-06-10 11:38:40,549 INFO L480 AbstractCegarLoop]: Abstraction has has 699 places, 667 transitions, 1545 flow [2021-06-10 11:38:40,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:40,549 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:40,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2021-06-10 11:38:40,549 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2088269263, now seen corresponding path program 1 times [2021-06-10 11:38:40,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:40,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462959123] [2021-06-10 11:38:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:40,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:40,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:40,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462959123] [2021-06-10 11:38:40,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:40,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:40,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403095093] [2021-06-10 11:38:40,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:40,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:40,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:40,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:40,566 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:40,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 667 transitions, 1545 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:40,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:40,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:40,762 INFO L129 PetriNetUnfolder]: 53/775 cut-off events. [2021-06-10 11:38:40,762 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:40,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 775 events. 53/775 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3212 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 904. Up to 27 conditions per place. [2021-06-10 11:38:40,799 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/668 dead transitions. [2021-06-10 11:38:40,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 668 transitions, 1561 flow [2021-06-10 11:38:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:40,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:40,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:40,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:40,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:40,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:40,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,802 INFO L185 Difference]: Start difference. First operand has 699 places, 667 transitions, 1545 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:40,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 668 transitions, 1561 flow [2021-06-10 11:38:40,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 668 transitions, 1560 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:40,808 INFO L241 Difference]: Finished difference. Result has 701 places, 667 transitions, 1549 flow [2021-06-10 11:38:40,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=701, PETRI_TRANSITIONS=667} [2021-06-10 11:38:40,808 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 4 predicate places. [2021-06-10 11:38:40,808 INFO L480 AbstractCegarLoop]: Abstraction has has 701 places, 667 transitions, 1549 flow [2021-06-10 11:38:40,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:40,809 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:40,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2021-06-10 11:38:40,809 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2088268240, now seen corresponding path program 1 times [2021-06-10 11:38:40,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:40,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810692373] [2021-06-10 11:38:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:40,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:40,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:40,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:40,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810692373] [2021-06-10 11:38:40,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:40,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:40,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310785215] [2021-06-10 11:38:40,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:40,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:40,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:40,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 667 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:40,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:40,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:40,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:41,028 INFO L129 PetriNetUnfolder]: 51/777 cut-off events. [2021-06-10 11:38:41,028 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:41,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 777 events. 51/777 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3248 event pairs, 0 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 915. Up to 27 conditions per place. [2021-06-10 11:38:41,066 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/668 dead transitions. [2021-06-10 11:38:41,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 668 transitions, 1575 flow [2021-06-10 11:38:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:41,067 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:41,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:41,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:41,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:41,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:41,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,070 INFO L185 Difference]: Start difference. First operand has 701 places, 667 transitions, 1549 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:41,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 668 transitions, 1575 flow [2021-06-10 11:38:41,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 668 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:41,076 INFO L241 Difference]: Finished difference. Result has 704 places, 668 transitions, 1566 flow [2021-06-10 11:38:41,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1566, PETRI_PLACES=704, PETRI_TRANSITIONS=668} [2021-06-10 11:38:41,076 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 7 predicate places. [2021-06-10 11:38:41,076 INFO L480 AbstractCegarLoop]: Abstraction has has 704 places, 668 transitions, 1566 flow [2021-06-10 11:38:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:41,076 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:41,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2021-06-10 11:38:41,076 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2089221552, now seen corresponding path program 1 times [2021-06-10 11:38:41,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:41,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046014388] [2021-06-10 11:38:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:41,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:41,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:41,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046014388] [2021-06-10 11:38:41,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:41,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:41,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114887576] [2021-06-10 11:38:41,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:41,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:41,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:41,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 668 transitions, 1566 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:41,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:41,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:41,290 INFO L129 PetriNetUnfolder]: 51/770 cut-off events. [2021-06-10 11:38:41,290 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:41,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 770 events. 51/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3186 event pairs, 0 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 901. Up to 27 conditions per place. [2021-06-10 11:38:41,327 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/666 dead transitions. [2021-06-10 11:38:41,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 666 transitions, 1568 flow [2021-06-10 11:38:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:41,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:41,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:41,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:41,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:41,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:41,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,330 INFO L185 Difference]: Start difference. First operand has 704 places, 668 transitions, 1566 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:41,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 666 transitions, 1568 flow [2021-06-10 11:38:41,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 666 transitions, 1560 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:41,336 INFO L241 Difference]: Finished difference. Result has 704 places, 666 transitions, 1553 flow [2021-06-10 11:38:41,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=704, PETRI_TRANSITIONS=666} [2021-06-10 11:38:41,337 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 7 predicate places. [2021-06-10 11:38:41,337 INFO L480 AbstractCegarLoop]: Abstraction has has 704 places, 666 transitions, 1553 flow [2021-06-10 11:38:41,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:41,337 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:41,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2021-06-10 11:38:41,337 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2089222575, now seen corresponding path program 1 times [2021-06-10 11:38:41,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:41,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311032732] [2021-06-10 11:38:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:41,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:41,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:38:41,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311032732] [2021-06-10 11:38:41,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:41,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:41,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742482415] [2021-06-10 11:38:41,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:41,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:41,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:41,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 666 transitions, 1553 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:41,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:41,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:41,554 INFO L129 PetriNetUnfolder]: 51/768 cut-off events. [2021-06-10 11:38:41,555 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:41,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 768 events. 51/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3171 event pairs, 0 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 905. Up to 27 conditions per place. [2021-06-10 11:38:41,591 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/664 dead transitions. [2021-06-10 11:38:41,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 664 transitions, 1566 flow [2021-06-10 11:38:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:41,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:41,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:41,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:41,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:41,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:41,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,594 INFO L185 Difference]: Start difference. First operand has 704 places, 666 transitions, 1553 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:41,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 664 transitions, 1566 flow [2021-06-10 11:38:41,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 664 transitions, 1565 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:41,600 INFO L241 Difference]: Finished difference. Result has 703 places, 664 transitions, 1549 flow [2021-06-10 11:38:41,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1549, PETRI_PLACES=703, PETRI_TRANSITIONS=664} [2021-06-10 11:38:41,600 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 6 predicate places. [2021-06-10 11:38:41,600 INFO L480 AbstractCegarLoop]: Abstraction has has 703 places, 664 transitions, 1549 flow [2021-06-10 11:38:41,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:41,601 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:41,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2021-06-10 11:38:41,601 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash -249639979, now seen corresponding path program 1 times [2021-06-10 11:38:41,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:41,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837520089] [2021-06-10 11:38:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:41,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:41,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:41,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837520089] [2021-06-10 11:38:41,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:41,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:41,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829519517] [2021-06-10 11:38:41,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:41,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:41,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:41,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:41,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:41,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 664 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:41,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:41,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:41,823 INFO L129 PetriNetUnfolder]: 50/776 cut-off events. [2021-06-10 11:38:41,823 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:41,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 776 events. 50/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3240 event pairs, 0 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 917. Up to 27 conditions per place. [2021-06-10 11:38:41,861 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/666 dead transitions. [2021-06-10 11:38:41,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 666 transitions, 1579 flow [2021-06-10 11:38:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:41,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:41,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:41,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:41,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:41,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:41,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,865 INFO L185 Difference]: Start difference. First operand has 703 places, 664 transitions, 1549 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 666 transitions, 1579 flow [2021-06-10 11:38:41,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 666 transitions, 1578 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:41,871 INFO L241 Difference]: Finished difference. Result has 706 places, 666 transitions, 1572 flow [2021-06-10 11:38:41,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1572, PETRI_PLACES=706, PETRI_TRANSITIONS=666} [2021-06-10 11:38:41,871 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 9 predicate places. [2021-06-10 11:38:41,871 INFO L480 AbstractCegarLoop]: Abstraction has has 706 places, 666 transitions, 1572 flow [2021-06-10 11:38:41,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:41,871 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:41,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2021-06-10 11:38:41,871 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:41,872 INFO L82 PathProgramCache]: Analyzing trace with hash -249638956, now seen corresponding path program 1 times [2021-06-10 11:38:41,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:41,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428697391] [2021-06-10 11:38:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:41,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:41,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:41,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:41,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428697391] [2021-06-10 11:38:41,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:41,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:41,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098551268] [2021-06-10 11:38:41,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:41,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:41,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:41,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 666 transitions, 1572 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:41,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:41,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:41,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:42,095 INFO L129 PetriNetUnfolder]: 49/774 cut-off events. [2021-06-10 11:38:42,095 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:42,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 774 events. 49/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3231 event pairs, 0 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 914. Up to 27 conditions per place. [2021-06-10 11:38:42,132 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/666 dead transitions. [2021-06-10 11:38:42,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 666 transitions, 1584 flow [2021-06-10 11:38:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:42,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:42,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:42,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:42,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:42,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:42,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,135 INFO L185 Difference]: Start difference. First operand has 706 places, 666 transitions, 1572 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:42,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 666 transitions, 1584 flow [2021-06-10 11:38:42,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 666 transitions, 1579 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:42,141 INFO L241 Difference]: Finished difference. Result has 709 places, 666 transitions, 1577 flow [2021-06-10 11:38:42,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=709, PETRI_TRANSITIONS=666} [2021-06-10 11:38:42,141 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 12 predicate places. [2021-06-10 11:38:42,141 INFO L480 AbstractCegarLoop]: Abstraction has has 709 places, 666 transitions, 1577 flow [2021-06-10 11:38:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:42,142 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:42,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2021-06-10 11:38:42,142 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash -248686667, now seen corresponding path program 1 times [2021-06-10 11:38:42,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:42,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028866160] [2021-06-10 11:38:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:42,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:42,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:42,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028866160] [2021-06-10 11:38:42,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:42,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:42,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045323115] [2021-06-10 11:38:42,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:42,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:42,159 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:42,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 666 transitions, 1577 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:42,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:42,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:42,356 INFO L129 PetriNetUnfolder]: 48/770 cut-off events. [2021-06-10 11:38:42,356 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:42,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 770 events. 48/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3200 event pairs, 0 based on Foata normal form. 1/698 useless extension candidates. Maximal degree in co-relation 911. Up to 27 conditions per place. [2021-06-10 11:38:42,393 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/663 dead transitions. [2021-06-10 11:38:42,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 663 transitions, 1574 flow [2021-06-10 11:38:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:42,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:42,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:42,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:42,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:42,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,396 INFO L185 Difference]: Start difference. First operand has 709 places, 666 transitions, 1577 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:42,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 663 transitions, 1574 flow [2021-06-10 11:38:42,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 663 transitions, 1567 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:42,402 INFO L241 Difference]: Finished difference. Result has 708 places, 663 transitions, 1557 flow [2021-06-10 11:38:42,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1557, PETRI_PLACES=708, PETRI_TRANSITIONS=663} [2021-06-10 11:38:42,402 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 11 predicate places. [2021-06-10 11:38:42,402 INFO L480 AbstractCegarLoop]: Abstraction has has 708 places, 663 transitions, 1557 flow [2021-06-10 11:38:42,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:42,403 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:42,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2021-06-10 11:38:42,403 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -248685644, now seen corresponding path program 1 times [2021-06-10 11:38:42,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:42,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711206838] [2021-06-10 11:38:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:42,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:42,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:38:42,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711206838] [2021-06-10 11:38:42,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:42,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:42,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248635207] [2021-06-10 11:38:42,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:42,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:42,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:42,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:42,421 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:42,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 663 transitions, 1557 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:42,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:42,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:42,620 INFO L129 PetriNetUnfolder]: 48/768 cut-off events. [2021-06-10 11:38:42,621 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:42,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 768 events. 48/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3188 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 912. Up to 27 conditions per place. [2021-06-10 11:38:42,656 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/661 dead transitions. [2021-06-10 11:38:42,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 661 transitions, 1570 flow [2021-06-10 11:38:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:42,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:42,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:42,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:42,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:42,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,660 INFO L185 Difference]: Start difference. First operand has 708 places, 663 transitions, 1557 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:42,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 661 transitions, 1570 flow [2021-06-10 11:38:42,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 661 transitions, 1569 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:42,665 INFO L241 Difference]: Finished difference. Result has 707 places, 661 transitions, 1553 flow [2021-06-10 11:38:42,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1553, PETRI_PLACES=707, PETRI_TRANSITIONS=661} [2021-06-10 11:38:42,666 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 10 predicate places. [2021-06-10 11:38:42,666 INFO L480 AbstractCegarLoop]: Abstraction has has 707 places, 661 transitions, 1553 flow [2021-06-10 11:38:42,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:42,666 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:42,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2021-06-10 11:38:42,666 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1066592199, now seen corresponding path program 1 times [2021-06-10 11:38:42,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:42,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781007526] [2021-06-10 11:38:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:42,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:42,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:42,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781007526] [2021-06-10 11:38:42,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:42,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:42,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886915181] [2021-06-10 11:38:42,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:42,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:42,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:42,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 661 transitions, 1553 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:42,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:42,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:42,901 INFO L129 PetriNetUnfolder]: 47/776 cut-off events. [2021-06-10 11:38:42,901 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:42,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 776 events. 47/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3258 event pairs, 0 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 924. Up to 27 conditions per place. [2021-06-10 11:38:42,939 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/663 dead transitions. [2021-06-10 11:38:42,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 663 transitions, 1583 flow [2021-06-10 11:38:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:42,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:42,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:42,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:42,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:42,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:42,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,942 INFO L185 Difference]: Start difference. First operand has 707 places, 661 transitions, 1553 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:42,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 663 transitions, 1583 flow [2021-06-10 11:38:42,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 663 transitions, 1582 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:42,948 INFO L241 Difference]: Finished difference. Result has 710 places, 663 transitions, 1576 flow [2021-06-10 11:38:42,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1576, PETRI_PLACES=710, PETRI_TRANSITIONS=663} [2021-06-10 11:38:42,949 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 13 predicate places. [2021-06-10 11:38:42,949 INFO L480 AbstractCegarLoop]: Abstraction has has 710 places, 663 transitions, 1576 flow [2021-06-10 11:38:42,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:42,949 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:42,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2021-06-10 11:38:42,949 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1066593222, now seen corresponding path program 1 times [2021-06-10 11:38:42,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:42,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154000942] [2021-06-10 11:38:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:42,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:42,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:42,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:42,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154000942] [2021-06-10 11:38:42,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:42,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:42,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291627132] [2021-06-10 11:38:42,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:42,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:42,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:42,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 663 transitions, 1576 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:42,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:42,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:42,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:43,170 INFO L129 PetriNetUnfolder]: 45/777 cut-off events. [2021-06-10 11:38:43,170 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:43,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 777 events. 45/777 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3282 event pairs, 0 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 924. Up to 27 conditions per place. [2021-06-10 11:38:43,207 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/663 dead transitions. [2021-06-10 11:38:43,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 663 transitions, 1588 flow [2021-06-10 11:38:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:43,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:43,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:43,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:43,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:43,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:43,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,210 INFO L185 Difference]: Start difference. First operand has 710 places, 663 transitions, 1576 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:43,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 663 transitions, 1588 flow [2021-06-10 11:38:43,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 663 transitions, 1583 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:43,216 INFO L241 Difference]: Finished difference. Result has 712 places, 662 transitions, 1572 flow [2021-06-10 11:38:43,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1572, PETRI_PLACES=712, PETRI_TRANSITIONS=662} [2021-06-10 11:38:43,217 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 15 predicate places. [2021-06-10 11:38:43,217 INFO L480 AbstractCegarLoop]: Abstraction has has 712 places, 662 transitions, 1572 flow [2021-06-10 11:38:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:43,217 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:43,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2021-06-10 11:38:43,217 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1067545511, now seen corresponding path program 1 times [2021-06-10 11:38:43,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:43,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944251934] [2021-06-10 11:38:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:43,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:43,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:43,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944251934] [2021-06-10 11:38:43,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:43,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:43,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728381806] [2021-06-10 11:38:43,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:43,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:43,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:43,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:43,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 662 transitions, 1572 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:43,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:43,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:43,441 INFO L129 PetriNetUnfolder]: 45/770 cut-off events. [2021-06-10 11:38:43,441 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:43,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 770 events. 45/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3217 event pairs, 0 based on Foata normal form. 1/701 useless extension candidates. Maximal degree in co-relation 918. Up to 27 conditions per place. [2021-06-10 11:38:43,478 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/660 dead transitions. [2021-06-10 11:38:43,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 660 transitions, 1575 flow [2021-06-10 11:38:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:43,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:43,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:43,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:43,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:43,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:43,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,481 INFO L185 Difference]: Start difference. First operand has 712 places, 662 transitions, 1572 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:43,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 660 transitions, 1575 flow [2021-06-10 11:38:43,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 660 transitions, 1568 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:43,487 INFO L241 Difference]: Finished difference. Result has 712 places, 660 transitions, 1561 flow [2021-06-10 11:38:43,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=712, PETRI_TRANSITIONS=660} [2021-06-10 11:38:43,487 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 15 predicate places. [2021-06-10 11:38:43,487 INFO L480 AbstractCegarLoop]: Abstraction has has 712 places, 660 transitions, 1561 flow [2021-06-10 11:38:43,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,488 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:43,488 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:43,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2021-06-10 11:38:43,488 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1067546534, now seen corresponding path program 1 times [2021-06-10 11:38:43,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:43,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356860480] [2021-06-10 11:38:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:43,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:43,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:38:43,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356860480] [2021-06-10 11:38:43,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:43,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:43,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674361167] [2021-06-10 11:38:43,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:43,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:43,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:43,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 660 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:43,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:43,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:43,711 INFO L129 PetriNetUnfolder]: 45/768 cut-off events. [2021-06-10 11:38:43,711 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:43,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 768 events. 45/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3206 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 918. Up to 27 conditions per place. [2021-06-10 11:38:43,746 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/658 dead transitions. [2021-06-10 11:38:43,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 658 transitions, 1574 flow [2021-06-10 11:38:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:43,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:43,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:43,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:43,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:43,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:43,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,749 INFO L185 Difference]: Start difference. First operand has 712 places, 660 transitions, 1561 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:43,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 658 transitions, 1574 flow [2021-06-10 11:38:43,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 658 transitions, 1573 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:43,755 INFO L241 Difference]: Finished difference. Result has 711 places, 658 transitions, 1557 flow [2021-06-10 11:38:43,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1557, PETRI_PLACES=711, PETRI_TRANSITIONS=658} [2021-06-10 11:38:43,755 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 14 predicate places. [2021-06-10 11:38:43,755 INFO L480 AbstractCegarLoop]: Abstraction has has 711 places, 658 transitions, 1557 flow [2021-06-10 11:38:43,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,756 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:43,756 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:43,756 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2021-06-10 11:38:43,756 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:43,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1107289152, now seen corresponding path program 1 times [2021-06-10 11:38:43,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:43,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795983976] [2021-06-10 11:38:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:43,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:43,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:43,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:43,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795983976] [2021-06-10 11:38:43,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:43,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:43,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446777312] [2021-06-10 11:38:43,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:43,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:43,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:43,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 658 transitions, 1557 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:43,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:43,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:43,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:43,981 INFO L129 PetriNetUnfolder]: 44/775 cut-off events. [2021-06-10 11:38:43,981 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:44,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 775 events. 44/775 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3266 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 923. Up to 27 conditions per place. [2021-06-10 11:38:44,018 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2021-06-10 11:38:44,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 659 transitions, 1573 flow [2021-06-10 11:38:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:44,020 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:44,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:44,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:44,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:44,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:44,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,022 INFO L185 Difference]: Start difference. First operand has 711 places, 658 transitions, 1557 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:44,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 659 transitions, 1573 flow [2021-06-10 11:38:44,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 659 transitions, 1572 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:44,028 INFO L241 Difference]: Finished difference. Result has 713 places, 658 transitions, 1561 flow [2021-06-10 11:38:44,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=713, PETRI_TRANSITIONS=658} [2021-06-10 11:38:44,028 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 16 predicate places. [2021-06-10 11:38:44,028 INFO L480 AbstractCegarLoop]: Abstraction has has 713 places, 658 transitions, 1561 flow [2021-06-10 11:38:44,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:44,029 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:44,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2021-06-10 11:38:44,029 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1107290175, now seen corresponding path program 1 times [2021-06-10 11:38:44,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:44,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979795715] [2021-06-10 11:38:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:44,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:44,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:44,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979795715] [2021-06-10 11:38:44,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:44,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:44,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311140414] [2021-06-10 11:38:44,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:44,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:44,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:44,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 658 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:44,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:44,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:44,256 INFO L129 PetriNetUnfolder]: 42/777 cut-off events. [2021-06-10 11:38:44,256 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:44,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 777 events. 42/777 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3299 event pairs, 0 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 934. Up to 27 conditions per place. [2021-06-10 11:38:44,292 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/659 dead transitions. [2021-06-10 11:38:44,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 659 transitions, 1587 flow [2021-06-10 11:38:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:44,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:44,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:44,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:44,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:44,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:44,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,296 INFO L185 Difference]: Start difference. First operand has 713 places, 658 transitions, 1561 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:44,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 659 transitions, 1587 flow [2021-06-10 11:38:44,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 659 transitions, 1586 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:44,301 INFO L241 Difference]: Finished difference. Result has 716 places, 659 transitions, 1578 flow [2021-06-10 11:38:44,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=716, PETRI_TRANSITIONS=659} [2021-06-10 11:38:44,302 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 19 predicate places. [2021-06-10 11:38:44,302 INFO L480 AbstractCegarLoop]: Abstraction has has 716 places, 659 transitions, 1578 flow [2021-06-10 11:38:44,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,302 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:44,302 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:44,302 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2021-06-10 11:38:44,302 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1106336863, now seen corresponding path program 1 times [2021-06-10 11:38:44,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:44,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595170666] [2021-06-10 11:38:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:44,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:44,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:44,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595170666] [2021-06-10 11:38:44,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:44,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:44,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177514618] [2021-06-10 11:38:44,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:44,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:44,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:44,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 659 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:44,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:44,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:44,518 INFO L129 PetriNetUnfolder]: 42/770 cut-off events. [2021-06-10 11:38:44,519 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:44,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 770 events. 42/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3236 event pairs, 0 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 920. Up to 27 conditions per place. [2021-06-10 11:38:44,554 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2021-06-10 11:38:44,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 657 transitions, 1580 flow [2021-06-10 11:38:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:44,556 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:44,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:44,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:44,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:44,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:44,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,558 INFO L185 Difference]: Start difference. First operand has 716 places, 659 transitions, 1578 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:44,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 657 transitions, 1580 flow [2021-06-10 11:38:44,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 657 transitions, 1572 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:44,564 INFO L241 Difference]: Finished difference. Result has 716 places, 657 transitions, 1565 flow [2021-06-10 11:38:44,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=716, PETRI_TRANSITIONS=657} [2021-06-10 11:38:44,565 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 19 predicate places. [2021-06-10 11:38:44,565 INFO L480 AbstractCegarLoop]: Abstraction has has 716 places, 657 transitions, 1565 flow [2021-06-10 11:38:44,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:44,565 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:44,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2021-06-10 11:38:44,565 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1106335840, now seen corresponding path program 1 times [2021-06-10 11:38:44,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:44,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250782412] [2021-06-10 11:38:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:44,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:44,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:38:44,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250782412] [2021-06-10 11:38:44,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:44,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:44,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724119599] [2021-06-10 11:38:44,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:44,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:44,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:44,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 657 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:44,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:44,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:44,787 INFO L129 PetriNetUnfolder]: 42/768 cut-off events. [2021-06-10 11:38:44,787 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:44,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 768 events. 42/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3224 event pairs, 0 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 924. Up to 27 conditions per place. [2021-06-10 11:38:44,822 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/655 dead transitions. [2021-06-10 11:38:44,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 655 transitions, 1578 flow [2021-06-10 11:38:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:44,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:44,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:44,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:44,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:44,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:44,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,826 INFO L185 Difference]: Start difference. First operand has 716 places, 657 transitions, 1565 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:44,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 655 transitions, 1578 flow [2021-06-10 11:38:44,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 655 transitions, 1577 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:44,832 INFO L241 Difference]: Finished difference. Result has 715 places, 655 transitions, 1561 flow [2021-06-10 11:38:44,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=715, PETRI_TRANSITIONS=655} [2021-06-10 11:38:44,832 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 18 predicate places. [2021-06-10 11:38:44,832 INFO L480 AbstractCegarLoop]: Abstraction has has 715 places, 655 transitions, 1561 flow [2021-06-10 11:38:44,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,832 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:44,832 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:44,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2021-06-10 11:38:44,833 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:44,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:44,833 INFO L82 PathProgramCache]: Analyzing trace with hash 157421159, now seen corresponding path program 1 times [2021-06-10 11:38:44,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:44,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705593142] [2021-06-10 11:38:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:44,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:44,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:44,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:44,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705593142] [2021-06-10 11:38:44,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:44,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:44,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132419275] [2021-06-10 11:38:44,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:44,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:44,850 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:44,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 655 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:44,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:44,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:44,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:45,061 INFO L129 PetriNetUnfolder]: 41/776 cut-off events. [2021-06-10 11:38:45,061 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:45,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 776 events. 41/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3295 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 936. Up to 27 conditions per place. [2021-06-10 11:38:45,098 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/657 dead transitions. [2021-06-10 11:38:45,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 657 transitions, 1591 flow [2021-06-10 11:38:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:45,099 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:45,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:45,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:45,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:45,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:45,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,101 INFO L185 Difference]: Start difference. First operand has 715 places, 655 transitions, 1561 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:45,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 657 transitions, 1591 flow [2021-06-10 11:38:45,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 657 transitions, 1590 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:45,107 INFO L241 Difference]: Finished difference. Result has 718 places, 657 transitions, 1584 flow [2021-06-10 11:38:45,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=718, PETRI_TRANSITIONS=657} [2021-06-10 11:38:45,107 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 21 predicate places. [2021-06-10 11:38:45,108 INFO L480 AbstractCegarLoop]: Abstraction has has 718 places, 657 transitions, 1584 flow [2021-06-10 11:38:45,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:45,108 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:45,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2021-06-10 11:38:45,108 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 157422182, now seen corresponding path program 1 times [2021-06-10 11:38:45,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:45,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013735124] [2021-06-10 11:38:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:45,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:45,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:45,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013735124] [2021-06-10 11:38:45,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:45,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:45,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809552305] [2021-06-10 11:38:45,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:45,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:45,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:45,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 657 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:45,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:45,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:45,335 INFO L129 PetriNetUnfolder]: 40/774 cut-off events. [2021-06-10 11:38:45,335 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:45,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 774 events. 40/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3283 event pairs, 0 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 933. Up to 27 conditions per place. [2021-06-10 11:38:45,372 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2021-06-10 11:38:45,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 657 transitions, 1596 flow [2021-06-10 11:38:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:45,374 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:45,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:45,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:45,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:45,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:45,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,376 INFO L185 Difference]: Start difference. First operand has 718 places, 657 transitions, 1584 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:45,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 657 transitions, 1596 flow [2021-06-10 11:38:45,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 657 transitions, 1591 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:45,382 INFO L241 Difference]: Finished difference. Result has 721 places, 657 transitions, 1589 flow [2021-06-10 11:38:45,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=721, PETRI_TRANSITIONS=657} [2021-06-10 11:38:45,382 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 24 predicate places. [2021-06-10 11:38:45,382 INFO L480 AbstractCegarLoop]: Abstraction has has 721 places, 657 transitions, 1589 flow [2021-06-10 11:38:45,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,383 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:45,383 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:45,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2021-06-10 11:38:45,383 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 158374471, now seen corresponding path program 1 times [2021-06-10 11:38:45,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:45,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574794384] [2021-06-10 11:38:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:45,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:45,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:45,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574794384] [2021-06-10 11:38:45,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:45,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:45,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073619012] [2021-06-10 11:38:45,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:45,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:45,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:45,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 657 transitions, 1589 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:45,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:45,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:45,604 INFO L129 PetriNetUnfolder]: 39/770 cut-off events. [2021-06-10 11:38:45,605 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:45,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 770 events. 39/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3257 event pairs, 0 based on Foata normal form. 1/707 useless extension candidates. Maximal degree in co-relation 930. Up to 27 conditions per place. [2021-06-10 11:38:45,641 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/654 dead transitions. [2021-06-10 11:38:45,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 654 transitions, 1586 flow [2021-06-10 11:38:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:45,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:45,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:45,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:45,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:45,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:45,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,644 INFO L185 Difference]: Start difference. First operand has 721 places, 657 transitions, 1589 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:45,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 654 transitions, 1586 flow [2021-06-10 11:38:45,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 654 transitions, 1579 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:45,650 INFO L241 Difference]: Finished difference. Result has 720 places, 654 transitions, 1569 flow [2021-06-10 11:38:45,651 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=720, PETRI_TRANSITIONS=654} [2021-06-10 11:38:45,651 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 23 predicate places. [2021-06-10 11:38:45,651 INFO L480 AbstractCegarLoop]: Abstraction has has 720 places, 654 transitions, 1569 flow [2021-06-10 11:38:45,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:45,651 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:45,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2021-06-10 11:38:45,651 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash 158375494, now seen corresponding path program 1 times [2021-06-10 11:38:45,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:45,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834587066] [2021-06-10 11:38:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:45,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:45,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:38:45,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834587066] [2021-06-10 11:38:45,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:45,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:45,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917990772] [2021-06-10 11:38:45,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:45,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:45,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:45,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 654 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:45,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:45,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:45,876 INFO L129 PetriNetUnfolder]: 39/768 cut-off events. [2021-06-10 11:38:45,877 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:45,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 768 events. 39/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3243 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 931. Up to 27 conditions per place. [2021-06-10 11:38:45,912 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/652 dead transitions. [2021-06-10 11:38:45,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 652 transitions, 1582 flow [2021-06-10 11:38:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:45,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:45,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:45,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:45,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:45,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:45,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,916 INFO L185 Difference]: Start difference. First operand has 720 places, 654 transitions, 1569 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:45,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 652 transitions, 1582 flow [2021-06-10 11:38:45,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 652 transitions, 1581 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:45,922 INFO L241 Difference]: Finished difference. Result has 719 places, 652 transitions, 1565 flow [2021-06-10 11:38:45,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=719, PETRI_TRANSITIONS=652} [2021-06-10 11:38:45,922 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 22 predicate places. [2021-06-10 11:38:45,922 INFO L480 AbstractCegarLoop]: Abstraction has has 719 places, 652 transitions, 1565 flow [2021-06-10 11:38:45,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:45,922 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:45,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2021-06-10 11:38:45,922 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1832776242, now seen corresponding path program 1 times [2021-06-10 11:38:45,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:45,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441233677] [2021-06-10 11:38:45,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:45,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:45,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:45,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:45,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441233677] [2021-06-10 11:38:45,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:45,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:45,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378041512] [2021-06-10 11:38:45,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:45,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:45,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:45,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 652 transitions, 1565 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:45,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:45,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:45,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:46,153 INFO L129 PetriNetUnfolder]: 38/776 cut-off events. [2021-06-10 11:38:46,153 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:46,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 776 events. 38/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3312 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 943. Up to 27 conditions per place. [2021-06-10 11:38:46,190 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/654 dead transitions. [2021-06-10 11:38:46,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 654 transitions, 1595 flow [2021-06-10 11:38:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:46,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:46,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:46,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:46,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:46,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:46,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,193 INFO L185 Difference]: Start difference. First operand has 719 places, 652 transitions, 1565 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:46,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 654 transitions, 1595 flow [2021-06-10 11:38:46,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 654 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:46,199 INFO L241 Difference]: Finished difference. Result has 722 places, 654 transitions, 1588 flow [2021-06-10 11:38:46,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1588, PETRI_PLACES=722, PETRI_TRANSITIONS=654} [2021-06-10 11:38:46,199 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 25 predicate places. [2021-06-10 11:38:46,199 INFO L480 AbstractCegarLoop]: Abstraction has has 722 places, 654 transitions, 1588 flow [2021-06-10 11:38:46,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,200 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:46,200 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:46,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2021-06-10 11:38:46,200 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1832777265, now seen corresponding path program 1 times [2021-06-10 11:38:46,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:46,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745815192] [2021-06-10 11:38:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:46,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:46,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:46,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745815192] [2021-06-10 11:38:46,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:46,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:46,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860702133] [2021-06-10 11:38:46,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:46,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:46,218 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:46,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 654 transitions, 1588 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:46,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:46,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:46,430 INFO L129 PetriNetUnfolder]: 36/777 cut-off events. [2021-06-10 11:38:46,430 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:46,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 777 events. 36/777 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3337 event pairs, 0 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 943. Up to 27 conditions per place. [2021-06-10 11:38:46,466 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/654 dead transitions. [2021-06-10 11:38:46,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 654 transitions, 1600 flow [2021-06-10 11:38:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:46,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:46,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:46,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:46,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:46,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:46,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,469 INFO L185 Difference]: Start difference. First operand has 722 places, 654 transitions, 1588 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:46,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 654 transitions, 1600 flow [2021-06-10 11:38:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 654 transitions, 1595 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:46,475 INFO L241 Difference]: Finished difference. Result has 724 places, 653 transitions, 1584 flow [2021-06-10 11:38:46,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=724, PETRI_TRANSITIONS=653} [2021-06-10 11:38:46,476 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 27 predicate places. [2021-06-10 11:38:46,476 INFO L480 AbstractCegarLoop]: Abstraction has has 724 places, 653 transitions, 1584 flow [2021-06-10 11:38:46,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:46,476 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:46,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2021-06-10 11:38:46,476 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1833729554, now seen corresponding path program 1 times [2021-06-10 11:38:46,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:46,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109780233] [2021-06-10 11:38:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:46,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:46,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:46,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109780233] [2021-06-10 11:38:46,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:46,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:46,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951982648] [2021-06-10 11:38:46,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:46,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:46,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:46,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 653 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:46,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:46,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:46,704 INFO L129 PetriNetUnfolder]: 36/770 cut-off events. [2021-06-10 11:38:46,704 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:46,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 770 events. 36/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3272 event pairs, 0 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 937. Up to 27 conditions per place. [2021-06-10 11:38:46,739 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/651 dead transitions. [2021-06-10 11:38:46,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 651 transitions, 1587 flow [2021-06-10 11:38:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:46,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:46,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:46,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:46,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:46,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:46,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,742 INFO L185 Difference]: Start difference. First operand has 724 places, 653 transitions, 1584 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:46,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 651 transitions, 1587 flow [2021-06-10 11:38:46,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 651 transitions, 1580 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:46,748 INFO L241 Difference]: Finished difference. Result has 724 places, 651 transitions, 1573 flow [2021-06-10 11:38:46,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=724, PETRI_TRANSITIONS=651} [2021-06-10 11:38:46,749 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 27 predicate places. [2021-06-10 11:38:46,749 INFO L480 AbstractCegarLoop]: Abstraction has has 724 places, 651 transitions, 1573 flow [2021-06-10 11:38:46,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:46,749 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:46,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2021-06-10 11:38:46,749 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1833730577, now seen corresponding path program 1 times [2021-06-10 11:38:46,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:46,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272348016] [2021-06-10 11:38:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:46,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:46,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:46,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:38:46,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272348016] [2021-06-10 11:38:46,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:46,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:46,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022428725] [2021-06-10 11:38:46,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:46,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:46,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:46,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 651 transitions, 1573 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:46,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:46,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:46,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:46,995 INFO L129 PetriNetUnfolder]: 36/768 cut-off events. [2021-06-10 11:38:46,995 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:47,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 768 events. 36/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3260 event pairs, 0 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 937. Up to 27 conditions per place. [2021-06-10 11:38:47,031 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/649 dead transitions. [2021-06-10 11:38:47,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 649 transitions, 1586 flow [2021-06-10 11:38:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:47,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:47,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:47,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:47,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:47,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:47,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,034 INFO L185 Difference]: Start difference. First operand has 724 places, 651 transitions, 1573 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:47,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 649 transitions, 1586 flow [2021-06-10 11:38:47,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 649 transitions, 1585 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:47,040 INFO L241 Difference]: Finished difference. Result has 723 places, 649 transitions, 1569 flow [2021-06-10 11:38:47,040 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1569, PETRI_PLACES=723, PETRI_TRANSITIONS=649} [2021-06-10 11:38:47,040 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 26 predicate places. [2021-06-10 11:38:47,040 INFO L480 AbstractCegarLoop]: Abstraction has has 723 places, 649 transitions, 1569 flow [2021-06-10 11:38:47,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:47,040 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:47,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2021-06-10 11:38:47,041 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 840728952, now seen corresponding path program 1 times [2021-06-10 11:38:47,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:47,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909135866] [2021-06-10 11:38:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:47,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:47,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:47,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909135866] [2021-06-10 11:38:47,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:47,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:47,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478711903] [2021-06-10 11:38:47,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:47,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:47,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:47,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 649 transitions, 1569 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:47,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:47,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:47,287 INFO L129 PetriNetUnfolder]: 35/776 cut-off events. [2021-06-10 11:38:47,287 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:47,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 776 events. 35/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3329 event pairs, 0 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 949. Up to 27 conditions per place. [2021-06-10 11:38:47,322 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/651 dead transitions. [2021-06-10 11:38:47,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 651 transitions, 1599 flow [2021-06-10 11:38:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:47,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:47,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:47,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:47,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:47,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:47,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,326 INFO L185 Difference]: Start difference. First operand has 723 places, 649 transitions, 1569 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 651 transitions, 1599 flow [2021-06-10 11:38:47,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 651 transitions, 1598 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:47,332 INFO L241 Difference]: Finished difference. Result has 726 places, 651 transitions, 1592 flow [2021-06-10 11:38:47,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1592, PETRI_PLACES=726, PETRI_TRANSITIONS=651} [2021-06-10 11:38:47,332 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 29 predicate places. [2021-06-10 11:38:47,332 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 651 transitions, 1592 flow [2021-06-10 11:38:47,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:47,332 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:47,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2021-06-10 11:38:47,332 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash 840729975, now seen corresponding path program 1 times [2021-06-10 11:38:47,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:47,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438755401] [2021-06-10 11:38:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:47,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:47,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:47,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438755401] [2021-06-10 11:38:47,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:47,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:47,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653861638] [2021-06-10 11:38:47,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:47,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:47,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:47,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 651 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:47,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:47,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:47,562 INFO L129 PetriNetUnfolder]: 34/774 cut-off events. [2021-06-10 11:38:47,562 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:47,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 774 events. 34/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3317 event pairs, 0 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 946. Up to 27 conditions per place. [2021-06-10 11:38:47,598 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/651 dead transitions. [2021-06-10 11:38:47,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 651 transitions, 1604 flow [2021-06-10 11:38:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:47,599 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:47,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:47,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:47,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:47,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:47,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,602 INFO L185 Difference]: Start difference. First operand has 726 places, 651 transitions, 1592 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:47,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 651 transitions, 1604 flow [2021-06-10 11:38:47,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 651 transitions, 1599 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:47,608 INFO L241 Difference]: Finished difference. Result has 729 places, 651 transitions, 1597 flow [2021-06-10 11:38:47,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=729, PETRI_TRANSITIONS=651} [2021-06-10 11:38:47,608 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 32 predicate places. [2021-06-10 11:38:47,608 INFO L480 AbstractCegarLoop]: Abstraction has has 729 places, 651 transitions, 1597 flow [2021-06-10 11:38:47,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,608 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:47,608 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:47,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2021-06-10 11:38:47,608 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash 841682264, now seen corresponding path program 1 times [2021-06-10 11:38:47,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:47,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441733764] [2021-06-10 11:38:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:47,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:47,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:47,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441733764] [2021-06-10 11:38:47,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:47,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:47,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692311235] [2021-06-10 11:38:47,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:47,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:47,627 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:47,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 651 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:47,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:47,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:47,834 INFO L129 PetriNetUnfolder]: 33/770 cut-off events. [2021-06-10 11:38:47,834 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:47,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 770 events. 33/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3288 event pairs, 0 based on Foata normal form. 1/713 useless extension candidates. Maximal degree in co-relation 943. Up to 27 conditions per place. [2021-06-10 11:38:47,870 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/648 dead transitions. [2021-06-10 11:38:47,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 648 transitions, 1594 flow [2021-06-10 11:38:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:47,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:47,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:47,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:47,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:47,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,873 INFO L185 Difference]: Start difference. First operand has 729 places, 651 transitions, 1597 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 648 transitions, 1594 flow [2021-06-10 11:38:47,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 648 transitions, 1587 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:47,880 INFO L241 Difference]: Finished difference. Result has 728 places, 648 transitions, 1577 flow [2021-06-10 11:38:47,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=728, PETRI_TRANSITIONS=648} [2021-06-10 11:38:47,880 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 31 predicate places. [2021-06-10 11:38:47,880 INFO L480 AbstractCegarLoop]: Abstraction has has 728 places, 648 transitions, 1577 flow [2021-06-10 11:38:47,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:47,880 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:47,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2021-06-10 11:38:47,880 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 841683287, now seen corresponding path program 1 times [2021-06-10 11:38:47,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:47,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999925225] [2021-06-10 11:38:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:47,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:47,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:47,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:38:47,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999925225] [2021-06-10 11:38:47,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:47,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:47,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562046874] [2021-06-10 11:38:47,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:47,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:47,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:47,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 648 transitions, 1577 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:47,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:47,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:47,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:48,115 INFO L129 PetriNetUnfolder]: 33/768 cut-off events. [2021-06-10 11:38:48,116 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:48,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 768 events. 33/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3277 event pairs, 0 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 944. Up to 27 conditions per place. [2021-06-10 11:38:48,151 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/646 dead transitions. [2021-06-10 11:38:48,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 646 transitions, 1590 flow [2021-06-10 11:38:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:48,152 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:48,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:48,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:48,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:48,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:48,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,154 INFO L185 Difference]: Start difference. First operand has 728 places, 648 transitions, 1577 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:48,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 646 transitions, 1590 flow [2021-06-10 11:38:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 646 transitions, 1589 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:48,160 INFO L241 Difference]: Finished difference. Result has 727 places, 646 transitions, 1573 flow [2021-06-10 11:38:48,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1573, PETRI_PLACES=727, PETRI_TRANSITIONS=646} [2021-06-10 11:38:48,160 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 30 predicate places. [2021-06-10 11:38:48,161 INFO L480 AbstractCegarLoop]: Abstraction has has 727 places, 646 transitions, 1573 flow [2021-06-10 11:38:48,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:48,161 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:48,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2021-06-10 11:38:48,161 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1703078785, now seen corresponding path program 1 times [2021-06-10 11:38:48,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:48,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250887351] [2021-06-10 11:38:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:48,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:48,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:48,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250887351] [2021-06-10 11:38:48,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:48,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:48,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964163643] [2021-06-10 11:38:48,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:48,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:48,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:48,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 646 transitions, 1573 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:48,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:48,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:48,426 INFO L129 PetriNetUnfolder]: 31/773 cut-off events. [2021-06-10 11:38:48,426 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:48,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 773 events. 31/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3326 event pairs, 0 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 947. Up to 27 conditions per place. [2021-06-10 11:38:48,447 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2021-06-10 11:38:48,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 647 transitions, 1589 flow [2021-06-10 11:38:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:48,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:48,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:48,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:48,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:48,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:48,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,450 INFO L185 Difference]: Start difference. First operand has 727 places, 646 transitions, 1573 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:48,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 647 transitions, 1589 flow [2021-06-10 11:38:48,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 647 transitions, 1588 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:48,456 INFO L241 Difference]: Finished difference. Result has 730 places, 647 transitions, 1586 flow [2021-06-10 11:38:48,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1586, PETRI_PLACES=730, PETRI_TRANSITIONS=647} [2021-06-10 11:38:48,456 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 33 predicate places. [2021-06-10 11:38:48,456 INFO L480 AbstractCegarLoop]: Abstraction has has 730 places, 647 transitions, 1586 flow [2021-06-10 11:38:48,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:48,456 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:48,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2021-06-10 11:38:48,456 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1703077762, now seen corresponding path program 1 times [2021-06-10 11:38:48,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:48,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964691268] [2021-06-10 11:38:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:48,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:48,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964691268] [2021-06-10 11:38:48,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:48,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:48,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577420511] [2021-06-10 11:38:48,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:48,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:48,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:48,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 647 transitions, 1586 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:48,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:48,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:48,691 INFO L129 PetriNetUnfolder]: 31/774 cut-off events. [2021-06-10 11:38:48,691 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:48,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 774 events. 31/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3337 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 955. Up to 27 conditions per place. [2021-06-10 11:38:48,726 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/648 dead transitions. [2021-06-10 11:38:48,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 648 transitions, 1612 flow [2021-06-10 11:38:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:48,727 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:48,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:48,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:48,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:48,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:48,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,730 INFO L185 Difference]: Start difference. First operand has 730 places, 647 transitions, 1586 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:48,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 648 transitions, 1612 flow [2021-06-10 11:38:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 648 transitions, 1610 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:48,735 INFO L241 Difference]: Finished difference. Result has 733 places, 648 transitions, 1602 flow [2021-06-10 11:38:48,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=733, PETRI_TRANSITIONS=648} [2021-06-10 11:38:48,736 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 36 predicate places. [2021-06-10 11:38:48,736 INFO L480 AbstractCegarLoop]: Abstraction has has 733 places, 648 transitions, 1602 flow [2021-06-10 11:38:48,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:48,736 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:48,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2021-06-10 11:38:48,736 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1704031074, now seen corresponding path program 1 times [2021-06-10 11:38:48,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:48,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365070526] [2021-06-10 11:38:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:48,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:48,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:48,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365070526] [2021-06-10 11:38:48,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:48,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:48,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27889583] [2021-06-10 11:38:48,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:48,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:48,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:48,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 648 transitions, 1602 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:48,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:48,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:48,959 INFO L129 PetriNetUnfolder]: 30/770 cut-off events. [2021-06-10 11:38:48,959 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:48,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 770 events. 30/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3309 event pairs, 0 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 948. Up to 27 conditions per place. [2021-06-10 11:38:48,993 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/645 dead transitions. [2021-06-10 11:38:48,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 735 places, 645 transitions, 1599 flow [2021-06-10 11:38:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:48,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:48,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:48,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:48,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:48,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:48,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:48,997 INFO L185 Difference]: Start difference. First operand has 733 places, 648 transitions, 1602 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:48,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 735 places, 645 transitions, 1599 flow [2021-06-10 11:38:48,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 645 transitions, 1591 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:49,002 INFO L241 Difference]: Finished difference. Result has 732 places, 645 transitions, 1581 flow [2021-06-10 11:38:49,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=732, PETRI_TRANSITIONS=645} [2021-06-10 11:38:49,003 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 35 predicate places. [2021-06-10 11:38:49,003 INFO L480 AbstractCegarLoop]: Abstraction has has 732 places, 645 transitions, 1581 flow [2021-06-10 11:38:49,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:49,003 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:49,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2021-06-10 11:38:49,003 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:49,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1704032097, now seen corresponding path program 1 times [2021-06-10 11:38:49,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:49,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308848958] [2021-06-10 11:38:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:49,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:49,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:38:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308848958] [2021-06-10 11:38:49,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:49,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:49,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406923915] [2021-06-10 11:38:49,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:49,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:49,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:49,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:49,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:49,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 645 transitions, 1581 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:49,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:49,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:49,230 INFO L129 PetriNetUnfolder]: 30/768 cut-off events. [2021-06-10 11:38:49,230 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:49,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 768 events. 30/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3294 event pairs, 0 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 951. Up to 27 conditions per place. [2021-06-10 11:38:49,266 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/643 dead transitions. [2021-06-10 11:38:49,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 643 transitions, 1594 flow [2021-06-10 11:38:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:49,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:49,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:49,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:49,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:49,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:49,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,269 INFO L185 Difference]: Start difference. First operand has 732 places, 645 transitions, 1581 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:49,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 643 transitions, 1594 flow [2021-06-10 11:38:49,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 731 places, 643 transitions, 1593 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:49,276 INFO L241 Difference]: Finished difference. Result has 731 places, 643 transitions, 1577 flow [2021-06-10 11:38:49,276 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=729, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1577, PETRI_PLACES=731, PETRI_TRANSITIONS=643} [2021-06-10 11:38:49,276 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 34 predicate places. [2021-06-10 11:38:49,276 INFO L480 AbstractCegarLoop]: Abstraction has has 731 places, 643 transitions, 1577 flow [2021-06-10 11:38:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:49,276 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:49,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2021-06-10 11:38:49,276 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1739966828, now seen corresponding path program 1 times [2021-06-10 11:38:49,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:49,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815952389] [2021-06-10 11:38:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:49,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:49,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:49,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815952389] [2021-06-10 11:38:49,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:49,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:49,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099195432] [2021-06-10 11:38:49,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:49,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:49,300 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:49,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 643 transitions, 1577 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:49,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:49,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:49,521 INFO L129 PetriNetUnfolder]: 29/776 cut-off events. [2021-06-10 11:38:49,522 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:49,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 776 events. 29/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3365 event pairs, 0 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 963. Up to 27 conditions per place. [2021-06-10 11:38:49,557 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/645 dead transitions. [2021-06-10 11:38:49,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 645 transitions, 1607 flow [2021-06-10 11:38:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:49,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:49,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:49,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:49,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:49,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:49,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,561 INFO L185 Difference]: Start difference. First operand has 731 places, 643 transitions, 1577 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:49,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 645 transitions, 1607 flow [2021-06-10 11:38:49,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 645 transitions, 1606 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:49,567 INFO L241 Difference]: Finished difference. Result has 734 places, 645 transitions, 1600 flow [2021-06-10 11:38:49,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1600, PETRI_PLACES=734, PETRI_TRANSITIONS=645} [2021-06-10 11:38:49,567 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 37 predicate places. [2021-06-10 11:38:49,567 INFO L480 AbstractCegarLoop]: Abstraction has has 734 places, 645 transitions, 1600 flow [2021-06-10 11:38:49,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:49,567 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:49,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2021-06-10 11:38:49,567 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1739965805, now seen corresponding path program 1 times [2021-06-10 11:38:49,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:49,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885191690] [2021-06-10 11:38:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:49,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:49,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:49,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885191690] [2021-06-10 11:38:49,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:49,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:49,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775691092] [2021-06-10 11:38:49,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:49,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:49,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:49,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 645 transitions, 1600 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:49,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:49,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:49,798 INFO L129 PetriNetUnfolder]: 27/777 cut-off events. [2021-06-10 11:38:49,798 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:49,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 777 events. 27/777 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3389 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 963. Up to 27 conditions per place. [2021-06-10 11:38:49,832 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 6 selfloop transitions, 1 changer transitions 0/645 dead transitions. [2021-06-10 11:38:49,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 645 transitions, 1612 flow [2021-06-10 11:38:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:49,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:49,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:49,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:49,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:49,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:49,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,835 INFO L185 Difference]: Start difference. First operand has 734 places, 645 transitions, 1600 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:49,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 645 transitions, 1612 flow [2021-06-10 11:38:49,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 645 transitions, 1607 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:49,841 INFO L241 Difference]: Finished difference. Result has 736 places, 644 transitions, 1596 flow [2021-06-10 11:38:49,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1596, PETRI_PLACES=736, PETRI_TRANSITIONS=644} [2021-06-10 11:38:49,842 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 39 predicate places. [2021-06-10 11:38:49,842 INFO L480 AbstractCegarLoop]: Abstraction has has 736 places, 644 transitions, 1596 flow [2021-06-10 11:38:49,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:49,842 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:49,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2021-06-10 11:38:49,842 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1739013516, now seen corresponding path program 1 times [2021-06-10 11:38:49,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:49,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059612747] [2021-06-10 11:38:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:49,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:49,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:49,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:49,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059612747] [2021-06-10 11:38:49,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:49,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:49,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389264356] [2021-06-10 11:38:49,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:49,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:49,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:49,861 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 644 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:49,861 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:49,861 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:49,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:50,097 INFO L129 PetriNetUnfolder]: 27/770 cut-off events. [2021-06-10 11:38:50,097 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:50,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 770 events. 27/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3326 event pairs, 0 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 957. Up to 27 conditions per place. [2021-06-10 11:38:50,125 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/642 dead transitions. [2021-06-10 11:38:50,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 642 transitions, 1599 flow [2021-06-10 11:38:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:50,126 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:50,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:50,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:50,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:50,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:50,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,128 INFO L185 Difference]: Start difference. First operand has 736 places, 644 transitions, 1596 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:50,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 642 transitions, 1599 flow [2021-06-10 11:38:50,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 642 transitions, 1592 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:50,134 INFO L241 Difference]: Finished difference. Result has 736 places, 642 transitions, 1585 flow [2021-06-10 11:38:50,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1585, PETRI_PLACES=736, PETRI_TRANSITIONS=642} [2021-06-10 11:38:50,134 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 39 predicate places. [2021-06-10 11:38:50,134 INFO L480 AbstractCegarLoop]: Abstraction has has 736 places, 642 transitions, 1585 flow [2021-06-10 11:38:50,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:50,134 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:50,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2021-06-10 11:38:50,134 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:50,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1739012493, now seen corresponding path program 1 times [2021-06-10 11:38:50,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:50,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030211784] [2021-06-10 11:38:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:50,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:50,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:38:50,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030211784] [2021-06-10 11:38:50,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:50,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:50,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775709568] [2021-06-10 11:38:50,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:50,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:50,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:50,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 642 transitions, 1585 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:50,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:50,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:50,367 INFO L129 PetriNetUnfolder]: 27/768 cut-off events. [2021-06-10 11:38:50,367 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:50,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 768 events. 27/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3313 event pairs, 0 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 957. Up to 27 conditions per place. [2021-06-10 11:38:50,402 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2021-06-10 11:38:50,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 640 transitions, 1598 flow [2021-06-10 11:38:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:50,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:50,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:50,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:50,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:50,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:50,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,406 INFO L185 Difference]: Start difference. First operand has 736 places, 642 transitions, 1585 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:50,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 640 transitions, 1598 flow [2021-06-10 11:38:50,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 640 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:50,412 INFO L241 Difference]: Finished difference. Result has 735 places, 640 transitions, 1581 flow [2021-06-10 11:38:50,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1581, PETRI_PLACES=735, PETRI_TRANSITIONS=640} [2021-06-10 11:38:50,412 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 38 predicate places. [2021-06-10 11:38:50,412 INFO L480 AbstractCegarLoop]: Abstraction has has 735 places, 640 transitions, 1581 flow [2021-06-10 11:38:50,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:50,413 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:50,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2021-06-10 11:38:50,413 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1339500776, now seen corresponding path program 1 times [2021-06-10 11:38:50,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:50,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520862060] [2021-06-10 11:38:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:50,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:50,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:50,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520862060] [2021-06-10 11:38:50,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:50,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:50,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342701465] [2021-06-10 11:38:50,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:50,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:50,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:50,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 640 transitions, 1581 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:50,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:50,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:50,651 INFO L129 PetriNetUnfolder]: 25/773 cut-off events. [2021-06-10 11:38:50,651 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:50,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 773 events. 25/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3364 event pairs, 0 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 960. Up to 27 conditions per place. [2021-06-10 11:38:50,686 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/641 dead transitions. [2021-06-10 11:38:50,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 641 transitions, 1597 flow [2021-06-10 11:38:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:50,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:50,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:50,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:50,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:50,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:50,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,689 INFO L185 Difference]: Start difference. First operand has 735 places, 640 transitions, 1581 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:50,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 641 transitions, 1597 flow [2021-06-10 11:38:50,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 641 transitions, 1596 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:50,695 INFO L241 Difference]: Finished difference. Result has 738 places, 641 transitions, 1594 flow [2021-06-10 11:38:50,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=738, PETRI_TRANSITIONS=641} [2021-06-10 11:38:50,695 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 41 predicate places. [2021-06-10 11:38:50,695 INFO L480 AbstractCegarLoop]: Abstraction has has 738 places, 641 transitions, 1594 flow [2021-06-10 11:38:50,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,695 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:50,695 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:50,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2021-06-10 11:38:50,695 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1339501799, now seen corresponding path program 1 times [2021-06-10 11:38:50,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:50,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689842308] [2021-06-10 11:38:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:50,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:50,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:50,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:50,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689842308] [2021-06-10 11:38:50,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:50,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:50,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470061634] [2021-06-10 11:38:50,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:50,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:50,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:50,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 641 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:50,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:50,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:50,941 INFO L129 PetriNetUnfolder]: 25/774 cut-off events. [2021-06-10 11:38:50,941 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:50,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 774 events. 25/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3372 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 968. Up to 27 conditions per place. [2021-06-10 11:38:50,977 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/642 dead transitions. [2021-06-10 11:38:50,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 642 transitions, 1620 flow [2021-06-10 11:38:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:50,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:50,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:50,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:50,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:50,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:50,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,980 INFO L185 Difference]: Start difference. First operand has 738 places, 641 transitions, 1594 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 740 places, 642 transitions, 1620 flow [2021-06-10 11:38:50,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 739 places, 642 transitions, 1618 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:50,986 INFO L241 Difference]: Finished difference. Result has 741 places, 642 transitions, 1610 flow [2021-06-10 11:38:50,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=741, PETRI_TRANSITIONS=642} [2021-06-10 11:38:50,987 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 44 predicate places. [2021-06-10 11:38:50,987 INFO L480 AbstractCegarLoop]: Abstraction has has 741 places, 642 transitions, 1610 flow [2021-06-10 11:38:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:50,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:50,987 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:50,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2021-06-10 11:38:50,987 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1338547464, now seen corresponding path program 1 times [2021-06-10 11:38:50,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:50,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124592076] [2021-06-10 11:38:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:51,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:51,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:51,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124592076] [2021-06-10 11:38:51,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:51,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:51,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354473660] [2021-06-10 11:38:51,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:51,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:51,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:51,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 642 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:51,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:51,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:51,227 INFO L129 PetriNetUnfolder]: 24/771 cut-off events. [2021-06-10 11:38:51,227 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:51,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 771 events. 24/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3353 event pairs, 0 based on Foata normal form. 2/723 useless extension candidates. Maximal degree in co-relation 967. Up to 27 conditions per place. [2021-06-10 11:38:51,263 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/640 dead transitions. [2021-06-10 11:38:51,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 640 transitions, 1618 flow [2021-06-10 11:38:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:51,264 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:51,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:51,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:51,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:51,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:51,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,266 INFO L185 Difference]: Start difference. First operand has 741 places, 642 transitions, 1610 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:51,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 640 transitions, 1618 flow [2021-06-10 11:38:51,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 640 transitions, 1617 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:51,272 INFO L241 Difference]: Finished difference. Result has 742 places, 640 transitions, 1599 flow [2021-06-10 11:38:51,272 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1599, PETRI_PLACES=742, PETRI_TRANSITIONS=640} [2021-06-10 11:38:51,272 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 45 predicate places. [2021-06-10 11:38:51,273 INFO L480 AbstractCegarLoop]: Abstraction has has 742 places, 640 transitions, 1599 flow [2021-06-10 11:38:51,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,273 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:51,273 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:51,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2021-06-10 11:38:51,273 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1338548487, now seen corresponding path program 1 times [2021-06-10 11:38:51,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:51,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038315136] [2021-06-10 11:38:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:51,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:51,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:38:51,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038315136] [2021-06-10 11:38:51,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:51,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:51,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001983451] [2021-06-10 11:38:51,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:51,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:51,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:51,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 640 transitions, 1599 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:51,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:51,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:51,508 INFO L129 PetriNetUnfolder]: 24/768 cut-off events. [2021-06-10 11:38:51,508 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:51,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 768 events. 24/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3330 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 961. Up to 27 conditions per place. [2021-06-10 11:38:51,543 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2021-06-10 11:38:51,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 637 transitions, 1600 flow [2021-06-10 11:38:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:51,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:51,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:51,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:51,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:51,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:51,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,547 INFO L185 Difference]: Start difference. First operand has 742 places, 640 transitions, 1599 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:51,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 637 transitions, 1600 flow [2021-06-10 11:38:51,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 739 places, 637 transitions, 1595 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:51,553 INFO L241 Difference]: Finished difference. Result has 739 places, 637 transitions, 1585 flow [2021-06-10 11:38:51,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1585, PETRI_PLACES=739, PETRI_TRANSITIONS=637} [2021-06-10 11:38:51,553 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 42 predicate places. [2021-06-10 11:38:51,553 INFO L480 AbstractCegarLoop]: Abstraction has has 739 places, 637 transitions, 1585 flow [2021-06-10 11:38:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:51,553 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:51,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2021-06-10 11:38:51,553 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1652380251, now seen corresponding path program 1 times [2021-06-10 11:38:51,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:51,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153825557] [2021-06-10 11:38:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:51,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:51,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:51,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153825557] [2021-06-10 11:38:51,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:51,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:51,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345632694] [2021-06-10 11:38:51,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:51,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:51,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:51,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:51,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 637 transitions, 1585 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:51,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:51,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:51,797 INFO L129 PetriNetUnfolder]: 22/773 cut-off events. [2021-06-10 11:38:51,797 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:51,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 773 events. 22/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3381 event pairs, 0 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 969. Up to 27 conditions per place. [2021-06-10 11:38:51,832 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/638 dead transitions. [2021-06-10 11:38:51,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 638 transitions, 1601 flow [2021-06-10 11:38:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:51,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:51,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:51,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:51,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:51,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:51,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,835 INFO L185 Difference]: Start difference. First operand has 739 places, 637 transitions, 1585 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 638 transitions, 1601 flow [2021-06-10 11:38:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 638 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:51,841 INFO L241 Difference]: Finished difference. Result has 742 places, 638 transitions, 1598 flow [2021-06-10 11:38:51,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=742, PETRI_TRANSITIONS=638} [2021-06-10 11:38:51,841 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 45 predicate places. [2021-06-10 11:38:51,841 INFO L480 AbstractCegarLoop]: Abstraction has has 742 places, 638 transitions, 1598 flow [2021-06-10 11:38:51,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:51,841 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:51,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2021-06-10 11:38:51,842 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1652381274, now seen corresponding path program 1 times [2021-06-10 11:38:51,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:51,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798475463] [2021-06-10 11:38:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:51,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:51,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:51,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:51,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798475463] [2021-06-10 11:38:51,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:51,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:51,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123722031] [2021-06-10 11:38:51,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:51,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:51,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:51,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 638 transitions, 1598 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:51,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:51,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:51,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:52,084 INFO L129 PetriNetUnfolder]: 22/774 cut-off events. [2021-06-10 11:38:52,085 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:52,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 774 events. 22/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3387 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 975. Up to 27 conditions per place. [2021-06-10 11:38:52,119 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/639 dead transitions. [2021-06-10 11:38:52,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 639 transitions, 1624 flow [2021-06-10 11:38:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:52,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:52,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:52,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:52,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:52,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:52,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,123 INFO L185 Difference]: Start difference. First operand has 742 places, 638 transitions, 1598 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:52,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 639 transitions, 1624 flow [2021-06-10 11:38:52,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 639 transitions, 1622 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:52,129 INFO L241 Difference]: Finished difference. Result has 745 places, 639 transitions, 1614 flow [2021-06-10 11:38:52,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=745, PETRI_TRANSITIONS=639} [2021-06-10 11:38:52,129 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 48 predicate places. [2021-06-10 11:38:52,129 INFO L480 AbstractCegarLoop]: Abstraction has has 745 places, 639 transitions, 1614 flow [2021-06-10 11:38:52,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:52,130 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:52,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2021-06-10 11:38:52,130 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1651426939, now seen corresponding path program 1 times [2021-06-10 11:38:52,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:52,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445349807] [2021-06-10 11:38:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:52,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:52,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:52,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445349807] [2021-06-10 11:38:52,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:52,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:52,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719705098] [2021-06-10 11:38:52,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:52,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:52,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:52,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 639 transitions, 1614 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:52,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:52,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:52,371 INFO L129 PetriNetUnfolder]: 21/771 cut-off events. [2021-06-10 11:38:52,371 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:52,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 771 events. 21/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3368 event pairs, 0 based on Foata normal form. 2/726 useless extension candidates. Maximal degree in co-relation 974. Up to 27 conditions per place. [2021-06-10 11:38:52,406 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/637 dead transitions. [2021-06-10 11:38:52,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 637 transitions, 1622 flow [2021-06-10 11:38:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:52,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:52,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:52,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:52,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:52,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:52,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,409 INFO L185 Difference]: Start difference. First operand has 745 places, 639 transitions, 1614 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:52,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 637 transitions, 1622 flow [2021-06-10 11:38:52,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 637 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:52,416 INFO L241 Difference]: Finished difference. Result has 746 places, 637 transitions, 1603 flow [2021-06-10 11:38:52,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1603, PETRI_PLACES=746, PETRI_TRANSITIONS=637} [2021-06-10 11:38:52,416 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 49 predicate places. [2021-06-10 11:38:52,416 INFO L480 AbstractCegarLoop]: Abstraction has has 746 places, 637 transitions, 1603 flow [2021-06-10 11:38:52,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:52,417 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:52,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2021-06-10 11:38:52,417 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1651427962, now seen corresponding path program 1 times [2021-06-10 11:38:52,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:52,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823982347] [2021-06-10 11:38:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:52,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:52,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:38:52,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823982347] [2021-06-10 11:38:52,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:52,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:52,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206016352] [2021-06-10 11:38:52,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:52,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:52,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:52,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 637 transitions, 1603 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:52,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:52,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:52,655 INFO L129 PetriNetUnfolder]: 21/768 cut-off events. [2021-06-10 11:38:52,655 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:52,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 768 events. 21/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3347 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 968. Up to 27 conditions per place. [2021-06-10 11:38:52,689 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/634 dead transitions. [2021-06-10 11:38:52,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 634 transitions, 1604 flow [2021-06-10 11:38:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:52,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:52,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:52,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:52,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:52,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:52,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,692 INFO L185 Difference]: Start difference. First operand has 746 places, 637 transitions, 1603 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:52,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 634 transitions, 1604 flow [2021-06-10 11:38:52,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 634 transitions, 1599 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:52,698 INFO L241 Difference]: Finished difference. Result has 743 places, 634 transitions, 1589 flow [2021-06-10 11:38:52,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=743, PETRI_TRANSITIONS=634} [2021-06-10 11:38:52,699 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 46 predicate places. [2021-06-10 11:38:52,699 INFO L480 AbstractCegarLoop]: Abstraction has has 743 places, 634 transitions, 1589 flow [2021-06-10 11:38:52,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:52,699 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:52,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2021-06-10 11:38:52,699 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash -851792716, now seen corresponding path program 1 times [2021-06-10 11:38:52,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:52,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723992548] [2021-06-10 11:38:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:52,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:52,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:52,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:52,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723992548] [2021-06-10 11:38:52,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:52,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:52,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59008882] [2021-06-10 11:38:52,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:52,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:52,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:52,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 634 transitions, 1589 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:52,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:52,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:52,955 INFO L129 PetriNetUnfolder]: 20/776 cut-off events. [2021-06-10 11:38:52,955 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:52,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 776 events. 20/776 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3416 event pairs, 0 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 985. Up to 27 conditions per place. [2021-06-10 11:38:52,989 INFO L132 encePairwiseOnDemand]: 744/749 looper letters, 10 selfloop transitions, 3 changer transitions 0/636 dead transitions. [2021-06-10 11:38:52,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 636 transitions, 1619 flow [2021-06-10 11:38:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2067 transitions. [2021-06-10 11:38:52,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198931909212283 [2021-06-10 11:38:52,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2067 transitions. [2021-06-10 11:38:52,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2067 transitions. [2021-06-10 11:38:52,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:52,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2067 transitions. [2021-06-10 11:38:52,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 689.0) internal successors, (2067), 3 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,992 INFO L185 Difference]: Start difference. First operand has 743 places, 634 transitions, 1589 flow. Second operand 3 states and 2067 transitions. [2021-06-10 11:38:52,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 636 transitions, 1619 flow [2021-06-10 11:38:52,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 636 transitions, 1618 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:52,998 INFO L241 Difference]: Finished difference. Result has 746 places, 636 transitions, 1612 flow [2021-06-10 11:38:52,998 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=746, PETRI_TRANSITIONS=636} [2021-06-10 11:38:52,998 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 49 predicate places. [2021-06-10 11:38:52,999 INFO L480 AbstractCegarLoop]: Abstraction has has 746 places, 636 transitions, 1612 flow [2021-06-10 11:38:52,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:52,999 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:52,999 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:52,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2021-06-10 11:38:52,999 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -851791693, now seen corresponding path program 1 times [2021-06-10 11:38:52,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:52,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018199414] [2021-06-10 11:38:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:53,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:53,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:53,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018199414] [2021-06-10 11:38:53,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:53,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:53,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293168306] [2021-06-10 11:38:53,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:53,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:53,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:53,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 636 transitions, 1612 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:53,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:53,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:53,255 INFO L129 PetriNetUnfolder]: 19/774 cut-off events. [2021-06-10 11:38:53,255 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:53,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 774 events. 19/774 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3406 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 980. Up to 27 conditions per place. [2021-06-10 11:38:53,281 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2021-06-10 11:38:53,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 636 transitions, 1624 flow [2021-06-10 11:38:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:53,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:53,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:53,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:53,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:53,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:53,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,284 INFO L185 Difference]: Start difference. First operand has 746 places, 636 transitions, 1612 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 636 transitions, 1624 flow [2021-06-10 11:38:53,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 636 transitions, 1619 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:53,290 INFO L241 Difference]: Finished difference. Result has 749 places, 636 transitions, 1617 flow [2021-06-10 11:38:53,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1617, PETRI_PLACES=749, PETRI_TRANSITIONS=636} [2021-06-10 11:38:53,290 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 52 predicate places. [2021-06-10 11:38:53,290 INFO L480 AbstractCegarLoop]: Abstraction has has 749 places, 636 transitions, 1617 flow [2021-06-10 11:38:53,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:53,290 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:53,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2021-06-10 11:38:53,291 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash -850839404, now seen corresponding path program 1 times [2021-06-10 11:38:53,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:53,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843355432] [2021-06-10 11:38:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:53,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:53,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:53,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843355432] [2021-06-10 11:38:53,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:53,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:53,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715084032] [2021-06-10 11:38:53,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:53,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:53,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:53,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 636 transitions, 1617 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:53,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:53,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:53,536 INFO L129 PetriNetUnfolder]: 18/770 cut-off events. [2021-06-10 11:38:53,536 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:53,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 770 events. 18/770 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3378 event pairs, 0 based on Foata normal form. 1/728 useless extension candidates. Maximal degree in co-relation 977. Up to 27 conditions per place. [2021-06-10 11:38:53,571 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/633 dead transitions. [2021-06-10 11:38:53,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 633 transitions, 1614 flow [2021-06-10 11:38:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:53,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:53,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:53,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:53,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:53,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:53,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,575 INFO L185 Difference]: Start difference. First operand has 749 places, 636 transitions, 1617 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:53,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 633 transitions, 1614 flow [2021-06-10 11:38:53,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 633 transitions, 1607 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:53,581 INFO L241 Difference]: Finished difference. Result has 748 places, 633 transitions, 1597 flow [2021-06-10 11:38:53,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=748, PETRI_TRANSITIONS=633} [2021-06-10 11:38:53,581 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 51 predicate places. [2021-06-10 11:38:53,581 INFO L480 AbstractCegarLoop]: Abstraction has has 748 places, 633 transitions, 1597 flow [2021-06-10 11:38:53,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:53,581 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:53,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2021-06-10 11:38:53,582 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -850838381, now seen corresponding path program 1 times [2021-06-10 11:38:53,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:53,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164109640] [2021-06-10 11:38:53,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:53,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:53,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:38:53,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164109640] [2021-06-10 11:38:53,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:53,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:53,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786576951] [2021-06-10 11:38:53,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:53,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:53,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:53,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:53,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 633 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:53,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:53,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:53,821 INFO L129 PetriNetUnfolder]: 18/768 cut-off events. [2021-06-10 11:38:53,822 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:53,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 768 events. 18/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3364 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 978. Up to 27 conditions per place. [2021-06-10 11:38:53,856 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/631 dead transitions. [2021-06-10 11:38:53,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 631 transitions, 1610 flow [2021-06-10 11:38:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:53,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:53,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:53,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:53,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:53,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:53,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,859 INFO L185 Difference]: Start difference. First operand has 748 places, 633 transitions, 1597 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 631 transitions, 1610 flow [2021-06-10 11:38:53,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 631 transitions, 1609 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:53,865 INFO L241 Difference]: Finished difference. Result has 747 places, 631 transitions, 1593 flow [2021-06-10 11:38:53,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1593, PETRI_PLACES=747, PETRI_TRANSITIONS=631} [2021-06-10 11:38:53,865 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 50 predicate places. [2021-06-10 11:38:53,865 INFO L480 AbstractCegarLoop]: Abstraction has has 747 places, 631 transitions, 1593 flow [2021-06-10 11:38:53,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:53,866 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:53,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2021-06-10 11:38:53,866 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -938406718, now seen corresponding path program 1 times [2021-06-10 11:38:53,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:53,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130355870] [2021-06-10 11:38:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:53,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:53,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:53,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:53,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130355870] [2021-06-10 11:38:53,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:53,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:53,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748711782] [2021-06-10 11:38:53,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:53,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:53,885 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:53,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 631 transitions, 1593 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:53,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:53,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:53,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:54,114 INFO L129 PetriNetUnfolder]: 16/773 cut-off events. [2021-06-10 11:38:54,115 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:54,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 773 events. 16/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3415 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 981. Up to 27 conditions per place. [2021-06-10 11:38:54,150 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/632 dead transitions. [2021-06-10 11:38:54,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 632 transitions, 1609 flow [2021-06-10 11:38:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:54,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:54,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:54,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:54,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:54,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:54,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,154 INFO L185 Difference]: Start difference. First operand has 747 places, 631 transitions, 1593 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:54,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 632 transitions, 1609 flow [2021-06-10 11:38:54,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 632 transitions, 1608 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:54,160 INFO L241 Difference]: Finished difference. Result has 750 places, 632 transitions, 1606 flow [2021-06-10 11:38:54,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=750, PETRI_TRANSITIONS=632} [2021-06-10 11:38:54,161 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 53 predicate places. [2021-06-10 11:38:54,161 INFO L480 AbstractCegarLoop]: Abstraction has has 750 places, 632 transitions, 1606 flow [2021-06-10 11:38:54,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:54,161 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:54,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2021-06-10 11:38:54,161 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash -938407741, now seen corresponding path program 1 times [2021-06-10 11:38:54,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:54,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731426303] [2021-06-10 11:38:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:54,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:54,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:54,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731426303] [2021-06-10 11:38:54,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:54,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:54,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611312744] [2021-06-10 11:38:54,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:54,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:54,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:54,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 632 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:54,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:54,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:54,416 INFO L129 PetriNetUnfolder]: 16/774 cut-off events. [2021-06-10 11:38:54,416 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:54,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 774 events. 16/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3421 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 989. Up to 27 conditions per place. [2021-06-10 11:38:54,451 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/633 dead transitions. [2021-06-10 11:38:54,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 633 transitions, 1632 flow [2021-06-10 11:38:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:54,452 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:54,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:54,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:54,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:54,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:54,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,454 INFO L185 Difference]: Start difference. First operand has 750 places, 632 transitions, 1606 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 633 transitions, 1632 flow [2021-06-10 11:38:54,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 633 transitions, 1630 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:54,460 INFO L241 Difference]: Finished difference. Result has 753 places, 633 transitions, 1622 flow [2021-06-10 11:38:54,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1622, PETRI_PLACES=753, PETRI_TRANSITIONS=633} [2021-06-10 11:38:54,461 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 56 predicate places. [2021-06-10 11:38:54,461 INFO L480 AbstractCegarLoop]: Abstraction has has 753 places, 633 transitions, 1622 flow [2021-06-10 11:38:54,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:54,461 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:54,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2021-06-10 11:38:54,461 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -937454429, now seen corresponding path program 1 times [2021-06-10 11:38:54,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:54,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230150093] [2021-06-10 11:38:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:54,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:54,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:54,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230150093] [2021-06-10 11:38:54,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:54,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:54,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563543777] [2021-06-10 11:38:54,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:54,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:54,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:54,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 633 transitions, 1622 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:54,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:54,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:54,702 INFO L129 PetriNetUnfolder]: 15/770 cut-off events. [2021-06-10 11:38:54,702 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:54,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 770 events. 15/770 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3396 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 982. Up to 27 conditions per place. [2021-06-10 11:38:54,737 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/630 dead transitions. [2021-06-10 11:38:54,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 630 transitions, 1619 flow [2021-06-10 11:38:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:54,738 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:54,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:54,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:54,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:54,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:54,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,740 INFO L185 Difference]: Start difference. First operand has 753 places, 633 transitions, 1622 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:54,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 630 transitions, 1619 flow [2021-06-10 11:38:54,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 630 transitions, 1611 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:54,746 INFO L241 Difference]: Finished difference. Result has 752 places, 630 transitions, 1601 flow [2021-06-10 11:38:54,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1601, PETRI_PLACES=752, PETRI_TRANSITIONS=630} [2021-06-10 11:38:54,747 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 55 predicate places. [2021-06-10 11:38:54,747 INFO L480 AbstractCegarLoop]: Abstraction has has 752 places, 630 transitions, 1601 flow [2021-06-10 11:38:54,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,747 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:54,747 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:54,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2021-06-10 11:38:54,747 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash -937453406, now seen corresponding path program 1 times [2021-06-10 11:38:54,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:54,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881944603] [2021-06-10 11:38:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:54,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:54,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:54,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:38:54,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881944603] [2021-06-10 11:38:54,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:54,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:54,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570202637] [2021-06-10 11:38:54,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:54,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:54,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:54,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 630 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:54,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:54,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:54,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:54,993 INFO L129 PetriNetUnfolder]: 15/768 cut-off events. [2021-06-10 11:38:54,993 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:55,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 768 events. 15/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3381 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 985. Up to 27 conditions per place. [2021-06-10 11:38:55,026 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 8 selfloop transitions, 1 changer transitions 0/628 dead transitions. [2021-06-10 11:38:55,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 628 transitions, 1614 flow [2021-06-10 11:38:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2062 transitions. [2021-06-10 11:38:55,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9176680017801513 [2021-06-10 11:38:55,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2062 transitions. [2021-06-10 11:38:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2062 transitions. [2021-06-10 11:38:55,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:55,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2062 transitions. [2021-06-10 11:38:55,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 687.3333333333334) internal successors, (2062), 3 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,030 INFO L185 Difference]: Start difference. First operand has 752 places, 630 transitions, 1601 flow. Second operand 3 states and 2062 transitions. [2021-06-10 11:38:55,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 628 transitions, 1614 flow [2021-06-10 11:38:55,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 628 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:55,036 INFO L241 Difference]: Finished difference. Result has 751 places, 628 transitions, 1597 flow [2021-06-10 11:38:55,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=751, PETRI_TRANSITIONS=628} [2021-06-10 11:38:55,036 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 54 predicate places. [2021-06-10 11:38:55,036 INFO L480 AbstractCegarLoop]: Abstraction has has 751 places, 628 transitions, 1597 flow [2021-06-10 11:38:55,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,036 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:55,036 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:55,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2021-06-10 11:38:55,036 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1139715154, now seen corresponding path program 1 times [2021-06-10 11:38:55,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:55,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364795899] [2021-06-10 11:38:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:55,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:55,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:38:55,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364795899] [2021-06-10 11:38:55,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:55,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:55,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194152828] [2021-06-10 11:38:55,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:55,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:55,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:55,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:55,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 628 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:55,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:55,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:55,276 INFO L129 PetriNetUnfolder]: 13/773 cut-off events. [2021-06-10 11:38:55,277 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:55,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 773 events. 13/773 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3431 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 988. Up to 27 conditions per place. [2021-06-10 11:38:55,312 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 5 selfloop transitions, 2 changer transitions 0/629 dead transitions. [2021-06-10 11:38:55,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 629 transitions, 1613 flow [2021-06-10 11:38:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2075 transitions. [2021-06-10 11:38:55,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9234534935469515 [2021-06-10 11:38:55,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2075 transitions. [2021-06-10 11:38:55,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2075 transitions. [2021-06-10 11:38:55,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:55,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2075 transitions. [2021-06-10 11:38:55,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.6666666666666) internal successors, (2075), 3 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,315 INFO L185 Difference]: Start difference. First operand has 751 places, 628 transitions, 1597 flow. Second operand 3 states and 2075 transitions. [2021-06-10 11:38:55,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 629 transitions, 1613 flow [2021-06-10 11:38:55,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 629 transitions, 1612 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:55,321 INFO L241 Difference]: Finished difference. Result has 754 places, 629 transitions, 1610 flow [2021-06-10 11:38:55,322 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=754, PETRI_TRANSITIONS=629} [2021-06-10 11:38:55,322 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 57 predicate places. [2021-06-10 11:38:55,322 INFO L480 AbstractCegarLoop]: Abstraction has has 754 places, 629 transitions, 1610 flow [2021-06-10 11:38:55,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:55,322 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:55,322 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2021-06-10 11:38:55,322 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:55,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1139714131, now seen corresponding path program 1 times [2021-06-10 11:38:55,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:55,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334728623] [2021-06-10 11:38:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:55,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:55,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:38:55,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334728623] [2021-06-10 11:38:55,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:55,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:55,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807663089] [2021-06-10 11:38:55,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:55,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:55,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:55,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 629 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:55,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:55,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:55,575 INFO L129 PetriNetUnfolder]: 13/774 cut-off events. [2021-06-10 11:38:55,575 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:55,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 774 events. 13/774 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3438 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 996. Up to 27 conditions per place. [2021-06-10 11:38:55,610 INFO L132 encePairwiseOnDemand]: 745/749 looper letters, 9 selfloop transitions, 3 changer transitions 0/630 dead transitions. [2021-06-10 11:38:55,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 630 transitions, 1636 flow [2021-06-10 11:38:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2065 transitions. [2021-06-10 11:38:55,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2021-06-10 11:38:55,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2065 transitions. [2021-06-10 11:38:55,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2065 transitions. [2021-06-10 11:38:55,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:55,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2065 transitions. [2021-06-10 11:38:55,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.3333333333334) internal successors, (2065), 3 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,613 INFO L185 Difference]: Start difference. First operand has 754 places, 629 transitions, 1610 flow. Second operand 3 states and 2065 transitions. [2021-06-10 11:38:55,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 630 transitions, 1636 flow [2021-06-10 11:38:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 755 places, 630 transitions, 1634 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:55,620 INFO L241 Difference]: Finished difference. Result has 757 places, 630 transitions, 1626 flow [2021-06-10 11:38:55,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=753, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1626, PETRI_PLACES=757, PETRI_TRANSITIONS=630} [2021-06-10 11:38:55,620 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 60 predicate places. [2021-06-10 11:38:55,620 INFO L480 AbstractCegarLoop]: Abstraction has has 757 places, 630 transitions, 1626 flow [2021-06-10 11:38:55,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:55,620 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:55,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2021-06-10 11:38:55,620 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1140668466, now seen corresponding path program 1 times [2021-06-10 11:38:55,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:55,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015648982] [2021-06-10 11:38:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:55,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:55,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:38:55,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015648982] [2021-06-10 11:38:55,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:55,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:55,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227053269] [2021-06-10 11:38:55,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:55,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:55,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 684 out of 749 [2021-06-10 11:38:55,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 630 transitions, 1626 flow. Second operand has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:55,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 684 of 749 [2021-06-10 11:38:55,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:55,871 INFO L129 PetriNetUnfolder]: 12/771 cut-off events. [2021-06-10 11:38:55,871 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:38:55,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 771 events. 12/771 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3422 event pairs, 0 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 995. Up to 27 conditions per place. [2021-06-10 11:38:55,905 INFO L132 encePairwiseOnDemand]: 746/749 looper letters, 9 selfloop transitions, 1 changer transitions 0/628 dead transitions. [2021-06-10 11:38:55,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 628 transitions, 1634 flow [2021-06-10 11:38:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2064 transitions. [2021-06-10 11:38:55,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185580774365821 [2021-06-10 11:38:55,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2064 transitions. [2021-06-10 11:38:55,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2064 transitions. [2021-06-10 11:38:55,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:55,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2064 transitions. [2021-06-10 11:38:55,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,909 INFO L185 Difference]: Start difference. First operand has 757 places, 630 transitions, 1626 flow. Second operand 3 states and 2064 transitions. [2021-06-10 11:38:55,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 628 transitions, 1634 flow [2021-06-10 11:38:55,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 628 transitions, 1633 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:55,915 INFO L241 Difference]: Finished difference. Result has 758 places, 628 transitions, 1615 flow [2021-06-10 11:38:55,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=758, PETRI_TRANSITIONS=628} [2021-06-10 11:38:55,915 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 61 predicate places. [2021-06-10 11:38:55,915 INFO L480 AbstractCegarLoop]: Abstraction has has 758 places, 628 transitions, 1615 flow [2021-06-10 11:38:55,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 686.3333333333334) internal successors, (2059), 3 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,915 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:55,915 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:55,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2021-06-10 11:38:55,915 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1140667443, now seen corresponding path program 1 times [2021-06-10 11:38:55,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:55,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676702540] [2021-06-10 11:38:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:55,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:55,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:55,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:38:55,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676702540] [2021-06-10 11:38:55,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:55,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:55,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574013211] [2021-06-10 11:38:55,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:55,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:55,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:55,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 749 [2021-06-10 11:38:55,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 628 transitions, 1615 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:55,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:55,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 749 [2021-06-10 11:38:55,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:56,154 INFO L129 PetriNetUnfolder]: 12/768 cut-off events. [2021-06-10 11:38:56,154 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:56,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 768 events. 12/768 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 989. Up to 27 conditions per place. [2021-06-10 11:38:56,188 INFO L132 encePairwiseOnDemand]: 747/749 looper letters, 5 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2021-06-10 11:38:56,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 625 transitions, 1616 flow [2021-06-10 11:38:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2074 transitions. [2021-06-10 11:38:56,189 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9230084557187361 [2021-06-10 11:38:56,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2074 transitions. [2021-06-10 11:38:56,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2074 transitions. [2021-06-10 11:38:56,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:56,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2074 transitions. [2021-06-10 11:38:56,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 691.3333333333334) internal successors, (2074), 3 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 749.0) internal successors, (2996), 4 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,191 INFO L185 Difference]: Start difference. First operand has 758 places, 628 transitions, 1615 flow. Second operand 3 states and 2074 transitions. [2021-06-10 11:38:56,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 625 transitions, 1616 flow [2021-06-10 11:38:56,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 755 places, 625 transitions, 1611 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:56,198 INFO L241 Difference]: Finished difference. Result has 755 places, 625 transitions, 1601 flow [2021-06-10 11:38:56,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=749, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=753, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1601, PETRI_PLACES=755, PETRI_TRANSITIONS=625} [2021-06-10 11:38:56,198 INFO L343 CegarLoopForPetriNet]: 697 programPoint places, 58 predicate places. [2021-06-10 11:38:56,198 INFO L480 AbstractCegarLoop]: Abstraction has has 755 places, 625 transitions, 1601 flow [2021-06-10 11:38:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,198 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:56,198 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:56,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2021-06-10 11:38:56,198 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1763107019, now seen corresponding path program 1 times [2021-06-10 11:38:56,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:56,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083797684] [2021-06-10 11:38:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:56,212 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:38:56,218 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:38:56,232 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:38:56,232 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:38:56,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2021-06-10 11:38:56,233 WARN L342 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:38:56,233 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2021-06-10 11:38:56,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of27ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of27ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:38:56,363 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:38:56,363 INFO L253 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-06-10 11:38:56,364 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:38:56,364 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:38:56,364 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:38:56,364 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:38:56,364 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:38:56,364 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:38:56,364 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:38:56,364 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:38:56,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 723 places, 777 transitions, 2391 flow [2021-06-10 11:38:56,632 INFO L129 PetriNetUnfolder]: 136/1019 cut-off events. [2021-06-10 11:38:56,632 INFO L130 PetriNetUnfolder]: For 3627/3627 co-relation queries the response was YES. [2021-06-10 11:38:56,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 1019 events. 136/1019 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4298 event pairs, 0 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1402. Up to 56 conditions per place. [2021-06-10 11:38:56,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 723 places, 777 transitions, 2391 flow [2021-06-10 11:38:56,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 723 places, 777 transitions, 2391 flow [2021-06-10 11:38:56,705 INFO L129 PetriNetUnfolder]: 9/102 cut-off events. [2021-06-10 11:38:56,705 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:38:56,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:56,705 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-06-10 11:38:56,705 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash 199923279, now seen corresponding path program 1 times [2021-06-10 11:38:56,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:56,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622208059] [2021-06-10 11:38:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:56,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:56,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:56,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:56,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:56,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:56,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:56,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622208059] [2021-06-10 11:38:56,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:56,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:56,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685481472] [2021-06-10 11:38:56,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:56,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:56,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:56,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 777 transitions, 2391 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:56,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:56,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:56,927 INFO L129 PetriNetUnfolder]: 79/802 cut-off events. [2021-06-10 11:38:56,927 INFO L130 PetriNetUnfolder]: For 3628/3628 co-relation queries the response was YES. [2021-06-10 11:38:56,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 802 events. 79/802 cut-off events. For 3628/3628 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3189 event pairs, 0 based on Foata normal form. 110/804 useless extension candidates. Maximal degree in co-relation 1197. Up to 28 conditions per place. [2021-06-10 11:38:56,974 INFO L132 encePairwiseOnDemand]: 745/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2021-06-10 11:38:56,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 718 transitions, 2287 flow [2021-06-10 11:38:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2211 transitions. [2021-06-10 11:38:56,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9485199485199485 [2021-06-10 11:38:56,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2211 transitions. [2021-06-10 11:38:56,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2211 transitions. [2021-06-10 11:38:56,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:56,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2211 transitions. [2021-06-10 11:38:56,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,977 INFO L185 Difference]: Start difference. First operand has 723 places, 777 transitions, 2391 flow. Second operand 3 states and 2211 transitions. [2021-06-10 11:38:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 718 transitions, 2287 flow [2021-06-10 11:38:56,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 718 transitions, 1585 flow, removed 351 selfloop flow, removed 0 redundant places. [2021-06-10 11:38:56,987 INFO L241 Difference]: Finished difference. Result has 695 places, 718 transitions, 1583 flow [2021-06-10 11:38:56,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1583, PETRI_PLACES=695, PETRI_TRANSITIONS=718} [2021-06-10 11:38:56,987 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -28 predicate places. [2021-06-10 11:38:56,987 INFO L480 AbstractCegarLoop]: Abstraction has has 695 places, 718 transitions, 1583 flow [2021-06-10 11:38:56,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:56,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:56,987 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-06-10 11:38:56,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2021-06-10 11:38:56,987 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 199922256, now seen corresponding path program 1 times [2021-06-10 11:38:56,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:56,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276867549] [2021-06-10 11:38:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:56,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:56,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:56,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:56,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:57,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:57,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276867549] [2021-06-10 11:38:57,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:57,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:57,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358446672] [2021-06-10 11:38:57,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:57,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:57,003 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:57,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 718 transitions, 1583 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:57,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:57,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:57,196 INFO L129 PetriNetUnfolder]: 79/803 cut-off events. [2021-06-10 11:38:57,197 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:38:57,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 803 events. 79/803 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3197 event pairs, 0 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 884. Up to 28 conditions per place. [2021-06-10 11:38:57,240 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/719 dead transitions. [2021-06-10 11:38:57,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 719 transitions, 1609 flow [2021-06-10 11:38:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:38:57,242 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:38:57,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:38:57,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:38:57,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:57,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:38:57,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,244 INFO L185 Difference]: Start difference. First operand has 695 places, 718 transitions, 1583 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:38:57,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 719 transitions, 1609 flow [2021-06-10 11:38:57,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 719 transitions, 1607 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:57,250 INFO L241 Difference]: Finished difference. Result has 698 places, 719 transitions, 1599 flow [2021-06-10 11:38:57,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1599, PETRI_PLACES=698, PETRI_TRANSITIONS=719} [2021-06-10 11:38:57,251 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -25 predicate places. [2021-06-10 11:38:57,251 INFO L480 AbstractCegarLoop]: Abstraction has has 698 places, 719 transitions, 1599 flow [2021-06-10 11:38:57,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,251 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:57,251 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-06-10 11:38:57,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2021-06-10 11:38:57,251 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash 200875568, now seen corresponding path program 1 times [2021-06-10 11:38:57,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:57,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947212406] [2021-06-10 11:38:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:57,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:57,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:57,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947212406] [2021-06-10 11:38:57,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:57,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:57,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867563758] [2021-06-10 11:38:57,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:57,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:57,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:57,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 719 transitions, 1599 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:57,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:57,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:57,455 INFO L129 PetriNetUnfolder]: 78/799 cut-off events. [2021-06-10 11:38:57,455 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:38:57,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 799 events. 78/799 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3173 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 876. Up to 28 conditions per place. [2021-06-10 11:38:57,495 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/716 dead transitions. [2021-06-10 11:38:57,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 716 transitions, 1596 flow [2021-06-10 11:38:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:38:57,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:38:57,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:38:57,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:38:57,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:57,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:38:57,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,499 INFO L185 Difference]: Start difference. First operand has 698 places, 719 transitions, 1599 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:38:57,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 716 transitions, 1596 flow [2021-06-10 11:38:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 716 transitions, 1588 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:57,505 INFO L241 Difference]: Finished difference. Result has 697 places, 716 transitions, 1578 flow [2021-06-10 11:38:57,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=697, PETRI_TRANSITIONS=716} [2021-06-10 11:38:57,505 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -26 predicate places. [2021-06-10 11:38:57,505 INFO L480 AbstractCegarLoop]: Abstraction has has 697 places, 716 transitions, 1578 flow [2021-06-10 11:38:57,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:57,505 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-06-10 11:38:57,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2021-06-10 11:38:57,505 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 200876591, now seen corresponding path program 1 times [2021-06-10 11:38:57,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:57,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942697420] [2021-06-10 11:38:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:57,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:57,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:38:57,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942697420] [2021-06-10 11:38:57,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:57,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:57,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703259928] [2021-06-10 11:38:57,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:57,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:57,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:57,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:57,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 716 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:57,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:57,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:57,715 INFO L129 PetriNetUnfolder]: 78/797 cut-off events. [2021-06-10 11:38:57,715 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-06-10 11:38:57,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 797 events. 78/797 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3158 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 884. Up to 28 conditions per place. [2021-06-10 11:38:57,758 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/714 dead transitions. [2021-06-10 11:38:57,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 714 transitions, 1591 flow [2021-06-10 11:38:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:38:57,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:38:57,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:38:57,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:38:57,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:57,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:38:57,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,762 INFO L185 Difference]: Start difference. First operand has 697 places, 716 transitions, 1578 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:38:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 714 transitions, 1591 flow [2021-06-10 11:38:57,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 714 transitions, 1590 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:57,768 INFO L241 Difference]: Finished difference. Result has 696 places, 714 transitions, 1574 flow [2021-06-10 11:38:57,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1574, PETRI_PLACES=696, PETRI_TRANSITIONS=714} [2021-06-10 11:38:57,768 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -27 predicate places. [2021-06-10 11:38:57,769 INFO L480 AbstractCegarLoop]: Abstraction has has 696 places, 714 transitions, 1574 flow [2021-06-10 11:38:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:57,769 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:57,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2021-06-10 11:38:57,769 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:57,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:57,769 INFO L82 PathProgramCache]: Analyzing trace with hash -293652057, now seen corresponding path program 1 times [2021-06-10 11:38:57,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:57,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615214251] [2021-06-10 11:38:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:57,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:57,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:57,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:57,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615214251] [2021-06-10 11:38:57,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:57,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:57,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600132925] [2021-06-10 11:38:57,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:57,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:57,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:57,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 714 transitions, 1574 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:57,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:57,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:57,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:57,987 INFO L129 PetriNetUnfolder]: 77/805 cut-off events. [2021-06-10 11:38:57,988 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:58,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 805 events. 77/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3231 event pairs, 0 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 896. Up to 28 conditions per place. [2021-06-10 11:38:58,030 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/716 dead transitions. [2021-06-10 11:38:58,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 716 transitions, 1604 flow [2021-06-10 11:38:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:38:58,031 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:38:58,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:38:58,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:38:58,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:58,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:38:58,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,033 INFO L185 Difference]: Start difference. First operand has 696 places, 714 transitions, 1574 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:38:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 716 transitions, 1604 flow [2021-06-10 11:38:58,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 716 transitions, 1603 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:58,039 INFO L241 Difference]: Finished difference. Result has 699 places, 716 transitions, 1597 flow [2021-06-10 11:38:58,040 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1597, PETRI_PLACES=699, PETRI_TRANSITIONS=716} [2021-06-10 11:38:58,040 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -24 predicate places. [2021-06-10 11:38:58,040 INFO L480 AbstractCegarLoop]: Abstraction has has 699 places, 716 transitions, 1597 flow [2021-06-10 11:38:58,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:58,040 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:58,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2021-06-10 11:38:58,040 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -293651034, now seen corresponding path program 1 times [2021-06-10 11:38:58,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:58,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687587542] [2021-06-10 11:38:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:58,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:58,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:58,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687587542] [2021-06-10 11:38:58,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:58,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:58,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456478393] [2021-06-10 11:38:58,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:58,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:58,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:58,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 716 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:58,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:58,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:58,256 INFO L129 PetriNetUnfolder]: 76/803 cut-off events. [2021-06-10 11:38:58,256 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:58,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 803 events. 76/803 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3219 event pairs, 0 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 892. Up to 28 conditions per place. [2021-06-10 11:38:58,297 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/716 dead transitions. [2021-06-10 11:38:58,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 716 transitions, 1609 flow [2021-06-10 11:38:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:38:58,298 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:38:58,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:38:58,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:38:58,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:58,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:38:58,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,301 INFO L185 Difference]: Start difference. First operand has 699 places, 716 transitions, 1597 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:38:58,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 716 transitions, 1609 flow [2021-06-10 11:38:58,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 716 transitions, 1604 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:58,306 INFO L241 Difference]: Finished difference. Result has 702 places, 716 transitions, 1602 flow [2021-06-10 11:38:58,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=702, PETRI_TRANSITIONS=716} [2021-06-10 11:38:58,307 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -21 predicate places. [2021-06-10 11:38:58,307 INFO L480 AbstractCegarLoop]: Abstraction has has 702 places, 716 transitions, 1602 flow [2021-06-10 11:38:58,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:58,307 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:58,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2021-06-10 11:38:58,307 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -292698745, now seen corresponding path program 1 times [2021-06-10 11:38:58,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:58,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001151248] [2021-06-10 11:38:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:58,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:58,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:58,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001151248] [2021-06-10 11:38:58,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:58,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:58,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814288289] [2021-06-10 11:38:58,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:58,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:58,323 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:58,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 716 transitions, 1602 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:58,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:58,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:58,520 INFO L129 PetriNetUnfolder]: 75/799 cut-off events. [2021-06-10 11:38:58,520 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:38:58,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 799 events. 75/799 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3194 event pairs, 0 based on Foata normal form. 1/699 useless extension candidates. Maximal degree in co-relation 890. Up to 28 conditions per place. [2021-06-10 11:38:58,560 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/713 dead transitions. [2021-06-10 11:38:58,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 713 transitions, 1599 flow [2021-06-10 11:38:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:38:58,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:38:58,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:38:58,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:38:58,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:58,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:38:58,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,564 INFO L185 Difference]: Start difference. First operand has 702 places, 716 transitions, 1602 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:38:58,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 713 transitions, 1599 flow [2021-06-10 11:38:58,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 713 transitions, 1592 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:58,569 INFO L241 Difference]: Finished difference. Result has 701 places, 713 transitions, 1582 flow [2021-06-10 11:38:58,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1582, PETRI_PLACES=701, PETRI_TRANSITIONS=713} [2021-06-10 11:38:58,570 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -22 predicate places. [2021-06-10 11:38:58,570 INFO L480 AbstractCegarLoop]: Abstraction has has 701 places, 713 transitions, 1582 flow [2021-06-10 11:38:58,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:58,570 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:58,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2021-06-10 11:38:58,570 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash -292697722, now seen corresponding path program 1 times [2021-06-10 11:38:58,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:58,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932511053] [2021-06-10 11:38:58,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:58,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:58,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:38:58,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932511053] [2021-06-10 11:38:58,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:58,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:58,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276928342] [2021-06-10 11:38:58,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:58,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:58,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:58,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 713 transitions, 1582 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:58,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:58,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:58,792 INFO L129 PetriNetUnfolder]: 75/797 cut-off events. [2021-06-10 11:38:58,793 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:58,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 797 events. 75/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3179 event pairs, 0 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 891. Up to 28 conditions per place. [2021-06-10 11:38:58,836 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/711 dead transitions. [2021-06-10 11:38:58,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 711 transitions, 1595 flow [2021-06-10 11:38:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:38:58,837 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:38:58,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:38:58,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:38:58,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:58,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:38:58,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,839 INFO L185 Difference]: Start difference. First operand has 701 places, 713 transitions, 1582 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:38:58,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 711 transitions, 1595 flow [2021-06-10 11:38:58,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 711 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:58,845 INFO L241 Difference]: Finished difference. Result has 700 places, 711 transitions, 1578 flow [2021-06-10 11:38:58,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1578, PETRI_PLACES=700, PETRI_TRANSITIONS=711} [2021-06-10 11:38:58,846 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -23 predicate places. [2021-06-10 11:38:58,846 INFO L480 AbstractCegarLoop]: Abstraction has has 700 places, 711 transitions, 1578 flow [2021-06-10 11:38:58,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:58,846 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:58,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2021-06-10 11:38:58,846 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash -700690561, now seen corresponding path program 1 times [2021-06-10 11:38:58,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:58,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14595530] [2021-06-10 11:38:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:58,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:58,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:58,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:58,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14595530] [2021-06-10 11:38:58,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:58,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:58,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251090490] [2021-06-10 11:38:58,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:58,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:58,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:58,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 711 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:58,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:58,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:58,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:59,073 INFO L129 PetriNetUnfolder]: 74/805 cut-off events. [2021-06-10 11:38:59,074 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:59,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 805 events. 74/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3248 event pairs, 0 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 903. Up to 28 conditions per place. [2021-06-10 11:38:59,118 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/713 dead transitions. [2021-06-10 11:38:59,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 713 transitions, 1608 flow [2021-06-10 11:38:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:38:59,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:38:59,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:38:59,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:38:59,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:59,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:38:59,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,121 INFO L185 Difference]: Start difference. First operand has 700 places, 711 transitions, 1578 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:38:59,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 713 transitions, 1608 flow [2021-06-10 11:38:59,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 713 transitions, 1607 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:59,127 INFO L241 Difference]: Finished difference. Result has 703 places, 713 transitions, 1601 flow [2021-06-10 11:38:59,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1601, PETRI_PLACES=703, PETRI_TRANSITIONS=713} [2021-06-10 11:38:59,127 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -20 predicate places. [2021-06-10 11:38:59,127 INFO L480 AbstractCegarLoop]: Abstraction has has 703 places, 713 transitions, 1601 flow [2021-06-10 11:38:59,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,128 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:59,128 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:59,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2021-06-10 11:38:59,128 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:59,128 INFO L82 PathProgramCache]: Analyzing trace with hash -700689538, now seen corresponding path program 1 times [2021-06-10 11:38:59,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:59,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56749529] [2021-06-10 11:38:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:59,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:59,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:59,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56749529] [2021-06-10 11:38:59,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:59,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:59,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099228675] [2021-06-10 11:38:59,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:59,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:59,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:59,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:59,144 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:59,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 713 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:59,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:59,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:59,351 INFO L129 PetriNetUnfolder]: 73/803 cut-off events. [2021-06-10 11:38:59,351 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:38:59,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 803 events. 73/803 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3235 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 899. Up to 28 conditions per place. [2021-06-10 11:38:59,394 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2021-06-10 11:38:59,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 713 transitions, 1613 flow [2021-06-10 11:38:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:38:59,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:38:59,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:38:59,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:38:59,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:59,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:38:59,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,398 INFO L185 Difference]: Start difference. First operand has 703 places, 713 transitions, 1601 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:38:59,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 713 transitions, 1613 flow [2021-06-10 11:38:59,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 713 transitions, 1608 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:59,404 INFO L241 Difference]: Finished difference. Result has 706 places, 713 transitions, 1606 flow [2021-06-10 11:38:59,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=706, PETRI_TRANSITIONS=713} [2021-06-10 11:38:59,404 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -17 predicate places. [2021-06-10 11:38:59,404 INFO L480 AbstractCegarLoop]: Abstraction has has 706 places, 713 transitions, 1606 flow [2021-06-10 11:38:59,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:59,405 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:59,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2021-06-10 11:38:59,405 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash -699737249, now seen corresponding path program 1 times [2021-06-10 11:38:59,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:59,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453341856] [2021-06-10 11:38:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:59,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:38:59,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:59,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453341856] [2021-06-10 11:38:59,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:59,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:59,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552373372] [2021-06-10 11:38:59,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:59,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:59,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:59,422 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:38:59,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 713 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:59,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:38:59,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:59,626 INFO L129 PetriNetUnfolder]: 72/799 cut-off events. [2021-06-10 11:38:59,626 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:38:59,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 799 events. 72/799 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3209 event pairs, 0 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 897. Up to 28 conditions per place. [2021-06-10 11:38:59,669 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2021-06-10 11:38:59,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 710 transitions, 1603 flow [2021-06-10 11:38:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:38:59,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:38:59,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:38:59,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:38:59,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:59,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:38:59,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,672 INFO L185 Difference]: Start difference. First operand has 706 places, 713 transitions, 1606 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:38:59,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 710 transitions, 1603 flow [2021-06-10 11:38:59,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 710 transitions, 1596 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:38:59,679 INFO L241 Difference]: Finished difference. Result has 705 places, 710 transitions, 1586 flow [2021-06-10 11:38:59,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1586, PETRI_PLACES=705, PETRI_TRANSITIONS=710} [2021-06-10 11:38:59,679 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -18 predicate places. [2021-06-10 11:38:59,679 INFO L480 AbstractCegarLoop]: Abstraction has has 705 places, 710 transitions, 1586 flow [2021-06-10 11:38:59,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,679 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:59,679 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:59,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2021-06-10 11:38:59,679 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -699736226, now seen corresponding path program 1 times [2021-06-10 11:38:59,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:59,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926806400] [2021-06-10 11:38:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:59,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:38:59,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:38:59,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926806400] [2021-06-10 11:38:59,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:59,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:59,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380453752] [2021-06-10 11:38:59,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:59,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:59,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:59,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:59,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:59,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 710 transitions, 1586 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:59,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:59,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:38:59,902 INFO L129 PetriNetUnfolder]: 72/797 cut-off events. [2021-06-10 11:38:59,903 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:38:59,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 797 events. 72/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3192 event pairs, 0 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 898. Up to 28 conditions per place. [2021-06-10 11:38:59,940 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/708 dead transitions. [2021-06-10 11:38:59,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 708 transitions, 1599 flow [2021-06-10 11:38:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:38:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:38:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:38:59,942 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:38:59,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:38:59,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:38:59,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:38:59,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:38:59,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,944 INFO L185 Difference]: Start difference. First operand has 705 places, 710 transitions, 1586 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:38:59,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 708 transitions, 1599 flow [2021-06-10 11:38:59,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 708 transitions, 1598 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:38:59,950 INFO L241 Difference]: Finished difference. Result has 704 places, 708 transitions, 1582 flow [2021-06-10 11:38:59,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1582, PETRI_PLACES=704, PETRI_TRANSITIONS=708} [2021-06-10 11:38:59,950 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -19 predicate places. [2021-06-10 11:38:59,950 INFO L480 AbstractCegarLoop]: Abstraction has has 704 places, 708 transitions, 1582 flow [2021-06-10 11:38:59,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:38:59,950 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:38:59,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2021-06-10 11:38:59,950 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:38:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:38:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -733911720, now seen corresponding path program 1 times [2021-06-10 11:38:59,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:38:59,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218344765] [2021-06-10 11:38:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:38:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:38:59,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:38:59,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:38:59,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:38:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:38:59,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218344765] [2021-06-10 11:38:59,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:38:59,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:38:59,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259544042] [2021-06-10 11:38:59,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:38:59,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:38:59,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:38:59,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:38:59,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:38:59,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 708 transitions, 1582 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:38:59,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:38:59,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:38:59,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:00,182 INFO L129 PetriNetUnfolder]: 71/805 cut-off events. [2021-06-10 11:39:00,183 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:00,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 805 events. 71/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3267 event pairs, 0 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 910. Up to 28 conditions per place. [2021-06-10 11:39:00,225 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/710 dead transitions. [2021-06-10 11:39:00,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 710 transitions, 1612 flow [2021-06-10 11:39:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:00,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:00,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:00,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:00,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:00,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:00,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,229 INFO L185 Difference]: Start difference. First operand has 704 places, 708 transitions, 1582 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:00,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 710 transitions, 1612 flow [2021-06-10 11:39:00,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 710 transitions, 1611 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:00,235 INFO L241 Difference]: Finished difference. Result has 707 places, 710 transitions, 1605 flow [2021-06-10 11:39:00,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1605, PETRI_PLACES=707, PETRI_TRANSITIONS=710} [2021-06-10 11:39:00,235 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -16 predicate places. [2021-06-10 11:39:00,235 INFO L480 AbstractCegarLoop]: Abstraction has has 707 places, 710 transitions, 1605 flow [2021-06-10 11:39:00,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,235 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:00,235 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:00,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2021-06-10 11:39:00,235 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:00,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -733910697, now seen corresponding path program 1 times [2021-06-10 11:39:00,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:00,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774415600] [2021-06-10 11:39:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:00,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:00,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:00,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774415600] [2021-06-10 11:39:00,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:00,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:00,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195183964] [2021-06-10 11:39:00,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:00,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:00,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:00,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 710 transitions, 1605 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:00,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:00,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:00,457 INFO L129 PetriNetUnfolder]: 70/803 cut-off events. [2021-06-10 11:39:00,457 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:00,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 803 events. 70/803 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3252 event pairs, 0 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 906. Up to 28 conditions per place. [2021-06-10 11:39:00,500 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/710 dead transitions. [2021-06-10 11:39:00,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 710 transitions, 1617 flow [2021-06-10 11:39:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:00,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:00,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:00,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:00,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:00,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:00,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,504 INFO L185 Difference]: Start difference. First operand has 707 places, 710 transitions, 1605 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:00,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 710 transitions, 1617 flow [2021-06-10 11:39:00,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 710 transitions, 1612 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:00,510 INFO L241 Difference]: Finished difference. Result has 710 places, 710 transitions, 1610 flow [2021-06-10 11:39:00,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=710, PETRI_TRANSITIONS=710} [2021-06-10 11:39:00,510 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -13 predicate places. [2021-06-10 11:39:00,510 INFO L480 AbstractCegarLoop]: Abstraction has has 710 places, 710 transitions, 1610 flow [2021-06-10 11:39:00,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,510 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:00,510 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:00,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2021-06-10 11:39:00,510 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash -732958408, now seen corresponding path program 1 times [2021-06-10 11:39:00,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:00,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729102228] [2021-06-10 11:39:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:00,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:00,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:00,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729102228] [2021-06-10 11:39:00,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:00,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:00,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903810749] [2021-06-10 11:39:00,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:00,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:00,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:00,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 710 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:00,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:00,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:00,724 INFO L129 PetriNetUnfolder]: 69/799 cut-off events. [2021-06-10 11:39:00,724 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:00,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 799 events. 69/799 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3228 event pairs, 0 based on Foata normal form. 1/705 useless extension candidates. Maximal degree in co-relation 904. Up to 28 conditions per place. [2021-06-10 11:39:00,768 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/707 dead transitions. [2021-06-10 11:39:00,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 707 transitions, 1607 flow [2021-06-10 11:39:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:00,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:00,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:00,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:00,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:00,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:00,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,772 INFO L185 Difference]: Start difference. First operand has 710 places, 710 transitions, 1610 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:00,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 707 transitions, 1607 flow [2021-06-10 11:39:00,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 707 transitions, 1600 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:00,778 INFO L241 Difference]: Finished difference. Result has 709 places, 707 transitions, 1590 flow [2021-06-10 11:39:00,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=709, PETRI_TRANSITIONS=707} [2021-06-10 11:39:00,778 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -14 predicate places. [2021-06-10 11:39:00,778 INFO L480 AbstractCegarLoop]: Abstraction has has 709 places, 707 transitions, 1590 flow [2021-06-10 11:39:00,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:00,778 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:00,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2021-06-10 11:39:00,779 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash -732957385, now seen corresponding path program 1 times [2021-06-10 11:39:00,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:00,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405622661] [2021-06-10 11:39:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:00,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:00,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:00,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:00,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405622661] [2021-06-10 11:39:00,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:00,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:00,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626663704] [2021-06-10 11:39:00,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:00,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:00,795 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:00,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 707 transitions, 1590 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:00,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:00,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:00,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:01,000 INFO L129 PetriNetUnfolder]: 69/797 cut-off events. [2021-06-10 11:39:01,000 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:01,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 797 events. 69/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3214 event pairs, 0 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 905. Up to 28 conditions per place. [2021-06-10 11:39:01,040 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/705 dead transitions. [2021-06-10 11:39:01,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 705 transitions, 1603 flow [2021-06-10 11:39:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:01,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:01,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:01,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:01,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:01,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:01,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,043 INFO L185 Difference]: Start difference. First operand has 709 places, 707 transitions, 1590 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:01,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 705 transitions, 1603 flow [2021-06-10 11:39:01,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 705 transitions, 1602 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:01,049 INFO L241 Difference]: Finished difference. Result has 708 places, 705 transitions, 1586 flow [2021-06-10 11:39:01,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1586, PETRI_PLACES=708, PETRI_TRANSITIONS=705} [2021-06-10 11:39:01,049 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -15 predicate places. [2021-06-10 11:39:01,049 INFO L480 AbstractCegarLoop]: Abstraction has has 708 places, 705 transitions, 1586 flow [2021-06-10 11:39:01,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:01,049 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:01,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2021-06-10 11:39:01,050 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:01,050 INFO L82 PathProgramCache]: Analyzing trace with hash 831968658, now seen corresponding path program 1 times [2021-06-10 11:39:01,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:01,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250667033] [2021-06-10 11:39:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:01,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:01,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:01,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250667033] [2021-06-10 11:39:01,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:01,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:01,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295383037] [2021-06-10 11:39:01,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:01,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:01,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:01,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:01,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:01,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 705 transitions, 1586 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:01,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:01,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:01,266 INFO L129 PetriNetUnfolder]: 68/804 cut-off events. [2021-06-10 11:39:01,266 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:01,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 804 events. 68/804 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3270 event pairs, 0 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 910. Up to 28 conditions per place. [2021-06-10 11:39:01,309 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/706 dead transitions. [2021-06-10 11:39:01,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 706 transitions, 1602 flow [2021-06-10 11:39:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:01,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:01,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:01,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:01,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:01,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:01,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,313 INFO L185 Difference]: Start difference. First operand has 708 places, 705 transitions, 1586 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:01,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 706 transitions, 1602 flow [2021-06-10 11:39:01,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 706 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:01,319 INFO L241 Difference]: Finished difference. Result has 710 places, 705 transitions, 1590 flow [2021-06-10 11:39:01,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=710, PETRI_TRANSITIONS=705} [2021-06-10 11:39:01,319 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -13 predicate places. [2021-06-10 11:39:01,319 INFO L480 AbstractCegarLoop]: Abstraction has has 710 places, 705 transitions, 1590 flow [2021-06-10 11:39:01,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:01,319 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:01,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2021-06-10 11:39:01,319 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 831969681, now seen corresponding path program 1 times [2021-06-10 11:39:01,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:01,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404730135] [2021-06-10 11:39:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:01,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:01,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:01,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404730135] [2021-06-10 11:39:01,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:01,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:01,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417899444] [2021-06-10 11:39:01,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:01,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:01,336 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:01,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 705 transitions, 1590 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:01,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:01,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:01,546 INFO L129 PetriNetUnfolder]: 66/806 cut-off events. [2021-06-10 11:39:01,546 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:01,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 806 events. 66/806 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3308 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 921. Up to 28 conditions per place. [2021-06-10 11:39:01,579 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/706 dead transitions. [2021-06-10 11:39:01,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 706 transitions, 1616 flow [2021-06-10 11:39:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:01,580 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:01,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:01,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:01,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:01,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:01,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,583 INFO L185 Difference]: Start difference. First operand has 710 places, 705 transitions, 1590 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:01,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 706 transitions, 1616 flow [2021-06-10 11:39:01,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 706 transitions, 1615 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:01,588 INFO L241 Difference]: Finished difference. Result has 713 places, 706 transitions, 1607 flow [2021-06-10 11:39:01,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1607, PETRI_PLACES=713, PETRI_TRANSITIONS=706} [2021-06-10 11:39:01,588 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -10 predicate places. [2021-06-10 11:39:01,588 INFO L480 AbstractCegarLoop]: Abstraction has has 713 places, 706 transitions, 1607 flow [2021-06-10 11:39:01,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:01,588 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:01,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2021-06-10 11:39:01,589 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 831016369, now seen corresponding path program 1 times [2021-06-10 11:39:01,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:01,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099624163] [2021-06-10 11:39:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:01,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:01,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:01,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099624163] [2021-06-10 11:39:01,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:01,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:01,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814748262] [2021-06-10 11:39:01,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:01,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:01,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:01,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 706 transitions, 1607 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:01,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:01,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:01,800 INFO L129 PetriNetUnfolder]: 66/799 cut-off events. [2021-06-10 11:39:01,800 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:01,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 799 events. 66/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3245 event pairs, 0 based on Foata normal form. 1/708 useless extension candidates. Maximal degree in co-relation 906. Up to 28 conditions per place. [2021-06-10 11:39:01,841 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/704 dead transitions. [2021-06-10 11:39:01,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 704 transitions, 1609 flow [2021-06-10 11:39:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:01,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:01,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:01,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:01,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:01,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:01,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,844 INFO L185 Difference]: Start difference. First operand has 713 places, 706 transitions, 1607 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:01,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 704 transitions, 1609 flow [2021-06-10 11:39:01,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 704 transitions, 1601 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:01,850 INFO L241 Difference]: Finished difference. Result has 713 places, 704 transitions, 1594 flow [2021-06-10 11:39:01,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=713, PETRI_TRANSITIONS=704} [2021-06-10 11:39:01,851 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -10 predicate places. [2021-06-10 11:39:01,851 INFO L480 AbstractCegarLoop]: Abstraction has has 713 places, 704 transitions, 1594 flow [2021-06-10 11:39:01,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:01,851 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:01,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2021-06-10 11:39:01,851 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 831015346, now seen corresponding path program 1 times [2021-06-10 11:39:01,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:01,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958120409] [2021-06-10 11:39:01,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:01,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:01,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:01,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:01,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958120409] [2021-06-10 11:39:01,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:01,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:01,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807558153] [2021-06-10 11:39:01,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:01,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:01,868 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:01,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 704 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:01,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:01,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:01,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:02,067 INFO L129 PetriNetUnfolder]: 66/797 cut-off events. [2021-06-10 11:39:02,067 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:02,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 797 events. 66/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3232 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 911. Up to 28 conditions per place. [2021-06-10 11:39:02,106 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2021-06-10 11:39:02,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 702 transitions, 1607 flow [2021-06-10 11:39:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:02,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:02,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:02,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:02,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:02,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:02,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,110 INFO L185 Difference]: Start difference. First operand has 713 places, 704 transitions, 1594 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:02,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 702 transitions, 1607 flow [2021-06-10 11:39:02,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 702 transitions, 1606 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:02,116 INFO L241 Difference]: Finished difference. Result has 712 places, 702 transitions, 1590 flow [2021-06-10 11:39:02,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1590, PETRI_PLACES=712, PETRI_TRANSITIONS=702} [2021-06-10 11:39:02,116 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -11 predicate places. [2021-06-10 11:39:02,116 INFO L480 AbstractCegarLoop]: Abstraction has has 712 places, 702 transitions, 1590 flow [2021-06-10 11:39:02,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,116 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:02,117 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:02,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2021-06-10 11:39:02,117 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1760270323, now seen corresponding path program 1 times [2021-06-10 11:39:02,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:02,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889779895] [2021-06-10 11:39:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:02,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:02,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:02,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889779895] [2021-06-10 11:39:02,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:02,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:02,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932784478] [2021-06-10 11:39:02,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:02,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:02,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:02,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:02,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:02,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 702 transitions, 1590 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:02,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:02,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:02,341 INFO L129 PetriNetUnfolder]: 65/805 cut-off events. [2021-06-10 11:39:02,341 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:02,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 805 events. 65/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3302 event pairs, 0 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 923. Up to 28 conditions per place. [2021-06-10 11:39:02,382 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/704 dead transitions. [2021-06-10 11:39:02,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 704 transitions, 1620 flow [2021-06-10 11:39:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:02,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:02,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:02,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:02,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:02,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:02,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,386 INFO L185 Difference]: Start difference. First operand has 712 places, 702 transitions, 1590 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:02,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 704 transitions, 1620 flow [2021-06-10 11:39:02,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 704 transitions, 1619 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:02,392 INFO L241 Difference]: Finished difference. Result has 715 places, 704 transitions, 1613 flow [2021-06-10 11:39:02,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1613, PETRI_PLACES=715, PETRI_TRANSITIONS=704} [2021-06-10 11:39:02,392 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -8 predicate places. [2021-06-10 11:39:02,392 INFO L480 AbstractCegarLoop]: Abstraction has has 715 places, 704 transitions, 1613 flow [2021-06-10 11:39:02,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,392 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:02,392 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:02,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2021-06-10 11:39:02,392 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1760269300, now seen corresponding path program 1 times [2021-06-10 11:39:02,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:02,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385115146] [2021-06-10 11:39:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:02,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:02,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:02,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385115146] [2021-06-10 11:39:02,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:02,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:02,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680784834] [2021-06-10 11:39:02,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:02,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:02,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:02,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 704 transitions, 1613 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:02,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:02,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:02,612 INFO L129 PetriNetUnfolder]: 64/803 cut-off events. [2021-06-10 11:39:02,612 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:02,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 803 events. 64/803 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3293 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 920. Up to 28 conditions per place. [2021-06-10 11:39:02,653 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2021-06-10 11:39:02,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 704 transitions, 1625 flow [2021-06-10 11:39:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:02,654 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:02,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:02,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:02,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:02,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:02,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,656 INFO L185 Difference]: Start difference. First operand has 715 places, 704 transitions, 1613 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:02,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 704 transitions, 1625 flow [2021-06-10 11:39:02,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 704 transitions, 1620 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:02,662 INFO L241 Difference]: Finished difference. Result has 718 places, 704 transitions, 1618 flow [2021-06-10 11:39:02,662 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=718, PETRI_TRANSITIONS=704} [2021-06-10 11:39:02,662 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -5 predicate places. [2021-06-10 11:39:02,662 INFO L480 AbstractCegarLoop]: Abstraction has has 718 places, 704 transitions, 1618 flow [2021-06-10 11:39:02,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:02,663 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:02,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2021-06-10 11:39:02,663 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1759317011, now seen corresponding path program 1 times [2021-06-10 11:39:02,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:02,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720966166] [2021-06-10 11:39:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:02,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:02,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:02,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720966166] [2021-06-10 11:39:02,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:02,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:02,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326573292] [2021-06-10 11:39:02,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:02,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:02,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:02,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 704 transitions, 1618 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:02,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:02,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:02,893 INFO L129 PetriNetUnfolder]: 63/799 cut-off events. [2021-06-10 11:39:02,893 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:02,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 799 events. 63/799 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3262 event pairs, 0 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 917. Up to 28 conditions per place. [2021-06-10 11:39:02,934 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/701 dead transitions. [2021-06-10 11:39:02,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 701 transitions, 1615 flow [2021-06-10 11:39:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:02,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:02,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:02,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:02,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:02,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:02,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,938 INFO L185 Difference]: Start difference. First operand has 718 places, 704 transitions, 1618 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:02,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 701 transitions, 1615 flow [2021-06-10 11:39:02,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 701 transitions, 1608 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:02,944 INFO L241 Difference]: Finished difference. Result has 717 places, 701 transitions, 1598 flow [2021-06-10 11:39:02,944 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=717, PETRI_TRANSITIONS=701} [2021-06-10 11:39:02,944 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -6 predicate places. [2021-06-10 11:39:02,944 INFO L480 AbstractCegarLoop]: Abstraction has has 717 places, 701 transitions, 1598 flow [2021-06-10 11:39:02,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:02,945 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:02,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2021-06-10 11:39:02,945 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1759315988, now seen corresponding path program 1 times [2021-06-10 11:39:02,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:02,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941552615] [2021-06-10 11:39:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:02,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:02,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:02,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:02,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941552615] [2021-06-10 11:39:02,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:02,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:02,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183435321] [2021-06-10 11:39:02,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:02,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:02,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:02,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 701 transitions, 1598 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:02,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:02,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:02,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:03,171 INFO L129 PetriNetUnfolder]: 63/797 cut-off events. [2021-06-10 11:39:03,172 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:03,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 797 events. 63/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3250 event pairs, 0 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 918. Up to 28 conditions per place. [2021-06-10 11:39:03,204 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/699 dead transitions. [2021-06-10 11:39:03,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 699 transitions, 1611 flow [2021-06-10 11:39:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:03,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:03,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:03,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:03,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:03,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:03,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,208 INFO L185 Difference]: Start difference. First operand has 717 places, 701 transitions, 1598 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:03,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 699 transitions, 1611 flow [2021-06-10 11:39:03,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 699 transitions, 1610 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:03,213 INFO L241 Difference]: Finished difference. Result has 716 places, 699 transitions, 1594 flow [2021-06-10 11:39:03,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1594, PETRI_PLACES=716, PETRI_TRANSITIONS=699} [2021-06-10 11:39:03,214 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -7 predicate places. [2021-06-10 11:39:03,214 INFO L480 AbstractCegarLoop]: Abstraction has has 716 places, 699 transitions, 1594 flow [2021-06-10 11:39:03,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:03,214 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:03,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2021-06-10 11:39:03,214 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:03,214 INFO L82 PathProgramCache]: Analyzing trace with hash 291939560, now seen corresponding path program 1 times [2021-06-10 11:39:03,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:03,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162210762] [2021-06-10 11:39:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:03,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:03,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:03,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162210762] [2021-06-10 11:39:03,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:03,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:03,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115749217] [2021-06-10 11:39:03,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:03,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:03,231 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:03,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 699 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:03,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:03,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:03,440 INFO L129 PetriNetUnfolder]: 61/802 cut-off events. [2021-06-10 11:39:03,440 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:03,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 802 events. 61/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3300 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 921. Up to 28 conditions per place. [2021-06-10 11:39:03,482 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/700 dead transitions. [2021-06-10 11:39:03,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 700 transitions, 1610 flow [2021-06-10 11:39:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:03,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:03,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:03,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:03,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:03,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:03,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,485 INFO L185 Difference]: Start difference. First operand has 716 places, 699 transitions, 1594 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:03,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 700 transitions, 1610 flow [2021-06-10 11:39:03,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 700 transitions, 1609 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:03,491 INFO L241 Difference]: Finished difference. Result has 719 places, 700 transitions, 1607 flow [2021-06-10 11:39:03,492 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1607, PETRI_PLACES=719, PETRI_TRANSITIONS=700} [2021-06-10 11:39:03,492 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -4 predicate places. [2021-06-10 11:39:03,492 INFO L480 AbstractCegarLoop]: Abstraction has has 719 places, 700 transitions, 1607 flow [2021-06-10 11:39:03,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:03,492 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:03,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2021-06-10 11:39:03,492 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash 291938537, now seen corresponding path program 1 times [2021-06-10 11:39:03,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:03,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937248622] [2021-06-10 11:39:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:03,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:03,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:03,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937248622] [2021-06-10 11:39:03,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:03,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:03,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958547736] [2021-06-10 11:39:03,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:03,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:03,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:03,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:03,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 700 transitions, 1607 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:03,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:03,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:03,717 INFO L129 PetriNetUnfolder]: 61/803 cut-off events. [2021-06-10 11:39:03,717 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:03,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 803 events. 61/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3306 event pairs, 0 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 929. Up to 28 conditions per place. [2021-06-10 11:39:03,758 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2021-06-10 11:39:03,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 701 transitions, 1633 flow [2021-06-10 11:39:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:03,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:03,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:03,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:03,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:03,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:03,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,761 INFO L185 Difference]: Start difference. First operand has 719 places, 700 transitions, 1607 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:03,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 701 transitions, 1633 flow [2021-06-10 11:39:03,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 701 transitions, 1631 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:03,767 INFO L241 Difference]: Finished difference. Result has 722 places, 701 transitions, 1623 flow [2021-06-10 11:39:03,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1623, PETRI_PLACES=722, PETRI_TRANSITIONS=701} [2021-06-10 11:39:03,767 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -1 predicate places. [2021-06-10 11:39:03,767 INFO L480 AbstractCegarLoop]: Abstraction has has 722 places, 701 transitions, 1623 flow [2021-06-10 11:39:03,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:03,768 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:03,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2021-06-10 11:39:03,768 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash 292891849, now seen corresponding path program 1 times [2021-06-10 11:39:03,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:03,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905014023] [2021-06-10 11:39:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:03,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:03,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:03,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:03,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905014023] [2021-06-10 11:39:03,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:03,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:03,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107032518] [2021-06-10 11:39:03,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:03,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:03,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:03,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 701 transitions, 1623 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:03,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:03,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:03,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:03,989 INFO L129 PetriNetUnfolder]: 60/799 cut-off events. [2021-06-10 11:39:03,989 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:04,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 799 events. 60/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3282 event pairs, 0 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 922. Up to 28 conditions per place. [2021-06-10 11:39:04,031 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/698 dead transitions. [2021-06-10 11:39:04,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 698 transitions, 1620 flow [2021-06-10 11:39:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:04,033 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:04,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:04,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:04,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:04,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:04,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,035 INFO L185 Difference]: Start difference. First operand has 722 places, 701 transitions, 1623 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:04,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 698 transitions, 1620 flow [2021-06-10 11:39:04,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 698 transitions, 1612 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:04,041 INFO L241 Difference]: Finished difference. Result has 721 places, 698 transitions, 1602 flow [2021-06-10 11:39:04,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=721, PETRI_TRANSITIONS=698} [2021-06-10 11:39:04,041 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -2 predicate places. [2021-06-10 11:39:04,041 INFO L480 AbstractCegarLoop]: Abstraction has has 721 places, 698 transitions, 1602 flow [2021-06-10 11:39:04,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:04,042 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:04,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2021-06-10 11:39:04,042 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 292892872, now seen corresponding path program 1 times [2021-06-10 11:39:04,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:04,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510030484] [2021-06-10 11:39:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:04,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:04,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:04,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510030484] [2021-06-10 11:39:04,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:04,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:04,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65646559] [2021-06-10 11:39:04,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:04,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:04,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:04,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:04,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:04,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 698 transitions, 1602 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:04,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:04,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:04,277 INFO L129 PetriNetUnfolder]: 60/797 cut-off events. [2021-06-10 11:39:04,277 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:04,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 797 events. 60/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3267 event pairs, 0 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 925. Up to 28 conditions per place. [2021-06-10 11:39:04,316 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2021-06-10 11:39:04,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 696 transitions, 1615 flow [2021-06-10 11:39:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:04,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:04,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:04,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:04,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:04,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:04,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,319 INFO L185 Difference]: Start difference. First operand has 721 places, 698 transitions, 1602 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:04,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 696 transitions, 1615 flow [2021-06-10 11:39:04,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 696 transitions, 1614 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:04,325 INFO L241 Difference]: Finished difference. Result has 720 places, 696 transitions, 1598 flow [2021-06-10 11:39:04,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=720, PETRI_TRANSITIONS=696} [2021-06-10 11:39:04,326 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, -3 predicate places. [2021-06-10 11:39:04,326 INFO L480 AbstractCegarLoop]: Abstraction has has 720 places, 696 transitions, 1598 flow [2021-06-10 11:39:04,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,326 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:04,326 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:04,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2021-06-10 11:39:04,326 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1513227461, now seen corresponding path program 1 times [2021-06-10 11:39:04,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:04,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142489626] [2021-06-10 11:39:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:04,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:04,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:04,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142489626] [2021-06-10 11:39:04,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:04,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:04,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171230633] [2021-06-10 11:39:04,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:04,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:04,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:04,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 696 transitions, 1598 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:04,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:04,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:04,570 INFO L129 PetriNetUnfolder]: 58/802 cut-off events. [2021-06-10 11:39:04,570 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:04,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 802 events. 58/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3316 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 928. Up to 28 conditions per place. [2021-06-10 11:39:04,611 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2021-06-10 11:39:04,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 697 transitions, 1614 flow [2021-06-10 11:39:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:04,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:04,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:04,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:04,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:04,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:04,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,615 INFO L185 Difference]: Start difference. First operand has 720 places, 696 transitions, 1598 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:04,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 697 transitions, 1614 flow [2021-06-10 11:39:04,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 697 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:04,621 INFO L241 Difference]: Finished difference. Result has 723 places, 697 transitions, 1611 flow [2021-06-10 11:39:04,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1611, PETRI_PLACES=723, PETRI_TRANSITIONS=697} [2021-06-10 11:39:04,621 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 0 predicate places. [2021-06-10 11:39:04,621 INFO L480 AbstractCegarLoop]: Abstraction has has 723 places, 697 transitions, 1611 flow [2021-06-10 11:39:04,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:04,622 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:04,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2021-06-10 11:39:04,622 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1513226438, now seen corresponding path program 1 times [2021-06-10 11:39:04,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:04,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032113602] [2021-06-10 11:39:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:04,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:04,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:04,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032113602] [2021-06-10 11:39:04,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:04,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:04,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430506457] [2021-06-10 11:39:04,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:04,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:04,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:04,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 697 transitions, 1611 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:04,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:04,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:04,852 INFO L129 PetriNetUnfolder]: 58/803 cut-off events. [2021-06-10 11:39:04,852 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:04,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 803 events. 58/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3326 event pairs, 0 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 936. Up to 28 conditions per place. [2021-06-10 11:39:04,887 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/698 dead transitions. [2021-06-10 11:39:04,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 698 transitions, 1637 flow [2021-06-10 11:39:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:04,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:04,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:04,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:04,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:04,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:04,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,891 INFO L185 Difference]: Start difference. First operand has 723 places, 697 transitions, 1611 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:04,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 698 transitions, 1637 flow [2021-06-10 11:39:04,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 698 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:04,897 INFO L241 Difference]: Finished difference. Result has 726 places, 698 transitions, 1627 flow [2021-06-10 11:39:04,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=726, PETRI_TRANSITIONS=698} [2021-06-10 11:39:04,897 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 3 predicate places. [2021-06-10 11:39:04,897 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 698 transitions, 1627 flow [2021-06-10 11:39:04,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:04,897 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:04,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2021-06-10 11:39:04,897 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1514180773, now seen corresponding path program 1 times [2021-06-10 11:39:04,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:04,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858462978] [2021-06-10 11:39:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:04,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:04,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:04,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:04,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858462978] [2021-06-10 11:39:04,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:04,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:04,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141156196] [2021-06-10 11:39:04,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:04,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:04,925 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:04,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 698 transitions, 1627 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:04,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:04,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:04,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:05,136 INFO L129 PetriNetUnfolder]: 57/800 cut-off events. [2021-06-10 11:39:05,136 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:39:05,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 800 events. 57/800 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3308 event pairs, 0 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 935. Up to 28 conditions per place. [2021-06-10 11:39:05,178 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 9 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2021-06-10 11:39:05,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 696 transitions, 1635 flow [2021-06-10 11:39:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2021-06-10 11:39:05,179 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2021-06-10 11:39:05,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2021-06-10 11:39:05,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2021-06-10 11:39:05,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:05,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2021-06-10 11:39:05,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.0) internal successors, (2142), 3 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,181 INFO L185 Difference]: Start difference. First operand has 726 places, 698 transitions, 1627 flow. Second operand 3 states and 2142 transitions. [2021-06-10 11:39:05,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 696 transitions, 1635 flow [2021-06-10 11:39:05,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 696 transitions, 1634 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:05,187 INFO L241 Difference]: Finished difference. Result has 727 places, 696 transitions, 1616 flow [2021-06-10 11:39:05,188 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1616, PETRI_PLACES=727, PETRI_TRANSITIONS=696} [2021-06-10 11:39:05,188 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 4 predicate places. [2021-06-10 11:39:05,188 INFO L480 AbstractCegarLoop]: Abstraction has has 727 places, 696 transitions, 1616 flow [2021-06-10 11:39:05,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:05,188 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:05,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2021-06-10 11:39:05,188 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1514179750, now seen corresponding path program 1 times [2021-06-10 11:39:05,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:05,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963274714] [2021-06-10 11:39:05,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:05,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:05,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:05,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963274714] [2021-06-10 11:39:05,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:05,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:05,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393352424] [2021-06-10 11:39:05,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:05,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:05,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:05,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 696 transitions, 1616 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:05,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:05,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:05,420 INFO L129 PetriNetUnfolder]: 57/797 cut-off events. [2021-06-10 11:39:05,420 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:05,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 797 events. 57/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3281 event pairs, 0 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 929. Up to 28 conditions per place. [2021-06-10 11:39:05,460 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/693 dead transitions. [2021-06-10 11:39:05,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 693 transitions, 1617 flow [2021-06-10 11:39:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:05,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:05,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:05,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:05,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:05,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:05,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,464 INFO L185 Difference]: Start difference. First operand has 727 places, 696 transitions, 1616 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:05,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 693 transitions, 1617 flow [2021-06-10 11:39:05,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 693 transitions, 1612 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:05,470 INFO L241 Difference]: Finished difference. Result has 724 places, 693 transitions, 1602 flow [2021-06-10 11:39:05,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1602, PETRI_PLACES=724, PETRI_TRANSITIONS=693} [2021-06-10 11:39:05,470 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 1 predicate places. [2021-06-10 11:39:05,470 INFO L480 AbstractCegarLoop]: Abstraction has has 724 places, 693 transitions, 1602 flow [2021-06-10 11:39:05,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:05,470 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:05,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2021-06-10 11:39:05,470 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 571507204, now seen corresponding path program 1 times [2021-06-10 11:39:05,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:05,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768939946] [2021-06-10 11:39:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:05,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:05,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:05,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768939946] [2021-06-10 11:39:05,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:05,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:05,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102876745] [2021-06-10 11:39:05,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:05,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:05,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:05,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:05,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:05,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 693 transitions, 1602 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:05,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:05,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:05,698 INFO L129 PetriNetUnfolder]: 56/804 cut-off events. [2021-06-10 11:39:05,699 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:05,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 804 events. 56/804 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3345 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 939. Up to 28 conditions per place. [2021-06-10 11:39:05,738 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/694 dead transitions. [2021-06-10 11:39:05,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 694 transitions, 1618 flow [2021-06-10 11:39:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:05,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:05,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:05,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:05,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:05,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:05,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,741 INFO L185 Difference]: Start difference. First operand has 724 places, 693 transitions, 1602 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:05,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 694 transitions, 1618 flow [2021-06-10 11:39:05,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 694 transitions, 1617 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:05,747 INFO L241 Difference]: Finished difference. Result has 726 places, 693 transitions, 1606 flow [2021-06-10 11:39:05,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=726, PETRI_TRANSITIONS=693} [2021-06-10 11:39:05,747 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 3 predicate places. [2021-06-10 11:39:05,748 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 693 transitions, 1606 flow [2021-06-10 11:39:05,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:05,748 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:05,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2021-06-10 11:39:05,748 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 571508227, now seen corresponding path program 1 times [2021-06-10 11:39:05,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:05,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018296716] [2021-06-10 11:39:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:05,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:05,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:05,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:05,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018296716] [2021-06-10 11:39:05,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:05,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:05,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944640064] [2021-06-10 11:39:05,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:05,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:05,765 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:05,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 693 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:05,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:05,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:05,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:05,986 INFO L129 PetriNetUnfolder]: 54/806 cut-off events. [2021-06-10 11:39:05,986 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:06,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 806 events. 54/806 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3378 event pairs, 0 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 948. Up to 28 conditions per place. [2021-06-10 11:39:06,027 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/694 dead transitions. [2021-06-10 11:39:06,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 694 transitions, 1632 flow [2021-06-10 11:39:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:06,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:06,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:06,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:06,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:06,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:06,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,032 INFO L185 Difference]: Start difference. First operand has 726 places, 693 transitions, 1606 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:06,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 694 transitions, 1632 flow [2021-06-10 11:39:06,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 694 transitions, 1631 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:06,038 INFO L241 Difference]: Finished difference. Result has 729 places, 694 transitions, 1623 flow [2021-06-10 11:39:06,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1623, PETRI_PLACES=729, PETRI_TRANSITIONS=694} [2021-06-10 11:39:06,038 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 6 predicate places. [2021-06-10 11:39:06,038 INFO L480 AbstractCegarLoop]: Abstraction has has 729 places, 694 transitions, 1623 flow [2021-06-10 11:39:06,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:06,038 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:06,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2021-06-10 11:39:06,039 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 570554915, now seen corresponding path program 1 times [2021-06-10 11:39:06,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:06,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598837588] [2021-06-10 11:39:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:06,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:06,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:06,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598837588] [2021-06-10 11:39:06,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:06,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:06,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53355187] [2021-06-10 11:39:06,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:06,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:06,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:06,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 694 transitions, 1623 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:06,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:06,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:06,264 INFO L129 PetriNetUnfolder]: 54/799 cut-off events. [2021-06-10 11:39:06,264 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:06,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 799 events. 54/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3315 event pairs, 0 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 934. Up to 28 conditions per place. [2021-06-10 11:39:06,305 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/692 dead transitions. [2021-06-10 11:39:06,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 692 transitions, 1625 flow [2021-06-10 11:39:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:06,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:06,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:06,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:06,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:06,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:06,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,308 INFO L185 Difference]: Start difference. First operand has 729 places, 694 transitions, 1623 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:06,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 692 transitions, 1625 flow [2021-06-10 11:39:06,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 692 transitions, 1617 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:06,314 INFO L241 Difference]: Finished difference. Result has 729 places, 692 transitions, 1610 flow [2021-06-10 11:39:06,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=729, PETRI_TRANSITIONS=692} [2021-06-10 11:39:06,315 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 6 predicate places. [2021-06-10 11:39:06,315 INFO L480 AbstractCegarLoop]: Abstraction has has 729 places, 692 transitions, 1610 flow [2021-06-10 11:39:06,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:06,315 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:06,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2021-06-10 11:39:06,315 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash 570553892, now seen corresponding path program 1 times [2021-06-10 11:39:06,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:06,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817761669] [2021-06-10 11:39:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:06,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:06,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:06,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817761669] [2021-06-10 11:39:06,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:06,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:06,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607204546] [2021-06-10 11:39:06,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:06,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:06,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:06,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 692 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:06,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:06,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:06,543 INFO L129 PetriNetUnfolder]: 54/797 cut-off events. [2021-06-10 11:39:06,543 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:06,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 797 events. 54/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3299 event pairs, 0 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 938. Up to 28 conditions per place. [2021-06-10 11:39:06,581 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/690 dead transitions. [2021-06-10 11:39:06,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 690 transitions, 1623 flow [2021-06-10 11:39:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:06,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:06,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:06,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:06,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:06,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,584 INFO L185 Difference]: Start difference. First operand has 729 places, 692 transitions, 1610 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:06,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 690 transitions, 1623 flow [2021-06-10 11:39:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 690 transitions, 1622 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:06,590 INFO L241 Difference]: Finished difference. Result has 728 places, 690 transitions, 1606 flow [2021-06-10 11:39:06,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=728, PETRI_TRANSITIONS=690} [2021-06-10 11:39:06,590 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 5 predicate places. [2021-06-10 11:39:06,590 INFO L480 AbstractCegarLoop]: Abstraction has has 728 places, 690 transitions, 1606 flow [2021-06-10 11:39:06,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:06,590 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:06,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2021-06-10 11:39:06,590 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash 969144707, now seen corresponding path program 1 times [2021-06-10 11:39:06,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:06,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428796721] [2021-06-10 11:39:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:06,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:06,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:06,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428796721] [2021-06-10 11:39:06,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:06,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:06,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858116198] [2021-06-10 11:39:06,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:06,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:06,607 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:06,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 690 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:06,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:06,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:06,825 INFO L129 PetriNetUnfolder]: 53/805 cut-off events. [2021-06-10 11:39:06,826 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:06,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 805 events. 53/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3370 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 950. Up to 28 conditions per place. [2021-06-10 11:39:06,865 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/692 dead transitions. [2021-06-10 11:39:06,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 692 transitions, 1636 flow [2021-06-10 11:39:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:06,866 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:06,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:06,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:06,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:06,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:06,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,868 INFO L185 Difference]: Start difference. First operand has 728 places, 690 transitions, 1606 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:06,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 692 transitions, 1636 flow [2021-06-10 11:39:06,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 692 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:06,874 INFO L241 Difference]: Finished difference. Result has 731 places, 692 transitions, 1629 flow [2021-06-10 11:39:06,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1629, PETRI_PLACES=731, PETRI_TRANSITIONS=692} [2021-06-10 11:39:06,875 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 8 predicate places. [2021-06-10 11:39:06,875 INFO L480 AbstractCegarLoop]: Abstraction has has 731 places, 692 transitions, 1629 flow [2021-06-10 11:39:06,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:06,875 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:06,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2021-06-10 11:39:06,875 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash 969145730, now seen corresponding path program 1 times [2021-06-10 11:39:06,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:06,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289257668] [2021-06-10 11:39:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:06,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:06,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:06,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:06,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289257668] [2021-06-10 11:39:06,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:06,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:06,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080439930] [2021-06-10 11:39:06,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:06,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:06,911 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:06,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 692 transitions, 1629 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:06,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:06,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:06,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:07,130 INFO L129 PetriNetUnfolder]: 52/803 cut-off events. [2021-06-10 11:39:07,130 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:07,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 803 events. 52/803 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3360 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 947. Up to 28 conditions per place. [2021-06-10 11:39:07,169 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2021-06-10 11:39:07,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 692 transitions, 1641 flow [2021-06-10 11:39:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:07,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:07,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:07,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:07,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:07,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:07,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,173 INFO L185 Difference]: Start difference. First operand has 731 places, 692 transitions, 1629 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:07,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 692 transitions, 1641 flow [2021-06-10 11:39:07,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 692 transitions, 1636 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:07,179 INFO L241 Difference]: Finished difference. Result has 734 places, 692 transitions, 1634 flow [2021-06-10 11:39:07,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=734, PETRI_TRANSITIONS=692} [2021-06-10 11:39:07,179 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 11 predicate places. [2021-06-10 11:39:07,179 INFO L480 AbstractCegarLoop]: Abstraction has has 734 places, 692 transitions, 1634 flow [2021-06-10 11:39:07,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:07,179 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:07,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2021-06-10 11:39:07,179 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 970098019, now seen corresponding path program 1 times [2021-06-10 11:39:07,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:07,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304948111] [2021-06-10 11:39:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:07,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:07,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:07,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304948111] [2021-06-10 11:39:07,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:07,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:07,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619884275] [2021-06-10 11:39:07,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:07,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:07,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:07,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:07,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 692 transitions, 1634 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:07,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:07,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:07,402 INFO L129 PetriNetUnfolder]: 51/799 cut-off events. [2021-06-10 11:39:07,402 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:07,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 799 events. 51/799 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3337 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 944. Up to 28 conditions per place. [2021-06-10 11:39:07,441 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/689 dead transitions. [2021-06-10 11:39:07,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 689 transitions, 1631 flow [2021-06-10 11:39:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:07,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:07,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:07,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:07,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:07,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:07,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,444 INFO L185 Difference]: Start difference. First operand has 734 places, 692 transitions, 1634 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:07,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 689 transitions, 1631 flow [2021-06-10 11:39:07,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 689 transitions, 1624 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:07,450 INFO L241 Difference]: Finished difference. Result has 733 places, 689 transitions, 1614 flow [2021-06-10 11:39:07,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=733, PETRI_TRANSITIONS=689} [2021-06-10 11:39:07,450 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 10 predicate places. [2021-06-10 11:39:07,450 INFO L480 AbstractCegarLoop]: Abstraction has has 733 places, 689 transitions, 1614 flow [2021-06-10 11:39:07,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:07,451 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:07,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2021-06-10 11:39:07,451 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:07,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:07,451 INFO L82 PathProgramCache]: Analyzing trace with hash 970099042, now seen corresponding path program 1 times [2021-06-10 11:39:07,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:07,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621387658] [2021-06-10 11:39:07,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:07,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:07,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:07,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621387658] [2021-06-10 11:39:07,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:07,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:07,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577656054] [2021-06-10 11:39:07,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:07,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:07,469 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:07,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 689 transitions, 1614 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:07,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:07,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:07,678 INFO L129 PetriNetUnfolder]: 51/797 cut-off events. [2021-06-10 11:39:07,679 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:07,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 797 events. 51/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3322 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 945. Up to 28 conditions per place. [2021-06-10 11:39:07,718 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/687 dead transitions. [2021-06-10 11:39:07,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 687 transitions, 1627 flow [2021-06-10 11:39:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:07,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:07,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:07,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:07,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:07,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:07,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,722 INFO L185 Difference]: Start difference. First operand has 733 places, 689 transitions, 1614 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:07,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 733 places, 687 transitions, 1627 flow [2021-06-10 11:39:07,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 732 places, 687 transitions, 1626 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:07,728 INFO L241 Difference]: Finished difference. Result has 732 places, 687 transitions, 1610 flow [2021-06-10 11:39:07,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=732, PETRI_TRANSITIONS=687} [2021-06-10 11:39:07,728 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 9 predicate places. [2021-06-10 11:39:07,729 INFO L480 AbstractCegarLoop]: Abstraction has has 732 places, 687 transitions, 1610 flow [2021-06-10 11:39:07,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:07,729 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:07,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2021-06-10 11:39:07,729 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash -148757437, now seen corresponding path program 1 times [2021-06-10 11:39:07,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:07,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186797284] [2021-06-10 11:39:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:07,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:07,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:07,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:07,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186797284] [2021-06-10 11:39:07,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:07,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:07,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402903158] [2021-06-10 11:39:07,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:07,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:07,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:07,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 687 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:07,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:07,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:07,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:07,960 INFO L129 PetriNetUnfolder]: 50/804 cut-off events. [2021-06-10 11:39:07,961 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:07,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 804 events. 50/804 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3377 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 950. Up to 28 conditions per place. [2021-06-10 11:39:08,028 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/688 dead transitions. [2021-06-10 11:39:08,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 688 transitions, 1626 flow [2021-06-10 11:39:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:08,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:08,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:08,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:08,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:08,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:08,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,031 INFO L185 Difference]: Start difference. First operand has 732 places, 687 transitions, 1610 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:08,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 688 transitions, 1626 flow [2021-06-10 11:39:08,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 688 transitions, 1625 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:08,036 INFO L241 Difference]: Finished difference. Result has 734 places, 687 transitions, 1614 flow [2021-06-10 11:39:08,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=734, PETRI_TRANSITIONS=687} [2021-06-10 11:39:08,037 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 11 predicate places. [2021-06-10 11:39:08,037 INFO L480 AbstractCegarLoop]: Abstraction has has 734 places, 687 transitions, 1614 flow [2021-06-10 11:39:08,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,037 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:08,037 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:08,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2021-06-10 11:39:08,037 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash -148756414, now seen corresponding path program 1 times [2021-06-10 11:39:08,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:08,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044859272] [2021-06-10 11:39:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:08,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:08,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:08,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044859272] [2021-06-10 11:39:08,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:08,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:08,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627192248] [2021-06-10 11:39:08,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:08,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:08,054 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:08,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 687 transitions, 1614 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:08,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:08,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:08,266 INFO L129 PetriNetUnfolder]: 48/806 cut-off events. [2021-06-10 11:39:08,266 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:08,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 806 events. 48/806 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3412 event pairs, 0 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 961. Up to 28 conditions per place. [2021-06-10 11:39:08,304 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/688 dead transitions. [2021-06-10 11:39:08,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 688 transitions, 1640 flow [2021-06-10 11:39:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:08,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:08,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:08,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:08,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:08,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:08,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,308 INFO L185 Difference]: Start difference. First operand has 734 places, 687 transitions, 1614 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 688 transitions, 1640 flow [2021-06-10 11:39:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 688 transitions, 1639 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:08,314 INFO L241 Difference]: Finished difference. Result has 737 places, 688 transitions, 1631 flow [2021-06-10 11:39:08,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=737, PETRI_TRANSITIONS=688} [2021-06-10 11:39:08,314 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 14 predicate places. [2021-06-10 11:39:08,314 INFO L480 AbstractCegarLoop]: Abstraction has has 737 places, 688 transitions, 1631 flow [2021-06-10 11:39:08,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:08,314 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:08,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2021-06-10 11:39:08,314 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:08,315 INFO L82 PathProgramCache]: Analyzing trace with hash -149709726, now seen corresponding path program 1 times [2021-06-10 11:39:08,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:08,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701977079] [2021-06-10 11:39:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:08,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:08,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:08,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701977079] [2021-06-10 11:39:08,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:08,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:08,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095279733] [2021-06-10 11:39:08,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:08,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:08,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:08,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 688 transitions, 1631 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:08,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:08,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:08,539 INFO L129 PetriNetUnfolder]: 48/799 cut-off events. [2021-06-10 11:39:08,540 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:08,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 799 events. 48/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3351 event pairs, 0 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 947. Up to 28 conditions per place. [2021-06-10 11:39:08,577 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/686 dead transitions. [2021-06-10 11:39:08,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 686 transitions, 1633 flow [2021-06-10 11:39:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:08,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:08,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:08,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:08,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:08,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:08,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,581 INFO L185 Difference]: Start difference. First operand has 737 places, 688 transitions, 1631 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:08,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 686 transitions, 1633 flow [2021-06-10 11:39:08,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 686 transitions, 1625 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:08,587 INFO L241 Difference]: Finished difference. Result has 737 places, 686 transitions, 1618 flow [2021-06-10 11:39:08,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=737, PETRI_TRANSITIONS=686} [2021-06-10 11:39:08,587 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 14 predicate places. [2021-06-10 11:39:08,587 INFO L480 AbstractCegarLoop]: Abstraction has has 737 places, 686 transitions, 1618 flow [2021-06-10 11:39:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:08,587 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:08,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2021-06-10 11:39:08,587 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash -149710749, now seen corresponding path program 1 times [2021-06-10 11:39:08,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:08,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491849942] [2021-06-10 11:39:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:08,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:08,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:08,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491849942] [2021-06-10 11:39:08,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:08,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:08,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452529739] [2021-06-10 11:39:08,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:08,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:08,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:08,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:08,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 686 transitions, 1618 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:08,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:08,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:08,812 INFO L129 PetriNetUnfolder]: 48/797 cut-off events. [2021-06-10 11:39:08,813 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:08,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 797 events. 48/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3338 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 951. Up to 28 conditions per place. [2021-06-10 11:39:08,851 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/684 dead transitions. [2021-06-10 11:39:08,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 684 transitions, 1631 flow [2021-06-10 11:39:08,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:08,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:08,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:08,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:08,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:08,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:08,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,855 INFO L185 Difference]: Start difference. First operand has 737 places, 686 transitions, 1618 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:08,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 684 transitions, 1631 flow [2021-06-10 11:39:08,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 736 places, 684 transitions, 1630 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:08,861 INFO L241 Difference]: Finished difference. Result has 736 places, 684 transitions, 1614 flow [2021-06-10 11:39:08,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1614, PETRI_PLACES=736, PETRI_TRANSITIONS=684} [2021-06-10 11:39:08,861 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 13 predicate places. [2021-06-10 11:39:08,861 INFO L480 AbstractCegarLoop]: Abstraction has has 736 places, 684 transitions, 1614 flow [2021-06-10 11:39:08,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:08,862 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:08,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2021-06-10 11:39:08,862 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2072194084, now seen corresponding path program 1 times [2021-06-10 11:39:08,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:08,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509317462] [2021-06-10 11:39:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:08,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:08,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:08,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:08,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509317462] [2021-06-10 11:39:08,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:08,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:08,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317797174] [2021-06-10 11:39:08,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:08,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:08,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:08,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 684 transitions, 1614 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:08,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:08,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:08,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:09,107 INFO L129 PetriNetUnfolder]: 47/804 cut-off events. [2021-06-10 11:39:09,108 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:09,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 804 events. 47/804 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3395 event pairs, 0 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 956. Up to 28 conditions per place. [2021-06-10 11:39:09,145 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/685 dead transitions. [2021-06-10 11:39:09,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 685 transitions, 1630 flow [2021-06-10 11:39:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:09,146 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:09,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:09,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:09,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:09,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:09,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,149 INFO L185 Difference]: Start difference. First operand has 736 places, 684 transitions, 1614 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:09,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 685 transitions, 1630 flow [2021-06-10 11:39:09,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 685 transitions, 1629 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:09,154 INFO L241 Difference]: Finished difference. Result has 738 places, 684 transitions, 1618 flow [2021-06-10 11:39:09,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=738, PETRI_TRANSITIONS=684} [2021-06-10 11:39:09,155 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 15 predicate places. [2021-06-10 11:39:09,155 INFO L480 AbstractCegarLoop]: Abstraction has has 738 places, 684 transitions, 1618 flow [2021-06-10 11:39:09,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,155 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:09,155 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:09,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2021-06-10 11:39:09,155 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2072195107, now seen corresponding path program 1 times [2021-06-10 11:39:09,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:09,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682086700] [2021-06-10 11:39:09,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:09,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:09,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:09,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682086700] [2021-06-10 11:39:09,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:09,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:09,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154862747] [2021-06-10 11:39:09,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:09,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:09,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:09,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 684 transitions, 1618 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:09,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:09,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:09,386 INFO L129 PetriNetUnfolder]: 45/806 cut-off events. [2021-06-10 11:39:09,386 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:09,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 806 events. 45/806 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3432 event pairs, 0 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 967. Up to 28 conditions per place. [2021-06-10 11:39:09,424 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2021-06-10 11:39:09,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 685 transitions, 1644 flow [2021-06-10 11:39:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:09,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:09,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:09,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:09,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:09,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:09,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,428 INFO L185 Difference]: Start difference. First operand has 738 places, 684 transitions, 1618 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 740 places, 685 transitions, 1644 flow [2021-06-10 11:39:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 739 places, 685 transitions, 1643 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:09,434 INFO L241 Difference]: Finished difference. Result has 741 places, 685 transitions, 1635 flow [2021-06-10 11:39:09,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=737, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=741, PETRI_TRANSITIONS=685} [2021-06-10 11:39:09,434 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 18 predicate places. [2021-06-10 11:39:09,434 INFO L480 AbstractCegarLoop]: Abstraction has has 741 places, 685 transitions, 1635 flow [2021-06-10 11:39:09,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,435 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:09,435 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:09,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2021-06-10 11:39:09,435 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2071241795, now seen corresponding path program 1 times [2021-06-10 11:39:09,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:09,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550770010] [2021-06-10 11:39:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:09,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:09,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:09,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550770010] [2021-06-10 11:39:09,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:09,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:09,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438607718] [2021-06-10 11:39:09,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:09,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:09,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:09,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 685 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:09,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:09,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:09,671 INFO L129 PetriNetUnfolder]: 45/799 cut-off events. [2021-06-10 11:39:09,671 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:09,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 799 events. 45/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3370 event pairs, 0 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 953. Up to 28 conditions per place. [2021-06-10 11:39:09,700 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2021-06-10 11:39:09,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 683 transitions, 1637 flow [2021-06-10 11:39:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:09,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:09,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:09,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:09,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:09,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:09,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,704 INFO L185 Difference]: Start difference. First operand has 741 places, 685 transitions, 1635 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:09,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 683 transitions, 1637 flow [2021-06-10 11:39:09,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 683 transitions, 1629 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:09,709 INFO L241 Difference]: Finished difference. Result has 741 places, 683 transitions, 1622 flow [2021-06-10 11:39:09,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1622, PETRI_PLACES=741, PETRI_TRANSITIONS=683} [2021-06-10 11:39:09,710 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 18 predicate places. [2021-06-10 11:39:09,710 INFO L480 AbstractCegarLoop]: Abstraction has has 741 places, 683 transitions, 1622 flow [2021-06-10 11:39:09,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:09,710 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:09,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2021-06-10 11:39:09,710 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2071240772, now seen corresponding path program 1 times [2021-06-10 11:39:09,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:09,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100033605] [2021-06-10 11:39:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:09,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:09,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:09,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100033605] [2021-06-10 11:39:09,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:09,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:09,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728397093] [2021-06-10 11:39:09,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:09,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:09,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:09,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:09,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 683 transitions, 1622 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:09,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:09,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:09,935 INFO L129 PetriNetUnfolder]: 45/797 cut-off events. [2021-06-10 11:39:09,935 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:09,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 797 events. 45/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3354 event pairs, 0 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 957. Up to 28 conditions per place. [2021-06-10 11:39:09,973 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/681 dead transitions. [2021-06-10 11:39:09,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 681 transitions, 1635 flow [2021-06-10 11:39:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:09,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:09,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:09,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:09,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:09,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:09,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,977 INFO L185 Difference]: Start difference. First operand has 741 places, 683 transitions, 1622 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:09,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 681 transitions, 1635 flow [2021-06-10 11:39:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 681 transitions, 1634 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:09,983 INFO L241 Difference]: Finished difference. Result has 740 places, 681 transitions, 1618 flow [2021-06-10 11:39:09,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=738, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1618, PETRI_PLACES=740, PETRI_TRANSITIONS=681} [2021-06-10 11:39:09,983 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 17 predicate places. [2021-06-10 11:39:09,983 INFO L480 AbstractCegarLoop]: Abstraction has has 740 places, 681 transitions, 1618 flow [2021-06-10 11:39:09,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:09,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:09,984 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:09,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2021-06-10 11:39:09,984 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash -984843899, now seen corresponding path program 1 times [2021-06-10 11:39:09,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:09,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071013258] [2021-06-10 11:39:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:09,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:09,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:09,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:10,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:10,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071013258] [2021-06-10 11:39:10,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:10,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:10,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100956737] [2021-06-10 11:39:10,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:10,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:10,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:10,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 681 transitions, 1618 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:10,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:10,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:10,229 INFO L129 PetriNetUnfolder]: 44/805 cut-off events. [2021-06-10 11:39:10,229 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:10,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 805 events. 44/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3425 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 969. Up to 28 conditions per place. [2021-06-10 11:39:10,268 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/683 dead transitions. [2021-06-10 11:39:10,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 683 transitions, 1648 flow [2021-06-10 11:39:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:10,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:10,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:10,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:10,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:10,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:10,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,271 INFO L185 Difference]: Start difference. First operand has 740 places, 681 transitions, 1618 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:10,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 683 transitions, 1648 flow [2021-06-10 11:39:10,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 683 transitions, 1647 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:10,277 INFO L241 Difference]: Finished difference. Result has 743 places, 683 transitions, 1641 flow [2021-06-10 11:39:10,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=743, PETRI_TRANSITIONS=683} [2021-06-10 11:39:10,277 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 20 predicate places. [2021-06-10 11:39:10,278 INFO L480 AbstractCegarLoop]: Abstraction has has 743 places, 683 transitions, 1641 flow [2021-06-10 11:39:10,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:10,278 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:10,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2021-06-10 11:39:10,278 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -984844922, now seen corresponding path program 1 times [2021-06-10 11:39:10,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:10,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964738063] [2021-06-10 11:39:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:10,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:10,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:10,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964738063] [2021-06-10 11:39:10,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:10,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:10,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059321935] [2021-06-10 11:39:10,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:10,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:10,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:10,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 683 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:10,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:10,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:10,509 INFO L129 PetriNetUnfolder]: 42/806 cut-off events. [2021-06-10 11:39:10,510 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:10,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 806 events. 42/806 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3445 event pairs, 0 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 969. Up to 28 conditions per place. [2021-06-10 11:39:10,547 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2021-06-10 11:39:10,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 683 transitions, 1653 flow [2021-06-10 11:39:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:10,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:10,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:10,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:10,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:10,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:10,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,551 INFO L185 Difference]: Start difference. First operand has 743 places, 683 transitions, 1641 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:10,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 683 transitions, 1653 flow [2021-06-10 11:39:10,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 683 transitions, 1648 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:10,557 INFO L241 Difference]: Finished difference. Result has 745 places, 682 transitions, 1637 flow [2021-06-10 11:39:10,557 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=745, PETRI_TRANSITIONS=682} [2021-06-10 11:39:10,557 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 22 predicate places. [2021-06-10 11:39:10,557 INFO L480 AbstractCegarLoop]: Abstraction has has 745 places, 682 transitions, 1637 flow [2021-06-10 11:39:10,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:10,557 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:10,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2021-06-10 11:39:10,558 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash -985797211, now seen corresponding path program 1 times [2021-06-10 11:39:10,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:10,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999836944] [2021-06-10 11:39:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:10,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:10,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:10,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999836944] [2021-06-10 11:39:10,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:10,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:10,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133110384] [2021-06-10 11:39:10,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:10,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:10,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:10,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 682 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:10,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:10,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:10,786 INFO L129 PetriNetUnfolder]: 42/799 cut-off events. [2021-06-10 11:39:10,786 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:10,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 799 events. 42/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3384 event pairs, 0 based on Foata normal form. 1/732 useless extension candidates. Maximal degree in co-relation 963. Up to 28 conditions per place. [2021-06-10 11:39:10,824 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/680 dead transitions. [2021-06-10 11:39:10,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 680 transitions, 1640 flow [2021-06-10 11:39:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:10,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:10,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:10,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:10,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:10,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:10,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,827 INFO L185 Difference]: Start difference. First operand has 745 places, 682 transitions, 1637 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:10,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 680 transitions, 1640 flow [2021-06-10 11:39:10,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 680 transitions, 1633 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:10,833 INFO L241 Difference]: Finished difference. Result has 745 places, 680 transitions, 1626 flow [2021-06-10 11:39:10,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1626, PETRI_PLACES=745, PETRI_TRANSITIONS=680} [2021-06-10 11:39:10,833 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 22 predicate places. [2021-06-10 11:39:10,834 INFO L480 AbstractCegarLoop]: Abstraction has has 745 places, 680 transitions, 1626 flow [2021-06-10 11:39:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:10,834 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:10,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2021-06-10 11:39:10,834 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:10,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash -985798234, now seen corresponding path program 1 times [2021-06-10 11:39:10,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:10,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691353926] [2021-06-10 11:39:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:10,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:10,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:10,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:10,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691353926] [2021-06-10 11:39:10,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:10,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:10,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987069032] [2021-06-10 11:39:10,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:10,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:10,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:10,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 680 transitions, 1626 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:10,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:10,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:10,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:11,071 INFO L129 PetriNetUnfolder]: 42/797 cut-off events. [2021-06-10 11:39:11,071 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:11,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 797 events. 42/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3373 event pairs, 0 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 963. Up to 28 conditions per place. [2021-06-10 11:39:11,108 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/678 dead transitions. [2021-06-10 11:39:11,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 678 transitions, 1639 flow [2021-06-10 11:39:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:11,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:11,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:11,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:11,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:11,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:11,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,112 INFO L185 Difference]: Start difference. First operand has 745 places, 680 transitions, 1626 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:11,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 678 transitions, 1639 flow [2021-06-10 11:39:11,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 678 transitions, 1638 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:11,118 INFO L241 Difference]: Finished difference. Result has 744 places, 678 transitions, 1622 flow [2021-06-10 11:39:11,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1622, PETRI_PLACES=744, PETRI_TRANSITIONS=678} [2021-06-10 11:39:11,118 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 21 predicate places. [2021-06-10 11:39:11,118 INFO L480 AbstractCegarLoop]: Abstraction has has 744 places, 678 transitions, 1622 flow [2021-06-10 11:39:11,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,118 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:11,118 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:11,118 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2021-06-10 11:39:11,118 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1857470216, now seen corresponding path program 1 times [2021-06-10 11:39:11,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:11,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688651203] [2021-06-10 11:39:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:11,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:11,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:11,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688651203] [2021-06-10 11:39:11,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:11,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:11,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742614301] [2021-06-10 11:39:11,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:11,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:11,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:11,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 678 transitions, 1622 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:11,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:11,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:11,367 INFO L129 PetriNetUnfolder]: 40/802 cut-off events. [2021-06-10 11:39:11,368 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:11,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 802 events. 40/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3423 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 966. Up to 28 conditions per place. [2021-06-10 11:39:11,406 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2021-06-10 11:39:11,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 679 transitions, 1638 flow [2021-06-10 11:39:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:11,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:11,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:11,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:11,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:11,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:11,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,410 INFO L185 Difference]: Start difference. First operand has 744 places, 678 transitions, 1622 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 679 transitions, 1638 flow [2021-06-10 11:39:11,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 679 transitions, 1637 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:11,416 INFO L241 Difference]: Finished difference. Result has 747 places, 679 transitions, 1635 flow [2021-06-10 11:39:11,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=747, PETRI_TRANSITIONS=679} [2021-06-10 11:39:11,416 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 24 predicate places. [2021-06-10 11:39:11,416 INFO L480 AbstractCegarLoop]: Abstraction has has 747 places, 679 transitions, 1635 flow [2021-06-10 11:39:11,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:11,417 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:11,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2021-06-10 11:39:11,417 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1857469193, now seen corresponding path program 1 times [2021-06-10 11:39:11,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:11,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600740115] [2021-06-10 11:39:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:11,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:11,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:11,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600740115] [2021-06-10 11:39:11,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:11,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:11,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730084483] [2021-06-10 11:39:11,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:11,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:11,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:11,435 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:11,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 679 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:11,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:11,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:11,658 INFO L129 PetriNetUnfolder]: 40/803 cut-off events. [2021-06-10 11:39:11,659 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:11,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 803 events. 40/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3433 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 974. Up to 28 conditions per place. [2021-06-10 11:39:11,696 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/680 dead transitions. [2021-06-10 11:39:11,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 680 transitions, 1661 flow [2021-06-10 11:39:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:11,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:11,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:11,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:11,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:11,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:11,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,700 INFO L185 Difference]: Start difference. First operand has 747 places, 679 transitions, 1635 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:11,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 680 transitions, 1661 flow [2021-06-10 11:39:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 680 transitions, 1659 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:11,706 INFO L241 Difference]: Finished difference. Result has 750 places, 680 transitions, 1651 flow [2021-06-10 11:39:11,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=750, PETRI_TRANSITIONS=680} [2021-06-10 11:39:11,706 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 27 predicate places. [2021-06-10 11:39:11,706 INFO L480 AbstractCegarLoop]: Abstraction has has 750 places, 680 transitions, 1651 flow [2021-06-10 11:39:11,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,706 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:11,706 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:11,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2021-06-10 11:39:11,706 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1858422505, now seen corresponding path program 1 times [2021-06-10 11:39:11,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:11,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038151535] [2021-06-10 11:39:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:11,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:11,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:11,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:11,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038151535] [2021-06-10 11:39:11,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:11,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:11,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64022204] [2021-06-10 11:39:11,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:11,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:11,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:11,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 680 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:11,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:11,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:11,940 INFO L129 PetriNetUnfolder]: 39/799 cut-off events. [2021-06-10 11:39:11,940 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:11,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 799 events. 39/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3406 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 967. Up to 28 conditions per place. [2021-06-10 11:39:11,978 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2021-06-10 11:39:11,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 677 transitions, 1648 flow [2021-06-10 11:39:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:11,979 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:11,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:11,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:11,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:11,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:11,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,981 INFO L185 Difference]: Start difference. First operand has 750 places, 680 transitions, 1651 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 677 transitions, 1648 flow [2021-06-10 11:39:11,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 677 transitions, 1640 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:11,987 INFO L241 Difference]: Finished difference. Result has 749 places, 677 transitions, 1630 flow [2021-06-10 11:39:11,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=749, PETRI_TRANSITIONS=677} [2021-06-10 11:39:11,988 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 26 predicate places. [2021-06-10 11:39:11,988 INFO L480 AbstractCegarLoop]: Abstraction has has 749 places, 677 transitions, 1630 flow [2021-06-10 11:39:11,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:11,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:11,988 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:11,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2021-06-10 11:39:11,988 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1858423528, now seen corresponding path program 1 times [2021-06-10 11:39:11,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:11,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759554597] [2021-06-10 11:39:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:12,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:12,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:12,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759554597] [2021-06-10 11:39:12,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:12,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:12,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208759937] [2021-06-10 11:39:12,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:12,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:12,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:12,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:12,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 677 transitions, 1630 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:12,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:12,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:12,227 INFO L129 PetriNetUnfolder]: 39/797 cut-off events. [2021-06-10 11:39:12,228 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:12,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 797 events. 39/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3388 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 970. Up to 28 conditions per place. [2021-06-10 11:39:12,265 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/675 dead transitions. [2021-06-10 11:39:12,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 675 transitions, 1643 flow [2021-06-10 11:39:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:12,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:12,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:12,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:12,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:12,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:12,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,269 INFO L185 Difference]: Start difference. First operand has 749 places, 677 transitions, 1630 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:12,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 675 transitions, 1643 flow [2021-06-10 11:39:12,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 675 transitions, 1642 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:12,275 INFO L241 Difference]: Finished difference. Result has 748 places, 675 transitions, 1626 flow [2021-06-10 11:39:12,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1626, PETRI_PLACES=748, PETRI_TRANSITIONS=675} [2021-06-10 11:39:12,275 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 25 predicate places. [2021-06-10 11:39:12,275 INFO L480 AbstractCegarLoop]: Abstraction has has 748 places, 675 transitions, 1626 flow [2021-06-10 11:39:12,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:12,275 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:12,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2021-06-10 11:39:12,276 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1588269260, now seen corresponding path program 1 times [2021-06-10 11:39:12,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:12,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826447932] [2021-06-10 11:39:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:12,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:12,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:12,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826447932] [2021-06-10 11:39:12,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:12,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:12,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323696342] [2021-06-10 11:39:12,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:12,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:12,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:12,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 675 transitions, 1626 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:12,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:12,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:12,530 INFO L129 PetriNetUnfolder]: 38/805 cut-off events. [2021-06-10 11:39:12,531 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:12,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 805 events. 38/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3462 event pairs, 0 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 982. Up to 28 conditions per place. [2021-06-10 11:39:12,570 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/677 dead transitions. [2021-06-10 11:39:12,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 677 transitions, 1656 flow [2021-06-10 11:39:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:12,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:12,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:12,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:12,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:12,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,574 INFO L185 Difference]: Start difference. First operand has 748 places, 675 transitions, 1626 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:12,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 677 transitions, 1656 flow [2021-06-10 11:39:12,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 677 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:12,580 INFO L241 Difference]: Finished difference. Result has 751 places, 677 transitions, 1649 flow [2021-06-10 11:39:12,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=751, PETRI_TRANSITIONS=677} [2021-06-10 11:39:12,581 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 28 predicate places. [2021-06-10 11:39:12,581 INFO L480 AbstractCegarLoop]: Abstraction has has 751 places, 677 transitions, 1649 flow [2021-06-10 11:39:12,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:12,581 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:12,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2021-06-10 11:39:12,581 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:12,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1588268237, now seen corresponding path program 1 times [2021-06-10 11:39:12,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:12,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792582727] [2021-06-10 11:39:12,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:12,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:12,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:12,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792582727] [2021-06-10 11:39:12,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:12,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:12,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341248032] [2021-06-10 11:39:12,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:12,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:12,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:12,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:12,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:12,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 677 transitions, 1649 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:12,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:12,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:12,864 INFO L129 PetriNetUnfolder]: 36/806 cut-off events. [2021-06-10 11:39:12,864 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:12,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 806 events. 36/806 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3481 event pairs, 0 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 982. Up to 28 conditions per place. [2021-06-10 11:39:12,894 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2021-06-10 11:39:12,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 677 transitions, 1661 flow [2021-06-10 11:39:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:12,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:12,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:12,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:12,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:12,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:12,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,897 INFO L185 Difference]: Start difference. First operand has 751 places, 677 transitions, 1649 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:12,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 677 transitions, 1661 flow [2021-06-10 11:39:12,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 677 transitions, 1656 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:12,903 INFO L241 Difference]: Finished difference. Result has 753 places, 676 transitions, 1645 flow [2021-06-10 11:39:12,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1645, PETRI_PLACES=753, PETRI_TRANSITIONS=676} [2021-06-10 11:39:12,903 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 30 predicate places. [2021-06-10 11:39:12,903 INFO L480 AbstractCegarLoop]: Abstraction has has 753 places, 676 transitions, 1645 flow [2021-06-10 11:39:12,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:12,904 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:12,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2021-06-10 11:39:12,904 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:12,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1587315948, now seen corresponding path program 1 times [2021-06-10 11:39:12,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:12,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137810703] [2021-06-10 11:39:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:12,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:12,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:12,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:12,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137810703] [2021-06-10 11:39:12,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:12,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:12,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230331724] [2021-06-10 11:39:12,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:12,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:12,922 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:12,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 676 transitions, 1645 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:12,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:12,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:12,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:13,139 INFO L129 PetriNetUnfolder]: 36/799 cut-off events. [2021-06-10 11:39:13,140 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:13,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 799 events. 36/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3423 event pairs, 0 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 976. Up to 28 conditions per place. [2021-06-10 11:39:13,177 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2021-06-10 11:39:13,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 674 transitions, 1648 flow [2021-06-10 11:39:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:13,178 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:13,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:13,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:13,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:13,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:13,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,181 INFO L185 Difference]: Start difference. First operand has 753 places, 676 transitions, 1645 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:13,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 674 transitions, 1648 flow [2021-06-10 11:39:13,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 674 transitions, 1641 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:13,187 INFO L241 Difference]: Finished difference. Result has 753 places, 674 transitions, 1634 flow [2021-06-10 11:39:13,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=753, PETRI_TRANSITIONS=674} [2021-06-10 11:39:13,187 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 30 predicate places. [2021-06-10 11:39:13,187 INFO L480 AbstractCegarLoop]: Abstraction has has 753 places, 674 transitions, 1634 flow [2021-06-10 11:39:13,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:13,187 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:13,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2021-06-10 11:39:13,187 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1587314925, now seen corresponding path program 1 times [2021-06-10 11:39:13,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:13,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312307382] [2021-06-10 11:39:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:13,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:13,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:13,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312307382] [2021-06-10 11:39:13,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:13,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:13,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507329214] [2021-06-10 11:39:13,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:13,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:13,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:13,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 674 transitions, 1634 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:13,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:13,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:13,427 INFO L129 PetriNetUnfolder]: 36/797 cut-off events. [2021-06-10 11:39:13,427 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:13,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 797 events. 36/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3409 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 976. Up to 28 conditions per place. [2021-06-10 11:39:13,465 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2021-06-10 11:39:13,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 672 transitions, 1647 flow [2021-06-10 11:39:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:13,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:13,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:13,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:13,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:13,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:13,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,468 INFO L185 Difference]: Start difference. First operand has 753 places, 674 transitions, 1634 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:13,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 672 transitions, 1647 flow [2021-06-10 11:39:13,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 672 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:13,474 INFO L241 Difference]: Finished difference. Result has 752 places, 672 transitions, 1630 flow [2021-06-10 11:39:13,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1630, PETRI_PLACES=752, PETRI_TRANSITIONS=672} [2021-06-10 11:39:13,475 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 29 predicate places. [2021-06-10 11:39:13,475 INFO L480 AbstractCegarLoop]: Abstraction has has 752 places, 672 transitions, 1630 flow [2021-06-10 11:39:13,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:13,475 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:13,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2021-06-10 11:39:13,475 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:13,475 INFO L82 PathProgramCache]: Analyzing trace with hash -694054447, now seen corresponding path program 1 times [2021-06-10 11:39:13,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:13,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869015315] [2021-06-10 11:39:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:13,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:13,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:13,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869015315] [2021-06-10 11:39:13,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:13,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:13,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806858537] [2021-06-10 11:39:13,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:13,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:13,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:13,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 672 transitions, 1630 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:13,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:13,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:13,720 INFO L129 PetriNetUnfolder]: 34/802 cut-off events. [2021-06-10 11:39:13,720 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:13,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 802 events. 34/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3458 event pairs, 0 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 979. Up to 28 conditions per place. [2021-06-10 11:39:13,758 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2021-06-10 11:39:13,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 673 transitions, 1646 flow [2021-06-10 11:39:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:13,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:13,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:13,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:13,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:13,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:13,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,761 INFO L185 Difference]: Start difference. First operand has 752 places, 672 transitions, 1630 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:13,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 754 places, 673 transitions, 1646 flow [2021-06-10 11:39:13,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 673 transitions, 1645 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:13,768 INFO L241 Difference]: Finished difference. Result has 755 places, 673 transitions, 1643 flow [2021-06-10 11:39:13,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=755, PETRI_TRANSITIONS=673} [2021-06-10 11:39:13,768 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 32 predicate places. [2021-06-10 11:39:13,768 INFO L480 AbstractCegarLoop]: Abstraction has has 755 places, 673 transitions, 1643 flow [2021-06-10 11:39:13,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:13,768 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:13,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2021-06-10 11:39:13,768 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -694055470, now seen corresponding path program 1 times [2021-06-10 11:39:13,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:13,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891305701] [2021-06-10 11:39:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:13,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:13,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:13,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:13,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891305701] [2021-06-10 11:39:13,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:13,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:13,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688951141] [2021-06-10 11:39:13,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:13,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:13,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:13,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 673 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:13,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:13,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:13,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:14,018 INFO L129 PetriNetUnfolder]: 34/803 cut-off events. [2021-06-10 11:39:14,018 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:14,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 803 events. 34/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3464 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 987. Up to 28 conditions per place. [2021-06-10 11:39:14,058 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2021-06-10 11:39:14,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 674 transitions, 1669 flow [2021-06-10 11:39:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:14,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:14,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:14,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:14,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:14,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:14,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,062 INFO L185 Difference]: Start difference. First operand has 755 places, 673 transitions, 1643 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:14,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 674 transitions, 1669 flow [2021-06-10 11:39:14,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 674 transitions, 1667 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:14,068 INFO L241 Difference]: Finished difference. Result has 758 places, 674 transitions, 1659 flow [2021-06-10 11:39:14,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=758, PETRI_TRANSITIONS=674} [2021-06-10 11:39:14,069 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 35 predicate places. [2021-06-10 11:39:14,069 INFO L480 AbstractCegarLoop]: Abstraction has has 758 places, 674 transitions, 1659 flow [2021-06-10 11:39:14,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,069 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:14,069 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:14,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2021-06-10 11:39:14,069 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -693101135, now seen corresponding path program 1 times [2021-06-10 11:39:14,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:14,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117516256] [2021-06-10 11:39:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:14,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:14,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:14,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117516256] [2021-06-10 11:39:14,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:14,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:14,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491503087] [2021-06-10 11:39:14,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:14,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:14,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:14,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:14,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 674 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:14,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:14,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:14,323 INFO L129 PetriNetUnfolder]: 33/800 cut-off events. [2021-06-10 11:39:14,323 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:39:14,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 800 events. 33/800 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3448 event pairs, 0 based on Foata normal form. 2/742 useless extension candidates. Maximal degree in co-relation 986. Up to 28 conditions per place. [2021-06-10 11:39:14,361 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 9 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2021-06-10 11:39:14,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 672 transitions, 1667 flow [2021-06-10 11:39:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2021-06-10 11:39:14,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2021-06-10 11:39:14,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2021-06-10 11:39:14,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2021-06-10 11:39:14,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:14,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2021-06-10 11:39:14,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.0) internal successors, (2142), 3 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,364 INFO L185 Difference]: Start difference. First operand has 758 places, 674 transitions, 1659 flow. Second operand 3 states and 2142 transitions. [2021-06-10 11:39:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 672 transitions, 1667 flow [2021-06-10 11:39:14,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 672 transitions, 1666 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:14,403 INFO L241 Difference]: Finished difference. Result has 759 places, 672 transitions, 1648 flow [2021-06-10 11:39:14,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1648, PETRI_PLACES=759, PETRI_TRANSITIONS=672} [2021-06-10 11:39:14,404 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 36 predicate places. [2021-06-10 11:39:14,404 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 672 transitions, 1648 flow [2021-06-10 11:39:14,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:14,404 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:14,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2021-06-10 11:39:14,404 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -693102158, now seen corresponding path program 1 times [2021-06-10 11:39:14,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:14,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755224109] [2021-06-10 11:39:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:14,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:14,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:14,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755224109] [2021-06-10 11:39:14,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:14,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:14,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401856651] [2021-06-10 11:39:14,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:14,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:14,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:14,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 672 transitions, 1648 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:14,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:14,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:14,652 INFO L129 PetriNetUnfolder]: 33/797 cut-off events. [2021-06-10 11:39:14,652 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:14,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 797 events. 33/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3422 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 980. Up to 28 conditions per place. [2021-06-10 11:39:14,689 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/669 dead transitions. [2021-06-10 11:39:14,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 669 transitions, 1649 flow [2021-06-10 11:39:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:14,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:14,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:14,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:14,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:14,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:14,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,692 INFO L185 Difference]: Start difference. First operand has 759 places, 672 transitions, 1648 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:14,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 669 transitions, 1649 flow [2021-06-10 11:39:14,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 669 transitions, 1644 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:14,698 INFO L241 Difference]: Finished difference. Result has 756 places, 669 transitions, 1634 flow [2021-06-10 11:39:14,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=756, PETRI_TRANSITIONS=669} [2021-06-10 11:39:14,699 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 33 predicate places. [2021-06-10 11:39:14,699 INFO L480 AbstractCegarLoop]: Abstraction has has 756 places, 669 transitions, 1634 flow [2021-06-10 11:39:14,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:14,699 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:14,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2021-06-10 11:39:14,699 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 704259383, now seen corresponding path program 1 times [2021-06-10 11:39:14,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:14,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217066799] [2021-06-10 11:39:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:14,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:14,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:14,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:14,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217066799] [2021-06-10 11:39:14,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:14,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:14,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957855696] [2021-06-10 11:39:14,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:14,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:14,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:14,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 669 transitions, 1634 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:14,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:14,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:14,939 INFO L129 PetriNetUnfolder]: 31/802 cut-off events. [2021-06-10 11:39:14,939 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:14,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 802 events. 31/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3475 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 988. Up to 28 conditions per place. [2021-06-10 11:39:14,976 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/670 dead transitions. [2021-06-10 11:39:14,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 670 transitions, 1650 flow [2021-06-10 11:39:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:14,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:14,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:14,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:14,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:14,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:14,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,980 INFO L185 Difference]: Start difference. First operand has 756 places, 669 transitions, 1634 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:14,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 670 transitions, 1650 flow [2021-06-10 11:39:14,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 757 places, 670 transitions, 1649 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:14,986 INFO L241 Difference]: Finished difference. Result has 759 places, 670 transitions, 1647 flow [2021-06-10 11:39:14,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=759, PETRI_TRANSITIONS=670} [2021-06-10 11:39:14,987 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 36 predicate places. [2021-06-10 11:39:14,987 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 670 transitions, 1647 flow [2021-06-10 11:39:14,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:14,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:14,987 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:14,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2021-06-10 11:39:14,987 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash 704258360, now seen corresponding path program 1 times [2021-06-10 11:39:14,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:14,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777596541] [2021-06-10 11:39:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:15,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:15,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:15,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777596541] [2021-06-10 11:39:15,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:15,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:15,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156768704] [2021-06-10 11:39:15,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:15,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:15,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:15,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 670 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:15,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:15,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:15,239 INFO L129 PetriNetUnfolder]: 31/803 cut-off events. [2021-06-10 11:39:15,240 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:15,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 803 events. 31/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3484 event pairs, 0 based on Foata normal form. 0/744 useless extension candidates. Maximal degree in co-relation 994. Up to 28 conditions per place. [2021-06-10 11:39:15,277 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2021-06-10 11:39:15,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 671 transitions, 1673 flow [2021-06-10 11:39:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:15,279 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:15,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:15,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:15,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:15,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:15,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,281 INFO L185 Difference]: Start difference. First operand has 759 places, 670 transitions, 1647 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:15,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 671 transitions, 1673 flow [2021-06-10 11:39:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 760 places, 671 transitions, 1671 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:15,287 INFO L241 Difference]: Finished difference. Result has 762 places, 671 transitions, 1663 flow [2021-06-10 11:39:15,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=762, PETRI_TRANSITIONS=671} [2021-06-10 11:39:15,287 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 39 predicate places. [2021-06-10 11:39:15,287 INFO L480 AbstractCegarLoop]: Abstraction has has 762 places, 671 transitions, 1663 flow [2021-06-10 11:39:15,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:15,288 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:15,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2021-06-10 11:39:15,288 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 705211672, now seen corresponding path program 1 times [2021-06-10 11:39:15,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:15,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302437535] [2021-06-10 11:39:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:15,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:15,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302437535] [2021-06-10 11:39:15,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:15,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:15,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668572169] [2021-06-10 11:39:15,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:15,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:15,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:15,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:15,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 671 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:15,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:15,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:15,531 INFO L129 PetriNetUnfolder]: 30/799 cut-off events. [2021-06-10 11:39:15,531 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:15,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 799 events. 30/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3458 event pairs, 0 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 987. Up to 28 conditions per place. [2021-06-10 11:39:15,570 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/668 dead transitions. [2021-06-10 11:39:15,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 668 transitions, 1660 flow [2021-06-10 11:39:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:15,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:15,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:15,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:15,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:15,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:15,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,573 INFO L185 Difference]: Start difference. First operand has 762 places, 671 transitions, 1663 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:15,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 668 transitions, 1660 flow [2021-06-10 11:39:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 668 transitions, 1652 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:15,580 INFO L241 Difference]: Finished difference. Result has 761 places, 668 transitions, 1642 flow [2021-06-10 11:39:15,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=761, PETRI_TRANSITIONS=668} [2021-06-10 11:39:15,580 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 38 predicate places. [2021-06-10 11:39:15,580 INFO L480 AbstractCegarLoop]: Abstraction has has 761 places, 668 transitions, 1642 flow [2021-06-10 11:39:15,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:15,581 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:15,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2021-06-10 11:39:15,581 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash 705212695, now seen corresponding path program 1 times [2021-06-10 11:39:15,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:15,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476738421] [2021-06-10 11:39:15,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:15,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:15,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:15,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476738421] [2021-06-10 11:39:15,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:15,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:15,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538759843] [2021-06-10 11:39:15,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:15,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:15,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:15,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 668 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:15,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:15,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:15,833 INFO L129 PetriNetUnfolder]: 30/797 cut-off events. [2021-06-10 11:39:15,833 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:15,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 797 events. 30/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3444 event pairs, 0 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 990. Up to 28 conditions per place. [2021-06-10 11:39:15,870 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/666 dead transitions. [2021-06-10 11:39:15,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 666 transitions, 1655 flow [2021-06-10 11:39:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:15,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:15,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:15,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:15,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:15,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:15,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,873 INFO L185 Difference]: Start difference. First operand has 761 places, 668 transitions, 1642 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 666 transitions, 1655 flow [2021-06-10 11:39:15,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 760 places, 666 transitions, 1654 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:15,880 INFO L241 Difference]: Finished difference. Result has 760 places, 666 transitions, 1638 flow [2021-06-10 11:39:15,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1638, PETRI_PLACES=760, PETRI_TRANSITIONS=666} [2021-06-10 11:39:15,880 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 37 predicate places. [2021-06-10 11:39:15,880 INFO L480 AbstractCegarLoop]: Abstraction has has 760 places, 666 transitions, 1638 flow [2021-06-10 11:39:15,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:15,880 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:15,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2021-06-10 11:39:15,880 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1517565026, now seen corresponding path program 1 times [2021-06-10 11:39:15,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:15,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73158975] [2021-06-10 11:39:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:15,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:15,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:15,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:15,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73158975] [2021-06-10 11:39:15,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:15,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:15,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174084671] [2021-06-10 11:39:15,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:15,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:15,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:15,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 666 transitions, 1638 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:15,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:15,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:15,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:16,126 INFO L129 PetriNetUnfolder]: 28/802 cut-off events. [2021-06-10 11:39:16,126 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:16,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 802 events. 28/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3492 event pairs, 0 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 993. Up to 28 conditions per place. [2021-06-10 11:39:16,161 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/667 dead transitions. [2021-06-10 11:39:16,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 667 transitions, 1654 flow [2021-06-10 11:39:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:16,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:16,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:16,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:16,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:16,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:16,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,165 INFO L185 Difference]: Start difference. First operand has 760 places, 666 transitions, 1638 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:16,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 667 transitions, 1654 flow [2021-06-10 11:39:16,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 667 transitions, 1653 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:16,170 INFO L241 Difference]: Finished difference. Result has 763 places, 667 transitions, 1651 flow [2021-06-10 11:39:16,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=763, PETRI_TRANSITIONS=667} [2021-06-10 11:39:16,171 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 40 predicate places. [2021-06-10 11:39:16,171 INFO L480 AbstractCegarLoop]: Abstraction has has 763 places, 667 transitions, 1651 flow [2021-06-10 11:39:16,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,171 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:16,171 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:16,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2021-06-10 11:39:16,171 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1517566049, now seen corresponding path program 1 times [2021-06-10 11:39:16,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:16,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978962616] [2021-06-10 11:39:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:16,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:16,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:16,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978962616] [2021-06-10 11:39:16,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:16,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:16,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390054555] [2021-06-10 11:39:16,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:16,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:16,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:16,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 667 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:16,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:16,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:16,425 INFO L129 PetriNetUnfolder]: 28/803 cut-off events. [2021-06-10 11:39:16,425 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:16,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 803 events. 28/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3497 event pairs, 0 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 1001. Up to 28 conditions per place. [2021-06-10 11:39:16,463 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/668 dead transitions. [2021-06-10 11:39:16,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 668 transitions, 1677 flow [2021-06-10 11:39:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:16,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:16,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:16,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:16,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:16,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:16,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,466 INFO L185 Difference]: Start difference. First operand has 763 places, 667 transitions, 1651 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 668 transitions, 1677 flow [2021-06-10 11:39:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 668 transitions, 1675 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:16,472 INFO L241 Difference]: Finished difference. Result has 766 places, 668 transitions, 1667 flow [2021-06-10 11:39:16,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=766, PETRI_TRANSITIONS=668} [2021-06-10 11:39:16,473 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 43 predicate places. [2021-06-10 11:39:16,473 INFO L480 AbstractCegarLoop]: Abstraction has has 766 places, 668 transitions, 1667 flow [2021-06-10 11:39:16,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:16,473 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:16,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2021-06-10 11:39:16,473 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1516612737, now seen corresponding path program 1 times [2021-06-10 11:39:16,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:16,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389470465] [2021-06-10 11:39:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:16,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:16,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:16,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389470465] [2021-06-10 11:39:16,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:16,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:16,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404835392] [2021-06-10 11:39:16,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:16,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:16,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:16,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:16,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 668 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:16,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:16,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:16,720 INFO L129 PetriNetUnfolder]: 27/799 cut-off events. [2021-06-10 11:39:16,720 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:16,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 799 events. 27/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3473 event pairs, 0 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 994. Up to 28 conditions per place. [2021-06-10 11:39:16,758 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/665 dead transitions. [2021-06-10 11:39:16,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 768 places, 665 transitions, 1664 flow [2021-06-10 11:39:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:16,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:16,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:16,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:16,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:16,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:16,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,761 INFO L185 Difference]: Start difference. First operand has 766 places, 668 transitions, 1667 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:16,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 768 places, 665 transitions, 1664 flow [2021-06-10 11:39:16,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 765 places, 665 transitions, 1656 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:16,768 INFO L241 Difference]: Finished difference. Result has 765 places, 665 transitions, 1646 flow [2021-06-10 11:39:16,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=763, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=765, PETRI_TRANSITIONS=665} [2021-06-10 11:39:16,768 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 42 predicate places. [2021-06-10 11:39:16,768 INFO L480 AbstractCegarLoop]: Abstraction has has 765 places, 665 transitions, 1646 flow [2021-06-10 11:39:16,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,768 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:16,768 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:16,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2021-06-10 11:39:16,768 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1516611714, now seen corresponding path program 1 times [2021-06-10 11:39:16,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:16,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366211222] [2021-06-10 11:39:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:16,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:16,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:16,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:16,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366211222] [2021-06-10 11:39:16,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:16,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:16,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107859985] [2021-06-10 11:39:16,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:16,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:16,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:16,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 665 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:16,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:16,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:16,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:17,019 INFO L129 PetriNetUnfolder]: 27/797 cut-off events. [2021-06-10 11:39:17,019 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:17,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 797 events. 27/797 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3456 event pairs, 0 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 997. Up to 28 conditions per place. [2021-06-10 11:39:17,057 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/663 dead transitions. [2021-06-10 11:39:17,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 663 transitions, 1659 flow [2021-06-10 11:39:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:17,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:17,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:17,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:17,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:17,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,061 INFO L185 Difference]: Start difference. First operand has 765 places, 665 transitions, 1646 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:17,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 663 transitions, 1659 flow [2021-06-10 11:39:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 764 places, 663 transitions, 1658 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:17,067 INFO L241 Difference]: Finished difference. Result has 764 places, 663 transitions, 1642 flow [2021-06-10 11:39:17,067 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=762, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=764, PETRI_TRANSITIONS=663} [2021-06-10 11:39:17,068 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 41 predicate places. [2021-06-10 11:39:17,068 INFO L480 AbstractCegarLoop]: Abstraction has has 764 places, 663 transitions, 1642 flow [2021-06-10 11:39:17,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:17,068 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:17,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2021-06-10 11:39:17,068 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1335552615, now seen corresponding path program 1 times [2021-06-10 11:39:17,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:17,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421063548] [2021-06-10 11:39:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:17,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:17,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:17,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421063548] [2021-06-10 11:39:17,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:17,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:17,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531927335] [2021-06-10 11:39:17,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:17,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:17,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:17,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:17,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:17,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 663 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:17,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:17,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:17,321 INFO L129 PetriNetUnfolder]: 26/804 cut-off events. [2021-06-10 11:39:17,321 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:17,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 804 events. 26/804 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3522 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 1002. Up to 28 conditions per place. [2021-06-10 11:39:17,358 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/664 dead transitions. [2021-06-10 11:39:17,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 664 transitions, 1658 flow [2021-06-10 11:39:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:17,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:17,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:17,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:17,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:17,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:17,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,362 INFO L185 Difference]: Start difference. First operand has 764 places, 663 transitions, 1642 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:17,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 664 transitions, 1658 flow [2021-06-10 11:39:17,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 765 places, 664 transitions, 1657 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:17,368 INFO L241 Difference]: Finished difference. Result has 766 places, 663 transitions, 1646 flow [2021-06-10 11:39:17,368 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=763, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=766, PETRI_TRANSITIONS=663} [2021-06-10 11:39:17,368 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 43 predicate places. [2021-06-10 11:39:17,368 INFO L480 AbstractCegarLoop]: Abstraction has has 766 places, 663 transitions, 1646 flow [2021-06-10 11:39:17,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:17,369 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:17,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2021-06-10 11:39:17,369 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1335553638, now seen corresponding path program 1 times [2021-06-10 11:39:17,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:17,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214060645] [2021-06-10 11:39:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:17,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:17,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:17,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214060645] [2021-06-10 11:39:17,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:17,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:17,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979810847] [2021-06-10 11:39:17,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:17,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:17,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:17,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 663 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:17,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:17,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:17,636 INFO L129 PetriNetUnfolder]: 24/806 cut-off events. [2021-06-10 11:39:17,636 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:17,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 806 events. 24/806 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3554 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 1013. Up to 28 conditions per place. [2021-06-10 11:39:17,665 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/664 dead transitions. [2021-06-10 11:39:17,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 768 places, 664 transitions, 1672 flow [2021-06-10 11:39:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:17,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:17,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:17,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:17,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:17,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:17,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,668 INFO L185 Difference]: Start difference. First operand has 766 places, 663 transitions, 1646 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:17,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 768 places, 664 transitions, 1672 flow [2021-06-10 11:39:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 767 places, 664 transitions, 1671 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:17,674 INFO L241 Difference]: Finished difference. Result has 769 places, 664 transitions, 1663 flow [2021-06-10 11:39:17,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=765, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=769, PETRI_TRANSITIONS=664} [2021-06-10 11:39:17,674 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 46 predicate places. [2021-06-10 11:39:17,674 INFO L480 AbstractCegarLoop]: Abstraction has has 769 places, 664 transitions, 1663 flow [2021-06-10 11:39:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:17,675 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:17,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2021-06-10 11:39:17,675 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1334600326, now seen corresponding path program 1 times [2021-06-10 11:39:17,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:17,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552842313] [2021-06-10 11:39:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:17,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:17,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:17,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552842313] [2021-06-10 11:39:17,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:17,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:17,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770677655] [2021-06-10 11:39:17,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:17,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:17,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:17,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 664 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:17,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:17,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:17,921 INFO L129 PetriNetUnfolder]: 24/799 cut-off events. [2021-06-10 11:39:17,921 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:17,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 799 events. 24/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3493 event pairs, 0 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 999. Up to 28 conditions per place. [2021-06-10 11:39:17,957 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/662 dead transitions. [2021-06-10 11:39:17,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 662 transitions, 1665 flow [2021-06-10 11:39:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:17,959 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:17,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:17,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:17,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:17,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:17,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,961 INFO L185 Difference]: Start difference. First operand has 769 places, 664 transitions, 1663 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:17,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 771 places, 662 transitions, 1665 flow [2021-06-10 11:39:17,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 662 transitions, 1657 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:17,967 INFO L241 Difference]: Finished difference. Result has 769 places, 662 transitions, 1650 flow [2021-06-10 11:39:17,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=769, PETRI_TRANSITIONS=662} [2021-06-10 11:39:17,967 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 46 predicate places. [2021-06-10 11:39:17,967 INFO L480 AbstractCegarLoop]: Abstraction has has 769 places, 662 transitions, 1650 flow [2021-06-10 11:39:17,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:17,968 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:17,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2021-06-10 11:39:17,968 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1334599303, now seen corresponding path program 1 times [2021-06-10 11:39:17,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:17,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082047625] [2021-06-10 11:39:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:17,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:17,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:17,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:17,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082047625] [2021-06-10 11:39:17,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:17,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:17,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346506854] [2021-06-10 11:39:17,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:17,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:17,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:17,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 662 transitions, 1650 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:17,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:17,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:17,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:18,216 INFO L129 PetriNetUnfolder]: 24/797 cut-off events. [2021-06-10 11:39:18,217 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:18,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 797 events. 24/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3479 event pairs, 0 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1003. Up to 28 conditions per place. [2021-06-10 11:39:18,253 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/660 dead transitions. [2021-06-10 11:39:18,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 660 transitions, 1663 flow [2021-06-10 11:39:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:18,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:18,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:18,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:18,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:18,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:18,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,256 INFO L185 Difference]: Start difference. First operand has 769 places, 662 transitions, 1650 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:18,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 660 transitions, 1663 flow [2021-06-10 11:39:18,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 660 transitions, 1662 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:18,262 INFO L241 Difference]: Finished difference. Result has 768 places, 660 transitions, 1646 flow [2021-06-10 11:39:18,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=768, PETRI_TRANSITIONS=660} [2021-06-10 11:39:18,263 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 45 predicate places. [2021-06-10 11:39:18,263 INFO L480 AbstractCegarLoop]: Abstraction has has 768 places, 660 transitions, 1646 flow [2021-06-10 11:39:18,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:18,263 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:18,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2021-06-10 11:39:18,263 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash 611123311, now seen corresponding path program 1 times [2021-06-10 11:39:18,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:18,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429213969] [2021-06-10 11:39:18,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:18,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:18,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:18,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429213969] [2021-06-10 11:39:18,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:18,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:18,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419361214] [2021-06-10 11:39:18,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:18,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:18,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:18,283 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:18,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 768 places, 660 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:18,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:18,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:18,518 INFO L129 PetriNetUnfolder]: 22/802 cut-off events. [2021-06-10 11:39:18,519 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:18,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 802 events. 22/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3528 event pairs, 0 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1006. Up to 28 conditions per place. [2021-06-10 11:39:18,555 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 5 selfloop transitions, 2 changer transitions 0/661 dead transitions. [2021-06-10 11:39:18,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 770 places, 661 transitions, 1662 flow [2021-06-10 11:39:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:18,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:18,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:18,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:18,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:18,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:18,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,559 INFO L185 Difference]: Start difference. First operand has 768 places, 660 transitions, 1646 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 770 places, 661 transitions, 1662 flow [2021-06-10 11:39:18,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 661 transitions, 1661 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:18,565 INFO L241 Difference]: Finished difference. Result has 771 places, 661 transitions, 1659 flow [2021-06-10 11:39:18,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=771, PETRI_TRANSITIONS=661} [2021-06-10 11:39:18,566 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 48 predicate places. [2021-06-10 11:39:18,566 INFO L480 AbstractCegarLoop]: Abstraction has has 771 places, 661 transitions, 1659 flow [2021-06-10 11:39:18,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,566 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:18,566 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:18,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2021-06-10 11:39:18,566 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 611122288, now seen corresponding path program 1 times [2021-06-10 11:39:18,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:18,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404780318] [2021-06-10 11:39:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:18,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:18,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:18,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404780318] [2021-06-10 11:39:18,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:18,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:18,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196060980] [2021-06-10 11:39:18,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:18,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:18,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:18,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:18,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:18,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 661 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:18,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:18,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:18,829 INFO L129 PetriNetUnfolder]: 22/803 cut-off events. [2021-06-10 11:39:18,829 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:18,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 803 events. 22/803 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3536 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 1014. Up to 28 conditions per place. [2021-06-10 11:39:18,865 INFO L132 encePairwiseOnDemand]: 773/777 looper letters, 9 selfloop transitions, 3 changer transitions 0/662 dead transitions. [2021-06-10 11:39:18,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 662 transitions, 1685 flow [2021-06-10 11:39:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2021-06-10 11:39:18,866 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193479193479194 [2021-06-10 11:39:18,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2143 transitions. [2021-06-10 11:39:18,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2143 transitions. [2021-06-10 11:39:18,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:18,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2143 transitions. [2021-06-10 11:39:18,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.3333333333334) internal successors, (2143), 3 states have internal predecessors, (2143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,869 INFO L185 Difference]: Start difference. First operand has 771 places, 661 transitions, 1659 flow. Second operand 3 states and 2143 transitions. [2021-06-10 11:39:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 662 transitions, 1685 flow [2021-06-10 11:39:18,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 772 places, 662 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:18,875 INFO L241 Difference]: Finished difference. Result has 774 places, 662 transitions, 1675 flow [2021-06-10 11:39:18,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=774, PETRI_TRANSITIONS=662} [2021-06-10 11:39:18,875 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 51 predicate places. [2021-06-10 11:39:18,875 INFO L480 AbstractCegarLoop]: Abstraction has has 774 places, 662 transitions, 1675 flow [2021-06-10 11:39:18,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,876 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:18,876 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:18,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2021-06-10 11:39:18,876 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash 612076623, now seen corresponding path program 1 times [2021-06-10 11:39:18,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:18,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393613083] [2021-06-10 11:39:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:18,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:18,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:18,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:18,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393613083] [2021-06-10 11:39:18,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:18,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:18,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252014861] [2021-06-10 11:39:18,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:18,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:18,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:18,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 662 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:18,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:18,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:18,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:19,151 INFO L129 PetriNetUnfolder]: 21/800 cut-off events. [2021-06-10 11:39:19,151 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:39:19,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 800 events. 21/800 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3518 event pairs, 0 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 1013. Up to 28 conditions per place. [2021-06-10 11:39:19,176 INFO L132 encePairwiseOnDemand]: 774/777 looper letters, 9 selfloop transitions, 1 changer transitions 0/660 dead transitions. [2021-06-10 11:39:19,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 660 transitions, 1683 flow [2021-06-10 11:39:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2021-06-10 11:39:19,178 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2021-06-10 11:39:19,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2142 transitions. [2021-06-10 11:39:19,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2142 transitions. [2021-06-10 11:39:19,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:19,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2142 transitions. [2021-06-10 11:39:19,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 714.0) internal successors, (2142), 3 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,180 INFO L185 Difference]: Start difference. First operand has 774 places, 662 transitions, 1675 flow. Second operand 3 states and 2142 transitions. [2021-06-10 11:39:19,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 660 transitions, 1683 flow [2021-06-10 11:39:19,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 660 transitions, 1682 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:19,186 INFO L241 Difference]: Finished difference. Result has 775 places, 660 transitions, 1664 flow [2021-06-10 11:39:19,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=773, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1664, PETRI_PLACES=775, PETRI_TRANSITIONS=660} [2021-06-10 11:39:19,186 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 52 predicate places. [2021-06-10 11:39:19,186 INFO L480 AbstractCegarLoop]: Abstraction has has 775 places, 660 transitions, 1664 flow [2021-06-10 11:39:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:19,186 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:19,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2021-06-10 11:39:19,186 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 612075600, now seen corresponding path program 1 times [2021-06-10 11:39:19,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:19,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429894316] [2021-06-10 11:39:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:19,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:19,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:19,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429894316] [2021-06-10 11:39:19,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:19,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:19,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223818631] [2021-06-10 11:39:19,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:19,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:19,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:19,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 660 transitions, 1664 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:19,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:19,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:19,430 INFO L129 PetriNetUnfolder]: 21/797 cut-off events. [2021-06-10 11:39:19,431 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:19,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 797 events. 21/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3496 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 1007. Up to 28 conditions per place. [2021-06-10 11:39:19,466 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2021-06-10 11:39:19,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 657 transitions, 1665 flow [2021-06-10 11:39:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:19,468 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:19,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:19,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:19,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:19,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:19,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,470 INFO L185 Difference]: Start difference. First operand has 775 places, 660 transitions, 1664 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:19,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 657 transitions, 1665 flow [2021-06-10 11:39:19,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 772 places, 657 transitions, 1660 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:19,476 INFO L241 Difference]: Finished difference. Result has 772 places, 657 transitions, 1650 flow [2021-06-10 11:39:19,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1650, PETRI_PLACES=772, PETRI_TRANSITIONS=657} [2021-06-10 11:39:19,476 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 49 predicate places. [2021-06-10 11:39:19,476 INFO L480 AbstractCegarLoop]: Abstraction has has 772 places, 657 transitions, 1650 flow [2021-06-10 11:39:19,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:19,477 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:19,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2021-06-10 11:39:19,477 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -158890823, now seen corresponding path program 1 times [2021-06-10 11:39:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:19,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236618137] [2021-06-10 11:39:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:19,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:19,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:19,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236618137] [2021-06-10 11:39:19,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:19,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:19,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425096507] [2021-06-10 11:39:19,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:19,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:19,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:19,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 657 transitions, 1650 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:19,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:19,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:19,742 INFO L129 PetriNetUnfolder]: 20/805 cut-off events. [2021-06-10 11:39:19,742 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:19,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 805 events. 20/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3566 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1024. Up to 28 conditions per place. [2021-06-10 11:39:19,778 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/659 dead transitions. [2021-06-10 11:39:19,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 659 transitions, 1680 flow [2021-06-10 11:39:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:19,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:19,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:19,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:19,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:19,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:19,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,782 INFO L185 Difference]: Start difference. First operand has 772 places, 657 transitions, 1650 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:19,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 659 transitions, 1680 flow [2021-06-10 11:39:19,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 659 transitions, 1679 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:19,788 INFO L241 Difference]: Finished difference. Result has 775 places, 659 transitions, 1673 flow [2021-06-10 11:39:19,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1673, PETRI_PLACES=775, PETRI_TRANSITIONS=659} [2021-06-10 11:39:19,788 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 52 predicate places. [2021-06-10 11:39:19,788 INFO L480 AbstractCegarLoop]: Abstraction has has 775 places, 659 transitions, 1673 flow [2021-06-10 11:39:19,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:19,789 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:19,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2021-06-10 11:39:19,789 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -158891846, now seen corresponding path program 1 times [2021-06-10 11:39:19,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:19,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952786563] [2021-06-10 11:39:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:19,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:19,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:19,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:19,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952786563] [2021-06-10 11:39:19,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:19,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:19,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138931494] [2021-06-10 11:39:19,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:19,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:19,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:19,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:19,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 659 transitions, 1673 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:19,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:19,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:19,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:20,044 INFO L129 PetriNetUnfolder]: 18/806 cut-off events. [2021-06-10 11:39:20,044 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:20,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 806 events. 18/806 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3591 event pairs, 0 based on Foata normal form. 0/761 useless extension candidates. Maximal degree in co-relation 1022. Up to 28 conditions per place. [2021-06-10 11:39:20,081 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/659 dead transitions. [2021-06-10 11:39:20,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 659 transitions, 1685 flow [2021-06-10 11:39:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:20,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:20,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:20,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:20,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:20,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:20,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,085 INFO L185 Difference]: Start difference. First operand has 775 places, 659 transitions, 1673 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:20,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 659 transitions, 1685 flow [2021-06-10 11:39:20,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 659 transitions, 1680 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:20,091 INFO L241 Difference]: Finished difference. Result has 777 places, 658 transitions, 1669 flow [2021-06-10 11:39:20,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1669, PETRI_PLACES=777, PETRI_TRANSITIONS=658} [2021-06-10 11:39:20,091 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 54 predicate places. [2021-06-10 11:39:20,091 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 658 transitions, 1669 flow [2021-06-10 11:39:20,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:20,092 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:20,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2021-06-10 11:39:20,092 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -159844135, now seen corresponding path program 1 times [2021-06-10 11:39:20,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:20,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745845248] [2021-06-10 11:39:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:20,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:20,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:20,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745845248] [2021-06-10 11:39:20,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:20,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:20,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080732332] [2021-06-10 11:39:20,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:20,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:20,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:20,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 658 transitions, 1669 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:20,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:20,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:20,343 INFO L129 PetriNetUnfolder]: 18/799 cut-off events. [2021-06-10 11:39:20,343 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:20,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 799 events. 18/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3529 event pairs, 0 based on Foata normal form. 1/756 useless extension candidates. Maximal degree in co-relation 1016. Up to 28 conditions per place. [2021-06-10 11:39:20,378 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2021-06-10 11:39:20,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 656 transitions, 1672 flow [2021-06-10 11:39:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:20,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:20,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:20,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:20,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:20,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:20,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,381 INFO L185 Difference]: Start difference. First operand has 777 places, 658 transitions, 1669 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:20,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 656 transitions, 1672 flow [2021-06-10 11:39:20,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 656 transitions, 1665 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:20,388 INFO L241 Difference]: Finished difference. Result has 777 places, 656 transitions, 1658 flow [2021-06-10 11:39:20,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1658, PETRI_PLACES=777, PETRI_TRANSITIONS=656} [2021-06-10 11:39:20,388 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 54 predicate places. [2021-06-10 11:39:20,388 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 656 transitions, 1658 flow [2021-06-10 11:39:20,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:20,389 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:20,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2021-06-10 11:39:20,389 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash -159845158, now seen corresponding path program 1 times [2021-06-10 11:39:20,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:20,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388171751] [2021-06-10 11:39:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:20,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:20,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:20,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388171751] [2021-06-10 11:39:20,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:20,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:20,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015165139] [2021-06-10 11:39:20,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:20,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:20,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:20,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 656 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:20,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:20,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:20,671 INFO L129 PetriNetUnfolder]: 18/797 cut-off events. [2021-06-10 11:39:20,671 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:20,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 797 events. 18/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3514 event pairs, 0 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1016. Up to 28 conditions per place. [2021-06-10 11:39:20,695 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/654 dead transitions. [2021-06-10 11:39:20,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 654 transitions, 1671 flow [2021-06-10 11:39:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:20,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:20,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:20,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:20,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:20,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:20,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,699 INFO L185 Difference]: Start difference. First operand has 777 places, 656 transitions, 1658 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:20,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 654 transitions, 1671 flow [2021-06-10 11:39:20,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 654 transitions, 1670 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:20,704 INFO L241 Difference]: Finished difference. Result has 776 places, 654 transitions, 1654 flow [2021-06-10 11:39:20,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=776, PETRI_TRANSITIONS=654} [2021-06-10 11:39:20,705 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 53 predicate places. [2021-06-10 11:39:20,705 INFO L480 AbstractCegarLoop]: Abstraction has has 776 places, 654 transitions, 1654 flow [2021-06-10 11:39:20,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:20,705 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:20,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2021-06-10 11:39:20,705 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -482170332, now seen corresponding path program 1 times [2021-06-10 11:39:20,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:20,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454320521] [2021-06-10 11:39:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:20,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:20,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:20,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:20,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454320521] [2021-06-10 11:39:20,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:20,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:20,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109416321] [2021-06-10 11:39:20,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:20,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:20,725 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:20,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 654 transitions, 1654 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:20,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:20,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:20,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:20,966 INFO L129 PetriNetUnfolder]: 17/805 cut-off events. [2021-06-10 11:39:20,966 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:21,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 805 events. 17/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3583 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1028. Up to 28 conditions per place. [2021-06-10 11:39:21,003 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/656 dead transitions. [2021-06-10 11:39:21,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 656 transitions, 1684 flow [2021-06-10 11:39:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:21,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:21,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:21,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:21,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:21,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:21,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,006 INFO L185 Difference]: Start difference. First operand has 776 places, 654 transitions, 1654 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:21,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 656 transitions, 1684 flow [2021-06-10 11:39:21,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 656 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:21,012 INFO L241 Difference]: Finished difference. Result has 779 places, 656 transitions, 1677 flow [2021-06-10 11:39:21,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=779, PETRI_TRANSITIONS=656} [2021-06-10 11:39:21,013 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 56 predicate places. [2021-06-10 11:39:21,013 INFO L480 AbstractCegarLoop]: Abstraction has has 779 places, 656 transitions, 1677 flow [2021-06-10 11:39:21,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:21,013 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:21,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2021-06-10 11:39:21,013 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -482171355, now seen corresponding path program 1 times [2021-06-10 11:39:21,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:21,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017442176] [2021-06-10 11:39:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:21,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:21,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:21,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017442176] [2021-06-10 11:39:21,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:21,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:21,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816250797] [2021-06-10 11:39:21,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:21,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:21,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:21,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:21,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 656 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:21,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:21,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:21,273 INFO L129 PetriNetUnfolder]: 15/806 cut-off events. [2021-06-10 11:39:21,273 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:21,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 806 events. 15/806 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3605 event pairs, 0 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 1028. Up to 28 conditions per place. [2021-06-10 11:39:21,309 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2021-06-10 11:39:21,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 656 transitions, 1689 flow [2021-06-10 11:39:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:21,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:21,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:21,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:21,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:21,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:21,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,313 INFO L185 Difference]: Start difference. First operand has 779 places, 656 transitions, 1677 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:21,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 656 transitions, 1689 flow [2021-06-10 11:39:21,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 656 transitions, 1684 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:21,319 INFO L241 Difference]: Finished difference. Result has 781 places, 655 transitions, 1673 flow [2021-06-10 11:39:21,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1673, PETRI_PLACES=781, PETRI_TRANSITIONS=655} [2021-06-10 11:39:21,319 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 58 predicate places. [2021-06-10 11:39:21,319 INFO L480 AbstractCegarLoop]: Abstraction has has 781 places, 655 transitions, 1673 flow [2021-06-10 11:39:21,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:21,320 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:21,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2021-06-10 11:39:21,320 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -483123644, now seen corresponding path program 1 times [2021-06-10 11:39:21,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:21,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132466899] [2021-06-10 11:39:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:21,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:21,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:21,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132466899] [2021-06-10 11:39:21,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:21,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:21,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996518508] [2021-06-10 11:39:21,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:21,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:21,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:21,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 655 transitions, 1673 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:21,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:21,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:21,572 INFO L129 PetriNetUnfolder]: 15/799 cut-off events. [2021-06-10 11:39:21,572 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:21,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 799 events. 15/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3547 event pairs, 0 based on Foata normal form. 1/759 useless extension candidates. Maximal degree in co-relation 1022. Up to 28 conditions per place. [2021-06-10 11:39:21,607 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2021-06-10 11:39:21,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 653 transitions, 1676 flow [2021-06-10 11:39:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:21,608 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:21,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:21,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:21,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:21,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:21,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,610 INFO L185 Difference]: Start difference. First operand has 781 places, 655 transitions, 1673 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:21,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 653 transitions, 1676 flow [2021-06-10 11:39:21,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 653 transitions, 1669 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:21,616 INFO L241 Difference]: Finished difference. Result has 781 places, 653 transitions, 1662 flow [2021-06-10 11:39:21,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=781, PETRI_TRANSITIONS=653} [2021-06-10 11:39:21,616 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 58 predicate places. [2021-06-10 11:39:21,616 INFO L480 AbstractCegarLoop]: Abstraction has has 781 places, 653 transitions, 1662 flow [2021-06-10 11:39:21,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:21,617 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:21,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2021-06-10 11:39:21,617 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:21,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash -483124667, now seen corresponding path program 1 times [2021-06-10 11:39:21,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:21,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327490624] [2021-06-10 11:39:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:21,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:21,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:21,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327490624] [2021-06-10 11:39:21,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:21,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:21,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498747715] [2021-06-10 11:39:21,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:21,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:21,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:21,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 653 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:21,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:21,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:21,879 INFO L129 PetriNetUnfolder]: 15/797 cut-off events. [2021-06-10 11:39:21,879 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:21,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 797 events. 15/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3531 event pairs, 0 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1022. Up to 28 conditions per place. [2021-06-10 11:39:21,914 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/651 dead transitions. [2021-06-10 11:39:21,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 651 transitions, 1675 flow [2021-06-10 11:39:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:21,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:21,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:21,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:21,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:21,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:21,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,918 INFO L185 Difference]: Start difference. First operand has 781 places, 653 transitions, 1662 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 651 transitions, 1675 flow [2021-06-10 11:39:21,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 651 transitions, 1674 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:21,924 INFO L241 Difference]: Finished difference. Result has 780 places, 651 transitions, 1658 flow [2021-06-10 11:39:21,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1658, PETRI_PLACES=780, PETRI_TRANSITIONS=651} [2021-06-10 11:39:21,924 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 57 predicate places. [2021-06-10 11:39:21,924 INFO L480 AbstractCegarLoop]: Abstraction has has 780 places, 651 transitions, 1658 flow [2021-06-10 11:39:21,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,925 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:21,925 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:21,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2021-06-10 11:39:21,925 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1367538448, now seen corresponding path program 1 times [2021-06-10 11:39:21,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:21,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53480703] [2021-06-10 11:39:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:21,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:21,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:21,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:21,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53480703] [2021-06-10 11:39:21,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:21,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:21,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607010498] [2021-06-10 11:39:21,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:21,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:21,945 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:21,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 651 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:21,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:21,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:21,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:22,218 INFO L129 PetriNetUnfolder]: 14/805 cut-off events. [2021-06-10 11:39:22,219 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-06-10 11:39:22,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 805 events. 14/805 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3599 event pairs, 0 based on Foata normal form. 0/763 useless extension candidates. Maximal degree in co-relation 1034. Up to 28 conditions per place. [2021-06-10 11:39:22,242 INFO L132 encePairwiseOnDemand]: 772/777 looper letters, 10 selfloop transitions, 3 changer transitions 0/653 dead transitions. [2021-06-10 11:39:22,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 782 places, 653 transitions, 1688 flow [2021-06-10 11:39:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2145 transitions. [2021-06-10 11:39:22,243 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202059202059202 [2021-06-10 11:39:22,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2145 transitions. [2021-06-10 11:39:22,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2145 transitions. [2021-06-10 11:39:22,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:22,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2145 transitions. [2021-06-10 11:39:22,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,246 INFO L185 Difference]: Start difference. First operand has 780 places, 651 transitions, 1658 flow. Second operand 3 states and 2145 transitions. [2021-06-10 11:39:22,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 782 places, 653 transitions, 1688 flow [2021-06-10 11:39:22,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 653 transitions, 1687 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:22,251 INFO L241 Difference]: Finished difference. Result has 783 places, 653 transitions, 1681 flow [2021-06-10 11:39:22,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=783, PETRI_TRANSITIONS=653} [2021-06-10 11:39:22,252 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 60 predicate places. [2021-06-10 11:39:22,252 INFO L480 AbstractCegarLoop]: Abstraction has has 783 places, 653 transitions, 1681 flow [2021-06-10 11:39:22,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:22,252 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:22,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2021-06-10 11:39:22,252 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1367537425, now seen corresponding path program 1 times [2021-06-10 11:39:22,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:22,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311152121] [2021-06-10 11:39:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:22,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:22,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:22,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311152121] [2021-06-10 11:39:22,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:22,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:22,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026522853] [2021-06-10 11:39:22,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:22,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:22,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:22,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:22,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:22,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 653 transitions, 1681 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:22,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:22,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:22,527 INFO L129 PetriNetUnfolder]: 12/806 cut-off events. [2021-06-10 11:39:22,527 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:22,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 806 events. 12/806 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3622 event pairs, 0 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 1034. Up to 28 conditions per place. [2021-06-10 11:39:22,563 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 6 selfloop transitions, 1 changer transitions 0/653 dead transitions. [2021-06-10 11:39:22,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 653 transitions, 1693 flow [2021-06-10 11:39:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2021-06-10 11:39:22,564 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236379236379236 [2021-06-10 11:39:22,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2021-06-10 11:39:22,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2021-06-10 11:39:22,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:22,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2021-06-10 11:39:22,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,566 INFO L185 Difference]: Start difference. First operand has 783 places, 653 transitions, 1681 flow. Second operand 3 states and 2153 transitions. [2021-06-10 11:39:22,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 785 places, 653 transitions, 1693 flow [2021-06-10 11:39:22,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 784 places, 653 transitions, 1688 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:22,573 INFO L241 Difference]: Finished difference. Result has 785 places, 652 transitions, 1677 flow [2021-06-10 11:39:22,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=782, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=785, PETRI_TRANSITIONS=652} [2021-06-10 11:39:22,573 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 62 predicate places. [2021-06-10 11:39:22,573 INFO L480 AbstractCegarLoop]: Abstraction has has 785 places, 652 transitions, 1677 flow [2021-06-10 11:39:22,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,573 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:22,573 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:22,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2021-06-10 11:39:22,573 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1366585136, now seen corresponding path program 1 times [2021-06-10 11:39:22,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:22,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253722640] [2021-06-10 11:39:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:22,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:22,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:22,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253722640] [2021-06-10 11:39:22,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:22,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:22,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178022434] [2021-06-10 11:39:22,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:22,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:22,594 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 777 [2021-06-10 11:39:22,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 652 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:22,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 777 [2021-06-10 11:39:22,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:22,829 INFO L129 PetriNetUnfolder]: 12/799 cut-off events. [2021-06-10 11:39:22,830 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:22,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 799 events. 12/799 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3561 event pairs, 0 based on Foata normal form. 1/762 useless extension candidates. Maximal degree in co-relation 1028. Up to 28 conditions per place. [2021-06-10 11:39:22,865 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 5 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2021-06-10 11:39:22,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 650 transitions, 1680 flow [2021-06-10 11:39:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2152 transitions. [2021-06-10 11:39:22,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232089232089232 [2021-06-10 11:39:22,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2152 transitions. [2021-06-10 11:39:22,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2152 transitions. [2021-06-10 11:39:22,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:22,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2152 transitions. [2021-06-10 11:39:22,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,874 INFO L185 Difference]: Start difference. First operand has 785 places, 652 transitions, 1677 flow. Second operand 3 states and 2152 transitions. [2021-06-10 11:39:22,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 650 transitions, 1680 flow [2021-06-10 11:39:22,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 784 places, 650 transitions, 1673 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:22,881 INFO L241 Difference]: Finished difference. Result has 785 places, 650 transitions, 1666 flow [2021-06-10 11:39:22,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=782, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=785, PETRI_TRANSITIONS=650} [2021-06-10 11:39:22,881 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 62 predicate places. [2021-06-10 11:39:22,881 INFO L480 AbstractCegarLoop]: Abstraction has has 785 places, 650 transitions, 1666 flow [2021-06-10 11:39:22,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 716.3333333333334) internal successors, (2149), 3 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:22,882 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:22,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2021-06-10 11:39:22,882 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:22,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:22,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1366584113, now seen corresponding path program 1 times [2021-06-10 11:39:22,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:22,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886677682] [2021-06-10 11:39:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:22,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:22,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:22,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886677682] [2021-06-10 11:39:22,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:22,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:22,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808200895] [2021-06-10 11:39:22,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:22,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:22,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 777 [2021-06-10 11:39:22,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 650 transitions, 1666 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:22,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:22,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 777 [2021-06-10 11:39:22,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:23,164 INFO L129 PetriNetUnfolder]: 12/797 cut-off events. [2021-06-10 11:39:23,165 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:23,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 797 events. 12/797 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3545 event pairs, 0 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1028. Up to 28 conditions per place. [2021-06-10 11:39:23,202 INFO L132 encePairwiseOnDemand]: 775/777 looper letters, 8 selfloop transitions, 1 changer transitions 0/648 dead transitions. [2021-06-10 11:39:23,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 648 transitions, 1679 flow [2021-06-10 11:39:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2021-06-10 11:39:23,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.918060918060918 [2021-06-10 11:39:23,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2140 transitions. [2021-06-10 11:39:23,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2140 transitions. [2021-06-10 11:39:23,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:23,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2140 transitions. [2021-06-10 11:39:23,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 713.3333333333334) internal successors, (2140), 3 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:23,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:23,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:23,205 INFO L185 Difference]: Start difference. First operand has 785 places, 650 transitions, 1666 flow. Second operand 3 states and 2140 transitions. [2021-06-10 11:39:23,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 785 places, 648 transitions, 1679 flow [2021-06-10 11:39:23,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 784 places, 648 transitions, 1678 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:23,212 INFO L241 Difference]: Finished difference. Result has 784 places, 648 transitions, 1662 flow [2021-06-10 11:39:23,212 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=782, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=784, PETRI_TRANSITIONS=648} [2021-06-10 11:39:23,212 INFO L343 CegarLoopForPetriNet]: 723 programPoint places, 61 predicate places. [2021-06-10 11:39:23,212 INFO L480 AbstractCegarLoop]: Abstraction has has 784 places, 648 transitions, 1662 flow [2021-06-10 11:39:23,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:23,212 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:23,213 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:23,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2021-06-10 11:39:23,213 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 57974644, now seen corresponding path program 1 times [2021-06-10 11:39:23,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:23,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464859202] [2021-06-10 11:39:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:39:23,227 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:39:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:39:23,233 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:39:23,248 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:39:23,248 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:39:23,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2021-06-10 11:39:23,248 WARN L342 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:39:23,248 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of28ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of28ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:23,391 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:39:23,391 INFO L253 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-06-10 11:39:23,392 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:39:23,392 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:39:23,392 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:39:23,392 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:39:23,392 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:39:23,392 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:39:23,392 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:39:23,392 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:39:23,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 749 places, 805 transitions, 2506 flow [2021-06-10 11:39:23,677 INFO L129 PetriNetUnfolder]: 141/1056 cut-off events. [2021-06-10 11:39:23,678 INFO L130 PetriNetUnfolder]: For 4032/4032 co-relation queries the response was YES. [2021-06-10 11:39:23,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1056 events. 141/1056 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4494 event pairs, 0 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1469. Up to 58 conditions per place. [2021-06-10 11:39:23,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 749 places, 805 transitions, 2506 flow [2021-06-10 11:39:23,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 749 places, 805 transitions, 2506 flow [2021-06-10 11:39:23,758 INFO L129 PetriNetUnfolder]: 10/108 cut-off events. [2021-06-10 11:39:23,758 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:39:23,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:23,758 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-06-10 11:39:23,758 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -738713941, now seen corresponding path program 1 times [2021-06-10 11:39:23,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:23,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386460939] [2021-06-10 11:39:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:23,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:23,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:23,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:23,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:23,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:23,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:23,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386460939] [2021-06-10 11:39:23,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:23,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:23,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560882543] [2021-06-10 11:39:23,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:23,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:23,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:23,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 805 transitions, 2506 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:23,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:23,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:23,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:24,008 INFO L129 PetriNetUnfolder]: 83/833 cut-off events. [2021-06-10 11:39:24,008 INFO L130 PetriNetUnfolder]: For 4033/4033 co-relation queries the response was YES. [2021-06-10 11:39:24,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 833 events. 83/833 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3333 event pairs, 0 based on Foata normal form. 115/835 useless extension candidates. Maximal degree in co-relation 1256. Up to 29 conditions per place. [2021-06-10 11:39:24,056 INFO L132 encePairwiseOnDemand]: 773/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/744 dead transitions. [2021-06-10 11:39:24,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 744 transitions, 2398 flow [2021-06-10 11:39:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2021-06-10 11:39:24,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9486542443064182 [2021-06-10 11:39:24,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2291 transitions. [2021-06-10 11:39:24,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2291 transitions. [2021-06-10 11:39:24,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:24,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2291 transitions. [2021-06-10 11:39:24,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,060 INFO L185 Difference]: Start difference. First operand has 749 places, 805 transitions, 2506 flow. Second operand 3 states and 2291 transitions. [2021-06-10 11:39:24,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 744 transitions, 2398 flow [2021-06-10 11:39:24,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 744 transitions, 1642 flow, removed 378 selfloop flow, removed 0 redundant places. [2021-06-10 11:39:24,068 INFO L241 Difference]: Finished difference. Result has 719 places, 743 transitions, 1631 flow [2021-06-10 11:39:24,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=719, PETRI_TRANSITIONS=743} [2021-06-10 11:39:24,069 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -30 predicate places. [2021-06-10 11:39:24,069 INFO L480 AbstractCegarLoop]: Abstraction has has 719 places, 743 transitions, 1631 flow [2021-06-10 11:39:24,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,069 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:24,069 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-06-10 11:39:24,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2021-06-10 11:39:24,069 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -738712918, now seen corresponding path program 1 times [2021-06-10 11:39:24,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:24,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534784420] [2021-06-10 11:39:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:24,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:24,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:24,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534784420] [2021-06-10 11:39:24,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:24,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:24,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619280824] [2021-06-10 11:39:24,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:24,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:24,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:24,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 743 transitions, 1631 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:24,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:24,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:24,288 INFO L129 PetriNetUnfolder]: 81/835 cut-off events. [2021-06-10 11:39:24,288 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:24,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 835 events. 81/835 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3360 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 925. Up to 29 conditions per place. [2021-06-10 11:39:24,336 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/744 dead transitions. [2021-06-10 11:39:24,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 744 transitions, 1657 flow [2021-06-10 11:39:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:24,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:24,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:24,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:24,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:24,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:24,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,340 INFO L185 Difference]: Start difference. First operand has 719 places, 743 transitions, 1631 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:24,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 744 transitions, 1657 flow [2021-06-10 11:39:24,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 744 transitions, 1656 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:24,346 INFO L241 Difference]: Finished difference. Result has 722 places, 744 transitions, 1648 flow [2021-06-10 11:39:24,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1648, PETRI_PLACES=722, PETRI_TRANSITIONS=744} [2021-06-10 11:39:24,347 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -27 predicate places. [2021-06-10 11:39:24,347 INFO L480 AbstractCegarLoop]: Abstraction has has 722 places, 744 transitions, 1648 flow [2021-06-10 11:39:24,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:24,347 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-06-10 11:39:24,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2021-06-10 11:39:24,347 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -739666230, now seen corresponding path program 1 times [2021-06-10 11:39:24,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:24,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422484239] [2021-06-10 11:39:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:24,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:24,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:24,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422484239] [2021-06-10 11:39:24,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:24,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:24,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372426839] [2021-06-10 11:39:24,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:24,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:24,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:24,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:24,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 744 transitions, 1648 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:24,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:24,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:24,570 INFO L129 PetriNetUnfolder]: 81/828 cut-off events. [2021-06-10 11:39:24,570 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:24,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 828 events. 81/828 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3309 event pairs, 0 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 908. Up to 29 conditions per place. [2021-06-10 11:39:24,616 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/742 dead transitions. [2021-06-10 11:39:24,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 742 transitions, 1650 flow [2021-06-10 11:39:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:24,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:24,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:24,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:24,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:24,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:24,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,620 INFO L185 Difference]: Start difference. First operand has 722 places, 744 transitions, 1648 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:24,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 742 transitions, 1650 flow [2021-06-10 11:39:24,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 742 transitions, 1642 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:24,626 INFO L241 Difference]: Finished difference. Result has 722 places, 742 transitions, 1635 flow [2021-06-10 11:39:24,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=722, PETRI_TRANSITIONS=742} [2021-06-10 11:39:24,626 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -27 predicate places. [2021-06-10 11:39:24,626 INFO L480 AbstractCegarLoop]: Abstraction has has 722 places, 742 transitions, 1635 flow [2021-06-10 11:39:24,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:24,627 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-06-10 11:39:24,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2021-06-10 11:39:24,627 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -739667253, now seen corresponding path program 1 times [2021-06-10 11:39:24,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:24,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028677525] [2021-06-10 11:39:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:24,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:24,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:24,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028677525] [2021-06-10 11:39:24,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:24,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:24,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400599907] [2021-06-10 11:39:24,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:24,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:24,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:24,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:24,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:24,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 742 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:24,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:24,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:24,850 INFO L129 PetriNetUnfolder]: 81/826 cut-off events. [2021-06-10 11:39:24,850 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:24,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 826 events. 81/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3295 event pairs, 0 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 915. Up to 29 conditions per place. [2021-06-10 11:39:24,894 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/740 dead transitions. [2021-06-10 11:39:24,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 740 transitions, 1648 flow [2021-06-10 11:39:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:24,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:24,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:24,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:24,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:24,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:24,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,898 INFO L185 Difference]: Start difference. First operand has 722 places, 742 transitions, 1635 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:24,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 740 transitions, 1648 flow [2021-06-10 11:39:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 740 transitions, 1647 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:24,904 INFO L241 Difference]: Finished difference. Result has 721 places, 740 transitions, 1631 flow [2021-06-10 11:39:24,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1631, PETRI_PLACES=721, PETRI_TRANSITIONS=740} [2021-06-10 11:39:24,904 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -28 predicate places. [2021-06-10 11:39:24,905 INFO L480 AbstractCegarLoop]: Abstraction has has 721 places, 740 transitions, 1631 flow [2021-06-10 11:39:24,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:24,905 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:24,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2021-06-10 11:39:24,905 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash 843458013, now seen corresponding path program 1 times [2021-06-10 11:39:24,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:24,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313762893] [2021-06-10 11:39:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:24,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:24,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:24,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:24,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313762893] [2021-06-10 11:39:24,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:24,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:24,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133128304] [2021-06-10 11:39:24,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:24,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:24,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:24,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 740 transitions, 1631 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:24,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:24,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:24,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:25,126 INFO L129 PetriNetUnfolder]: 80/833 cut-off events. [2021-06-10 11:39:25,126 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:25,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 833 events. 80/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3355 event pairs, 0 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 920. Up to 29 conditions per place. [2021-06-10 11:39:25,172 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/741 dead transitions. [2021-06-10 11:39:25,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 741 transitions, 1647 flow [2021-06-10 11:39:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:25,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:25,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:25,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:25,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:25,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:25,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,176 INFO L185 Difference]: Start difference. First operand has 721 places, 740 transitions, 1631 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:25,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 741 transitions, 1647 flow [2021-06-10 11:39:25,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 741 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:25,182 INFO L241 Difference]: Finished difference. Result has 723 places, 740 transitions, 1635 flow [2021-06-10 11:39:25,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=723, PETRI_TRANSITIONS=740} [2021-06-10 11:39:25,182 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -26 predicate places. [2021-06-10 11:39:25,182 INFO L480 AbstractCegarLoop]: Abstraction has has 723 places, 740 transitions, 1635 flow [2021-06-10 11:39:25,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:25,182 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:25,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2021-06-10 11:39:25,183 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 843459036, now seen corresponding path program 1 times [2021-06-10 11:39:25,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:25,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337263025] [2021-06-10 11:39:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:25,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:25,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:25,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337263025] [2021-06-10 11:39:25,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:25,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:25,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075197106] [2021-06-10 11:39:25,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:25,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:25,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:25,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 740 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:25,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:25,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:25,409 INFO L129 PetriNetUnfolder]: 78/835 cut-off events. [2021-06-10 11:39:25,409 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:25,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 835 events. 78/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3383 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 931. Up to 29 conditions per place. [2021-06-10 11:39:25,454 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/741 dead transitions. [2021-06-10 11:39:25,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 741 transitions, 1661 flow [2021-06-10 11:39:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:25,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:25,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:25,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:25,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:25,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:25,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,458 INFO L185 Difference]: Start difference. First operand has 723 places, 740 transitions, 1635 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:25,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 741 transitions, 1661 flow [2021-06-10 11:39:25,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 741 transitions, 1660 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:25,464 INFO L241 Difference]: Finished difference. Result has 726 places, 741 transitions, 1652 flow [2021-06-10 11:39:25,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1652, PETRI_PLACES=726, PETRI_TRANSITIONS=741} [2021-06-10 11:39:25,464 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -23 predicate places. [2021-06-10 11:39:25,464 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 741 transitions, 1652 flow [2021-06-10 11:39:25,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:25,464 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:25,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2021-06-10 11:39:25,465 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 842505724, now seen corresponding path program 1 times [2021-06-10 11:39:25,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:25,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143081036] [2021-06-10 11:39:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:25,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:25,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:25,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143081036] [2021-06-10 11:39:25,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:25,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:25,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78956232] [2021-06-10 11:39:25,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:25,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:25,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:25,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 741 transitions, 1652 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:25,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:25,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:25,693 INFO L129 PetriNetUnfolder]: 78/828 cut-off events. [2021-06-10 11:39:25,693 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:25,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 828 events. 78/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3327 event pairs, 0 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 917. Up to 29 conditions per place. [2021-06-10 11:39:25,739 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/739 dead transitions. [2021-06-10 11:39:25,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 739 transitions, 1654 flow [2021-06-10 11:39:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:25,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:25,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:25,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:25,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:25,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:25,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,743 INFO L185 Difference]: Start difference. First operand has 726 places, 741 transitions, 1652 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:25,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 739 transitions, 1654 flow [2021-06-10 11:39:25,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 739 transitions, 1646 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:25,749 INFO L241 Difference]: Finished difference. Result has 726 places, 739 transitions, 1639 flow [2021-06-10 11:39:25,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=726, PETRI_TRANSITIONS=739} [2021-06-10 11:39:25,749 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -23 predicate places. [2021-06-10 11:39:25,749 INFO L480 AbstractCegarLoop]: Abstraction has has 726 places, 739 transitions, 1639 flow [2021-06-10 11:39:25,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:25,750 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:25,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2021-06-10 11:39:25,750 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 842504701, now seen corresponding path program 1 times [2021-06-10 11:39:25,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:25,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102714333] [2021-06-10 11:39:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:25,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:25,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:25,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:25,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102714333] [2021-06-10 11:39:25,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:25,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:25,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77725107] [2021-06-10 11:39:25,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:25,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:25,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:25,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 739 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:25,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:25,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:25,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:25,977 INFO L129 PetriNetUnfolder]: 78/826 cut-off events. [2021-06-10 11:39:25,977 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:26,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 826 events. 78/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3313 event pairs, 0 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 921. Up to 29 conditions per place. [2021-06-10 11:39:26,024 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2021-06-10 11:39:26,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 737 transitions, 1652 flow [2021-06-10 11:39:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:26,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:26,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:26,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:26,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:26,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:26,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,028 INFO L185 Difference]: Start difference. First operand has 726 places, 739 transitions, 1639 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:26,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 737 transitions, 1652 flow [2021-06-10 11:39:26,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 737 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:26,034 INFO L241 Difference]: Finished difference. Result has 725 places, 737 transitions, 1635 flow [2021-06-10 11:39:26,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1635, PETRI_PLACES=725, PETRI_TRANSITIONS=737} [2021-06-10 11:39:26,034 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -24 predicate places. [2021-06-10 11:39:26,034 INFO L480 AbstractCegarLoop]: Abstraction has has 725 places, 737 transitions, 1635 flow [2021-06-10 11:39:26,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:26,034 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:26,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2021-06-10 11:39:26,035 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1426720240, now seen corresponding path program 1 times [2021-06-10 11:39:26,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:26,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934891686] [2021-06-10 11:39:26,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:26,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:26,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:26,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934891686] [2021-06-10 11:39:26,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:26,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:26,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681561677] [2021-06-10 11:39:26,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:26,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:26,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:26,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 737 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:26,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:26,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:26,269 INFO L129 PetriNetUnfolder]: 77/833 cut-off events. [2021-06-10 11:39:26,269 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:26,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 833 events. 77/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3373 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 926. Up to 29 conditions per place. [2021-06-10 11:39:26,315 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/738 dead transitions. [2021-06-10 11:39:26,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 738 transitions, 1651 flow [2021-06-10 11:39:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:26,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:26,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:26,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:26,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:26,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:26,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,318 INFO L185 Difference]: Start difference. First operand has 725 places, 737 transitions, 1635 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:26,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 738 transitions, 1651 flow [2021-06-10 11:39:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 738 transitions, 1650 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:26,325 INFO L241 Difference]: Finished difference. Result has 727 places, 737 transitions, 1639 flow [2021-06-10 11:39:26,325 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=727, PETRI_TRANSITIONS=737} [2021-06-10 11:39:26,325 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -22 predicate places. [2021-06-10 11:39:26,325 INFO L480 AbstractCegarLoop]: Abstraction has has 727 places, 737 transitions, 1639 flow [2021-06-10 11:39:26,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:26,325 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:26,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2021-06-10 11:39:26,325 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1426719217, now seen corresponding path program 1 times [2021-06-10 11:39:26,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:26,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008919041] [2021-06-10 11:39:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:26,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:26,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:26,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008919041] [2021-06-10 11:39:26,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:26,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:26,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403401767] [2021-06-10 11:39:26,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:26,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:26,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:26,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 737 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:26,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:26,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:26,555 INFO L129 PetriNetUnfolder]: 75/835 cut-off events. [2021-06-10 11:39:26,556 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:26,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 835 events. 75/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3402 event pairs, 0 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 937. Up to 29 conditions per place. [2021-06-10 11:39:26,601 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2021-06-10 11:39:26,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 738 transitions, 1665 flow [2021-06-10 11:39:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:26,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:26,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:26,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:26,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:26,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:26,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,605 INFO L185 Difference]: Start difference. First operand has 727 places, 737 transitions, 1639 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:26,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 738 transitions, 1665 flow [2021-06-10 11:39:26,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 738 transitions, 1664 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:26,611 INFO L241 Difference]: Finished difference. Result has 730 places, 738 transitions, 1656 flow [2021-06-10 11:39:26,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1656, PETRI_PLACES=730, PETRI_TRANSITIONS=738} [2021-06-10 11:39:26,611 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -19 predicate places. [2021-06-10 11:39:26,611 INFO L480 AbstractCegarLoop]: Abstraction has has 730 places, 738 transitions, 1656 flow [2021-06-10 11:39:26,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:26,611 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:26,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2021-06-10 11:39:26,612 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1427672529, now seen corresponding path program 1 times [2021-06-10 11:39:26,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:26,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933747827] [2021-06-10 11:39:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:26,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:26,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:26,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933747827] [2021-06-10 11:39:26,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:26,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:26,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446148719] [2021-06-10 11:39:26,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:26,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:26,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:26,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 738 transitions, 1656 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:26,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:26,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:26,834 INFO L129 PetriNetUnfolder]: 75/828 cut-off events. [2021-06-10 11:39:26,834 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:26,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 828 events. 75/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3346 event pairs, 0 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 923. Up to 29 conditions per place. [2021-06-10 11:39:26,878 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2021-06-10 11:39:26,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 736 transitions, 1658 flow [2021-06-10 11:39:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:26,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:26,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:26,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:26,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:26,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:26,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,882 INFO L185 Difference]: Start difference. First operand has 730 places, 738 transitions, 1656 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:26,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 736 transitions, 1658 flow [2021-06-10 11:39:26,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 736 transitions, 1650 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:26,888 INFO L241 Difference]: Finished difference. Result has 730 places, 736 transitions, 1643 flow [2021-06-10 11:39:26,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=730, PETRI_TRANSITIONS=736} [2021-06-10 11:39:26,888 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -19 predicate places. [2021-06-10 11:39:26,888 INFO L480 AbstractCegarLoop]: Abstraction has has 730 places, 736 transitions, 1643 flow [2021-06-10 11:39:26,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,889 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:26,889 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:26,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2021-06-10 11:39:26,889 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1427673552, now seen corresponding path program 1 times [2021-06-10 11:39:26,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:26,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660886626] [2021-06-10 11:39:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:26,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:26,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:26,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:26,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660886626] [2021-06-10 11:39:26,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:26,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:26,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029022066] [2021-06-10 11:39:26,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:26,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:26,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:26,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:26,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 736 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:26,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:26,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:26,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:27,112 INFO L129 PetriNetUnfolder]: 75/826 cut-off events. [2021-06-10 11:39:27,113 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:27,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 826 events. 75/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3328 event pairs, 0 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 927. Up to 29 conditions per place. [2021-06-10 11:39:27,186 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/734 dead transitions. [2021-06-10 11:39:27,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 734 transitions, 1656 flow [2021-06-10 11:39:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:27,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:27,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:27,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:27,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:27,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:27,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,190 INFO L185 Difference]: Start difference. First operand has 730 places, 736 transitions, 1643 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:27,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 734 transitions, 1656 flow [2021-06-10 11:39:27,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 734 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:27,195 INFO L241 Difference]: Finished difference. Result has 729 places, 734 transitions, 1639 flow [2021-06-10 11:39:27,195 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=729, PETRI_TRANSITIONS=734} [2021-06-10 11:39:27,196 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -20 predicate places. [2021-06-10 11:39:27,196 INFO L480 AbstractCegarLoop]: Abstraction has has 729 places, 734 transitions, 1639 flow [2021-06-10 11:39:27,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:27,196 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:27,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2021-06-10 11:39:27,196 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 760249539, now seen corresponding path program 1 times [2021-06-10 11:39:27,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:27,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978345165] [2021-06-10 11:39:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:27,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:27,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:27,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978345165] [2021-06-10 11:39:27,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:27,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:27,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872085539] [2021-06-10 11:39:27,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:27,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:27,213 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:27,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 734 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:27,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:27,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:27,434 INFO L129 PetriNetUnfolder]: 74/834 cut-off events. [2021-06-10 11:39:27,434 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:27,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 834 events. 74/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3401 event pairs, 0 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 939. Up to 29 conditions per place. [2021-06-10 11:39:27,481 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/736 dead transitions. [2021-06-10 11:39:27,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 736 transitions, 1669 flow [2021-06-10 11:39:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:27,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:27,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:27,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:27,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:27,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:27,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,485 INFO L185 Difference]: Start difference. First operand has 729 places, 734 transitions, 1639 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:27,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 736 transitions, 1669 flow [2021-06-10 11:39:27,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 730 places, 736 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:27,491 INFO L241 Difference]: Finished difference. Result has 732 places, 736 transitions, 1662 flow [2021-06-10 11:39:27,492 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=728, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=732, PETRI_TRANSITIONS=736} [2021-06-10 11:39:27,492 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -17 predicate places. [2021-06-10 11:39:27,492 INFO L480 AbstractCegarLoop]: Abstraction has has 732 places, 736 transitions, 1662 flow [2021-06-10 11:39:27,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:27,492 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:27,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2021-06-10 11:39:27,492 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 760248516, now seen corresponding path program 1 times [2021-06-10 11:39:27,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:27,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439462430] [2021-06-10 11:39:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:27,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:27,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:27,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439462430] [2021-06-10 11:39:27,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:27,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:27,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683507666] [2021-06-10 11:39:27,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:27,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:27,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:27,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 736 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:27,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:27,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:27,722 INFO L129 PetriNetUnfolder]: 72/835 cut-off events. [2021-06-10 11:39:27,722 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:27,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 835 events. 72/835 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3423 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 939. Up to 29 conditions per place. [2021-06-10 11:39:27,766 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2021-06-10 11:39:27,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 736 transitions, 1674 flow [2021-06-10 11:39:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:27,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:27,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:27,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:27,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:27,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:27,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,770 INFO L185 Difference]: Start difference. First operand has 732 places, 736 transitions, 1662 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:27,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 736 transitions, 1674 flow [2021-06-10 11:39:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 736 transitions, 1669 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:27,776 INFO L241 Difference]: Finished difference. Result has 734 places, 735 transitions, 1658 flow [2021-06-10 11:39:27,776 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1658, PETRI_PLACES=734, PETRI_TRANSITIONS=735} [2021-06-10 11:39:27,776 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -15 predicate places. [2021-06-10 11:39:27,776 INFO L480 AbstractCegarLoop]: Abstraction has has 734 places, 735 transitions, 1658 flow [2021-06-10 11:39:27,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,777 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:27,777 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:27,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2021-06-10 11:39:27,777 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash 759296227, now seen corresponding path program 1 times [2021-06-10 11:39:27,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:27,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312250207] [2021-06-10 11:39:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:27,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:27,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:27,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:27,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312250207] [2021-06-10 11:39:27,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:27,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:27,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828715246] [2021-06-10 11:39:27,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:27,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:27,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:27,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 735 transitions, 1658 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:27,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:27,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:27,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:27,999 INFO L129 PetriNetUnfolder]: 72/828 cut-off events. [2021-06-10 11:39:27,999 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:28,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 828 events. 72/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3366 event pairs, 0 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 933. Up to 29 conditions per place. [2021-06-10 11:39:28,042 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/733 dead transitions. [2021-06-10 11:39:28,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 733 transitions, 1661 flow [2021-06-10 11:39:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:28,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:28,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:28,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:28,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:28,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,045 INFO L185 Difference]: Start difference. First operand has 734 places, 735 transitions, 1658 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 733 transitions, 1661 flow [2021-06-10 11:39:28,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 733 transitions, 1654 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:28,051 INFO L241 Difference]: Finished difference. Result has 734 places, 733 transitions, 1647 flow [2021-06-10 11:39:28,052 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=734, PETRI_TRANSITIONS=733} [2021-06-10 11:39:28,052 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -15 predicate places. [2021-06-10 11:39:28,052 INFO L480 AbstractCegarLoop]: Abstraction has has 734 places, 733 transitions, 1647 flow [2021-06-10 11:39:28,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:28,052 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:28,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2021-06-10 11:39:28,052 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash 759295204, now seen corresponding path program 1 times [2021-06-10 11:39:28,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:28,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302135724] [2021-06-10 11:39:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:28,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:28,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:28,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302135724] [2021-06-10 11:39:28,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:28,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:28,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547068069] [2021-06-10 11:39:28,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:28,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:28,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:28,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:28,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:28,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 734 places, 733 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:28,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:28,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:28,279 INFO L129 PetriNetUnfolder]: 72/826 cut-off events. [2021-06-10 11:39:28,279 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:28,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 826 events. 72/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3348 event pairs, 0 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 933. Up to 29 conditions per place. [2021-06-10 11:39:28,322 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/731 dead transitions. [2021-06-10 11:39:28,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 731 transitions, 1660 flow [2021-06-10 11:39:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:28,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:28,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:28,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:28,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:28,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:28,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,326 INFO L185 Difference]: Start difference. First operand has 734 places, 733 transitions, 1647 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:28,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 731 transitions, 1660 flow [2021-06-10 11:39:28,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 733 places, 731 transitions, 1659 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:28,332 INFO L241 Difference]: Finished difference. Result has 733 places, 731 transitions, 1643 flow [2021-06-10 11:39:28,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=731, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=733, PETRI_TRANSITIONS=731} [2021-06-10 11:39:28,332 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -16 predicate places. [2021-06-10 11:39:28,332 INFO L480 AbstractCegarLoop]: Abstraction has has 733 places, 731 transitions, 1643 flow [2021-06-10 11:39:28,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:28,332 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:28,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2021-06-10 11:39:28,333 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash 418694776, now seen corresponding path program 1 times [2021-06-10 11:39:28,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:28,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368413097] [2021-06-10 11:39:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:28,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:28,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:28,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368413097] [2021-06-10 11:39:28,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:28,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:28,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227423481] [2021-06-10 11:39:28,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:28,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:28,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:28,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 731 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:28,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:28,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:28,567 INFO L129 PetriNetUnfolder]: 71/834 cut-off events. [2021-06-10 11:39:28,567 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:28,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 834 events. 71/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3417 event pairs, 0 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 945. Up to 29 conditions per place. [2021-06-10 11:39:28,610 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/733 dead transitions. [2021-06-10 11:39:28,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 735 places, 733 transitions, 1673 flow [2021-06-10 11:39:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:28,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:28,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:28,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:28,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:28,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:28,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,614 INFO L185 Difference]: Start difference. First operand has 733 places, 731 transitions, 1643 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:28,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 735 places, 733 transitions, 1673 flow [2021-06-10 11:39:28,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 733 transitions, 1672 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:28,620 INFO L241 Difference]: Finished difference. Result has 736 places, 733 transitions, 1666 flow [2021-06-10 11:39:28,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1666, PETRI_PLACES=736, PETRI_TRANSITIONS=733} [2021-06-10 11:39:28,620 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -13 predicate places. [2021-06-10 11:39:28,620 INFO L480 AbstractCegarLoop]: Abstraction has has 736 places, 733 transitions, 1666 flow [2021-06-10 11:39:28,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:28,620 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:28,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2021-06-10 11:39:28,621 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash 418693753, now seen corresponding path program 1 times [2021-06-10 11:39:28,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:28,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488029694] [2021-06-10 11:39:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:28,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:28,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:28,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488029694] [2021-06-10 11:39:28,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:28,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:28,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261166010] [2021-06-10 11:39:28,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:28,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:28,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:28,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 733 transitions, 1666 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:28,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:28,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:28,866 INFO L129 PetriNetUnfolder]: 69/835 cut-off events. [2021-06-10 11:39:28,867 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:28,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 835 events. 69/835 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3438 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 945. Up to 29 conditions per place. [2021-06-10 11:39:28,903 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/733 dead transitions. [2021-06-10 11:39:28,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 733 transitions, 1678 flow [2021-06-10 11:39:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:28,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:28,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:28,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:28,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:28,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:28,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,907 INFO L185 Difference]: Start difference. First operand has 736 places, 733 transitions, 1666 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:28,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 733 transitions, 1678 flow [2021-06-10 11:39:28,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 733 transitions, 1673 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:28,913 INFO L241 Difference]: Finished difference. Result has 738 places, 732 transitions, 1662 flow [2021-06-10 11:39:28,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=738, PETRI_TRANSITIONS=732} [2021-06-10 11:39:28,913 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -11 predicate places. [2021-06-10 11:39:28,913 INFO L480 AbstractCegarLoop]: Abstraction has has 738 places, 732 transitions, 1662 flow [2021-06-10 11:39:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:28,914 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:28,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2021-06-10 11:39:28,914 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:28,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:28,914 INFO L82 PathProgramCache]: Analyzing trace with hash 417741464, now seen corresponding path program 1 times [2021-06-10 11:39:28,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:28,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336642374] [2021-06-10 11:39:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:28,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:28,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:28,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:28,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336642374] [2021-06-10 11:39:28,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:28,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:28,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567812808] [2021-06-10 11:39:28,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:28,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:28,931 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:28,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 732 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:28,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:28,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:28,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:29,146 INFO L129 PetriNetUnfolder]: 69/828 cut-off events. [2021-06-10 11:39:29,146 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:29,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 828 events. 69/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3380 event pairs, 0 based on Foata normal form. 1/733 useless extension candidates. Maximal degree in co-relation 939. Up to 29 conditions per place. [2021-06-10 11:39:29,191 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/730 dead transitions. [2021-06-10 11:39:29,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 730 transitions, 1665 flow [2021-06-10 11:39:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:29,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:29,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:29,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:29,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:29,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:29,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,194 INFO L185 Difference]: Start difference. First operand has 738 places, 732 transitions, 1662 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 740 places, 730 transitions, 1665 flow [2021-06-10 11:39:29,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 730 transitions, 1658 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:29,200 INFO L241 Difference]: Finished difference. Result has 738 places, 730 transitions, 1651 flow [2021-06-10 11:39:29,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=738, PETRI_TRANSITIONS=730} [2021-06-10 11:39:29,201 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -11 predicate places. [2021-06-10 11:39:29,201 INFO L480 AbstractCegarLoop]: Abstraction has has 738 places, 730 transitions, 1651 flow [2021-06-10 11:39:29,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:29,201 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:29,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2021-06-10 11:39:29,201 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 417740441, now seen corresponding path program 1 times [2021-06-10 11:39:29,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:29,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929598998] [2021-06-10 11:39:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:29,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:29,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:29,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929598998] [2021-06-10 11:39:29,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:29,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:29,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333525686] [2021-06-10 11:39:29,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:29,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:29,218 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:29,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 730 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:29,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:29,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:29,431 INFO L129 PetriNetUnfolder]: 69/826 cut-off events. [2021-06-10 11:39:29,431 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:29,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 826 events. 69/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3364 event pairs, 0 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 939. Up to 29 conditions per place. [2021-06-10 11:39:29,474 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/728 dead transitions. [2021-06-10 11:39:29,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 738 places, 728 transitions, 1664 flow [2021-06-10 11:39:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:29,475 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:29,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:29,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:29,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:29,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:29,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,478 INFO L185 Difference]: Start difference. First operand has 738 places, 730 transitions, 1651 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:29,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 738 places, 728 transitions, 1664 flow [2021-06-10 11:39:29,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 737 places, 728 transitions, 1663 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:29,484 INFO L241 Difference]: Finished difference. Result has 737 places, 728 transitions, 1647 flow [2021-06-10 11:39:29,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=735, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=737, PETRI_TRANSITIONS=728} [2021-06-10 11:39:29,484 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -12 predicate places. [2021-06-10 11:39:29,484 INFO L480 AbstractCegarLoop]: Abstraction has has 737 places, 728 transitions, 1647 flow [2021-06-10 11:39:29,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:29,484 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:29,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2021-06-10 11:39:29,484 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:29,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2009496270, now seen corresponding path program 1 times [2021-06-10 11:39:29,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:29,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143681121] [2021-06-10 11:39:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:29,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:29,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143681121] [2021-06-10 11:39:29,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:29,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:29,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130850945] [2021-06-10 11:39:29,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:29,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:29,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:29,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 737 places, 728 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:29,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:29,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:29,728 INFO L129 PetriNetUnfolder]: 67/831 cut-off events. [2021-06-10 11:39:29,728 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:29,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 831 events. 67/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3415 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 942. Up to 29 conditions per place. [2021-06-10 11:39:29,771 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2021-06-10 11:39:29,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 739 places, 729 transitions, 1663 flow [2021-06-10 11:39:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:29,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:29,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:29,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:29,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:29,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:29,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,775 INFO L185 Difference]: Start difference. First operand has 737 places, 728 transitions, 1647 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 739 places, 729 transitions, 1663 flow [2021-06-10 11:39:29,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 729 transitions, 1662 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:29,781 INFO L241 Difference]: Finished difference. Result has 740 places, 729 transitions, 1660 flow [2021-06-10 11:39:29,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=736, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1660, PETRI_PLACES=740, PETRI_TRANSITIONS=729} [2021-06-10 11:39:29,781 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -9 predicate places. [2021-06-10 11:39:29,781 INFO L480 AbstractCegarLoop]: Abstraction has has 740 places, 729 transitions, 1660 flow [2021-06-10 11:39:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:29,781 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:29,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2021-06-10 11:39:29,782 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2009495247, now seen corresponding path program 1 times [2021-06-10 11:39:29,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:29,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824682782] [2021-06-10 11:39:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:29,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:29,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:29,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:29,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824682782] [2021-06-10 11:39:29,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:29,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:29,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109910255] [2021-06-10 11:39:29,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:29,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:29,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:29,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:29,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 729 transitions, 1660 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:29,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:29,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:29,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:30,025 INFO L129 PetriNetUnfolder]: 67/832 cut-off events. [2021-06-10 11:39:30,025 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:30,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 832 events. 67/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3422 event pairs, 0 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 950. Up to 29 conditions per place. [2021-06-10 11:39:30,071 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/730 dead transitions. [2021-06-10 11:39:30,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 730 transitions, 1686 flow [2021-06-10 11:39:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:30,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:30,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:30,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:30,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:30,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:30,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,075 INFO L185 Difference]: Start difference. First operand has 740 places, 729 transitions, 1660 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 730 transitions, 1686 flow [2021-06-10 11:39:30,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 730 transitions, 1684 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:30,081 INFO L241 Difference]: Finished difference. Result has 743 places, 730 transitions, 1676 flow [2021-06-10 11:39:30,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1676, PETRI_PLACES=743, PETRI_TRANSITIONS=730} [2021-06-10 11:39:30,081 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -6 predicate places. [2021-06-10 11:39:30,081 INFO L480 AbstractCegarLoop]: Abstraction has has 743 places, 730 transitions, 1676 flow [2021-06-10 11:39:30,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:30,081 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:30,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2021-06-10 11:39:30,081 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2010449582, now seen corresponding path program 1 times [2021-06-10 11:39:30,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:30,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660651204] [2021-06-10 11:39:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:30,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:30,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:30,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660651204] [2021-06-10 11:39:30,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:30,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:30,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612744685] [2021-06-10 11:39:30,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:30,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:30,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:30,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 743 places, 730 transitions, 1676 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:30,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:30,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:30,330 INFO L129 PetriNetUnfolder]: 66/829 cut-off events. [2021-06-10 11:39:30,330 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:39:30,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 829 events. 66/829 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3407 event pairs, 0 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 949. Up to 29 conditions per place. [2021-06-10 11:39:30,377 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 9 selfloop transitions, 1 changer transitions 0/728 dead transitions. [2021-06-10 11:39:30,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 728 transitions, 1684 flow [2021-06-10 11:39:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2021-06-10 11:39:30,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192546583850931 [2021-06-10 11:39:30,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2021-06-10 11:39:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2021-06-10 11:39:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2021-06-10 11:39:30,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,381 INFO L185 Difference]: Start difference. First operand has 743 places, 730 transitions, 1676 flow. Second operand 3 states and 2220 transitions. [2021-06-10 11:39:30,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 728 transitions, 1684 flow [2021-06-10 11:39:30,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 728 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:30,388 INFO L241 Difference]: Finished difference. Result has 744 places, 728 transitions, 1665 flow [2021-06-10 11:39:30,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=742, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1665, PETRI_PLACES=744, PETRI_TRANSITIONS=728} [2021-06-10 11:39:30,388 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -5 predicate places. [2021-06-10 11:39:30,388 INFO L480 AbstractCegarLoop]: Abstraction has has 744 places, 728 transitions, 1665 flow [2021-06-10 11:39:30,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:30,388 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:30,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2021-06-10 11:39:30,388 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2010448559, now seen corresponding path program 1 times [2021-06-10 11:39:30,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:30,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873699658] [2021-06-10 11:39:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:30,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:30,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:39:30,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873699658] [2021-06-10 11:39:30,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:30,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:30,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816705695] [2021-06-10 11:39:30,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:30,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:30,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:30,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:30,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:30,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 728 transitions, 1665 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:30,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:30,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:30,641 INFO L129 PetriNetUnfolder]: 66/826 cut-off events. [2021-06-10 11:39:30,641 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:30,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 826 events. 66/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3381 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 943. Up to 29 conditions per place. [2021-06-10 11:39:30,685 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/725 dead transitions. [2021-06-10 11:39:30,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 725 transitions, 1666 flow [2021-06-10 11:39:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:30,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:30,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:30,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:30,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:30,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:30,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,689 INFO L185 Difference]: Start difference. First operand has 744 places, 728 transitions, 1665 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:30,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 725 transitions, 1666 flow [2021-06-10 11:39:30,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 741 places, 725 transitions, 1661 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:30,695 INFO L241 Difference]: Finished difference. Result has 741 places, 725 transitions, 1651 flow [2021-06-10 11:39:30,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=741, PETRI_TRANSITIONS=725} [2021-06-10 11:39:30,695 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -8 predicate places. [2021-06-10 11:39:30,695 INFO L480 AbstractCegarLoop]: Abstraction has has 741 places, 725 transitions, 1651 flow [2021-06-10 11:39:30,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:30,696 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:30,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2021-06-10 11:39:30,696 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -135586810, now seen corresponding path program 1 times [2021-06-10 11:39:30,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:30,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737698021] [2021-06-10 11:39:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:30,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:30,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:30,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:30,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737698021] [2021-06-10 11:39:30,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:30,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:30,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282810573] [2021-06-10 11:39:30,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:30,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:30,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:30,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 741 places, 725 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:30,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:30,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:30,937 INFO L129 PetriNetUnfolder]: 65/834 cut-off events. [2021-06-10 11:39:30,937 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:30,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 834 events. 65/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3452 event pairs, 0 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 960. Up to 29 conditions per place. [2021-06-10 11:39:30,982 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/727 dead transitions. [2021-06-10 11:39:30,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 727 transitions, 1681 flow [2021-06-10 11:39:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:30,983 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:30,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:30,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:30,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:30,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:30,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,986 INFO L185 Difference]: Start difference. First operand has 741 places, 725 transitions, 1651 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 727 transitions, 1681 flow [2021-06-10 11:39:30,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 727 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:30,992 INFO L241 Difference]: Finished difference. Result has 744 places, 727 transitions, 1674 flow [2021-06-10 11:39:30,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1674, PETRI_PLACES=744, PETRI_TRANSITIONS=727} [2021-06-10 11:39:30,992 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -5 predicate places. [2021-06-10 11:39:30,992 INFO L480 AbstractCegarLoop]: Abstraction has has 744 places, 727 transitions, 1674 flow [2021-06-10 11:39:30,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:30,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:30,992 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:30,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2021-06-10 11:39:30,992 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash -135585787, now seen corresponding path program 1 times [2021-06-10 11:39:30,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:30,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211371663] [2021-06-10 11:39:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:31,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:31,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:31,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211371663] [2021-06-10 11:39:31,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:31,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:31,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204843301] [2021-06-10 11:39:31,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:31,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:31,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:31,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:31,014 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:31,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 727 transitions, 1674 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:31,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:31,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:31,232 INFO L129 PetriNetUnfolder]: 64/832 cut-off events. [2021-06-10 11:39:31,232 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:31,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 832 events. 64/832 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3442 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 955. Up to 29 conditions per place. [2021-06-10 11:39:31,275 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2021-06-10 11:39:31,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 727 transitions, 1686 flow [2021-06-10 11:39:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:31,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:31,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:31,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:31,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:31,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:31,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,279 INFO L185 Difference]: Start difference. First operand has 744 places, 727 transitions, 1674 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:31,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 727 transitions, 1686 flow [2021-06-10 11:39:31,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 727 transitions, 1681 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:31,285 INFO L241 Difference]: Finished difference. Result has 747 places, 727 transitions, 1679 flow [2021-06-10 11:39:31,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1679, PETRI_PLACES=747, PETRI_TRANSITIONS=727} [2021-06-10 11:39:31,285 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -2 predicate places. [2021-06-10 11:39:31,285 INFO L480 AbstractCegarLoop]: Abstraction has has 747 places, 727 transitions, 1679 flow [2021-06-10 11:39:31,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:31,286 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:31,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2021-06-10 11:39:31,286 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -134633498, now seen corresponding path program 1 times [2021-06-10 11:39:31,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:31,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078361610] [2021-06-10 11:39:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:31,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:31,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:31,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078361610] [2021-06-10 11:39:31,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:31,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:31,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105126316] [2021-06-10 11:39:31,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:31,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:31,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:31,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 727 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:31,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:31,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:31,531 INFO L129 PetriNetUnfolder]: 63/828 cut-off events. [2021-06-10 11:39:31,532 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:31,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 828 events. 63/828 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3415 event pairs, 0 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 952. Up to 29 conditions per place. [2021-06-10 11:39:31,577 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/724 dead transitions. [2021-06-10 11:39:31,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 724 transitions, 1676 flow [2021-06-10 11:39:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:31,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:31,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:31,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:31,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:31,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:31,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,581 INFO L185 Difference]: Start difference. First operand has 747 places, 727 transitions, 1679 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:31,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 724 transitions, 1676 flow [2021-06-10 11:39:31,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 724 transitions, 1669 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:31,587 INFO L241 Difference]: Finished difference. Result has 746 places, 724 transitions, 1659 flow [2021-06-10 11:39:31,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=746, PETRI_TRANSITIONS=724} [2021-06-10 11:39:31,588 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -3 predicate places. [2021-06-10 11:39:31,588 INFO L480 AbstractCegarLoop]: Abstraction has has 746 places, 724 transitions, 1659 flow [2021-06-10 11:39:31,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:31,588 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:31,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2021-06-10 11:39:31,588 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -134632475, now seen corresponding path program 1 times [2021-06-10 11:39:31,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:31,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89850828] [2021-06-10 11:39:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:31,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:31,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:39:31,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89850828] [2021-06-10 11:39:31,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:31,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:31,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967973380] [2021-06-10 11:39:31,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:31,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:31,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:31,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 724 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:31,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:31,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:31,831 INFO L129 PetriNetUnfolder]: 63/826 cut-off events. [2021-06-10 11:39:31,831 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:31,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 826 events. 63/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 0 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 953. Up to 29 conditions per place. [2021-06-10 11:39:31,875 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/722 dead transitions. [2021-06-10 11:39:31,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 722 transitions, 1672 flow [2021-06-10 11:39:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:31,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:31,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:31,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:31,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:31,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:31,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,878 INFO L185 Difference]: Start difference. First operand has 746 places, 724 transitions, 1659 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:31,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 722 transitions, 1672 flow [2021-06-10 11:39:31,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 722 transitions, 1671 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:31,885 INFO L241 Difference]: Finished difference. Result has 745 places, 722 transitions, 1655 flow [2021-06-10 11:39:31,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1655, PETRI_PLACES=745, PETRI_TRANSITIONS=722} [2021-06-10 11:39:31,885 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -4 predicate places. [2021-06-10 11:39:31,885 INFO L480 AbstractCegarLoop]: Abstraction has has 745 places, 722 transitions, 1655 flow [2021-06-10 11:39:31,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,885 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:31,885 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:31,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2021-06-10 11:39:31,885 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1898432098, now seen corresponding path program 1 times [2021-06-10 11:39:31,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:31,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48069894] [2021-06-10 11:39:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:31,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:31,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:31,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:31,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48069894] [2021-06-10 11:39:31,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:31,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:31,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704387753] [2021-06-10 11:39:31,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:31,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:31,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:31,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 722 transitions, 1655 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:31,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:31,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:31,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:32,149 INFO L129 PetriNetUnfolder]: 62/833 cut-off events. [2021-06-10 11:39:32,149 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:32,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 833 events. 62/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3459 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 958. Up to 29 conditions per place. [2021-06-10 11:39:32,181 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2021-06-10 11:39:32,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 723 transitions, 1671 flow [2021-06-10 11:39:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:32,182 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:32,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:32,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:32,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:32,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:32,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,184 INFO L185 Difference]: Start difference. First operand has 745 places, 722 transitions, 1655 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 723 transitions, 1671 flow [2021-06-10 11:39:32,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 723 transitions, 1670 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:32,190 INFO L241 Difference]: Finished difference. Result has 747 places, 722 transitions, 1659 flow [2021-06-10 11:39:32,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=747, PETRI_TRANSITIONS=722} [2021-06-10 11:39:32,190 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, -2 predicate places. [2021-06-10 11:39:32,190 INFO L480 AbstractCegarLoop]: Abstraction has has 747 places, 722 transitions, 1659 flow [2021-06-10 11:39:32,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:32,191 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:32,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2021-06-10 11:39:32,191 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1898431075, now seen corresponding path program 1 times [2021-06-10 11:39:32,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:32,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179036773] [2021-06-10 11:39:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:32,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:32,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:32,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179036773] [2021-06-10 11:39:32,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:32,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:32,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004180206] [2021-06-10 11:39:32,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:32,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:32,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:32,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 722 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:32,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:32,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:32,433 INFO L129 PetriNetUnfolder]: 60/835 cut-off events. [2021-06-10 11:39:32,434 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:32,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 835 events. 60/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3492 event pairs, 0 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 969. Up to 29 conditions per place. [2021-06-10 11:39:32,477 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/723 dead transitions. [2021-06-10 11:39:32,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 723 transitions, 1685 flow [2021-06-10 11:39:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:32,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:32,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:32,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:32,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:32,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,481 INFO L185 Difference]: Start difference. First operand has 747 places, 722 transitions, 1659 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:32,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 723 transitions, 1685 flow [2021-06-10 11:39:32,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 723 transitions, 1684 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:32,487 INFO L241 Difference]: Finished difference. Result has 750 places, 723 transitions, 1676 flow [2021-06-10 11:39:32,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1676, PETRI_PLACES=750, PETRI_TRANSITIONS=723} [2021-06-10 11:39:32,487 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 1 predicate places. [2021-06-10 11:39:32,487 INFO L480 AbstractCegarLoop]: Abstraction has has 750 places, 723 transitions, 1676 flow [2021-06-10 11:39:32,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,487 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:32,487 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:32,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2021-06-10 11:39:32,488 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1899384387, now seen corresponding path program 1 times [2021-06-10 11:39:32,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:32,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019833108] [2021-06-10 11:39:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:32,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:32,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:32,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019833108] [2021-06-10 11:39:32,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:32,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:32,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130263133] [2021-06-10 11:39:32,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:32,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:32,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:32,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:32,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:32,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 723 transitions, 1676 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:32,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:32,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:32,720 INFO L129 PetriNetUnfolder]: 60/828 cut-off events. [2021-06-10 11:39:32,721 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:32,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 828 events. 60/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3435 event pairs, 0 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 955. Up to 29 conditions per place. [2021-06-10 11:39:32,763 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/721 dead transitions. [2021-06-10 11:39:32,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 721 transitions, 1678 flow [2021-06-10 11:39:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:32,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:32,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:32,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:32,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:32,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:32,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,766 INFO L185 Difference]: Start difference. First operand has 750 places, 723 transitions, 1676 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:32,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 721 transitions, 1678 flow [2021-06-10 11:39:32,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 721 transitions, 1670 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:32,773 INFO L241 Difference]: Finished difference. Result has 750 places, 721 transitions, 1663 flow [2021-06-10 11:39:32,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=750, PETRI_TRANSITIONS=721} [2021-06-10 11:39:32,773 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 1 predicate places. [2021-06-10 11:39:32,773 INFO L480 AbstractCegarLoop]: Abstraction has has 750 places, 721 transitions, 1663 flow [2021-06-10 11:39:32,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:32,773 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:32,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2021-06-10 11:39:32,773 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1899385410, now seen corresponding path program 1 times [2021-06-10 11:39:32,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:32,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843463511] [2021-06-10 11:39:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:32,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:32,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:32,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:39:32,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843463511] [2021-06-10 11:39:32,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:32,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:32,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527768186] [2021-06-10 11:39:32,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:32,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:32,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:32,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 721 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:32,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:32,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:32,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:33,014 INFO L129 PetriNetUnfolder]: 60/826 cut-off events. [2021-06-10 11:39:33,014 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:33,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 826 events. 60/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3420 event pairs, 0 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 959. Up to 29 conditions per place. [2021-06-10 11:39:33,056 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/719 dead transitions. [2021-06-10 11:39:33,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 719 transitions, 1676 flow [2021-06-10 11:39:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:33,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:33,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:33,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:33,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:33,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:33,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,060 INFO L185 Difference]: Start difference. First operand has 750 places, 721 transitions, 1663 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 719 transitions, 1676 flow [2021-06-10 11:39:33,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 719 transitions, 1675 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:33,066 INFO L241 Difference]: Finished difference. Result has 749 places, 719 transitions, 1659 flow [2021-06-10 11:39:33,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1659, PETRI_PLACES=749, PETRI_TRANSITIONS=719} [2021-06-10 11:39:33,066 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 0 predicate places. [2021-06-10 11:39:33,067 INFO L480 AbstractCegarLoop]: Abstraction has has 749 places, 719 transitions, 1659 flow [2021-06-10 11:39:33,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:33,067 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:33,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2021-06-10 11:39:33,067 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:33,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1006468695, now seen corresponding path program 1 times [2021-06-10 11:39:33,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:33,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311833390] [2021-06-10 11:39:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:33,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:33,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:33,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311833390] [2021-06-10 11:39:33,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:33,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:33,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281139977] [2021-06-10 11:39:33,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:33,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:33,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:33,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:33,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 719 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:33,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:33,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:33,307 INFO L129 PetriNetUnfolder]: 59/833 cut-off events. [2021-06-10 11:39:33,307 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:33,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 833 events. 59/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3476 event pairs, 0 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 964. Up to 29 conditions per place. [2021-06-10 11:39:33,351 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/720 dead transitions. [2021-06-10 11:39:33,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 720 transitions, 1675 flow [2021-06-10 11:39:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:33,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:33,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:33,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:33,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:33,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:33,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,355 INFO L185 Difference]: Start difference. First operand has 749 places, 719 transitions, 1659 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:33,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 720 transitions, 1675 flow [2021-06-10 11:39:33,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 750 places, 720 transitions, 1674 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:33,361 INFO L241 Difference]: Finished difference. Result has 751 places, 719 transitions, 1663 flow [2021-06-10 11:39:33,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=748, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=751, PETRI_TRANSITIONS=719} [2021-06-10 11:39:33,361 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 2 predicate places. [2021-06-10 11:39:33,361 INFO L480 AbstractCegarLoop]: Abstraction has has 751 places, 719 transitions, 1663 flow [2021-06-10 11:39:33,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:33,362 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:33,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2021-06-10 11:39:33,362 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1006469718, now seen corresponding path program 1 times [2021-06-10 11:39:33,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:33,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342946384] [2021-06-10 11:39:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:33,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:33,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:33,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342946384] [2021-06-10 11:39:33,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:33,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:33,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79063138] [2021-06-10 11:39:33,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:33,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:33,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:33,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 719 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:33,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:33,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:33,638 INFO L129 PetriNetUnfolder]: 57/835 cut-off events. [2021-06-10 11:39:33,638 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:33,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 835 events. 57/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3512 event pairs, 0 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 975. Up to 29 conditions per place. [2021-06-10 11:39:33,683 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/720 dead transitions. [2021-06-10 11:39:33,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 720 transitions, 1689 flow [2021-06-10 11:39:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:33,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:33,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:33,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:33,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:33,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:33,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,687 INFO L185 Difference]: Start difference. First operand has 751 places, 719 transitions, 1663 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:33,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 720 transitions, 1689 flow [2021-06-10 11:39:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 752 places, 720 transitions, 1688 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:33,694 INFO L241 Difference]: Finished difference. Result has 754 places, 720 transitions, 1680 flow [2021-06-10 11:39:33,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1680, PETRI_PLACES=754, PETRI_TRANSITIONS=720} [2021-06-10 11:39:33,694 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 5 predicate places. [2021-06-10 11:39:33,695 INFO L480 AbstractCegarLoop]: Abstraction has has 754 places, 720 transitions, 1680 flow [2021-06-10 11:39:33,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,695 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:33,695 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:33,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2021-06-10 11:39:33,695 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1005516406, now seen corresponding path program 1 times [2021-06-10 11:39:33,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:33,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294108959] [2021-06-10 11:39:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:33,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:33,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:33,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:33,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294108959] [2021-06-10 11:39:33,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:33,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:33,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571535172] [2021-06-10 11:39:33,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:33,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:33,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:33,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 720 transitions, 1680 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:33,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:33,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:33,951 INFO L129 PetriNetUnfolder]: 57/828 cut-off events. [2021-06-10 11:39:33,952 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:33,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 828 events. 57/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3450 event pairs, 0 based on Foata normal form. 1/745 useless extension candidates. Maximal degree in co-relation 961. Up to 29 conditions per place. [2021-06-10 11:39:33,995 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/718 dead transitions. [2021-06-10 11:39:33,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 718 transitions, 1682 flow [2021-06-10 11:39:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:33,996 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:33,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:33,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:33,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:33,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:33,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:33,999 INFO L185 Difference]: Start difference. First operand has 754 places, 720 transitions, 1680 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:33,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 718 transitions, 1682 flow [2021-06-10 11:39:34,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 718 transitions, 1674 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:34,005 INFO L241 Difference]: Finished difference. Result has 754 places, 718 transitions, 1667 flow [2021-06-10 11:39:34,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=754, PETRI_TRANSITIONS=718} [2021-06-10 11:39:34,005 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 5 predicate places. [2021-06-10 11:39:34,005 INFO L480 AbstractCegarLoop]: Abstraction has has 754 places, 718 transitions, 1667 flow [2021-06-10 11:39:34,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:34,005 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:34,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2021-06-10 11:39:34,005 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1005515383, now seen corresponding path program 1 times [2021-06-10 11:39:34,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:34,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720465996] [2021-06-10 11:39:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:34,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:34,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:39:34,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720465996] [2021-06-10 11:39:34,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:34,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:34,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690157146] [2021-06-10 11:39:34,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:34,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:34,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:34,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 718 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:34,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:34,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:34,250 INFO L129 PetriNetUnfolder]: 57/826 cut-off events. [2021-06-10 11:39:34,250 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:34,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 826 events. 57/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3433 event pairs, 0 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 965. Up to 29 conditions per place. [2021-06-10 11:39:34,296 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/716 dead transitions. [2021-06-10 11:39:34,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 716 transitions, 1680 flow [2021-06-10 11:39:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:34,297 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:34,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:34,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:34,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:34,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:34,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,300 INFO L185 Difference]: Start difference. First operand has 754 places, 718 transitions, 1667 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 754 places, 716 transitions, 1680 flow [2021-06-10 11:39:34,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 716 transitions, 1679 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:34,306 INFO L241 Difference]: Finished difference. Result has 753 places, 716 transitions, 1663 flow [2021-06-10 11:39:34,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1663, PETRI_PLACES=753, PETRI_TRANSITIONS=716} [2021-06-10 11:39:34,307 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 4 predicate places. [2021-06-10 11:39:34,307 INFO L480 AbstractCegarLoop]: Abstraction has has 753 places, 716 transitions, 1663 flow [2021-06-10 11:39:34,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:34,307 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:34,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2021-06-10 11:39:34,307 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 543435185, now seen corresponding path program 1 times [2021-06-10 11:39:34,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:34,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311909013] [2021-06-10 11:39:34,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:34,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:34,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:34,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311909013] [2021-06-10 11:39:34,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:34,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:34,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992510228] [2021-06-10 11:39:34,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:34,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:34,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:34,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:34,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 716 transitions, 1663 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:34,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:34,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:34,566 INFO L129 PetriNetUnfolder]: 56/834 cut-off events. [2021-06-10 11:39:34,566 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:34,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 834 events. 56/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3506 event pairs, 0 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 977. Up to 29 conditions per place. [2021-06-10 11:39:34,610 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/718 dead transitions. [2021-06-10 11:39:34,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 718 transitions, 1693 flow [2021-06-10 11:39:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:34,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:34,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:34,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:34,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:34,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:34,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,614 INFO L185 Difference]: Start difference. First operand has 753 places, 716 transitions, 1663 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:34,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 718 transitions, 1693 flow [2021-06-10 11:39:34,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 718 transitions, 1692 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:34,620 INFO L241 Difference]: Finished difference. Result has 756 places, 718 transitions, 1686 flow [2021-06-10 11:39:34,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1686, PETRI_PLACES=756, PETRI_TRANSITIONS=718} [2021-06-10 11:39:34,620 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 7 predicate places. [2021-06-10 11:39:34,620 INFO L480 AbstractCegarLoop]: Abstraction has has 756 places, 718 transitions, 1686 flow [2021-06-10 11:39:34,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:34,621 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:34,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2021-06-10 11:39:34,621 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash 543436208, now seen corresponding path program 1 times [2021-06-10 11:39:34,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:34,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216266848] [2021-06-10 11:39:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:34,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:34,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:34,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216266848] [2021-06-10 11:39:34,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:34,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:34,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646286882] [2021-06-10 11:39:34,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:34,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:34,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:34,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 718 transitions, 1686 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:34,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:34,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:34,866 INFO L129 PetriNetUnfolder]: 55/832 cut-off events. [2021-06-10 11:39:34,866 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:34,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 832 events. 55/832 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3494 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 974. Up to 29 conditions per place. [2021-06-10 11:39:34,909 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2021-06-10 11:39:34,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 718 transitions, 1698 flow [2021-06-10 11:39:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:34,910 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:34,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:34,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:34,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:34,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:34,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,912 INFO L185 Difference]: Start difference. First operand has 756 places, 718 transitions, 1686 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:34,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 718 transitions, 1698 flow [2021-06-10 11:39:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 757 places, 718 transitions, 1693 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:34,919 INFO L241 Difference]: Finished difference. Result has 759 places, 718 transitions, 1691 flow [2021-06-10 11:39:34,919 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=759, PETRI_TRANSITIONS=718} [2021-06-10 11:39:34,919 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 10 predicate places. [2021-06-10 11:39:34,919 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 718 transitions, 1691 flow [2021-06-10 11:39:34,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:34,919 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:34,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2021-06-10 11:39:34,920 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:34,920 INFO L82 PathProgramCache]: Analyzing trace with hash 544388497, now seen corresponding path program 1 times [2021-06-10 11:39:34,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:34,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511091930] [2021-06-10 11:39:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:34,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:34,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:34,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:34,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511091930] [2021-06-10 11:39:34,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:34,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:34,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058747119] [2021-06-10 11:39:34,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:34,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:34,938 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:34,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 718 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:34,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:34,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:34,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:35,165 INFO L129 PetriNetUnfolder]: 54/828 cut-off events. [2021-06-10 11:39:35,165 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:35,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 828 events. 54/828 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3467 event pairs, 0 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 971. Up to 29 conditions per place. [2021-06-10 11:39:35,209 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/715 dead transitions. [2021-06-10 11:39:35,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 715 transitions, 1688 flow [2021-06-10 11:39:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:35,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:35,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:35,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:35,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:35,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:35,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,213 INFO L185 Difference]: Start difference. First operand has 759 places, 718 transitions, 1691 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:35,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 715 transitions, 1688 flow [2021-06-10 11:39:35,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 715 transitions, 1681 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:35,219 INFO L241 Difference]: Finished difference. Result has 758 places, 715 transitions, 1671 flow [2021-06-10 11:39:35,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1671, PETRI_PLACES=758, PETRI_TRANSITIONS=715} [2021-06-10 11:39:35,220 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 9 predicate places. [2021-06-10 11:39:35,220 INFO L480 AbstractCegarLoop]: Abstraction has has 758 places, 715 transitions, 1671 flow [2021-06-10 11:39:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:35,220 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:35,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2021-06-10 11:39:35,220 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash 544389520, now seen corresponding path program 1 times [2021-06-10 11:39:35,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:35,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628757191] [2021-06-10 11:39:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:35,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:35,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:39:35,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628757191] [2021-06-10 11:39:35,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:35,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:35,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925284631] [2021-06-10 11:39:35,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:35,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:35,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:35,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 715 transitions, 1671 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:35,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:35,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:35,475 INFO L129 PetriNetUnfolder]: 54/826 cut-off events. [2021-06-10 11:39:35,475 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:35,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 826 events. 54/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3454 event pairs, 0 based on Foata normal form. 0/744 useless extension candidates. Maximal degree in co-relation 972. Up to 29 conditions per place. [2021-06-10 11:39:35,512 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/713 dead transitions. [2021-06-10 11:39:35,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 713 transitions, 1684 flow [2021-06-10 11:39:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:35,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:35,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:35,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:35,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:35,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:35,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,515 INFO L185 Difference]: Start difference. First operand has 758 places, 715 transitions, 1671 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:35,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 713 transitions, 1684 flow [2021-06-10 11:39:35,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 757 places, 713 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:35,521 INFO L241 Difference]: Finished difference. Result has 757 places, 713 transitions, 1667 flow [2021-06-10 11:39:35,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=757, PETRI_TRANSITIONS=713} [2021-06-10 11:39:35,521 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 8 predicate places. [2021-06-10 11:39:35,521 INFO L480 AbstractCegarLoop]: Abstraction has has 757 places, 713 transitions, 1667 flow [2021-06-10 11:39:35,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:35,522 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:35,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2021-06-10 11:39:35,522 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1890326732, now seen corresponding path program 1 times [2021-06-10 11:39:35,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:35,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565724626] [2021-06-10 11:39:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:35,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:35,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:35,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565724626] [2021-06-10 11:39:35,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:35,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:35,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648682234] [2021-06-10 11:39:35,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:35,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:35,540 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:35,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 713 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:35,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:35,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:35,769 INFO L129 PetriNetUnfolder]: 53/833 cut-off events. [2021-06-10 11:39:35,769 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:35,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 833 events. 53/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3510 event pairs, 0 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 977. Up to 29 conditions per place. [2021-06-10 11:39:35,811 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/714 dead transitions. [2021-06-10 11:39:35,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 714 transitions, 1683 flow [2021-06-10 11:39:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:35,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:35,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:35,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:35,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:35,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:35,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,815 INFO L185 Difference]: Start difference. First operand has 757 places, 713 transitions, 1667 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 714 transitions, 1683 flow [2021-06-10 11:39:35,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 714 transitions, 1682 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:35,821 INFO L241 Difference]: Finished difference. Result has 759 places, 713 transitions, 1671 flow [2021-06-10 11:39:35,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1671, PETRI_PLACES=759, PETRI_TRANSITIONS=713} [2021-06-10 11:39:35,821 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 10 predicate places. [2021-06-10 11:39:35,821 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 713 transitions, 1671 flow [2021-06-10 11:39:35,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:35,822 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:35,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2021-06-10 11:39:35,822 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1890327755, now seen corresponding path program 1 times [2021-06-10 11:39:35,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:35,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965019102] [2021-06-10 11:39:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:35,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:35,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:35,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:35,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965019102] [2021-06-10 11:39:35,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:35,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:35,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392811997] [2021-06-10 11:39:35,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:35,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:35,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:35,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:35,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:35,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 713 transitions, 1671 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:35,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:35,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:35,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:36,078 INFO L129 PetriNetUnfolder]: 51/835 cut-off events. [2021-06-10 11:39:36,079 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:36,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 835 events. 51/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3545 event pairs, 0 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 988. Up to 29 conditions per place. [2021-06-10 11:39:36,123 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/714 dead transitions. [2021-06-10 11:39:36,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 714 transitions, 1697 flow [2021-06-10 11:39:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:36,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:36,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:36,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:36,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:36,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:36,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,127 INFO L185 Difference]: Start difference. First operand has 759 places, 713 transitions, 1671 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:36,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 714 transitions, 1697 flow [2021-06-10 11:39:36,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 760 places, 714 transitions, 1696 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:36,133 INFO L241 Difference]: Finished difference. Result has 762 places, 714 transitions, 1688 flow [2021-06-10 11:39:36,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=758, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1688, PETRI_PLACES=762, PETRI_TRANSITIONS=714} [2021-06-10 11:39:36,134 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 13 predicate places. [2021-06-10 11:39:36,134 INFO L480 AbstractCegarLoop]: Abstraction has has 762 places, 714 transitions, 1688 flow [2021-06-10 11:39:36,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:36,134 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:36,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2021-06-10 11:39:36,134 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1889374443, now seen corresponding path program 1 times [2021-06-10 11:39:36,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:36,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728316742] [2021-06-10 11:39:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:36,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:36,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:36,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728316742] [2021-06-10 11:39:36,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:36,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:36,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622535683] [2021-06-10 11:39:36,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:36,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:36,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:36,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 714 transitions, 1688 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:36,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:36,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:36,378 INFO L129 PetriNetUnfolder]: 51/828 cut-off events. [2021-06-10 11:39:36,379 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:36,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 828 events. 51/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3484 event pairs, 0 based on Foata normal form. 1/751 useless extension candidates. Maximal degree in co-relation 974. Up to 29 conditions per place. [2021-06-10 11:39:36,420 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2021-06-10 11:39:36,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 712 transitions, 1690 flow [2021-06-10 11:39:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:36,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:36,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:36,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:36,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:36,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:36,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,424 INFO L185 Difference]: Start difference. First operand has 762 places, 714 transitions, 1688 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:36,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 712 transitions, 1690 flow [2021-06-10 11:39:36,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 712 transitions, 1682 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:36,431 INFO L241 Difference]: Finished difference. Result has 762 places, 712 transitions, 1675 flow [2021-06-10 11:39:36,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=762, PETRI_TRANSITIONS=712} [2021-06-10 11:39:36,431 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 13 predicate places. [2021-06-10 11:39:36,431 INFO L480 AbstractCegarLoop]: Abstraction has has 762 places, 712 transitions, 1675 flow [2021-06-10 11:39:36,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:36,431 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:36,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2021-06-10 11:39:36,431 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1889373420, now seen corresponding path program 1 times [2021-06-10 11:39:36,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:36,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892021406] [2021-06-10 11:39:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:36,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:36,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:39:36,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892021406] [2021-06-10 11:39:36,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:36,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:36,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753830674] [2021-06-10 11:39:36,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:36,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:36,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:36,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:36,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:36,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 712 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:36,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:36,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:36,679 INFO L129 PetriNetUnfolder]: 51/826 cut-off events. [2021-06-10 11:39:36,679 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:36,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 826 events. 51/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3471 event pairs, 0 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 978. Up to 29 conditions per place. [2021-06-10 11:39:36,720 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2021-06-10 11:39:36,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 710 transitions, 1688 flow [2021-06-10 11:39:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:36,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:36,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:36,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:36,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:36,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:36,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,724 INFO L185 Difference]: Start difference. First operand has 762 places, 712 transitions, 1675 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:36,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 710 transitions, 1688 flow [2021-06-10 11:39:36,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 710 transitions, 1687 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:36,730 INFO L241 Difference]: Finished difference. Result has 761 places, 710 transitions, 1671 flow [2021-06-10 11:39:36,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1671, PETRI_PLACES=761, PETRI_TRANSITIONS=710} [2021-06-10 11:39:36,731 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 12 predicate places. [2021-06-10 11:39:36,731 INFO L480 AbstractCegarLoop]: Abstraction has has 761 places, 710 transitions, 1671 flow [2021-06-10 11:39:36,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:36,731 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:36,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2021-06-10 11:39:36,731 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 537588647, now seen corresponding path program 1 times [2021-06-10 11:39:36,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:36,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066435844] [2021-06-10 11:39:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:36,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:36,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:36,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:36,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066435844] [2021-06-10 11:39:36,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:36,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:36,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782074384] [2021-06-10 11:39:36,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:36,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:36,749 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:36,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 710 transitions, 1671 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:36,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:36,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:36,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:37,003 INFO L129 PetriNetUnfolder]: 49/831 cut-off events. [2021-06-10 11:39:37,003 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:37,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 831 events. 49/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3522 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 981. Up to 29 conditions per place. [2021-06-10 11:39:37,030 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2021-06-10 11:39:37,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 711 transitions, 1687 flow [2021-06-10 11:39:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:37,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:37,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:37,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:37,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:37,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:37,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,034 INFO L185 Difference]: Start difference. First operand has 761 places, 710 transitions, 1671 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:37,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 763 places, 711 transitions, 1687 flow [2021-06-10 11:39:37,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 711 transitions, 1686 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:37,040 INFO L241 Difference]: Finished difference. Result has 764 places, 711 transitions, 1684 flow [2021-06-10 11:39:37,040 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=760, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1684, PETRI_PLACES=764, PETRI_TRANSITIONS=711} [2021-06-10 11:39:37,040 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 15 predicate places. [2021-06-10 11:39:37,040 INFO L480 AbstractCegarLoop]: Abstraction has has 764 places, 711 transitions, 1684 flow [2021-06-10 11:39:37,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:37,040 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:37,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2021-06-10 11:39:37,040 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash 537587624, now seen corresponding path program 1 times [2021-06-10 11:39:37,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:37,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386818097] [2021-06-10 11:39:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:37,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:37,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:37,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386818097] [2021-06-10 11:39:37,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:37,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:37,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996700443] [2021-06-10 11:39:37,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:37,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:37,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:37,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 711 transitions, 1684 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:37,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:37,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:37,289 INFO L129 PetriNetUnfolder]: 49/832 cut-off events. [2021-06-10 11:39:37,290 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:37,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 832 events. 49/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3532 event pairs, 0 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 989. Up to 29 conditions per place. [2021-06-10 11:39:37,332 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/712 dead transitions. [2021-06-10 11:39:37,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 712 transitions, 1710 flow [2021-06-10 11:39:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:37,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:37,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:37,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:37,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:37,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:37,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,336 INFO L185 Difference]: Start difference. First operand has 764 places, 711 transitions, 1684 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:37,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 712 transitions, 1710 flow [2021-06-10 11:39:37,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 765 places, 712 transitions, 1708 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:37,343 INFO L241 Difference]: Finished difference. Result has 767 places, 712 transitions, 1700 flow [2021-06-10 11:39:37,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=763, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1700, PETRI_PLACES=767, PETRI_TRANSITIONS=712} [2021-06-10 11:39:37,343 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 18 predicate places. [2021-06-10 11:39:37,343 INFO L480 AbstractCegarLoop]: Abstraction has has 767 places, 712 transitions, 1700 flow [2021-06-10 11:39:37,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:37,344 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:37,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2021-06-10 11:39:37,344 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 538540936, now seen corresponding path program 1 times [2021-06-10 11:39:37,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:37,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799224089] [2021-06-10 11:39:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:37,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:37,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:37,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799224089] [2021-06-10 11:39:37,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:37,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:37,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597209311] [2021-06-10 11:39:37,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:37,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:37,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 712 transitions, 1700 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:37,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:37,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:37,595 INFO L129 PetriNetUnfolder]: 48/828 cut-off events. [2021-06-10 11:39:37,595 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:37,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 828 events. 48/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3504 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 982. Up to 29 conditions per place. [2021-06-10 11:39:37,637 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/709 dead transitions. [2021-06-10 11:39:37,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 709 transitions, 1697 flow [2021-06-10 11:39:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:37,638 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:37,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:37,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:37,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:37,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:37,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,640 INFO L185 Difference]: Start difference. First operand has 767 places, 712 transitions, 1700 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:37,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 709 transitions, 1697 flow [2021-06-10 11:39:37,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 766 places, 709 transitions, 1689 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:37,647 INFO L241 Difference]: Finished difference. Result has 766 places, 709 transitions, 1679 flow [2021-06-10 11:39:37,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=764, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1679, PETRI_PLACES=766, PETRI_TRANSITIONS=709} [2021-06-10 11:39:37,647 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 17 predicate places. [2021-06-10 11:39:37,647 INFO L480 AbstractCegarLoop]: Abstraction has has 766 places, 709 transitions, 1679 flow [2021-06-10 11:39:37,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:37,647 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:37,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2021-06-10 11:39:37,648 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 538541959, now seen corresponding path program 1 times [2021-06-10 11:39:37,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:37,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206944119] [2021-06-10 11:39:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:37,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:37,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:39:37,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206944119] [2021-06-10 11:39:37,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:37,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:37,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266871115] [2021-06-10 11:39:37,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:37,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:37,666 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:37,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 709 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:37,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:37,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:37,891 INFO L129 PetriNetUnfolder]: 48/826 cut-off events. [2021-06-10 11:39:37,892 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:37,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 826 events. 48/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3489 event pairs, 0 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 985. Up to 29 conditions per place. [2021-06-10 11:39:37,932 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/707 dead transitions. [2021-06-10 11:39:37,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 707 transitions, 1692 flow [2021-06-10 11:39:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:37,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:37,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:37,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:37,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:37,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:37,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,935 INFO L185 Difference]: Start difference. First operand has 766 places, 709 transitions, 1679 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:37,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 707 transitions, 1692 flow [2021-06-10 11:39:37,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 765 places, 707 transitions, 1691 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:37,942 INFO L241 Difference]: Finished difference. Result has 765 places, 707 transitions, 1675 flow [2021-06-10 11:39:37,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=763, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=765, PETRI_TRANSITIONS=707} [2021-06-10 11:39:37,942 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 16 predicate places. [2021-06-10 11:39:37,942 INFO L480 AbstractCegarLoop]: Abstraction has has 765 places, 707 transitions, 1675 flow [2021-06-10 11:39:37,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,942 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:37,942 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:37,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2021-06-10 11:39:37,943 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 78160965, now seen corresponding path program 1 times [2021-06-10 11:39:37,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:37,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536619178] [2021-06-10 11:39:37,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:37,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:37,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:37,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:37,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536619178] [2021-06-10 11:39:37,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:37,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:37,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147090764] [2021-06-10 11:39:37,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:37,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:37,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:37,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 707 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:37,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:37,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:37,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:38,188 INFO L129 PetriNetUnfolder]: 47/833 cut-off events. [2021-06-10 11:39:38,188 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:38,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 833 events. 47/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3545 event pairs, 0 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 990. Up to 29 conditions per place. [2021-06-10 11:39:38,229 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/708 dead transitions. [2021-06-10 11:39:38,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 708 transitions, 1691 flow [2021-06-10 11:39:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:38,230 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:38,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:38,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:38,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:38,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:38,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,232 INFO L185 Difference]: Start difference. First operand has 765 places, 707 transitions, 1675 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:38,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 767 places, 708 transitions, 1691 flow [2021-06-10 11:39:38,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 766 places, 708 transitions, 1690 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:38,238 INFO L241 Difference]: Finished difference. Result has 767 places, 707 transitions, 1679 flow [2021-06-10 11:39:38,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=764, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1679, PETRI_PLACES=767, PETRI_TRANSITIONS=707} [2021-06-10 11:39:38,239 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 18 predicate places. [2021-06-10 11:39:38,239 INFO L480 AbstractCegarLoop]: Abstraction has has 767 places, 707 transitions, 1679 flow [2021-06-10 11:39:38,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:38,239 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:38,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2021-06-10 11:39:38,239 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash 78161988, now seen corresponding path program 1 times [2021-06-10 11:39:38,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:38,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398568357] [2021-06-10 11:39:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:38,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:38,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:38,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398568357] [2021-06-10 11:39:38,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:38,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:38,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167230719] [2021-06-10 11:39:38,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:38,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:38,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:38,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 707 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:38,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:38,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:38,491 INFO L129 PetriNetUnfolder]: 45/835 cut-off events. [2021-06-10 11:39:38,491 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:38,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 835 events. 45/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3578 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1001. Up to 29 conditions per place. [2021-06-10 11:39:38,554 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/708 dead transitions. [2021-06-10 11:39:38,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 708 transitions, 1705 flow [2021-06-10 11:39:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:38,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:38,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:38,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:38,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:38,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:38,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,557 INFO L185 Difference]: Start difference. First operand has 767 places, 707 transitions, 1679 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:38,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 708 transitions, 1705 flow [2021-06-10 11:39:38,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 708 transitions, 1704 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:38,563 INFO L241 Difference]: Finished difference. Result has 770 places, 708 transitions, 1696 flow [2021-06-10 11:39:38,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1696, PETRI_PLACES=770, PETRI_TRANSITIONS=708} [2021-06-10 11:39:38,563 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 21 predicate places. [2021-06-10 11:39:38,563 INFO L480 AbstractCegarLoop]: Abstraction has has 770 places, 708 transitions, 1696 flow [2021-06-10 11:39:38,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:38,564 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:38,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2021-06-10 11:39:38,564 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 77208676, now seen corresponding path program 1 times [2021-06-10 11:39:38,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:38,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074814178] [2021-06-10 11:39:38,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:38,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:38,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:38,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074814178] [2021-06-10 11:39:38,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:38,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:38,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615250812] [2021-06-10 11:39:38,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:38,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:38,582 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:38,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 708 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:38,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:38,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:38,816 INFO L129 PetriNetUnfolder]: 45/828 cut-off events. [2021-06-10 11:39:38,816 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:38,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 828 events. 45/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3518 event pairs, 0 based on Foata normal form. 1/757 useless extension candidates. Maximal degree in co-relation 987. Up to 29 conditions per place. [2021-06-10 11:39:38,857 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/706 dead transitions. [2021-06-10 11:39:38,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 706 transitions, 1698 flow [2021-06-10 11:39:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:38,858 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:38,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:38,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:38,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:38,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:38,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,860 INFO L185 Difference]: Start difference. First operand has 770 places, 708 transitions, 1696 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:38,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 772 places, 706 transitions, 1698 flow [2021-06-10 11:39:38,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 706 transitions, 1690 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:38,867 INFO L241 Difference]: Finished difference. Result has 770 places, 706 transitions, 1683 flow [2021-06-10 11:39:38,867 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1683, PETRI_PLACES=770, PETRI_TRANSITIONS=706} [2021-06-10 11:39:38,867 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 21 predicate places. [2021-06-10 11:39:38,867 INFO L480 AbstractCegarLoop]: Abstraction has has 770 places, 706 transitions, 1683 flow [2021-06-10 11:39:38,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:38,867 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:38,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2021-06-10 11:39:38,868 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash 77207653, now seen corresponding path program 1 times [2021-06-10 11:39:38,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:38,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121906898] [2021-06-10 11:39:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:38,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:38,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:38,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:39:38,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121906898] [2021-06-10 11:39:38,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:38,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:38,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035923906] [2021-06-10 11:39:38,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:38,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:38,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:38,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 706 transitions, 1683 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:38,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:38,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:38,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:39,115 INFO L129 PetriNetUnfolder]: 45/826 cut-off events. [2021-06-10 11:39:39,115 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:39,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 826 events. 45/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3501 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 991. Up to 29 conditions per place. [2021-06-10 11:39:39,155 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/704 dead transitions. [2021-06-10 11:39:39,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 770 places, 704 transitions, 1696 flow [2021-06-10 11:39:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:39,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:39,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:39,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:39,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:39,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:39,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,158 INFO L185 Difference]: Start difference. First operand has 770 places, 706 transitions, 1683 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:39,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 770 places, 704 transitions, 1696 flow [2021-06-10 11:39:39,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 704 transitions, 1695 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:39,165 INFO L241 Difference]: Finished difference. Result has 769 places, 704 transitions, 1679 flow [2021-06-10 11:39:39,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1679, PETRI_PLACES=769, PETRI_TRANSITIONS=704} [2021-06-10 11:39:39,165 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 20 predicate places. [2021-06-10 11:39:39,165 INFO L480 AbstractCegarLoop]: Abstraction has has 769 places, 704 transitions, 1679 flow [2021-06-10 11:39:39,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,165 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:39,165 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:39,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2021-06-10 11:39:39,165 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:39,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2136667230, now seen corresponding path program 1 times [2021-06-10 11:39:39,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:39,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014346115] [2021-06-10 11:39:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:39,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:39,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:39,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014346115] [2021-06-10 11:39:39,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:39,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:39,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174546711] [2021-06-10 11:39:39,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:39,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:39,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:39,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 704 transitions, 1679 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:39,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:39,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:39,413 INFO L129 PetriNetUnfolder]: 43/831 cut-off events. [2021-06-10 11:39:39,413 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:39,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 831 events. 43/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3554 event pairs, 0 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 994. Up to 29 conditions per place. [2021-06-10 11:39:39,454 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2021-06-10 11:39:39,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 705 transitions, 1695 flow [2021-06-10 11:39:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:39,455 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:39,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:39,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:39,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:39,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:39,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,457 INFO L185 Difference]: Start difference. First operand has 769 places, 704 transitions, 1679 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:39,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 771 places, 705 transitions, 1695 flow [2021-06-10 11:39:39,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 770 places, 705 transitions, 1694 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:39,463 INFO L241 Difference]: Finished difference. Result has 772 places, 705 transitions, 1692 flow [2021-06-10 11:39:39,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=768, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1692, PETRI_PLACES=772, PETRI_TRANSITIONS=705} [2021-06-10 11:39:39,464 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 23 predicate places. [2021-06-10 11:39:39,464 INFO L480 AbstractCegarLoop]: Abstraction has has 772 places, 705 transitions, 1692 flow [2021-06-10 11:39:39,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:39,464 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:39,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2021-06-10 11:39:39,464 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:39,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2136668253, now seen corresponding path program 1 times [2021-06-10 11:39:39,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:39,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487919145] [2021-06-10 11:39:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:39,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:39,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:39,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487919145] [2021-06-10 11:39:39,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:39,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:39,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429239348] [2021-06-10 11:39:39,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:39,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:39,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:39,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:39,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:39,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 705 transitions, 1692 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:39,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:39,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:39,720 INFO L129 PetriNetUnfolder]: 43/832 cut-off events. [2021-06-10 11:39:39,720 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:39,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 832 events. 43/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3563 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1002. Up to 29 conditions per place. [2021-06-10 11:39:39,761 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/706 dead transitions. [2021-06-10 11:39:39,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 706 transitions, 1718 flow [2021-06-10 11:39:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:39,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:39,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:39,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:39,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:39,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:39,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,765 INFO L185 Difference]: Start difference. First operand has 772 places, 705 transitions, 1692 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:39,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 706 transitions, 1718 flow [2021-06-10 11:39:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 706 transitions, 1716 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:39,771 INFO L241 Difference]: Finished difference. Result has 775 places, 706 transitions, 1708 flow [2021-06-10 11:39:39,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1708, PETRI_PLACES=775, PETRI_TRANSITIONS=706} [2021-06-10 11:39:39,771 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 26 predicate places. [2021-06-10 11:39:39,771 INFO L480 AbstractCegarLoop]: Abstraction has has 775 places, 706 transitions, 1708 flow [2021-06-10 11:39:39,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,772 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:39,772 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:39,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2021-06-10 11:39:39,772 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2135713918, now seen corresponding path program 1 times [2021-06-10 11:39:39,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:39,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553571869] [2021-06-10 11:39:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:39,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:39,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:39,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:39,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553571869] [2021-06-10 11:39:39,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:39,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:39,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654438650] [2021-06-10 11:39:39,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:39,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:39,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:39,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:39,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 706 transitions, 1708 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:39,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:39,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:39,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:40,035 INFO L129 PetriNetUnfolder]: 42/829 cut-off events. [2021-06-10 11:39:40,036 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:39:40,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 829 events. 42/829 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3545 event pairs, 0 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 1001. Up to 29 conditions per place. [2021-06-10 11:39:40,078 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 9 selfloop transitions, 1 changer transitions 0/704 dead transitions. [2021-06-10 11:39:40,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 704 transitions, 1716 flow [2021-06-10 11:39:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2021-06-10 11:39:40,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192546583850931 [2021-06-10 11:39:40,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2021-06-10 11:39:40,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2021-06-10 11:39:40,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:40,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2021-06-10 11:39:40,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,082 INFO L185 Difference]: Start difference. First operand has 775 places, 706 transitions, 1708 flow. Second operand 3 states and 2220 transitions. [2021-06-10 11:39:40,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 704 transitions, 1716 flow [2021-06-10 11:39:40,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 704 transitions, 1715 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:40,128 INFO L241 Difference]: Finished difference. Result has 776 places, 704 transitions, 1697 flow [2021-06-10 11:39:40,128 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1697, PETRI_PLACES=776, PETRI_TRANSITIONS=704} [2021-06-10 11:39:40,128 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 27 predicate places. [2021-06-10 11:39:40,128 INFO L480 AbstractCegarLoop]: Abstraction has has 776 places, 704 transitions, 1697 flow [2021-06-10 11:39:40,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,128 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:40,128 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:40,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2021-06-10 11:39:40,129 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2135714941, now seen corresponding path program 1 times [2021-06-10 11:39:40,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:40,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521766116] [2021-06-10 11:39:40,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:40,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:40,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:39:40,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521766116] [2021-06-10 11:39:40,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:40,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:40,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238684081] [2021-06-10 11:39:40,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:40,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:40,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:40,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:40,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:40,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 704 transitions, 1697 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:40,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:40,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:40,378 INFO L129 PetriNetUnfolder]: 42/826 cut-off events. [2021-06-10 11:39:40,378 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:40,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 826 events. 42/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3520 event pairs, 0 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 995. Up to 29 conditions per place. [2021-06-10 11:39:40,419 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/701 dead transitions. [2021-06-10 11:39:40,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 701 transitions, 1698 flow [2021-06-10 11:39:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:40,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:40,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:40,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:40,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:40,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:40,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,423 INFO L185 Difference]: Start difference. First operand has 776 places, 704 transitions, 1697 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:40,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 701 transitions, 1698 flow [2021-06-10 11:39:40,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 701 transitions, 1693 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:40,429 INFO L241 Difference]: Finished difference. Result has 773 places, 701 transitions, 1683 flow [2021-06-10 11:39:40,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1683, PETRI_PLACES=773, PETRI_TRANSITIONS=701} [2021-06-10 11:39:40,429 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 24 predicate places. [2021-06-10 11:39:40,430 INFO L480 AbstractCegarLoop]: Abstraction has has 773 places, 701 transitions, 1683 flow [2021-06-10 11:39:40,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:40,430 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:40,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2021-06-10 11:39:40,430 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -374698814, now seen corresponding path program 1 times [2021-06-10 11:39:40,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:40,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021010201] [2021-06-10 11:39:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:40,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:40,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:40,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021010201] [2021-06-10 11:39:40,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:40,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:40,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984425088] [2021-06-10 11:39:40,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:40,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:40,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:40,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 701 transitions, 1683 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:40,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:40,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:40,689 INFO L129 PetriNetUnfolder]: 41/833 cut-off events. [2021-06-10 11:39:40,689 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:40,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 833 events. 41/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3581 event pairs, 0 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 1005. Up to 29 conditions per place. [2021-06-10 11:39:40,731 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2021-06-10 11:39:40,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 702 transitions, 1699 flow [2021-06-10 11:39:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:40,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:40,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:40,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:40,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:40,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:40,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,734 INFO L185 Difference]: Start difference. First operand has 773 places, 701 transitions, 1683 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:40,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 702 transitions, 1699 flow [2021-06-10 11:39:40,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 774 places, 702 transitions, 1698 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:40,741 INFO L241 Difference]: Finished difference. Result has 775 places, 701 transitions, 1687 flow [2021-06-10 11:39:40,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=772, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1687, PETRI_PLACES=775, PETRI_TRANSITIONS=701} [2021-06-10 11:39:40,741 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 26 predicate places. [2021-06-10 11:39:40,741 INFO L480 AbstractCegarLoop]: Abstraction has has 775 places, 701 transitions, 1687 flow [2021-06-10 11:39:40,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:40,741 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:40,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2021-06-10 11:39:40,741 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -374697791, now seen corresponding path program 1 times [2021-06-10 11:39:40,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:40,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937876291] [2021-06-10 11:39:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:40,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:40,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:40,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:40,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937876291] [2021-06-10 11:39:40,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:40,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:40,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886926979] [2021-06-10 11:39:40,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:40,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:40,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:40,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 701 transitions, 1687 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:40,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:40,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:40,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:41,002 INFO L129 PetriNetUnfolder]: 39/835 cut-off events. [2021-06-10 11:39:41,002 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:41,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 835 events. 39/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3609 event pairs, 0 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1014. Up to 29 conditions per place. [2021-06-10 11:39:41,043 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/702 dead transitions. [2021-06-10 11:39:41,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 702 transitions, 1713 flow [2021-06-10 11:39:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:41,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:41,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:41,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:41,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:41,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:41,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,047 INFO L185 Difference]: Start difference. First operand has 775 places, 701 transitions, 1687 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:41,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 702 transitions, 1713 flow [2021-06-10 11:39:41,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 702 transitions, 1712 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:41,054 INFO L241 Difference]: Finished difference. Result has 778 places, 702 transitions, 1704 flow [2021-06-10 11:39:41,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1704, PETRI_PLACES=778, PETRI_TRANSITIONS=702} [2021-06-10 11:39:41,054 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 29 predicate places. [2021-06-10 11:39:41,054 INFO L480 AbstractCegarLoop]: Abstraction has has 778 places, 702 transitions, 1704 flow [2021-06-10 11:39:41,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:41,054 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:41,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2021-06-10 11:39:41,054 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash -375651103, now seen corresponding path program 1 times [2021-06-10 11:39:41,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:41,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760906382] [2021-06-10 11:39:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:41,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:41,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:41,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760906382] [2021-06-10 11:39:41,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:41,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:41,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810184212] [2021-06-10 11:39:41,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:41,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:41,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:41,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 702 transitions, 1704 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:41,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:41,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:41,308 INFO L129 PetriNetUnfolder]: 39/828 cut-off events. [2021-06-10 11:39:41,308 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:41,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 828 events. 39/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3553 event pairs, 0 based on Foata normal form. 1/763 useless extension candidates. Maximal degree in co-relation 1000. Up to 29 conditions per place. [2021-06-10 11:39:41,352 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/700 dead transitions. [2021-06-10 11:39:41,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 700 transitions, 1706 flow [2021-06-10 11:39:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:41,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:41,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:41,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:41,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:41,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:41,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,356 INFO L185 Difference]: Start difference. First operand has 778 places, 702 transitions, 1704 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:41,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 700 transitions, 1706 flow [2021-06-10 11:39:41,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 700 transitions, 1698 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:41,363 INFO L241 Difference]: Finished difference. Result has 778 places, 700 transitions, 1691 flow [2021-06-10 11:39:41,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=778, PETRI_TRANSITIONS=700} [2021-06-10 11:39:41,363 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 29 predicate places. [2021-06-10 11:39:41,363 INFO L480 AbstractCegarLoop]: Abstraction has has 778 places, 700 transitions, 1691 flow [2021-06-10 11:39:41,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:41,363 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:41,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2021-06-10 11:39:41,364 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:41,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -375652126, now seen corresponding path program 1 times [2021-06-10 11:39:41,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:41,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026168156] [2021-06-10 11:39:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:41,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:41,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:39:41,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026168156] [2021-06-10 11:39:41,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:41,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:41,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433224184] [2021-06-10 11:39:41,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:41,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:41,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:41,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 700 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:41,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:41,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:41,634 INFO L129 PetriNetUnfolder]: 39/826 cut-off events. [2021-06-10 11:39:41,634 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:41,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 826 events. 39/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3537 event pairs, 0 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1004. Up to 29 conditions per place. [2021-06-10 11:39:41,675 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/698 dead transitions. [2021-06-10 11:39:41,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 698 transitions, 1704 flow [2021-06-10 11:39:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:41,677 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:41,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:41,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:41,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:41,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:41,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,679 INFO L185 Difference]: Start difference. First operand has 778 places, 700 transitions, 1691 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:41,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 698 transitions, 1704 flow [2021-06-10 11:39:41,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 698 transitions, 1703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:41,686 INFO L241 Difference]: Finished difference. Result has 777 places, 698 transitions, 1687 flow [2021-06-10 11:39:41,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1687, PETRI_PLACES=777, PETRI_TRANSITIONS=698} [2021-06-10 11:39:41,686 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 28 predicate places. [2021-06-10 11:39:41,686 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 698 transitions, 1687 flow [2021-06-10 11:39:41,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:41,686 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:41,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2021-06-10 11:39:41,687 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -560819806, now seen corresponding path program 1 times [2021-06-10 11:39:41,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:41,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812314450] [2021-06-10 11:39:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:41,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:41,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:41,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:41,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812314450] [2021-06-10 11:39:41,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:41,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:41,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605654694] [2021-06-10 11:39:41,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:41,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:41,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:41,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:41,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:41,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 698 transitions, 1687 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:41,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:41,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:41,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:41,966 INFO L129 PetriNetUnfolder]: 38/834 cut-off events. [2021-06-10 11:39:41,966 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:42,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 834 events. 38/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3608 event pairs, 0 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 1016. Up to 29 conditions per place. [2021-06-10 11:39:42,008 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/700 dead transitions. [2021-06-10 11:39:42,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 700 transitions, 1717 flow [2021-06-10 11:39:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:42,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:42,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:42,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:42,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:42,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,011 INFO L185 Difference]: Start difference. First operand has 777 places, 698 transitions, 1687 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 700 transitions, 1717 flow [2021-06-10 11:39:42,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 700 transitions, 1716 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:42,018 INFO L241 Difference]: Finished difference. Result has 780 places, 700 transitions, 1710 flow [2021-06-10 11:39:42,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1710, PETRI_PLACES=780, PETRI_TRANSITIONS=700} [2021-06-10 11:39:42,018 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 31 predicate places. [2021-06-10 11:39:42,018 INFO L480 AbstractCegarLoop]: Abstraction has has 780 places, 700 transitions, 1710 flow [2021-06-10 11:39:42,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,018 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:42,018 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:42,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2021-06-10 11:39:42,019 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -560818783, now seen corresponding path program 1 times [2021-06-10 11:39:42,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:42,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236017088] [2021-06-10 11:39:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:42,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:42,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:42,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236017088] [2021-06-10 11:39:42,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:42,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:42,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695452893] [2021-06-10 11:39:42,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:42,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:42,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:42,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 700 transitions, 1710 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:42,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:42,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:42,275 INFO L129 PetriNetUnfolder]: 37/832 cut-off events. [2021-06-10 11:39:42,275 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:42,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 832 events. 37/832 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3598 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1013. Up to 29 conditions per place. [2021-06-10 11:39:42,316 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/700 dead transitions. [2021-06-10 11:39:42,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 782 places, 700 transitions, 1722 flow [2021-06-10 11:39:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:42,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:42,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:42,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:42,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:42,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:42,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,320 INFO L185 Difference]: Start difference. First operand has 780 places, 700 transitions, 1710 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:42,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 782 places, 700 transitions, 1722 flow [2021-06-10 11:39:42,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 700 transitions, 1717 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:42,326 INFO L241 Difference]: Finished difference. Result has 783 places, 700 transitions, 1715 flow [2021-06-10 11:39:42,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1715, PETRI_PLACES=783, PETRI_TRANSITIONS=700} [2021-06-10 11:39:42,326 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 34 predicate places. [2021-06-10 11:39:42,326 INFO L480 AbstractCegarLoop]: Abstraction has has 783 places, 700 transitions, 1715 flow [2021-06-10 11:39:42,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:42,327 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:42,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2021-06-10 11:39:42,327 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash -559866494, now seen corresponding path program 1 times [2021-06-10 11:39:42,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:42,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098987869] [2021-06-10 11:39:42,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:42,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:42,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:42,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098987869] [2021-06-10 11:39:42,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:42,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:42,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923412020] [2021-06-10 11:39:42,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:42,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:42,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:42,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 700 transitions, 1715 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:42,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:42,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:42,590 INFO L129 PetriNetUnfolder]: 36/828 cut-off events. [2021-06-10 11:39:42,590 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:42,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 828 events. 36/828 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3575 event pairs, 0 based on Foata normal form. 1/766 useless extension candidates. Maximal degree in co-relation 1010. Up to 29 conditions per place. [2021-06-10 11:39:42,630 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/697 dead transitions. [2021-06-10 11:39:42,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 697 transitions, 1712 flow [2021-06-10 11:39:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:42,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:42,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:42,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:42,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:42,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:42,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,634 INFO L185 Difference]: Start difference. First operand has 783 places, 700 transitions, 1715 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:42,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 785 places, 697 transitions, 1712 flow [2021-06-10 11:39:42,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 782 places, 697 transitions, 1705 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:42,640 INFO L241 Difference]: Finished difference. Result has 782 places, 697 transitions, 1695 flow [2021-06-10 11:39:42,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=782, PETRI_TRANSITIONS=697} [2021-06-10 11:39:42,641 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 33 predicate places. [2021-06-10 11:39:42,641 INFO L480 AbstractCegarLoop]: Abstraction has has 782 places, 697 transitions, 1695 flow [2021-06-10 11:39:42,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:42,641 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:42,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2021-06-10 11:39:42,641 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -559865471, now seen corresponding path program 1 times [2021-06-10 11:39:42,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:42,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58099007] [2021-06-10 11:39:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:42,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:42,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:39:42,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58099007] [2021-06-10 11:39:42,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:42,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:42,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124194450] [2021-06-10 11:39:42,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:42,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:42,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:42,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 782 places, 697 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:42,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:42,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:42,904 INFO L129 PetriNetUnfolder]: 36/826 cut-off events. [2021-06-10 11:39:42,904 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:42,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 826 events. 36/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3560 event pairs, 0 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 1011. Up to 29 conditions per place. [2021-06-10 11:39:42,946 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/695 dead transitions. [2021-06-10 11:39:42,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 782 places, 695 transitions, 1708 flow [2021-06-10 11:39:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:42,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:42,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:42,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:42,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:42,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:42,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,950 INFO L185 Difference]: Start difference. First operand has 782 places, 697 transitions, 1695 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:42,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 782 places, 695 transitions, 1708 flow [2021-06-10 11:39:42,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 695 transitions, 1707 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:42,957 INFO L241 Difference]: Finished difference. Result has 781 places, 695 transitions, 1691 flow [2021-06-10 11:39:42,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=781, PETRI_TRANSITIONS=695} [2021-06-10 11:39:42,957 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 32 predicate places. [2021-06-10 11:39:42,957 INFO L480 AbstractCegarLoop]: Abstraction has has 781 places, 695 transitions, 1691 flow [2021-06-10 11:39:42,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:42,958 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:42,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2021-06-10 11:39:42,958 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1272527006, now seen corresponding path program 1 times [2021-06-10 11:39:42,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:42,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663291484] [2021-06-10 11:39:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:42,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:42,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:42,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:42,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663291484] [2021-06-10 11:39:42,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:42,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:42,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134467090] [2021-06-10 11:39:42,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:42,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:42,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:42,978 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:42,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 695 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:42,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:42,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:42,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:43,223 INFO L129 PetriNetUnfolder]: 34/831 cut-off events. [2021-06-10 11:39:43,223 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:43,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 831 events. 34/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3605 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1014. Up to 29 conditions per place. [2021-06-10 11:39:43,265 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/696 dead transitions. [2021-06-10 11:39:43,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 696 transitions, 1707 flow [2021-06-10 11:39:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:43,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:43,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:43,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:43,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:43,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:43,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,269 INFO L185 Difference]: Start difference. First operand has 781 places, 695 transitions, 1691 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:43,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 696 transitions, 1707 flow [2021-06-10 11:39:43,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 782 places, 696 transitions, 1706 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:43,275 INFO L241 Difference]: Finished difference. Result has 784 places, 696 transitions, 1704 flow [2021-06-10 11:39:43,276 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1704, PETRI_PLACES=784, PETRI_TRANSITIONS=696} [2021-06-10 11:39:43,276 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 35 predicate places. [2021-06-10 11:39:43,276 INFO L480 AbstractCegarLoop]: Abstraction has has 784 places, 696 transitions, 1704 flow [2021-06-10 11:39:43,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:43,276 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:43,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2021-06-10 11:39:43,276 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1272528029, now seen corresponding path program 1 times [2021-06-10 11:39:43,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:43,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051633241] [2021-06-10 11:39:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:43,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:43,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:43,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051633241] [2021-06-10 11:39:43,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:43,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:43,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482871171] [2021-06-10 11:39:43,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:43,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:43,296 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:43,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 784 places, 696 transitions, 1704 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:43,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:43,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:43,551 INFO L129 PetriNetUnfolder]: 34/832 cut-off events. [2021-06-10 11:39:43,551 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:43,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 832 events. 34/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3612 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1022. Up to 29 conditions per place. [2021-06-10 11:39:43,592 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2021-06-10 11:39:43,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 697 transitions, 1730 flow [2021-06-10 11:39:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:43,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:43,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:43,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:43,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:43,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:43,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,595 INFO L185 Difference]: Start difference. First operand has 784 places, 696 transitions, 1704 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:43,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 697 transitions, 1730 flow [2021-06-10 11:39:43,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 785 places, 697 transitions, 1728 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:43,602 INFO L241 Difference]: Finished difference. Result has 787 places, 697 transitions, 1720 flow [2021-06-10 11:39:43,602 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=783, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1720, PETRI_PLACES=787, PETRI_TRANSITIONS=697} [2021-06-10 11:39:43,602 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 38 predicate places. [2021-06-10 11:39:43,602 INFO L480 AbstractCegarLoop]: Abstraction has has 787 places, 697 transitions, 1720 flow [2021-06-10 11:39:43,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:43,602 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:43,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2021-06-10 11:39:43,602 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1271573694, now seen corresponding path program 1 times [2021-06-10 11:39:43,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:43,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157717566] [2021-06-10 11:39:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:43,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:43,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:43,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157717566] [2021-06-10 11:39:43,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:43,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:43,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781353280] [2021-06-10 11:39:43,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:43,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:43,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:43,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 697 transitions, 1720 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:43,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:43,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:43,865 INFO L129 PetriNetUnfolder]: 33/829 cut-off events. [2021-06-10 11:39:43,865 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:39:43,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 829 events. 33/829 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3597 event pairs, 0 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 1021. Up to 29 conditions per place. [2021-06-10 11:39:43,905 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 9 selfloop transitions, 1 changer transitions 0/695 dead transitions. [2021-06-10 11:39:43,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 695 transitions, 1728 flow [2021-06-10 11:39:43,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2220 transitions. [2021-06-10 11:39:43,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192546583850931 [2021-06-10 11:39:43,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2220 transitions. [2021-06-10 11:39:43,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2220 transitions. [2021-06-10 11:39:43,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:43,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2220 transitions. [2021-06-10 11:39:43,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,909 INFO L185 Difference]: Start difference. First operand has 787 places, 697 transitions, 1720 flow. Second operand 3 states and 2220 transitions. [2021-06-10 11:39:43,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 789 places, 695 transitions, 1728 flow [2021-06-10 11:39:43,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 695 transitions, 1727 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:43,915 INFO L241 Difference]: Finished difference. Result has 788 places, 695 transitions, 1709 flow [2021-06-10 11:39:43,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1709, PETRI_PLACES=788, PETRI_TRANSITIONS=695} [2021-06-10 11:39:43,915 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 39 predicate places. [2021-06-10 11:39:43,916 INFO L480 AbstractCegarLoop]: Abstraction has has 788 places, 695 transitions, 1709 flow [2021-06-10 11:39:43,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:43,916 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:43,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2021-06-10 11:39:43,916 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1271574717, now seen corresponding path program 1 times [2021-06-10 11:39:43,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:43,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341105965] [2021-06-10 11:39:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:43,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:43,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:43,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:39:43,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341105965] [2021-06-10 11:39:43,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:43,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:43,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331285939] [2021-06-10 11:39:43,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:43,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:43,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:43,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 695 transitions, 1709 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:43,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:43,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:43,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:44,171 INFO L129 PetriNetUnfolder]: 33/826 cut-off events. [2021-06-10 11:39:44,171 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:44,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 826 events. 33/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3571 event pairs, 0 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1015. Up to 29 conditions per place. [2021-06-10 11:39:44,211 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/692 dead transitions. [2021-06-10 11:39:44,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 692 transitions, 1710 flow [2021-06-10 11:39:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:44,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:44,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:44,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:44,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:44,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:44,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,215 INFO L185 Difference]: Start difference. First operand has 788 places, 695 transitions, 1709 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:44,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 692 transitions, 1710 flow [2021-06-10 11:39:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 785 places, 692 transitions, 1705 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:44,221 INFO L241 Difference]: Finished difference. Result has 785 places, 692 transitions, 1695 flow [2021-06-10 11:39:44,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=783, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=785, PETRI_TRANSITIONS=692} [2021-06-10 11:39:44,221 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 36 predicate places. [2021-06-10 11:39:44,222 INFO L480 AbstractCegarLoop]: Abstraction has has 785 places, 692 transitions, 1695 flow [2021-06-10 11:39:44,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:44,222 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:44,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2021-06-10 11:39:44,222 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 212892581, now seen corresponding path program 1 times [2021-06-10 11:39:44,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:44,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836396391] [2021-06-10 11:39:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:44,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:44,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:44,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836396391] [2021-06-10 11:39:44,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:44,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:44,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727400509] [2021-06-10 11:39:44,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:44,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:44,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:44,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 692 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:44,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:44,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:44,494 INFO L129 PetriNetUnfolder]: 32/834 cut-off events. [2021-06-10 11:39:44,495 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:44,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 834 events. 32/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3644 event pairs, 0 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1032. Up to 29 conditions per place. [2021-06-10 11:39:44,538 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/694 dead transitions. [2021-06-10 11:39:44,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 694 transitions, 1725 flow [2021-06-10 11:39:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:44,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:44,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:44,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:44,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:44,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:44,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,544 INFO L185 Difference]: Start difference. First operand has 785 places, 692 transitions, 1695 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 694 transitions, 1725 flow [2021-06-10 11:39:44,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 694 transitions, 1724 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:44,551 INFO L241 Difference]: Finished difference. Result has 788 places, 694 transitions, 1718 flow [2021-06-10 11:39:44,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=784, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1718, PETRI_PLACES=788, PETRI_TRANSITIONS=694} [2021-06-10 11:39:44,551 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 39 predicate places. [2021-06-10 11:39:44,552 INFO L480 AbstractCegarLoop]: Abstraction has has 788 places, 694 transitions, 1718 flow [2021-06-10 11:39:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:44,552 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:44,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2021-06-10 11:39:44,552 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:44,552 INFO L82 PathProgramCache]: Analyzing trace with hash 212893604, now seen corresponding path program 1 times [2021-06-10 11:39:44,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:44,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427810236] [2021-06-10 11:39:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:44,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:44,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:44,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427810236] [2021-06-10 11:39:44,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:44,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:44,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879797864] [2021-06-10 11:39:44,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:44,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:44,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:44,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 694 transitions, 1718 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:44,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:44,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:44,824 INFO L129 PetriNetUnfolder]: 31/832 cut-off events. [2021-06-10 11:39:44,825 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:44,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 832 events. 31/832 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3633 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1027. Up to 29 conditions per place. [2021-06-10 11:39:44,866 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/694 dead transitions. [2021-06-10 11:39:44,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 790 places, 694 transitions, 1730 flow [2021-06-10 11:39:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:44,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:44,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:44,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:44,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:44,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:44,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,870 INFO L185 Difference]: Start difference. First operand has 788 places, 694 transitions, 1718 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:44,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 790 places, 694 transitions, 1730 flow [2021-06-10 11:39:44,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 789 places, 694 transitions, 1725 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:44,877 INFO L241 Difference]: Finished difference. Result has 791 places, 694 transitions, 1723 flow [2021-06-10 11:39:44,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1723, PETRI_PLACES=791, PETRI_TRANSITIONS=694} [2021-06-10 11:39:44,877 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 42 predicate places. [2021-06-10 11:39:44,877 INFO L480 AbstractCegarLoop]: Abstraction has has 791 places, 694 transitions, 1723 flow [2021-06-10 11:39:44,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:44,877 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:44,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2021-06-10 11:39:44,877 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash 213845893, now seen corresponding path program 1 times [2021-06-10 11:39:44,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:44,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437344624] [2021-06-10 11:39:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:44,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:44,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:44,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:44,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437344624] [2021-06-10 11:39:44,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:44,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:44,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399932192] [2021-06-10 11:39:44,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:44,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:44,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:44,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 694 transitions, 1723 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:44,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:44,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:44,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:45,159 INFO L129 PetriNetUnfolder]: 30/828 cut-off events. [2021-06-10 11:39:45,159 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:45,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 828 events. 30/828 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3605 event pairs, 0 based on Foata normal form. 1/772 useless extension candidates. Maximal degree in co-relation 1024. Up to 29 conditions per place. [2021-06-10 11:39:45,199 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/691 dead transitions. [2021-06-10 11:39:45,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 691 transitions, 1720 flow [2021-06-10 11:39:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:45,200 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:45,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:45,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:45,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:45,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:45,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,203 INFO L185 Difference]: Start difference. First operand has 791 places, 694 transitions, 1723 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:45,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 793 places, 691 transitions, 1720 flow [2021-06-10 11:39:45,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 790 places, 691 transitions, 1713 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:45,209 INFO L241 Difference]: Finished difference. Result has 790 places, 691 transitions, 1703 flow [2021-06-10 11:39:45,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=788, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1703, PETRI_PLACES=790, PETRI_TRANSITIONS=691} [2021-06-10 11:39:45,209 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 41 predicate places. [2021-06-10 11:39:45,209 INFO L480 AbstractCegarLoop]: Abstraction has has 790 places, 691 transitions, 1703 flow [2021-06-10 11:39:45,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:45,210 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:45,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2021-06-10 11:39:45,210 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash 213846916, now seen corresponding path program 1 times [2021-06-10 11:39:45,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:45,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650098427] [2021-06-10 11:39:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:45,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:45,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:39:45,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650098427] [2021-06-10 11:39:45,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:45,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:45,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032691492] [2021-06-10 11:39:45,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:45,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:45,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:45,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:45,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 790 places, 691 transitions, 1703 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:45,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:45,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:45,475 INFO L129 PetriNetUnfolder]: 30/826 cut-off events. [2021-06-10 11:39:45,475 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:45,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 826 events. 30/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3589 event pairs, 0 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 1025. Up to 29 conditions per place. [2021-06-10 11:39:45,515 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/689 dead transitions. [2021-06-10 11:39:45,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 790 places, 689 transitions, 1716 flow [2021-06-10 11:39:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:45,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:45,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:45,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:45,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:45,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:45,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,520 INFO L185 Difference]: Start difference. First operand has 790 places, 691 transitions, 1703 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:45,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 790 places, 689 transitions, 1716 flow [2021-06-10 11:39:45,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 789 places, 689 transitions, 1715 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:45,526 INFO L241 Difference]: Finished difference. Result has 789 places, 689 transitions, 1699 flow [2021-06-10 11:39:45,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1699, PETRI_PLACES=789, PETRI_TRANSITIONS=689} [2021-06-10 11:39:45,527 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 40 predicate places. [2021-06-10 11:39:45,527 INFO L480 AbstractCegarLoop]: Abstraction has has 789 places, 689 transitions, 1699 flow [2021-06-10 11:39:45,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:45,527 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:45,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2021-06-10 11:39:45,527 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1204349465, now seen corresponding path program 1 times [2021-06-10 11:39:45,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:45,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571251116] [2021-06-10 11:39:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:45,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:45,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:45,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571251116] [2021-06-10 11:39:45,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:45,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:45,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810358287] [2021-06-10 11:39:45,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:45,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:45,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:45,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 689 transitions, 1699 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:45,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:45,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:45,793 INFO L129 PetriNetUnfolder]: 28/831 cut-off events. [2021-06-10 11:39:45,793 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:45,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 831 events. 28/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3638 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1028. Up to 29 conditions per place. [2021-06-10 11:39:45,833 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2021-06-10 11:39:45,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 690 transitions, 1715 flow [2021-06-10 11:39:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:45,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:45,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:45,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:45,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:45,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:45,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,836 INFO L185 Difference]: Start difference. First operand has 789 places, 689 transitions, 1699 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:45,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 791 places, 690 transitions, 1715 flow [2021-06-10 11:39:45,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 790 places, 690 transitions, 1714 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:45,843 INFO L241 Difference]: Finished difference. Result has 792 places, 690 transitions, 1712 flow [2021-06-10 11:39:45,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=788, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1712, PETRI_PLACES=792, PETRI_TRANSITIONS=690} [2021-06-10 11:39:45,843 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 43 predicate places. [2021-06-10 11:39:45,843 INFO L480 AbstractCegarLoop]: Abstraction has has 792 places, 690 transitions, 1712 flow [2021-06-10 11:39:45,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:45,844 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:45,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2021-06-10 11:39:45,844 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1204350488, now seen corresponding path program 1 times [2021-06-10 11:39:45,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:45,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343406385] [2021-06-10 11:39:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:45,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:45,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:45,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:45,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343406385] [2021-06-10 11:39:45,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:45,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:45,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308878057] [2021-06-10 11:39:45,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:45,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:45,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:45,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:45,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 690 transitions, 1712 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:45,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:45,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:45,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:46,126 INFO L129 PetriNetUnfolder]: 28/832 cut-off events. [2021-06-10 11:39:46,126 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:46,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 832 events. 28/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3648 event pairs, 0 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1036. Up to 29 conditions per place. [2021-06-10 11:39:46,167 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/691 dead transitions. [2021-06-10 11:39:46,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 691 transitions, 1738 flow [2021-06-10 11:39:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:46,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:46,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:46,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:46,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:46,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:46,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,171 INFO L185 Difference]: Start difference. First operand has 792 places, 690 transitions, 1712 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:46,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 691 transitions, 1738 flow [2021-06-10 11:39:46,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 691 transitions, 1736 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:46,178 INFO L241 Difference]: Finished difference. Result has 795 places, 691 transitions, 1728 flow [2021-06-10 11:39:46,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=791, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=795, PETRI_TRANSITIONS=691} [2021-06-10 11:39:46,178 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 46 predicate places. [2021-06-10 11:39:46,178 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 691 transitions, 1728 flow [2021-06-10 11:39:46,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:46,178 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:46,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2021-06-10 11:39:46,178 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1203397176, now seen corresponding path program 1 times [2021-06-10 11:39:46,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:46,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322577083] [2021-06-10 11:39:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:46,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:46,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:46,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322577083] [2021-06-10 11:39:46,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:46,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:46,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008383758] [2021-06-10 11:39:46,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:46,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:46,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:46,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 691 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:46,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:46,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:46,452 INFO L129 PetriNetUnfolder]: 27/828 cut-off events. [2021-06-10 11:39:46,452 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:46,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 828 events. 27/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3622 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1029. Up to 29 conditions per place. [2021-06-10 11:39:46,494 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/688 dead transitions. [2021-06-10 11:39:46,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 688 transitions, 1725 flow [2021-06-10 11:39:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:46,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:46,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:46,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:46,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:46,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:46,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,497 INFO L185 Difference]: Start difference. First operand has 795 places, 691 transitions, 1728 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:46,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 688 transitions, 1725 flow [2021-06-10 11:39:46,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 688 transitions, 1717 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:46,505 INFO L241 Difference]: Finished difference. Result has 794 places, 688 transitions, 1707 flow [2021-06-10 11:39:46,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=794, PETRI_TRANSITIONS=688} [2021-06-10 11:39:46,505 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 45 predicate places. [2021-06-10 11:39:46,505 INFO L480 AbstractCegarLoop]: Abstraction has has 794 places, 688 transitions, 1707 flow [2021-06-10 11:39:46,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:46,505 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:46,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2021-06-10 11:39:46,505 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1203396153, now seen corresponding path program 1 times [2021-06-10 11:39:46,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:46,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958713445] [2021-06-10 11:39:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:46,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:46,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:39:46,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958713445] [2021-06-10 11:39:46,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:46,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:46,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326434179] [2021-06-10 11:39:46,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:46,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:46,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:46,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 688 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:46,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:46,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:46,783 INFO L129 PetriNetUnfolder]: 27/826 cut-off events. [2021-06-10 11:39:46,783 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:46,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 826 events. 27/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3606 event pairs, 0 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 1032. Up to 29 conditions per place. [2021-06-10 11:39:46,824 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/686 dead transitions. [2021-06-10 11:39:46,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 686 transitions, 1720 flow [2021-06-10 11:39:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:46,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:46,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:46,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:46,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:46,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:46,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,828 INFO L185 Difference]: Start difference. First operand has 794 places, 688 transitions, 1707 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:46,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 686 transitions, 1720 flow [2021-06-10 11:39:46,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 686 transitions, 1719 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:46,834 INFO L241 Difference]: Finished difference. Result has 793 places, 686 transitions, 1703 flow [2021-06-10 11:39:46,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=791, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1703, PETRI_PLACES=793, PETRI_TRANSITIONS=686} [2021-06-10 11:39:46,835 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 44 predicate places. [2021-06-10 11:39:46,835 INFO L480 AbstractCegarLoop]: Abstraction has has 793 places, 686 transitions, 1703 flow [2021-06-10 11:39:46,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:46,835 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:46,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2021-06-10 11:39:46,835 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1938734476, now seen corresponding path program 1 times [2021-06-10 11:39:46,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:46,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834045544] [2021-06-10 11:39:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:46,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:46,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:46,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:46,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834045544] [2021-06-10 11:39:46,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:46,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:46,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351618001] [2021-06-10 11:39:46,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:46,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:46,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:46,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 686 transitions, 1703 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:46,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:46,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:46,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:47,108 INFO L129 PetriNetUnfolder]: 26/833 cut-off events. [2021-06-10 11:39:47,108 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:47,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 833 events. 26/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3671 event pairs, 0 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1037. Up to 29 conditions per place. [2021-06-10 11:39:47,148 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/687 dead transitions. [2021-06-10 11:39:47,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 687 transitions, 1719 flow [2021-06-10 11:39:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:47,149 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:47,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:47,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:47,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:47,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:47,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,152 INFO L185 Difference]: Start difference. First operand has 793 places, 686 transitions, 1703 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 687 transitions, 1719 flow [2021-06-10 11:39:47,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 687 transitions, 1718 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:47,158 INFO L241 Difference]: Finished difference. Result has 795 places, 686 transitions, 1707 flow [2021-06-10 11:39:47,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=795, PETRI_TRANSITIONS=686} [2021-06-10 11:39:47,159 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 46 predicate places. [2021-06-10 11:39:47,159 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 686 transitions, 1707 flow [2021-06-10 11:39:47,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,159 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:47,159 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:47,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2021-06-10 11:39:47,159 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1938735499, now seen corresponding path program 1 times [2021-06-10 11:39:47,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:47,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469954286] [2021-06-10 11:39:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:47,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:47,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:47,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469954286] [2021-06-10 11:39:47,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:47,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:47,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384339980] [2021-06-10 11:39:47,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:47,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:47,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:47,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:47,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 686 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:47,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:47,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:47,438 INFO L129 PetriNetUnfolder]: 24/835 cut-off events. [2021-06-10 11:39:47,438 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:47,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 835 events. 24/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3700 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1048. Up to 29 conditions per place. [2021-06-10 11:39:47,478 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/687 dead transitions. [2021-06-10 11:39:47,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 687 transitions, 1733 flow [2021-06-10 11:39:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:47,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:47,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:47,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:47,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:47,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:47,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,481 INFO L185 Difference]: Start difference. First operand has 795 places, 686 transitions, 1707 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:47,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 687 transitions, 1733 flow [2021-06-10 11:39:47,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 687 transitions, 1732 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:47,488 INFO L241 Difference]: Finished difference. Result has 798 places, 687 transitions, 1724 flow [2021-06-10 11:39:47,488 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1724, PETRI_PLACES=798, PETRI_TRANSITIONS=687} [2021-06-10 11:39:47,488 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 49 predicate places. [2021-06-10 11:39:47,488 INFO L480 AbstractCegarLoop]: Abstraction has has 798 places, 687 transitions, 1724 flow [2021-06-10 11:39:47,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,489 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:47,489 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:47,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2021-06-10 11:39:47,489 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1937782187, now seen corresponding path program 1 times [2021-06-10 11:39:47,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:47,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963527884] [2021-06-10 11:39:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:47,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:47,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:47,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963527884] [2021-06-10 11:39:47,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:47,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:47,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137515129] [2021-06-10 11:39:47,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:47,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:47,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:47,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 687 transitions, 1724 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:47,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:47,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:47,773 INFO L129 PetriNetUnfolder]: 24/828 cut-off events. [2021-06-10 11:39:47,773 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:47,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 828 events. 24/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3644 event pairs, 0 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 1034. Up to 29 conditions per place. [2021-06-10 11:39:47,814 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/685 dead transitions. [2021-06-10 11:39:47,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 685 transitions, 1726 flow [2021-06-10 11:39:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:47,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:47,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:47,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:47,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:47,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:47,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,817 INFO L185 Difference]: Start difference. First operand has 798 places, 687 transitions, 1724 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:47,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 800 places, 685 transitions, 1726 flow [2021-06-10 11:39:47,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 685 transitions, 1718 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:47,824 INFO L241 Difference]: Finished difference. Result has 798 places, 685 transitions, 1711 flow [2021-06-10 11:39:47,824 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=795, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1711, PETRI_PLACES=798, PETRI_TRANSITIONS=685} [2021-06-10 11:39:47,825 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 49 predicate places. [2021-06-10 11:39:47,825 INFO L480 AbstractCegarLoop]: Abstraction has has 798 places, 685 transitions, 1711 flow [2021-06-10 11:39:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:47,825 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:47,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2021-06-10 11:39:47,825 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1937781164, now seen corresponding path program 1 times [2021-06-10 11:39:47,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:47,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664389430] [2021-06-10 11:39:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:47,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:47,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:47,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:39:47,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664389430] [2021-06-10 11:39:47,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:47,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:47,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967909267] [2021-06-10 11:39:47,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:47,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:47,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:47,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:47,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:47,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 685 transitions, 1711 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:47,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:47,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:47,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:48,102 INFO L129 PetriNetUnfolder]: 24/826 cut-off events. [2021-06-10 11:39:48,103 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:48,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 826 events. 24/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3626 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1038. Up to 29 conditions per place. [2021-06-10 11:39:48,143 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2021-06-10 11:39:48,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 683 transitions, 1724 flow [2021-06-10 11:39:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:48,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:48,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:48,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:48,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:48,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:48,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,147 INFO L185 Difference]: Start difference. First operand has 798 places, 685 transitions, 1711 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:48,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 683 transitions, 1724 flow [2021-06-10 11:39:48,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 683 transitions, 1723 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:48,153 INFO L241 Difference]: Finished difference. Result has 797 places, 683 transitions, 1707 flow [2021-06-10 11:39:48,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=795, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=797, PETRI_TRANSITIONS=683} [2021-06-10 11:39:48,154 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 48 predicate places. [2021-06-10 11:39:48,154 INFO L480 AbstractCegarLoop]: Abstraction has has 797 places, 683 transitions, 1707 flow [2021-06-10 11:39:48,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:48,154 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:48,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2021-06-10 11:39:48,154 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1721777327, now seen corresponding path program 1 times [2021-06-10 11:39:48,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:48,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695534279] [2021-06-10 11:39:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:48,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:48,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:48,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695534279] [2021-06-10 11:39:48,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:48,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:48,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042442496] [2021-06-10 11:39:48,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:48,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:48,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:48,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:48,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 683 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:48,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:48,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:48,442 INFO L129 PetriNetUnfolder]: 23/833 cut-off events. [2021-06-10 11:39:48,442 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:48,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 833 events. 23/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3687 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1043. Up to 29 conditions per place. [2021-06-10 11:39:48,482 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/684 dead transitions. [2021-06-10 11:39:48,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 684 transitions, 1723 flow [2021-06-10 11:39:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:48,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:48,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:48,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:48,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:48,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:48,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,486 INFO L185 Difference]: Start difference. First operand has 797 places, 683 transitions, 1707 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:48,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 684 transitions, 1723 flow [2021-06-10 11:39:48,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 684 transitions, 1722 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:48,492 INFO L241 Difference]: Finished difference. Result has 799 places, 683 transitions, 1711 flow [2021-06-10 11:39:48,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=796, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1711, PETRI_PLACES=799, PETRI_TRANSITIONS=683} [2021-06-10 11:39:48,493 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 50 predicate places. [2021-06-10 11:39:48,493 INFO L480 AbstractCegarLoop]: Abstraction has has 799 places, 683 transitions, 1711 flow [2021-06-10 11:39:48,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,493 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:48,493 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:48,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2021-06-10 11:39:48,493 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:48,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1721776304, now seen corresponding path program 1 times [2021-06-10 11:39:48,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:48,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090514049] [2021-06-10 11:39:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:48,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:48,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:48,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090514049] [2021-06-10 11:39:48,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:48,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:48,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370961717] [2021-06-10 11:39:48,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:48,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:48,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:48,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 799 places, 683 transitions, 1711 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:48,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:48,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:48,774 INFO L129 PetriNetUnfolder]: 21/835 cut-off events. [2021-06-10 11:39:48,774 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:48,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 835 events. 21/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3716 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1054. Up to 29 conditions per place. [2021-06-10 11:39:48,813 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2021-06-10 11:39:48,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 801 places, 684 transitions, 1737 flow [2021-06-10 11:39:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:48,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:48,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:48,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:48,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:48,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:48,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,816 INFO L185 Difference]: Start difference. First operand has 799 places, 683 transitions, 1711 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:48,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 801 places, 684 transitions, 1737 flow [2021-06-10 11:39:48,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 684 transitions, 1736 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:48,823 INFO L241 Difference]: Finished difference. Result has 802 places, 684 transitions, 1728 flow [2021-06-10 11:39:48,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=798, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=802, PETRI_TRANSITIONS=684} [2021-06-10 11:39:48,823 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 53 predicate places. [2021-06-10 11:39:48,823 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 684 transitions, 1728 flow [2021-06-10 11:39:48,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:48,824 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:48,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2021-06-10 11:39:48,824 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1722729616, now seen corresponding path program 1 times [2021-06-10 11:39:48,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:48,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600921487] [2021-06-10 11:39:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:48,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:48,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:48,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:48,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600921487] [2021-06-10 11:39:48,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:48,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:48,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97259267] [2021-06-10 11:39:48,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:48,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:48,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:48,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 684 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:48,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:48,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:48,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:49,120 INFO L129 PetriNetUnfolder]: 21/828 cut-off events. [2021-06-10 11:39:49,120 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:49,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 828 events. 21/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3659 event pairs, 0 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 1040. Up to 29 conditions per place. [2021-06-10 11:39:49,160 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/682 dead transitions. [2021-06-10 11:39:49,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 682 transitions, 1730 flow [2021-06-10 11:39:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:49,161 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:49,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:49,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:49,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:49,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,163 INFO L185 Difference]: Start difference. First operand has 802 places, 684 transitions, 1728 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 682 transitions, 1730 flow [2021-06-10 11:39:49,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 682 transitions, 1722 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:49,170 INFO L241 Difference]: Finished difference. Result has 802 places, 682 transitions, 1715 flow [2021-06-10 11:39:49,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1715, PETRI_PLACES=802, PETRI_TRANSITIONS=682} [2021-06-10 11:39:49,170 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 53 predicate places. [2021-06-10 11:39:49,170 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 682 transitions, 1715 flow [2021-06-10 11:39:49,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,171 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:49,171 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:49,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2021-06-10 11:39:49,171 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:49,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1722730639, now seen corresponding path program 1 times [2021-06-10 11:39:49,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:49,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804159711] [2021-06-10 11:39:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:49,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:49,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:39:49,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804159711] [2021-06-10 11:39:49,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:49,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:49,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746815958] [2021-06-10 11:39:49,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:49,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:49,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:49,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 682 transitions, 1715 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:49,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:49,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:49,460 INFO L129 PetriNetUnfolder]: 21/826 cut-off events. [2021-06-10 11:39:49,460 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:49,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 826 events. 21/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3643 event pairs, 0 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1044. Up to 29 conditions per place. [2021-06-10 11:39:49,499 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/680 dead transitions. [2021-06-10 11:39:49,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 680 transitions, 1728 flow [2021-06-10 11:39:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:49,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:49,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:49,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:49,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:49,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:49,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,503 INFO L185 Difference]: Start difference. First operand has 802 places, 682 transitions, 1715 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:49,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 680 transitions, 1728 flow [2021-06-10 11:39:49,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 680 transitions, 1727 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:49,510 INFO L241 Difference]: Finished difference. Result has 801 places, 680 transitions, 1711 flow [2021-06-10 11:39:49,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1711, PETRI_PLACES=801, PETRI_TRANSITIONS=680} [2021-06-10 11:39:49,510 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 52 predicate places. [2021-06-10 11:39:49,510 INFO L480 AbstractCegarLoop]: Abstraction has has 801 places, 680 transitions, 1711 flow [2021-06-10 11:39:49,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:49,511 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:49,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2021-06-10 11:39:49,511 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash 731108502, now seen corresponding path program 1 times [2021-06-10 11:39:49,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:49,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721636303] [2021-06-10 11:39:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:49,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:49,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:49,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721636303] [2021-06-10 11:39:49,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:49,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:49,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492760260] [2021-06-10 11:39:49,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:49,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:49,540 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:49,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 680 transitions, 1711 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:49,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:49,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:49,835 INFO L129 PetriNetUnfolder]: 20/834 cut-off events. [2021-06-10 11:39:49,835 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:49,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 834 events. 20/834 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3713 event pairs, 0 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1056. Up to 29 conditions per place. [2021-06-10 11:39:49,859 INFO L132 encePairwiseOnDemand]: 800/805 looper letters, 10 selfloop transitions, 3 changer transitions 0/682 dead transitions. [2021-06-10 11:39:49,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 682 transitions, 1741 flow [2021-06-10 11:39:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2223 transitions. [2021-06-10 11:39:49,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204968944099379 [2021-06-10 11:39:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2223 transitions. [2021-06-10 11:39:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2223 transitions. [2021-06-10 11:39:49,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:49,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2223 transitions. [2021-06-10 11:39:49,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,862 INFO L185 Difference]: Start difference. First operand has 801 places, 680 transitions, 1711 flow. Second operand 3 states and 2223 transitions. [2021-06-10 11:39:49,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 682 transitions, 1741 flow [2021-06-10 11:39:49,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 802 places, 682 transitions, 1740 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:49,869 INFO L241 Difference]: Finished difference. Result has 804 places, 682 transitions, 1734 flow [2021-06-10 11:39:49,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1734, PETRI_PLACES=804, PETRI_TRANSITIONS=682} [2021-06-10 11:39:49,869 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 55 predicate places. [2021-06-10 11:39:49,869 INFO L480 AbstractCegarLoop]: Abstraction has has 804 places, 682 transitions, 1734 flow [2021-06-10 11:39:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,869 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:49,869 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:49,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2021-06-10 11:39:49,869 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 731107479, now seen corresponding path program 1 times [2021-06-10 11:39:49,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:49,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829045615] [2021-06-10 11:39:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:49,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:49,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:49,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:49,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829045615] [2021-06-10 11:39:49,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:49,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:49,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147059016] [2021-06-10 11:39:49,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:49,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:49,891 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:49,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 682 transitions, 1734 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:49,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:49,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:49,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:50,157 INFO L129 PetriNetUnfolder]: 18/835 cut-off events. [2021-06-10 11:39:50,157 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:50,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 835 events. 18/835 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3737 event pairs, 0 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1056. Up to 29 conditions per place. [2021-06-10 11:39:50,197 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/682 dead transitions. [2021-06-10 11:39:50,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 682 transitions, 1746 flow [2021-06-10 11:39:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:50,199 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:50,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:50,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:50,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:50,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:50,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,201 INFO L185 Difference]: Start difference. First operand has 804 places, 682 transitions, 1734 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:50,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 682 transitions, 1746 flow [2021-06-10 11:39:50,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 682 transitions, 1741 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:50,208 INFO L241 Difference]: Finished difference. Result has 806 places, 681 transitions, 1730 flow [2021-06-10 11:39:50,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1730, PETRI_PLACES=806, PETRI_TRANSITIONS=681} [2021-06-10 11:39:50,208 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 57 predicate places. [2021-06-10 11:39:50,208 INFO L480 AbstractCegarLoop]: Abstraction has has 806 places, 681 transitions, 1730 flow [2021-06-10 11:39:50,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:50,208 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:50,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2021-06-10 11:39:50,208 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash 730155190, now seen corresponding path program 1 times [2021-06-10 11:39:50,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:50,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846743296] [2021-06-10 11:39:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:50,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:50,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:50,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846743296] [2021-06-10 11:39:50,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:50,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:50,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903497455] [2021-06-10 11:39:50,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:50,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:50,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:50,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:50,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:50,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 681 transitions, 1730 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:50,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:50,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:50,487 INFO L129 PetriNetUnfolder]: 18/828 cut-off events. [2021-06-10 11:39:50,487 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:50,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 828 events. 18/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3680 event pairs, 0 based on Foata normal form. 1/784 useless extension candidates. Maximal degree in co-relation 1050. Up to 29 conditions per place. [2021-06-10 11:39:50,529 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/679 dead transitions. [2021-06-10 11:39:50,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 679 transitions, 1733 flow [2021-06-10 11:39:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:50,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:50,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:50,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:50,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:50,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:50,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,532 INFO L185 Difference]: Start difference. First operand has 806 places, 681 transitions, 1730 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:50,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 679 transitions, 1733 flow [2021-06-10 11:39:50,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 679 transitions, 1726 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:50,539 INFO L241 Difference]: Finished difference. Result has 806 places, 679 transitions, 1719 flow [2021-06-10 11:39:50,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1719, PETRI_PLACES=806, PETRI_TRANSITIONS=679} [2021-06-10 11:39:50,539 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 57 predicate places. [2021-06-10 11:39:50,539 INFO L480 AbstractCegarLoop]: Abstraction has has 806 places, 679 transitions, 1719 flow [2021-06-10 11:39:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:50,540 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:50,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2021-06-10 11:39:50,540 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash 730154167, now seen corresponding path program 1 times [2021-06-10 11:39:50,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:50,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257351970] [2021-06-10 11:39:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:50,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:50,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:39:50,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257351970] [2021-06-10 11:39:50,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:50,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:50,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596476898] [2021-06-10 11:39:50,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:50,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:50,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:50,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:50,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 679 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:50,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:50,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:50,827 INFO L129 PetriNetUnfolder]: 18/826 cut-off events. [2021-06-10 11:39:50,827 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:50,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 826 events. 18/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3665 event pairs, 0 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1050. Up to 29 conditions per place. [2021-06-10 11:39:50,867 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/677 dead transitions. [2021-06-10 11:39:50,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 677 transitions, 1732 flow [2021-06-10 11:39:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:50,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:50,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:50,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:50,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:50,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:50,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,871 INFO L185 Difference]: Start difference. First operand has 806 places, 679 transitions, 1719 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:50,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 677 transitions, 1732 flow [2021-06-10 11:39:50,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 677 transitions, 1731 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:50,877 INFO L241 Difference]: Finished difference. Result has 805 places, 677 transitions, 1715 flow [2021-06-10 11:39:50,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1715, PETRI_PLACES=805, PETRI_TRANSITIONS=677} [2021-06-10 11:39:50,878 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 56 predicate places. [2021-06-10 11:39:50,878 INFO L480 AbstractCegarLoop]: Abstraction has has 805 places, 677 transitions, 1715 flow [2021-06-10 11:39:50,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,878 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:50,878 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:50,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2021-06-10 11:39:50,878 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash 167732446, now seen corresponding path program 1 times [2021-06-10 11:39:50,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:50,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231336430] [2021-06-10 11:39:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:50,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:50,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:50,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:50,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231336430] [2021-06-10 11:39:50,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:50,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:50,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319740351] [2021-06-10 11:39:50,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:50,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:50,900 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:50,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 677 transitions, 1715 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:50,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:50,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:50,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:51,168 INFO L129 PetriNetUnfolder]: 17/833 cut-off events. [2021-06-10 11:39:51,168 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:51,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 833 events. 17/833 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3721 event pairs, 0 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1055. Up to 29 conditions per place. [2021-06-10 11:39:51,208 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 6 selfloop transitions, 1 changer transitions 0/678 dead transitions. [2021-06-10 11:39:51,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 678 transitions, 1731 flow [2021-06-10 11:39:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:51,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:51,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:51,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:51,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:51,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:51,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,211 INFO L185 Difference]: Start difference. First operand has 805 places, 677 transitions, 1715 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:51,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 678 transitions, 1731 flow [2021-06-10 11:39:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 678 transitions, 1730 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:51,218 INFO L241 Difference]: Finished difference. Result has 807 places, 677 transitions, 1719 flow [2021-06-10 11:39:51,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=804, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1719, PETRI_PLACES=807, PETRI_TRANSITIONS=677} [2021-06-10 11:39:51,218 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 58 predicate places. [2021-06-10 11:39:51,218 INFO L480 AbstractCegarLoop]: Abstraction has has 807 places, 677 transitions, 1719 flow [2021-06-10 11:39:51,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:51,218 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:51,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2021-06-10 11:39:51,219 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 167733469, now seen corresponding path program 1 times [2021-06-10 11:39:51,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:51,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569330413] [2021-06-10 11:39:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:51,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:51,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:51,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569330413] [2021-06-10 11:39:51,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:51,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:51,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653565365] [2021-06-10 11:39:51,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:51,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:51,249 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:51,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 677 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:51,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:51,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:51,528 INFO L129 PetriNetUnfolder]: 15/835 cut-off events. [2021-06-10 11:39:51,528 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:51,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 835 events. 15/835 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3757 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1066. Up to 29 conditions per place. [2021-06-10 11:39:51,557 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/678 dead transitions. [2021-06-10 11:39:51,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 678 transitions, 1745 flow [2021-06-10 11:39:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:51,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:51,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:51,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:51,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:51,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:51,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,561 INFO L185 Difference]: Start difference. First operand has 807 places, 677 transitions, 1719 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:51,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 678 transitions, 1745 flow [2021-06-10 11:39:51,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 678 transitions, 1744 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:51,567 INFO L241 Difference]: Finished difference. Result has 810 places, 678 transitions, 1736 flow [2021-06-10 11:39:51,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1736, PETRI_PLACES=810, PETRI_TRANSITIONS=678} [2021-06-10 11:39:51,567 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 61 predicate places. [2021-06-10 11:39:51,567 INFO L480 AbstractCegarLoop]: Abstraction has has 810 places, 678 transitions, 1736 flow [2021-06-10 11:39:51,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:51,568 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:51,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2021-06-10 11:39:51,568 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 166780157, now seen corresponding path program 1 times [2021-06-10 11:39:51,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:51,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108664866] [2021-06-10 11:39:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:51,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:51,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:51,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108664866] [2021-06-10 11:39:51,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:51,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:51,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424909509] [2021-06-10 11:39:51,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:51,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:51,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:51,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 678 transitions, 1736 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:51,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:51,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:51,849 INFO L129 PetriNetUnfolder]: 15/828 cut-off events. [2021-06-10 11:39:51,849 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:51,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 828 events. 15/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3694 event pairs, 0 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 1052. Up to 29 conditions per place. [2021-06-10 11:39:51,890 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/676 dead transitions. [2021-06-10 11:39:51,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 676 transitions, 1738 flow [2021-06-10 11:39:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:51,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:51,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:51,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:51,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:51,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:51,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,893 INFO L185 Difference]: Start difference. First operand has 810 places, 678 transitions, 1736 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:51,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 812 places, 676 transitions, 1738 flow [2021-06-10 11:39:51,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 676 transitions, 1730 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:51,901 INFO L241 Difference]: Finished difference. Result has 810 places, 676 transitions, 1723 flow [2021-06-10 11:39:51,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1723, PETRI_PLACES=810, PETRI_TRANSITIONS=676} [2021-06-10 11:39:51,901 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 61 predicate places. [2021-06-10 11:39:51,901 INFO L480 AbstractCegarLoop]: Abstraction has has 810 places, 676 transitions, 1723 flow [2021-06-10 11:39:51,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:51,901 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:51,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2021-06-10 11:39:51,901 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash 166779134, now seen corresponding path program 1 times [2021-06-10 11:39:51,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:51,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527510391] [2021-06-10 11:39:51,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:51,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:51,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:51,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:39:51,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527510391] [2021-06-10 11:39:51,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:51,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:51,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502510248] [2021-06-10 11:39:51,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:51,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:51,925 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:51,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 676 transitions, 1723 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:51,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:51,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:51,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:52,198 INFO L129 PetriNetUnfolder]: 15/826 cut-off events. [2021-06-10 11:39:52,198 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:52,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 826 events. 15/826 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3678 event pairs, 0 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1056. Up to 29 conditions per place. [2021-06-10 11:39:52,238 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2021-06-10 11:39:52,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 674 transitions, 1736 flow [2021-06-10 11:39:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:52,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:52,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:52,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:52,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:52,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:52,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,241 INFO L185 Difference]: Start difference. First operand has 810 places, 676 transitions, 1723 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:52,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 674 transitions, 1736 flow [2021-06-10 11:39:52,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 674 transitions, 1735 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:52,248 INFO L241 Difference]: Finished difference. Result has 809 places, 674 transitions, 1719 flow [2021-06-10 11:39:52,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1719, PETRI_PLACES=809, PETRI_TRANSITIONS=674} [2021-06-10 11:39:52,248 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 60 predicate places. [2021-06-10 11:39:52,249 INFO L480 AbstractCegarLoop]: Abstraction has has 809 places, 674 transitions, 1719 flow [2021-06-10 11:39:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,249 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:52,249 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:52,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2021-06-10 11:39:52,249 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1064696891, now seen corresponding path program 1 times [2021-06-10 11:39:52,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:52,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374020030] [2021-06-10 11:39:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:52,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:52,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:39:52,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374020030] [2021-06-10 11:39:52,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:52,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:52,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650330090] [2021-06-10 11:39:52,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:52,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:52,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:52,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 674 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:52,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:52,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:52,538 INFO L129 PetriNetUnfolder]: 13/831 cut-off events. [2021-06-10 11:39:52,538 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:52,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 831 events. 13/831 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3729 event pairs, 0 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1059. Up to 29 conditions per place. [2021-06-10 11:39:52,578 INFO L132 encePairwiseOnDemand]: 802/805 looper letters, 5 selfloop transitions, 2 changer transitions 0/675 dead transitions. [2021-06-10 11:39:52,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 811 places, 675 transitions, 1735 flow [2021-06-10 11:39:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2231 transitions. [2021-06-10 11:39:52,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2021-06-10 11:39:52,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2231 transitions. [2021-06-10 11:39:52,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2231 transitions. [2021-06-10 11:39:52,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:52,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2231 transitions. [2021-06-10 11:39:52,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.6666666666666) internal successors, (2231), 3 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,582 INFO L185 Difference]: Start difference. First operand has 809 places, 674 transitions, 1719 flow. Second operand 3 states and 2231 transitions. [2021-06-10 11:39:52,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 811 places, 675 transitions, 1735 flow [2021-06-10 11:39:52,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 810 places, 675 transitions, 1734 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:52,589 INFO L241 Difference]: Finished difference. Result has 812 places, 675 transitions, 1732 flow [2021-06-10 11:39:52,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1732, PETRI_PLACES=812, PETRI_TRANSITIONS=675} [2021-06-10 11:39:52,589 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 63 predicate places. [2021-06-10 11:39:52,589 INFO L480 AbstractCegarLoop]: Abstraction has has 812 places, 675 transitions, 1732 flow [2021-06-10 11:39:52,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:52,590 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:52,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2021-06-10 11:39:52,590 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1064697914, now seen corresponding path program 1 times [2021-06-10 11:39:52,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:52,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109482233] [2021-06-10 11:39:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:52,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:52,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:39:52,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109482233] [2021-06-10 11:39:52,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:52,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:52,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068170380] [2021-06-10 11:39:52,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:52,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:52,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:52,611 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:52,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 812 places, 675 transitions, 1732 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:52,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:52,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:52,885 INFO L129 PetriNetUnfolder]: 13/832 cut-off events. [2021-06-10 11:39:52,885 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:52,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 832 events. 13/832 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3739 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1067. Up to 29 conditions per place. [2021-06-10 11:39:52,926 INFO L132 encePairwiseOnDemand]: 801/805 looper letters, 9 selfloop transitions, 3 changer transitions 0/676 dead transitions. [2021-06-10 11:39:52,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 676 transitions, 1758 flow [2021-06-10 11:39:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2221 transitions. [2021-06-10 11:39:52,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196687370600414 [2021-06-10 11:39:52,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2221 transitions. [2021-06-10 11:39:52,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2221 transitions. [2021-06-10 11:39:52,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:52,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2221 transitions. [2021-06-10 11:39:52,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,929 INFO L185 Difference]: Start difference. First operand has 812 places, 675 transitions, 1732 flow. Second operand 3 states and 2221 transitions. [2021-06-10 11:39:52,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 676 transitions, 1758 flow [2021-06-10 11:39:52,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 676 transitions, 1756 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:52,936 INFO L241 Difference]: Finished difference. Result has 815 places, 676 transitions, 1748 flow [2021-06-10 11:39:52,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1748, PETRI_PLACES=815, PETRI_TRANSITIONS=676} [2021-06-10 11:39:52,936 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 66 predicate places. [2021-06-10 11:39:52,936 INFO L480 AbstractCegarLoop]: Abstraction has has 815 places, 676 transitions, 1748 flow [2021-06-10 11:39:52,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:52,937 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:52,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2021-06-10 11:39:52,937 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1063744602, now seen corresponding path program 1 times [2021-06-10 11:39:52,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:52,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536149009] [2021-06-10 11:39:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:52,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:52,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:52,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:39:52,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536149009] [2021-06-10 11:39:52,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:52,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:52,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928958248] [2021-06-10 11:39:52,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:52,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:52,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 805 [2021-06-10 11:39:52,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 676 transitions, 1748 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:52,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:52,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 805 [2021-06-10 11:39:52,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:53,213 INFO L129 PetriNetUnfolder]: 12/828 cut-off events. [2021-06-10 11:39:53,213 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:53,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 828 events. 12/828 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3714 event pairs, 0 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1060. Up to 29 conditions per place. [2021-06-10 11:39:53,249 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 5 selfloop transitions, 1 changer transitions 0/673 dead transitions. [2021-06-10 11:39:53,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 673 transitions, 1745 flow [2021-06-10 11:39:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2021-06-10 11:39:53,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9233954451345756 [2021-06-10 11:39:53,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2021-06-10 11:39:53,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2021-06-10 11:39:53,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:53,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2021-06-10 11:39:53,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,252 INFO L185 Difference]: Start difference. First operand has 815 places, 676 transitions, 1748 flow. Second operand 3 states and 2230 transitions. [2021-06-10 11:39:53,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 817 places, 673 transitions, 1745 flow [2021-06-10 11:39:53,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 814 places, 673 transitions, 1737 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:53,259 INFO L241 Difference]: Finished difference. Result has 814 places, 673 transitions, 1727 flow [2021-06-10 11:39:53,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=812, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1727, PETRI_PLACES=814, PETRI_TRANSITIONS=673} [2021-06-10 11:39:53,259 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 65 predicate places. [2021-06-10 11:39:53,259 INFO L480 AbstractCegarLoop]: Abstraction has has 814 places, 673 transitions, 1727 flow [2021-06-10 11:39:53,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:53,260 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:53,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2021-06-10 11:39:53,260 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1063743579, now seen corresponding path program 1 times [2021-06-10 11:39:53,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:53,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531514161] [2021-06-10 11:39:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:53,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:53,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:53,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:53,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:53,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:53,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:39:53,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531514161] [2021-06-10 11:39:53,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:53,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:53,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921677419] [2021-06-10 11:39:53,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:53,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:53,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:53,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:53,281 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 805 [2021-06-10 11:39:53,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 673 transitions, 1727 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:53,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 805 [2021-06-10 11:39:53,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:53,545 INFO L129 PetriNetUnfolder]: 12/826 cut-off events. [2021-06-10 11:39:53,546 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:53,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 826 events. 12/826 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3699 event pairs, 0 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1063. Up to 29 conditions per place. [2021-06-10 11:39:53,585 INFO L132 encePairwiseOnDemand]: 803/805 looper letters, 8 selfloop transitions, 1 changer transitions 0/671 dead transitions. [2021-06-10 11:39:53,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 671 transitions, 1740 flow [2021-06-10 11:39:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2218 transitions. [2021-06-10 11:39:53,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9184265010351967 [2021-06-10 11:39:53,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2218 transitions. [2021-06-10 11:39:53,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2218 transitions. [2021-06-10 11:39:53,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:53,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2218 transitions. [2021-06-10 11:39:53,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 805.0) internal successors, (3220), 4 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,589 INFO L185 Difference]: Start difference. First operand has 814 places, 673 transitions, 1727 flow. Second operand 3 states and 2218 transitions. [2021-06-10 11:39:53,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 671 transitions, 1740 flow [2021-06-10 11:39:53,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 671 transitions, 1739 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:53,596 INFO L241 Difference]: Finished difference. Result has 813 places, 671 transitions, 1723 flow [2021-06-10 11:39:53,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=805, PETRI_DIFFERENCE_MINUEND_FLOW=1721, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1723, PETRI_PLACES=813, PETRI_TRANSITIONS=671} [2021-06-10 11:39:53,596 INFO L343 CegarLoopForPetriNet]: 749 programPoint places, 64 predicate places. [2021-06-10 11:39:53,596 INFO L480 AbstractCegarLoop]: Abstraction has has 813 places, 671 transitions, 1723 flow [2021-06-10 11:39:53,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:53,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:53,597 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:53,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2021-06-10 11:39:53,597 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -526614444, now seen corresponding path program 1 times [2021-06-10 11:39:53,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:53,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823351974] [2021-06-10 11:39:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:39:53,611 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:39:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:39:53,617 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:39:53,632 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:39:53,632 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:39:53,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2021-06-10 11:39:53,632 WARN L342 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:39:53,633 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2021-06-10 11:39:53,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of29ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of29ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:39:53,784 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:39:53,784 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-06-10 11:39:53,784 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:39:53,784 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:39:53,784 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:39:53,784 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:39:53,784 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:39:53,784 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:39:53,784 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:39:53,784 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:39:53,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 775 places, 833 transitions, 2623 flow [2021-06-10 11:39:54,104 INFO L129 PetriNetUnfolder]: 146/1093 cut-off events. [2021-06-10 11:39:54,104 INFO L130 PetriNetUnfolder]: For 4466/4466 co-relation queries the response was YES. [2021-06-10 11:39:54,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1093 events. 146/1093 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4672 event pairs, 0 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1537. Up to 60 conditions per place. [2021-06-10 11:39:54,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 775 places, 833 transitions, 2623 flow [2021-06-10 11:39:54,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 775 places, 833 transitions, 2623 flow [2021-06-10 11:39:54,188 INFO L129 PetriNetUnfolder]: 10/105 cut-off events. [2021-06-10 11:39:54,188 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:39:54,189 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:54,189 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-06-10 11:39:54,189 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1366160837, now seen corresponding path program 1 times [2021-06-10 11:39:54,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:54,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285862126] [2021-06-10 11:39:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:54,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:54,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:54,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285862126] [2021-06-10 11:39:54,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:54,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:54,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617841365] [2021-06-10 11:39:54,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:54,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:54,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:54,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 833 transitions, 2623 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:54,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:54,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:54,444 INFO L129 PetriNetUnfolder]: 85/860 cut-off events. [2021-06-10 11:39:54,444 INFO L130 PetriNetUnfolder]: For 4467/4467 co-relation queries the response was YES. [2021-06-10 11:39:54,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 860 events. 85/860 cut-off events. For 4467/4467 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3429 event pairs, 0 based on Foata normal form. 118/862 useless extension candidates. Maximal degree in co-relation 1316. Up to 30 conditions per place. [2021-06-10 11:39:54,500 INFO L132 encePairwiseOnDemand]: 799/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/770 dead transitions. [2021-06-10 11:39:54,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 770 transitions, 2511 flow [2021-06-10 11:39:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2371 transitions. [2021-06-10 11:39:54,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9487795118047219 [2021-06-10 11:39:54,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2371 transitions. [2021-06-10 11:39:54,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2371 transitions. [2021-06-10 11:39:54,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:54,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2371 transitions. [2021-06-10 11:39:54,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,504 INFO L185 Difference]: Start difference. First operand has 775 places, 833 transitions, 2623 flow. Second operand 3 states and 2371 transitions. [2021-06-10 11:39:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 743 places, 770 transitions, 2511 flow [2021-06-10 11:39:54,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 770 transitions, 1699 flow, removed 406 selfloop flow, removed 0 redundant places. [2021-06-10 11:39:54,515 INFO L241 Difference]: Finished difference. Result has 745 places, 770 transitions, 1697 flow [2021-06-10 11:39:54,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=741, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1697, PETRI_PLACES=745, PETRI_TRANSITIONS=770} [2021-06-10 11:39:54,515 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -30 predicate places. [2021-06-10 11:39:54,515 INFO L480 AbstractCegarLoop]: Abstraction has has 745 places, 770 transitions, 1697 flow [2021-06-10 11:39:54,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,515 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:54,515 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-06-10 11:39:54,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2021-06-10 11:39:54,515 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1366159814, now seen corresponding path program 1 times [2021-06-10 11:39:54,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:54,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805880393] [2021-06-10 11:39:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:54,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:54,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:54,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805880393] [2021-06-10 11:39:54,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:54,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:54,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277306473] [2021-06-10 11:39:54,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:54,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:54,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:54,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 770 transitions, 1697 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:54,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:54,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:54,784 INFO L129 PetriNetUnfolder]: 85/861 cut-off events. [2021-06-10 11:39:54,784 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:54,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 861 events. 85/861 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3435 event pairs, 0 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 948. Up to 30 conditions per place. [2021-06-10 11:39:54,818 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/771 dead transitions. [2021-06-10 11:39:54,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 771 transitions, 1723 flow [2021-06-10 11:39:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:39:54,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:39:54,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:39:54,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:39:54,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:54,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:39:54,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,822 INFO L185 Difference]: Start difference. First operand has 745 places, 770 transitions, 1697 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:39:54,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 771 transitions, 1723 flow [2021-06-10 11:39:54,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 771 transitions, 1721 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:54,828 INFO L241 Difference]: Finished difference. Result has 748 places, 771 transitions, 1713 flow [2021-06-10 11:39:54,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1713, PETRI_PLACES=748, PETRI_TRANSITIONS=771} [2021-06-10 11:39:54,828 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -27 predicate places. [2021-06-10 11:39:54,829 INFO L480 AbstractCegarLoop]: Abstraction has has 748 places, 771 transitions, 1713 flow [2021-06-10 11:39:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:54,829 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-06-10 11:39:54,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2021-06-10 11:39:54,829 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1367113126, now seen corresponding path program 1 times [2021-06-10 11:39:54,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:54,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807580912] [2021-06-10 11:39:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:54,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:54,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:54,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:54,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807580912] [2021-06-10 11:39:54,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:54,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:54,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6671418] [2021-06-10 11:39:54,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:54,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:54,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:54,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 771 transitions, 1713 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:54,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:54,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:54,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:55,057 INFO L129 PetriNetUnfolder]: 84/857 cut-off events. [2021-06-10 11:39:55,057 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:55,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 857 events. 84/857 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3411 event pairs, 0 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 940. Up to 30 conditions per place. [2021-06-10 11:39:55,106 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/768 dead transitions. [2021-06-10 11:39:55,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 768 transitions, 1710 flow [2021-06-10 11:39:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:39:55,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:39:55,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:39:55,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:39:55,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:55,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:39:55,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,110 INFO L185 Difference]: Start difference. First operand has 748 places, 771 transitions, 1713 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:39:55,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 768 transitions, 1710 flow [2021-06-10 11:39:55,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 768 transitions, 1702 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:55,117 INFO L241 Difference]: Finished difference. Result has 747 places, 768 transitions, 1692 flow [2021-06-10 11:39:55,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1692, PETRI_PLACES=747, PETRI_TRANSITIONS=768} [2021-06-10 11:39:55,117 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -28 predicate places. [2021-06-10 11:39:55,117 INFO L480 AbstractCegarLoop]: Abstraction has has 747 places, 768 transitions, 1692 flow [2021-06-10 11:39:55,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:55,117 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-06-10 11:39:55,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2021-06-10 11:39:55,118 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1367114149, now seen corresponding path program 1 times [2021-06-10 11:39:55,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:55,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465425272] [2021-06-10 11:39:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:55,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:55,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:39:55,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465425272] [2021-06-10 11:39:55,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:55,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:55,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009483036] [2021-06-10 11:39:55,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:55,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:55,138 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:55,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 768 transitions, 1692 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:55,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:55,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:55,356 INFO L129 PetriNetUnfolder]: 84/855 cut-off events. [2021-06-10 11:39:55,357 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 11:39:55,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 855 events. 84/855 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3401 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 948. Up to 30 conditions per place. [2021-06-10 11:39:55,405 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/766 dead transitions. [2021-06-10 11:39:55,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 766 transitions, 1705 flow [2021-06-10 11:39:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:39:55,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:39:55,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:39:55,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:39:55,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:55,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:39:55,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,409 INFO L185 Difference]: Start difference. First operand has 747 places, 768 transitions, 1692 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:39:55,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 747 places, 766 transitions, 1705 flow [2021-06-10 11:39:55,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 766 transitions, 1704 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:55,415 INFO L241 Difference]: Finished difference. Result has 746 places, 766 transitions, 1688 flow [2021-06-10 11:39:55,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1688, PETRI_PLACES=746, PETRI_TRANSITIONS=766} [2021-06-10 11:39:55,415 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -29 predicate places. [2021-06-10 11:39:55,415 INFO L480 AbstractCegarLoop]: Abstraction has has 746 places, 766 transitions, 1688 flow [2021-06-10 11:39:55,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:55,416 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:55,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2021-06-10 11:39:55,416 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1556278830, now seen corresponding path program 1 times [2021-06-10 11:39:55,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:55,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77922222] [2021-06-10 11:39:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:55,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:55,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:55,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77922222] [2021-06-10 11:39:55,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:55,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:55,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217491386] [2021-06-10 11:39:55,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:55,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:55,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:55,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 766 transitions, 1688 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:55,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:55,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:55,654 INFO L129 PetriNetUnfolder]: 82/860 cut-off events. [2021-06-10 11:39:55,655 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:55,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 860 events. 82/860 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3453 event pairs, 0 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 951. Up to 30 conditions per place. [2021-06-10 11:39:55,706 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/767 dead transitions. [2021-06-10 11:39:55,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 767 transitions, 1704 flow [2021-06-10 11:39:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:39:55,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:39:55,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:39:55,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:39:55,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:55,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:39:55,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,710 INFO L185 Difference]: Start difference. First operand has 746 places, 766 transitions, 1688 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:39:55,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 767 transitions, 1704 flow [2021-06-10 11:39:55,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 767 transitions, 1703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:55,717 INFO L241 Difference]: Finished difference. Result has 749 places, 767 transitions, 1701 flow [2021-06-10 11:39:55,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1701, PETRI_PLACES=749, PETRI_TRANSITIONS=767} [2021-06-10 11:39:55,717 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -26 predicate places. [2021-06-10 11:39:55,718 INFO L480 AbstractCegarLoop]: Abstraction has has 749 places, 767 transitions, 1701 flow [2021-06-10 11:39:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:55,718 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:55,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2021-06-10 11:39:55,718 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1556279853, now seen corresponding path program 1 times [2021-06-10 11:39:55,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:55,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725679517] [2021-06-10 11:39:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:55,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:55,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:55,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:55,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725679517] [2021-06-10 11:39:55,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:55,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:55,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665626763] [2021-06-10 11:39:55,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:55,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:55,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:55,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:55,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:55,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 767 transitions, 1701 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:55,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:55,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:55,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:55,963 INFO L129 PetriNetUnfolder]: 82/861 cut-off events. [2021-06-10 11:39:55,964 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:39:56,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 861 events. 82/861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3461 event pairs, 0 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 958. Up to 30 conditions per place. [2021-06-10 11:39:56,014 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/768 dead transitions. [2021-06-10 11:39:56,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 768 transitions, 1727 flow [2021-06-10 11:39:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:39:56,015 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:39:56,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:39:56,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:39:56,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:56,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:39:56,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,018 INFO L185 Difference]: Start difference. First operand has 749 places, 767 transitions, 1701 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:39:56,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 768 transitions, 1727 flow [2021-06-10 11:39:56,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 750 places, 768 transitions, 1725 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:56,024 INFO L241 Difference]: Finished difference. Result has 752 places, 768 transitions, 1717 flow [2021-06-10 11:39:56,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=748, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1717, PETRI_PLACES=752, PETRI_TRANSITIONS=768} [2021-06-10 11:39:56,024 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -23 predicate places. [2021-06-10 11:39:56,024 INFO L480 AbstractCegarLoop]: Abstraction has has 752 places, 768 transitions, 1717 flow [2021-06-10 11:39:56,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:56,025 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:56,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2021-06-10 11:39:56,025 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1555326541, now seen corresponding path program 1 times [2021-06-10 11:39:56,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:56,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167347761] [2021-06-10 11:39:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:56,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:56,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:56,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167347761] [2021-06-10 11:39:56,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:56,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:56,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930888854] [2021-06-10 11:39:56,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:56,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:56,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:56,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 768 transitions, 1717 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:56,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:56,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:56,259 INFO L129 PetriNetUnfolder]: 81/857 cut-off events. [2021-06-10 11:39:56,259 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:56,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 857 events. 81/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3431 event pairs, 0 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 951. Up to 30 conditions per place. [2021-06-10 11:39:56,308 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/765 dead transitions. [2021-06-10 11:39:56,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 765 transitions, 1714 flow [2021-06-10 11:39:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:39:56,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:39:56,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:39:56,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:39:56,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:56,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:39:56,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,312 INFO L185 Difference]: Start difference. First operand has 752 places, 768 transitions, 1717 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:39:56,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 754 places, 765 transitions, 1714 flow [2021-06-10 11:39:56,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 765 transitions, 1706 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:56,318 INFO L241 Difference]: Finished difference. Result has 751 places, 765 transitions, 1696 flow [2021-06-10 11:39:56,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1696, PETRI_PLACES=751, PETRI_TRANSITIONS=765} [2021-06-10 11:39:56,319 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -24 predicate places. [2021-06-10 11:39:56,319 INFO L480 AbstractCegarLoop]: Abstraction has has 751 places, 765 transitions, 1696 flow [2021-06-10 11:39:56,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:56,319 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:56,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2021-06-10 11:39:56,319 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1555325518, now seen corresponding path program 1 times [2021-06-10 11:39:56,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:56,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235144345] [2021-06-10 11:39:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:56,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:56,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:39:56,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235144345] [2021-06-10 11:39:56,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:56,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:56,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532714758] [2021-06-10 11:39:56,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:56,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:56,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:56,336 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:56,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 765 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:56,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:56,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:56,561 INFO L129 PetriNetUnfolder]: 81/855 cut-off events. [2021-06-10 11:39:56,561 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:56,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 855 events. 81/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3419 event pairs, 0 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 955. Up to 30 conditions per place. [2021-06-10 11:39:56,608 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/763 dead transitions. [2021-06-10 11:39:56,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 763 transitions, 1709 flow [2021-06-10 11:39:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:39:56,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:39:56,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:39:56,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:39:56,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:56,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:39:56,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,612 INFO L185 Difference]: Start difference. First operand has 751 places, 765 transitions, 1696 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:39:56,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 763 transitions, 1709 flow [2021-06-10 11:39:56,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 750 places, 763 transitions, 1708 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:56,618 INFO L241 Difference]: Finished difference. Result has 750 places, 763 transitions, 1692 flow [2021-06-10 11:39:56,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=748, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1692, PETRI_PLACES=750, PETRI_TRANSITIONS=763} [2021-06-10 11:39:56,618 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -25 predicate places. [2021-06-10 11:39:56,618 INFO L480 AbstractCegarLoop]: Abstraction has has 750 places, 763 transitions, 1692 flow [2021-06-10 11:39:56,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:56,618 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:56,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2021-06-10 11:39:56,618 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:56,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash 771514944, now seen corresponding path program 1 times [2021-06-10 11:39:56,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:56,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014485083] [2021-06-10 11:39:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:56,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:56,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:56,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014485083] [2021-06-10 11:39:56,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:56,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:56,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990110166] [2021-06-10 11:39:56,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:56,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:56,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:56,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 750 places, 763 transitions, 1692 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:56,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:56,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:56,869 INFO L129 PetriNetUnfolder]: 80/863 cut-off events. [2021-06-10 11:39:56,869 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:56,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 863 events. 80/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3489 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 967. Up to 30 conditions per place. [2021-06-10 11:39:56,918 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/765 dead transitions. [2021-06-10 11:39:56,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 765 transitions, 1722 flow [2021-06-10 11:39:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:39:56,920 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:39:56,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:39:56,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:39:56,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:56,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:39:56,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,922 INFO L185 Difference]: Start difference. First operand has 750 places, 763 transitions, 1692 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:39:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 765 transitions, 1722 flow [2021-06-10 11:39:56,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 765 transitions, 1721 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:56,929 INFO L241 Difference]: Finished difference. Result has 753 places, 765 transitions, 1715 flow [2021-06-10 11:39:56,929 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1715, PETRI_PLACES=753, PETRI_TRANSITIONS=765} [2021-06-10 11:39:56,929 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -22 predicate places. [2021-06-10 11:39:56,929 INFO L480 AbstractCegarLoop]: Abstraction has has 753 places, 765 transitions, 1715 flow [2021-06-10 11:39:56,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:56,929 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:56,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2021-06-10 11:39:56,929 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash 771513921, now seen corresponding path program 1 times [2021-06-10 11:39:56,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:56,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142039312] [2021-06-10 11:39:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:56,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:56,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:56,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:56,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142039312] [2021-06-10 11:39:56,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:56,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:56,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304589015] [2021-06-10 11:39:56,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:56,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:56,946 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:56,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 765 transitions, 1715 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:56,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:56,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:56,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:57,176 INFO L129 PetriNetUnfolder]: 78/864 cut-off events. [2021-06-10 11:39:57,176 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:57,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 864 events. 78/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3512 event pairs, 0 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 966. Up to 30 conditions per place. [2021-06-10 11:39:57,227 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/765 dead transitions. [2021-06-10 11:39:57,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 765 transitions, 1727 flow [2021-06-10 11:39:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:39:57,228 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:39:57,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:39:57,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:39:57,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:57,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:39:57,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,231 INFO L185 Difference]: Start difference. First operand has 753 places, 765 transitions, 1715 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:39:57,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 765 transitions, 1727 flow [2021-06-10 11:39:57,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 765 transitions, 1722 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:57,237 INFO L241 Difference]: Finished difference. Result has 755 places, 764 transitions, 1711 flow [2021-06-10 11:39:57,237 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1711, PETRI_PLACES=755, PETRI_TRANSITIONS=764} [2021-06-10 11:39:57,237 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -20 predicate places. [2021-06-10 11:39:57,237 INFO L480 AbstractCegarLoop]: Abstraction has has 755 places, 764 transitions, 1711 flow [2021-06-10 11:39:57,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,238 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:57,238 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:57,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2021-06-10 11:39:57,238 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 770561632, now seen corresponding path program 1 times [2021-06-10 11:39:57,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:57,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468669305] [2021-06-10 11:39:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:57,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:57,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:57,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468669305] [2021-06-10 11:39:57,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:57,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:57,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604583366] [2021-06-10 11:39:57,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:57,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:57,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:57,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 764 transitions, 1711 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:57,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:57,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:57,478 INFO L129 PetriNetUnfolder]: 78/857 cut-off events. [2021-06-10 11:39:57,478 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:57,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 857 events. 78/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3452 event pairs, 0 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 961. Up to 30 conditions per place. [2021-06-10 11:39:57,525 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/762 dead transitions. [2021-06-10 11:39:57,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 762 transitions, 1714 flow [2021-06-10 11:39:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:39:57,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:39:57,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:39:57,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:39:57,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:57,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:39:57,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,530 INFO L185 Difference]: Start difference. First operand has 755 places, 764 transitions, 1711 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:39:57,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 762 transitions, 1714 flow [2021-06-10 11:39:57,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 762 transitions, 1707 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:57,536 INFO L241 Difference]: Finished difference. Result has 755 places, 762 transitions, 1700 flow [2021-06-10 11:39:57,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1700, PETRI_PLACES=755, PETRI_TRANSITIONS=762} [2021-06-10 11:39:57,536 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -20 predicate places. [2021-06-10 11:39:57,536 INFO L480 AbstractCegarLoop]: Abstraction has has 755 places, 762 transitions, 1700 flow [2021-06-10 11:39:57,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,537 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:57,537 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:57,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2021-06-10 11:39:57,537 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 770560609, now seen corresponding path program 1 times [2021-06-10 11:39:57,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:57,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652285854] [2021-06-10 11:39:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:57,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:57,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:39:57,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652285854] [2021-06-10 11:39:57,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:57,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:57,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508940731] [2021-06-10 11:39:57,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:57,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:57,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:57,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 762 transitions, 1700 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:57,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:57,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:57,780 INFO L129 PetriNetUnfolder]: 78/855 cut-off events. [2021-06-10 11:39:57,780 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:57,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 855 events. 78/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3437 event pairs, 0 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 961. Up to 30 conditions per place. [2021-06-10 11:39:57,828 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/760 dead transitions. [2021-06-10 11:39:57,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 760 transitions, 1713 flow [2021-06-10 11:39:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:39:57,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:39:57,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:39:57,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:39:57,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:57,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:39:57,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,832 INFO L185 Difference]: Start difference. First operand has 755 places, 762 transitions, 1700 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:39:57,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 760 transitions, 1713 flow [2021-06-10 11:39:57,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 760 transitions, 1712 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:57,839 INFO L241 Difference]: Finished difference. Result has 754 places, 760 transitions, 1696 flow [2021-06-10 11:39:57,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=752, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1696, PETRI_PLACES=754, PETRI_TRANSITIONS=760} [2021-06-10 11:39:57,839 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -21 predicate places. [2021-06-10 11:39:57,839 INFO L480 AbstractCegarLoop]: Abstraction has has 754 places, 760 transitions, 1696 flow [2021-06-10 11:39:57,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:57,839 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:57,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2021-06-10 11:39:57,839 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2097023793, now seen corresponding path program 1 times [2021-06-10 11:39:57,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:57,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423486382] [2021-06-10 11:39:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:57,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:57,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:57,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:57,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423486382] [2021-06-10 11:39:57,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:57,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:57,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569909555] [2021-06-10 11:39:57,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:57,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:57,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:57,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 760 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:57,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:57,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:57,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:58,100 INFO L129 PetriNetUnfolder]: 77/863 cut-off events. [2021-06-10 11:39:58,100 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:58,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 863 events. 77/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3507 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 973. Up to 30 conditions per place. [2021-06-10 11:39:58,137 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/762 dead transitions. [2021-06-10 11:39:58,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 762 transitions, 1726 flow [2021-06-10 11:39:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:39:58,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:39:58,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:39:58,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:39:58,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:58,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:39:58,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,141 INFO L185 Difference]: Start difference. First operand has 754 places, 760 transitions, 1696 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:39:58,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 762 transitions, 1726 flow [2021-06-10 11:39:58,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 755 places, 762 transitions, 1725 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:58,146 INFO L241 Difference]: Finished difference. Result has 757 places, 762 transitions, 1719 flow [2021-06-10 11:39:58,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=753, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1719, PETRI_PLACES=757, PETRI_TRANSITIONS=762} [2021-06-10 11:39:58,147 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -18 predicate places. [2021-06-10 11:39:58,147 INFO L480 AbstractCegarLoop]: Abstraction has has 757 places, 762 transitions, 1719 flow [2021-06-10 11:39:58,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:58,147 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:58,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2021-06-10 11:39:58,147 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2097024816, now seen corresponding path program 1 times [2021-06-10 11:39:58,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:58,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885719138] [2021-06-10 11:39:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:58,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:58,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:58,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885719138] [2021-06-10 11:39:58,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:58,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:58,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584000839] [2021-06-10 11:39:58,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:58,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:58,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:58,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 762 transitions, 1719 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:58,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:58,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:58,387 INFO L129 PetriNetUnfolder]: 75/864 cut-off events. [2021-06-10 11:39:58,387 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:58,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 864 events. 75/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3533 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 973. Up to 30 conditions per place. [2021-06-10 11:39:58,435 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/762 dead transitions. [2021-06-10 11:39:58,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 762 transitions, 1731 flow [2021-06-10 11:39:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:39:58,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:39:58,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:39:58,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:39:58,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:58,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:39:58,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,439 INFO L185 Difference]: Start difference. First operand has 757 places, 762 transitions, 1719 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:39:58,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 762 transitions, 1731 flow [2021-06-10 11:39:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 762 transitions, 1726 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:58,445 INFO L241 Difference]: Finished difference. Result has 759 places, 761 transitions, 1715 flow [2021-06-10 11:39:58,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1715, PETRI_PLACES=759, PETRI_TRANSITIONS=761} [2021-06-10 11:39:58,446 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -16 predicate places. [2021-06-10 11:39:58,446 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 761 transitions, 1715 flow [2021-06-10 11:39:58,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:58,446 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:58,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2021-06-10 11:39:58,446 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2097977105, now seen corresponding path program 1 times [2021-06-10 11:39:58,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:58,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187969809] [2021-06-10 11:39:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:58,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:58,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:58,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187969809] [2021-06-10 11:39:58,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:58,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:58,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197950168] [2021-06-10 11:39:58,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:58,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:58,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:58,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:58,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 761 transitions, 1715 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:58,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:58,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:58,682 INFO L129 PetriNetUnfolder]: 75/857 cut-off events. [2021-06-10 11:39:58,682 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:58,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 857 events. 75/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3469 event pairs, 0 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 967. Up to 30 conditions per place. [2021-06-10 11:39:58,728 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/759 dead transitions. [2021-06-10 11:39:58,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 759 transitions, 1718 flow [2021-06-10 11:39:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:39:58,730 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:39:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:39:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:39:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:58,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:39:58,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,732 INFO L185 Difference]: Start difference. First operand has 759 places, 761 transitions, 1715 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:39:58,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 759 transitions, 1718 flow [2021-06-10 11:39:58,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 759 transitions, 1711 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:58,738 INFO L241 Difference]: Finished difference. Result has 759 places, 759 transitions, 1704 flow [2021-06-10 11:39:58,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1704, PETRI_PLACES=759, PETRI_TRANSITIONS=759} [2021-06-10 11:39:58,738 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -16 predicate places. [2021-06-10 11:39:58,738 INFO L480 AbstractCegarLoop]: Abstraction has has 759 places, 759 transitions, 1704 flow [2021-06-10 11:39:58,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:58,739 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:58,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2021-06-10 11:39:58,739 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2097978128, now seen corresponding path program 1 times [2021-06-10 11:39:58,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:58,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458534762] [2021-06-10 11:39:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:58,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:58,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:58,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:39:58,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458534762] [2021-06-10 11:39:58,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:58,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:58,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331764503] [2021-06-10 11:39:58,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:58,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:58,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:58,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:58,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:58,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 759 transitions, 1704 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:58,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:58,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:58,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:58,978 INFO L129 PetriNetUnfolder]: 75/855 cut-off events. [2021-06-10 11:39:58,978 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:39:59,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 855 events. 75/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3455 event pairs, 0 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 967. Up to 30 conditions per place. [2021-06-10 11:39:59,023 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/757 dead transitions. [2021-06-10 11:39:59,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 759 places, 757 transitions, 1717 flow [2021-06-10 11:39:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:39:59,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:39:59,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:39:59,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:39:59,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:59,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:39:59,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,027 INFO L185 Difference]: Start difference. First operand has 759 places, 759 transitions, 1704 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:39:59,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 759 places, 757 transitions, 1717 flow [2021-06-10 11:39:59,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 758 places, 757 transitions, 1716 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:59,033 INFO L241 Difference]: Finished difference. Result has 758 places, 757 transitions, 1700 flow [2021-06-10 11:39:59,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1700, PETRI_PLACES=758, PETRI_TRANSITIONS=757} [2021-06-10 11:39:59,033 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -17 predicate places. [2021-06-10 11:39:59,033 INFO L480 AbstractCegarLoop]: Abstraction has has 758 places, 757 transitions, 1700 flow [2021-06-10 11:39:59,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:59,034 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:59,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2021-06-10 11:39:59,034 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash -416643072, now seen corresponding path program 1 times [2021-06-10 11:39:59,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:59,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659298367] [2021-06-10 11:39:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:59,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:39:59,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:59,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659298367] [2021-06-10 11:39:59,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:59,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:59,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655054916] [2021-06-10 11:39:59,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:59,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:59,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:59,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 757 transitions, 1700 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:59,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:59,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:59,280 INFO L129 PetriNetUnfolder]: 74/863 cut-off events. [2021-06-10 11:39:59,280 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:39:59,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 863 events. 74/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3525 event pairs, 0 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 979. Up to 30 conditions per place. [2021-06-10 11:39:59,326 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/759 dead transitions. [2021-06-10 11:39:59,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 759 transitions, 1730 flow [2021-06-10 11:39:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:39:59,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:39:59,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:39:59,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:39:59,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:59,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:39:59,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,330 INFO L185 Difference]: Start difference. First operand has 758 places, 757 transitions, 1700 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:39:59,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 759 transitions, 1730 flow [2021-06-10 11:39:59,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 759 transitions, 1729 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:59,336 INFO L241 Difference]: Finished difference. Result has 761 places, 759 transitions, 1723 flow [2021-06-10 11:39:59,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1723, PETRI_PLACES=761, PETRI_TRANSITIONS=759} [2021-06-10 11:39:59,337 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -14 predicate places. [2021-06-10 11:39:59,337 INFO L480 AbstractCegarLoop]: Abstraction has has 761 places, 759 transitions, 1723 flow [2021-06-10 11:39:59,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:59,337 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:59,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2021-06-10 11:39:59,337 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash -416642049, now seen corresponding path program 1 times [2021-06-10 11:39:59,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:59,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978164154] [2021-06-10 11:39:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:59,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:59,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:59,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978164154] [2021-06-10 11:39:59,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:59,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:59,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989030978] [2021-06-10 11:39:59,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:59,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:59,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:59,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 759 transitions, 1723 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:59,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:59,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:59,615 INFO L129 PetriNetUnfolder]: 73/861 cut-off events. [2021-06-10 11:39:59,615 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:39:59,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 861 events. 73/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3513 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 976. Up to 30 conditions per place. [2021-06-10 11:39:59,644 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/759 dead transitions. [2021-06-10 11:39:59,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 759 transitions, 1735 flow [2021-06-10 11:39:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:39:59,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:39:59,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:39:59,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:39:59,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:59,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:39:59,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,648 INFO L185 Difference]: Start difference. First operand has 761 places, 759 transitions, 1723 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:39:59,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 763 places, 759 transitions, 1735 flow [2021-06-10 11:39:59,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 759 transitions, 1730 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:39:59,654 INFO L241 Difference]: Finished difference. Result has 764 places, 759 transitions, 1728 flow [2021-06-10 11:39:59,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=760, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=764, PETRI_TRANSITIONS=759} [2021-06-10 11:39:59,654 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -11 predicate places. [2021-06-10 11:39:59,654 INFO L480 AbstractCegarLoop]: Abstraction has has 764 places, 759 transitions, 1728 flow [2021-06-10 11:39:59,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:59,654 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:59,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2021-06-10 11:39:59,655 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash -415689760, now seen corresponding path program 1 times [2021-06-10 11:39:59,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:59,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192578053] [2021-06-10 11:39:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:59,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:39:59,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:59,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192578053] [2021-06-10 11:39:59,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:59,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:59,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450098438] [2021-06-10 11:39:59,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:59,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:59,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:39:59,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 759 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:59,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:39:59,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:39:59,903 INFO L129 PetriNetUnfolder]: 72/857 cut-off events. [2021-06-10 11:39:59,903 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:39:59,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 857 events. 72/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3484 event pairs, 0 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 973. Up to 30 conditions per place. [2021-06-10 11:39:59,952 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/756 dead transitions. [2021-06-10 11:39:59,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 766 places, 756 transitions, 1725 flow [2021-06-10 11:39:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:39:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:39:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:39:59,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:39:59,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:39:59,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:39:59,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:39:59,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:39:59,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,956 INFO L185 Difference]: Start difference. First operand has 764 places, 759 transitions, 1728 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:39:59,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 766 places, 756 transitions, 1725 flow [2021-06-10 11:39:59,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 756 transitions, 1718 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:39:59,962 INFO L241 Difference]: Finished difference. Result has 763 places, 756 transitions, 1708 flow [2021-06-10 11:39:59,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1708, PETRI_PLACES=763, PETRI_TRANSITIONS=756} [2021-06-10 11:39:59,962 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -12 predicate places. [2021-06-10 11:39:59,962 INFO L480 AbstractCegarLoop]: Abstraction has has 763 places, 756 transitions, 1708 flow [2021-06-10 11:39:59,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:39:59,963 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:39:59,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2021-06-10 11:39:59,963 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:39:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:39:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -415688737, now seen corresponding path program 1 times [2021-06-10 11:39:59,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:39:59,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175856726] [2021-06-10 11:39:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:39:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:39:59,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:39:59,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:39:59,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:39:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:39:59,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175856726] [2021-06-10 11:39:59,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:39:59,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:39:59,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104383578] [2021-06-10 11:39:59,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:39:59,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:39:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:39:59,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:39:59,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:39:59,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 756 transitions, 1708 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:39:59,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:39:59,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:39:59,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:00,209 INFO L129 PetriNetUnfolder]: 72/855 cut-off events. [2021-06-10 11:40:00,209 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:00,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 855 events. 72/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3473 event pairs, 0 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 974. Up to 30 conditions per place. [2021-06-10 11:40:00,254 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/754 dead transitions. [2021-06-10 11:40:00,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 754 transitions, 1721 flow [2021-06-10 11:40:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:00,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:00,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:00,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:00,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:00,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:00,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,258 INFO L185 Difference]: Start difference. First operand has 763 places, 756 transitions, 1708 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:00,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 763 places, 754 transitions, 1721 flow [2021-06-10 11:40:00,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 754 transitions, 1720 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:00,265 INFO L241 Difference]: Finished difference. Result has 762 places, 754 transitions, 1704 flow [2021-06-10 11:40:00,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=760, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1704, PETRI_PLACES=762, PETRI_TRANSITIONS=754} [2021-06-10 11:40:00,265 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -13 predicate places. [2021-06-10 11:40:00,265 INFO L480 AbstractCegarLoop]: Abstraction has has 762 places, 754 transitions, 1704 flow [2021-06-10 11:40:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,265 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:00,265 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:00,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2021-06-10 11:40:00,265 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2136011536, now seen corresponding path program 1 times [2021-06-10 11:40:00,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:00,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45426970] [2021-06-10 11:40:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:00,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:00,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:00,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45426970] [2021-06-10 11:40:00,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:00,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:00,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374328999] [2021-06-10 11:40:00,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:00,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:00,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:00,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 754 transitions, 1704 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:00,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:00,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:00,508 INFO L129 PetriNetUnfolder]: 70/860 cut-off events. [2021-06-10 11:40:00,508 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:00,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 860 events. 70/860 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3521 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 977. Up to 30 conditions per place. [2021-06-10 11:40:00,554 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/755 dead transitions. [2021-06-10 11:40:00,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 755 transitions, 1720 flow [2021-06-10 11:40:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:00,556 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:00,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:00,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:00,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:00,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:00,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,558 INFO L185 Difference]: Start difference. First operand has 762 places, 754 transitions, 1704 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:00,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 755 transitions, 1720 flow [2021-06-10 11:40:00,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 755 transitions, 1719 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:00,564 INFO L241 Difference]: Finished difference. Result has 765 places, 755 transitions, 1717 flow [2021-06-10 11:40:00,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1717, PETRI_PLACES=765, PETRI_TRANSITIONS=755} [2021-06-10 11:40:00,565 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -10 predicate places. [2021-06-10 11:40:00,565 INFO L480 AbstractCegarLoop]: Abstraction has has 765 places, 755 transitions, 1717 flow [2021-06-10 11:40:00,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:00,565 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:00,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2021-06-10 11:40:00,565 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2136010513, now seen corresponding path program 1 times [2021-06-10 11:40:00,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:00,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992337234] [2021-06-10 11:40:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:00,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:00,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:00,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992337234] [2021-06-10 11:40:00,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:00,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:00,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627099535] [2021-06-10 11:40:00,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:00,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:00,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:00,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 765 places, 755 transitions, 1717 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:00,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:00,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:00,819 INFO L129 PetriNetUnfolder]: 70/861 cut-off events. [2021-06-10 11:40:00,819 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:00,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 861 events. 70/861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3529 event pairs, 0 based on Foata normal form. 0/761 useless extension candidates. Maximal degree in co-relation 985. Up to 30 conditions per place. [2021-06-10 11:40:00,866 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/756 dead transitions. [2021-06-10 11:40:00,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 756 transitions, 1743 flow [2021-06-10 11:40:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:00,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:00,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:00,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:00,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:00,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:00,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,869 INFO L185 Difference]: Start difference. First operand has 765 places, 755 transitions, 1717 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:00,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 767 places, 756 transitions, 1743 flow [2021-06-10 11:40:00,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 766 places, 756 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:00,876 INFO L241 Difference]: Finished difference. Result has 768 places, 756 transitions, 1733 flow [2021-06-10 11:40:00,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=764, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1733, PETRI_PLACES=768, PETRI_TRANSITIONS=756} [2021-06-10 11:40:00,876 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -7 predicate places. [2021-06-10 11:40:00,876 INFO L480 AbstractCegarLoop]: Abstraction has has 768 places, 756 transitions, 1733 flow [2021-06-10 11:40:00,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,876 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:00,876 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:00,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2021-06-10 11:40:00,876 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2136964848, now seen corresponding path program 1 times [2021-06-10 11:40:00,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:00,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274550930] [2021-06-10 11:40:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:00,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:00,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:00,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:00,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274550930] [2021-06-10 11:40:00,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:00,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:00,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145817733] [2021-06-10 11:40:00,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:00,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:00,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:00,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 768 places, 756 transitions, 1733 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:00,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:00,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:00,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:01,129 INFO L129 PetriNetUnfolder]: 69/858 cut-off events. [2021-06-10 11:40:01,129 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:40:01,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 858 events. 69/858 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3514 event pairs, 0 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 984. Up to 30 conditions per place. [2021-06-10 11:40:01,175 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 9 selfloop transitions, 1 changer transitions 0/754 dead transitions. [2021-06-10 11:40:01,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 770 places, 754 transitions, 1741 flow [2021-06-10 11:40:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2298 transitions. [2021-06-10 11:40:01,177 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195678271308524 [2021-06-10 11:40:01,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2298 transitions. [2021-06-10 11:40:01,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2298 transitions. [2021-06-10 11:40:01,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:01,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2298 transitions. [2021-06-10 11:40:01,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,179 INFO L185 Difference]: Start difference. First operand has 768 places, 756 transitions, 1733 flow. Second operand 3 states and 2298 transitions. [2021-06-10 11:40:01,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 770 places, 754 transitions, 1741 flow [2021-06-10 11:40:01,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 769 places, 754 transitions, 1740 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:01,186 INFO L241 Difference]: Finished difference. Result has 769 places, 754 transitions, 1722 flow [2021-06-10 11:40:01,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=767, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1722, PETRI_PLACES=769, PETRI_TRANSITIONS=754} [2021-06-10 11:40:01,186 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -6 predicate places. [2021-06-10 11:40:01,186 INFO L480 AbstractCegarLoop]: Abstraction has has 769 places, 754 transitions, 1722 flow [2021-06-10 11:40:01,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:01,186 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:01,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2021-06-10 11:40:01,186 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2136963825, now seen corresponding path program 1 times [2021-06-10 11:40:01,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:01,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321129896] [2021-06-10 11:40:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:01,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:01,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:01,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321129896] [2021-06-10 11:40:01,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:01,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:01,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984283285] [2021-06-10 11:40:01,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:01,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:01,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:01,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 754 transitions, 1722 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:01,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:01,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:01,448 INFO L129 PetriNetUnfolder]: 69/855 cut-off events. [2021-06-10 11:40:01,448 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:01,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 855 events. 69/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3490 event pairs, 0 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 978. Up to 30 conditions per place. [2021-06-10 11:40:01,500 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/751 dead transitions. [2021-06-10 11:40:01,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 751 transitions, 1723 flow [2021-06-10 11:40:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:01,502 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:01,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:01,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:01,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:01,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:01,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,504 INFO L185 Difference]: Start difference. First operand has 769 places, 754 transitions, 1722 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:01,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 751 transitions, 1723 flow [2021-06-10 11:40:01,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 766 places, 751 transitions, 1718 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:01,511 INFO L241 Difference]: Finished difference. Result has 766 places, 751 transitions, 1708 flow [2021-06-10 11:40:01,511 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=764, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1708, PETRI_PLACES=766, PETRI_TRANSITIONS=751} [2021-06-10 11:40:01,511 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -9 predicate places. [2021-06-10 11:40:01,511 INFO L480 AbstractCegarLoop]: Abstraction has has 766 places, 751 transitions, 1708 flow [2021-06-10 11:40:01,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,512 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:01,512 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:01,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2021-06-10 11:40:01,512 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 845636226, now seen corresponding path program 1 times [2021-06-10 11:40:01,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:01,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951718670] [2021-06-10 11:40:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:01,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:01,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:01,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951718670] [2021-06-10 11:40:01,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:01,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:01,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313360039] [2021-06-10 11:40:01,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:01,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:01,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:01,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:01,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 766 places, 751 transitions, 1708 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:01,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:01,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:01,768 INFO L129 PetriNetUnfolder]: 68/863 cut-off events. [2021-06-10 11:40:01,768 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:01,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 863 events. 68/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3560 event pairs, 0 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 995. Up to 30 conditions per place. [2021-06-10 11:40:01,818 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/753 dead transitions. [2021-06-10 11:40:01,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 768 places, 753 transitions, 1738 flow [2021-06-10 11:40:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:01,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:01,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:01,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:01,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:01,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:01,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,822 INFO L185 Difference]: Start difference. First operand has 766 places, 751 transitions, 1708 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 768 places, 753 transitions, 1738 flow [2021-06-10 11:40:01,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 767 places, 753 transitions, 1737 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:01,829 INFO L241 Difference]: Finished difference. Result has 769 places, 753 transitions, 1731 flow [2021-06-10 11:40:01,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=765, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1731, PETRI_PLACES=769, PETRI_TRANSITIONS=753} [2021-06-10 11:40:01,829 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -6 predicate places. [2021-06-10 11:40:01,829 INFO L480 AbstractCegarLoop]: Abstraction has has 769 places, 753 transitions, 1731 flow [2021-06-10 11:40:01,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:01,829 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:01,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2021-06-10 11:40:01,829 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 845635203, now seen corresponding path program 1 times [2021-06-10 11:40:01,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:01,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504518345] [2021-06-10 11:40:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:01,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:01,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:01,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:01,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504518345] [2021-06-10 11:40:01,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:01,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:01,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623192059] [2021-06-10 11:40:01,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:01,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:01,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:01,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:01,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 753 transitions, 1731 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:01,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:01,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:01,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:02,155 INFO L129 PetriNetUnfolder]: 66/864 cut-off events. [2021-06-10 11:40:02,155 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:02,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 864 events. 66/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3582 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 993. Up to 30 conditions per place. [2021-06-10 11:40:02,208 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/753 dead transitions. [2021-06-10 11:40:02,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 753 transitions, 1743 flow [2021-06-10 11:40:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:02,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:02,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:02,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:02,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:02,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:02,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,213 INFO L185 Difference]: Start difference. First operand has 769 places, 753 transitions, 1731 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:02,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 771 places, 753 transitions, 1743 flow [2021-06-10 11:40:02,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 770 places, 753 transitions, 1738 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:02,219 INFO L241 Difference]: Finished difference. Result has 771 places, 752 transitions, 1727 flow [2021-06-10 11:40:02,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=768, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1727, PETRI_PLACES=771, PETRI_TRANSITIONS=752} [2021-06-10 11:40:02,220 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -4 predicate places. [2021-06-10 11:40:02,220 INFO L480 AbstractCegarLoop]: Abstraction has has 771 places, 752 transitions, 1727 flow [2021-06-10 11:40:02,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:02,220 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:02,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2021-06-10 11:40:02,220 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 844682914, now seen corresponding path program 1 times [2021-06-10 11:40:02,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:02,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239203578] [2021-06-10 11:40:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:02,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:02,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:02,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239203578] [2021-06-10 11:40:02,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:02,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:02,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013758836] [2021-06-10 11:40:02,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:02,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:02,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:02,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:02,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 752 transitions, 1727 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:02,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:02,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:02,482 INFO L129 PetriNetUnfolder]: 66/857 cut-off events. [2021-06-10 11:40:02,483 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:02,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 857 events. 66/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3522 event pairs, 0 based on Foata normal form. 1/764 useless extension candidates. Maximal degree in co-relation 987. Up to 30 conditions per place. [2021-06-10 11:40:02,532 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/750 dead transitions. [2021-06-10 11:40:02,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 750 transitions, 1730 flow [2021-06-10 11:40:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:02,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:02,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:02,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:02,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:02,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:02,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,536 INFO L185 Difference]: Start difference. First operand has 771 places, 752 transitions, 1727 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:02,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 750 transitions, 1730 flow [2021-06-10 11:40:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 770 places, 750 transitions, 1723 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:02,543 INFO L241 Difference]: Finished difference. Result has 771 places, 750 transitions, 1716 flow [2021-06-10 11:40:02,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=768, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1716, PETRI_PLACES=771, PETRI_TRANSITIONS=750} [2021-06-10 11:40:02,543 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -4 predicate places. [2021-06-10 11:40:02,543 INFO L480 AbstractCegarLoop]: Abstraction has has 771 places, 750 transitions, 1716 flow [2021-06-10 11:40:02,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:02,544 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:02,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2021-06-10 11:40:02,544 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:02,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash 844681891, now seen corresponding path program 1 times [2021-06-10 11:40:02,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:02,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432875399] [2021-06-10 11:40:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:02,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:02,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:02,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432875399] [2021-06-10 11:40:02,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:02,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:02,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809491660] [2021-06-10 11:40:02,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:02,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:02,563 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:02,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 750 transitions, 1716 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:02,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:02,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:02,806 INFO L129 PetriNetUnfolder]: 66/855 cut-off events. [2021-06-10 11:40:02,807 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:02,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 855 events. 66/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3508 event pairs, 0 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 987. Up to 30 conditions per place. [2021-06-10 11:40:02,854 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/748 dead transitions. [2021-06-10 11:40:02,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 771 places, 748 transitions, 1729 flow [2021-06-10 11:40:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:02,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:02,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:02,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:02,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:02,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:02,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,858 INFO L185 Difference]: Start difference. First operand has 771 places, 750 transitions, 1716 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:02,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 771 places, 748 transitions, 1729 flow [2021-06-10 11:40:02,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 770 places, 748 transitions, 1728 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:02,865 INFO L241 Difference]: Finished difference. Result has 770 places, 748 transitions, 1712 flow [2021-06-10 11:40:02,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=768, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1712, PETRI_PLACES=770, PETRI_TRANSITIONS=748} [2021-06-10 11:40:02,865 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -5 predicate places. [2021-06-10 11:40:02,865 INFO L480 AbstractCegarLoop]: Abstraction has has 770 places, 748 transitions, 1712 flow [2021-06-10 11:40:02,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:02,865 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:02,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2021-06-10 11:40:02,865 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1535280181, now seen corresponding path program 1 times [2021-06-10 11:40:02,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:02,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36647078] [2021-06-10 11:40:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:02,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:02,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:02,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:02,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36647078] [2021-06-10 11:40:02,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:02,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:02,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946168036] [2021-06-10 11:40:02,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:02,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:02,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:02,883 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:02,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 748 transitions, 1712 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:02,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:02,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:02,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:03,125 INFO L129 PetriNetUnfolder]: 64/860 cut-off events. [2021-06-10 11:40:03,125 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:03,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 860 events. 64/860 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3559 event pairs, 0 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 990. Up to 30 conditions per place. [2021-06-10 11:40:03,167 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/749 dead transitions. [2021-06-10 11:40:03,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 749 transitions, 1728 flow [2021-06-10 11:40:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:03,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:03,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:03,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:03,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:03,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:03,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,171 INFO L185 Difference]: Start difference. First operand has 770 places, 748 transitions, 1712 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:03,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 772 places, 749 transitions, 1728 flow [2021-06-10 11:40:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 749 transitions, 1727 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:03,177 INFO L241 Difference]: Finished difference. Result has 773 places, 749 transitions, 1725 flow [2021-06-10 11:40:03,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1725, PETRI_PLACES=773, PETRI_TRANSITIONS=749} [2021-06-10 11:40:03,178 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -2 predicate places. [2021-06-10 11:40:03,178 INFO L480 AbstractCegarLoop]: Abstraction has has 773 places, 749 transitions, 1725 flow [2021-06-10 11:40:03,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:03,178 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:03,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2021-06-10 11:40:03,178 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1535279158, now seen corresponding path program 1 times [2021-06-10 11:40:03,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:03,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378819170] [2021-06-10 11:40:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:03,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:03,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:03,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378819170] [2021-06-10 11:40:03,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:03,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:03,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520957794] [2021-06-10 11:40:03,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:03,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:03,196 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:03,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 749 transitions, 1725 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:03,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:03,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:03,439 INFO L129 PetriNetUnfolder]: 64/861 cut-off events. [2021-06-10 11:40:03,439 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:03,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 861 events. 64/861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3568 event pairs, 0 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 998. Up to 30 conditions per place. [2021-06-10 11:40:03,492 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/750 dead transitions. [2021-06-10 11:40:03,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 750 transitions, 1751 flow [2021-06-10 11:40:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:03,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:03,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:03,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:03,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:03,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:03,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,496 INFO L185 Difference]: Start difference. First operand has 773 places, 749 transitions, 1725 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:03,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 750 transitions, 1751 flow [2021-06-10 11:40:03,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 774 places, 750 transitions, 1749 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:03,503 INFO L241 Difference]: Finished difference. Result has 776 places, 750 transitions, 1741 flow [2021-06-10 11:40:03,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=772, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1741, PETRI_PLACES=776, PETRI_TRANSITIONS=750} [2021-06-10 11:40:03,503 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 1 predicate places. [2021-06-10 11:40:03,503 INFO L480 AbstractCegarLoop]: Abstraction has has 776 places, 750 transitions, 1741 flow [2021-06-10 11:40:03,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,503 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:03,503 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:03,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2021-06-10 11:40:03,504 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1536233493, now seen corresponding path program 1 times [2021-06-10 11:40:03,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:03,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763304188] [2021-06-10 11:40:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:03,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:03,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:03,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763304188] [2021-06-10 11:40:03,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:03,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:03,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664924156] [2021-06-10 11:40:03,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:03,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:03,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:03,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:03,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 750 transitions, 1741 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:03,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:03,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:03,770 INFO L129 PetriNetUnfolder]: 63/858 cut-off events. [2021-06-10 11:40:03,770 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:40:03,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 858 events. 63/858 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3550 event pairs, 0 based on Foata normal form. 2/768 useless extension candidates. Maximal degree in co-relation 997. Up to 30 conditions per place. [2021-06-10 11:40:03,822 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 9 selfloop transitions, 1 changer transitions 0/748 dead transitions. [2021-06-10 11:40:03,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 748 transitions, 1749 flow [2021-06-10 11:40:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2298 transitions. [2021-06-10 11:40:03,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195678271308524 [2021-06-10 11:40:03,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2298 transitions. [2021-06-10 11:40:03,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2298 transitions. [2021-06-10 11:40:03,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:03,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2298 transitions. [2021-06-10 11:40:03,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.0) internal successors, (2298), 3 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,825 INFO L185 Difference]: Start difference. First operand has 776 places, 750 transitions, 1741 flow. Second operand 3 states and 2298 transitions. [2021-06-10 11:40:03,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 748 transitions, 1749 flow [2021-06-10 11:40:03,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 748 transitions, 1748 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:03,832 INFO L241 Difference]: Finished difference. Result has 777 places, 748 transitions, 1730 flow [2021-06-10 11:40:03,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1730, PETRI_PLACES=777, PETRI_TRANSITIONS=748} [2021-06-10 11:40:03,832 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 2 predicate places. [2021-06-10 11:40:03,832 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 748 transitions, 1730 flow [2021-06-10 11:40:03,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:03,833 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:03,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2021-06-10 11:40:03,833 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1536232470, now seen corresponding path program 1 times [2021-06-10 11:40:03,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:03,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837757912] [2021-06-10 11:40:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:03,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:03,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:03,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:03,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837757912] [2021-06-10 11:40:03,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:03,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:03,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983323022] [2021-06-10 11:40:03,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:03,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:03,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:03,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:03,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 748 transitions, 1730 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:03,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:03,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:03,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:04,091 INFO L129 PetriNetUnfolder]: 63/855 cut-off events. [2021-06-10 11:40:04,092 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:04,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 855 events. 63/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3526 event pairs, 0 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 991. Up to 30 conditions per place. [2021-06-10 11:40:04,142 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/745 dead transitions. [2021-06-10 11:40:04,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 745 transitions, 1731 flow [2021-06-10 11:40:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:04,143 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:04,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:04,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:04,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:04,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:04,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,146 INFO L185 Difference]: Start difference. First operand has 777 places, 748 transitions, 1730 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:04,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 745 transitions, 1731 flow [2021-06-10 11:40:04,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 774 places, 745 transitions, 1726 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:04,153 INFO L241 Difference]: Finished difference. Result has 774 places, 745 transitions, 1716 flow [2021-06-10 11:40:04,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=772, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1716, PETRI_PLACES=774, PETRI_TRANSITIONS=745} [2021-06-10 11:40:04,153 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, -1 predicate places. [2021-06-10 11:40:04,154 INFO L480 AbstractCegarLoop]: Abstraction has has 774 places, 745 transitions, 1716 flow [2021-06-10 11:40:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:04,154 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:04,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2021-06-10 11:40:04,154 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337897, now seen corresponding path program 1 times [2021-06-10 11:40:04,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:04,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823635187] [2021-06-10 11:40:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:04,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:04,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:04,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823635187] [2021-06-10 11:40:04,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:04,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:04,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026875157] [2021-06-10 11:40:04,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:04,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:04,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:04,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 745 transitions, 1716 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:04,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:04,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:04,435 INFO L129 PetriNetUnfolder]: 62/863 cut-off events. [2021-06-10 11:40:04,436 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:04,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 863 events. 62/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3596 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1008. Up to 30 conditions per place. [2021-06-10 11:40:04,485 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/747 dead transitions. [2021-06-10 11:40:04,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 747 transitions, 1746 flow [2021-06-10 11:40:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:04,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:04,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:04,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:04,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:04,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:04,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,489 INFO L185 Difference]: Start difference. First operand has 774 places, 745 transitions, 1716 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:04,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 747 transitions, 1746 flow [2021-06-10 11:40:04,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 747 transitions, 1745 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:04,496 INFO L241 Difference]: Finished difference. Result has 777 places, 747 transitions, 1739 flow [2021-06-10 11:40:04,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=773, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1739, PETRI_PLACES=777, PETRI_TRANSITIONS=747} [2021-06-10 11:40:04,496 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 2 predicate places. [2021-06-10 11:40:04,496 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 747 transitions, 1739 flow [2021-06-10 11:40:04,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:04,496 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:04,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2021-06-10 11:40:04,496 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1101336874, now seen corresponding path program 1 times [2021-06-10 11:40:04,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:04,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107641265] [2021-06-10 11:40:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:04,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:04,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:04,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107641265] [2021-06-10 11:40:04,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:04,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:04,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891901025] [2021-06-10 11:40:04,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:04,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:04,516 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:04,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 747 transitions, 1739 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:04,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:04,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:04,788 INFO L129 PetriNetUnfolder]: 60/864 cut-off events. [2021-06-10 11:40:04,788 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:04,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 864 events. 60/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3620 event pairs, 0 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1006. Up to 30 conditions per place. [2021-06-10 11:40:04,828 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/747 dead transitions. [2021-06-10 11:40:04,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 747 transitions, 1751 flow [2021-06-10 11:40:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:04,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:04,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:04,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:04,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:04,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:04,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,832 INFO L185 Difference]: Start difference. First operand has 777 places, 747 transitions, 1739 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:04,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 747 transitions, 1751 flow [2021-06-10 11:40:04,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 747 transitions, 1746 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:04,838 INFO L241 Difference]: Finished difference. Result has 779 places, 746 transitions, 1735 flow [2021-06-10 11:40:04,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1735, PETRI_PLACES=779, PETRI_TRANSITIONS=746} [2021-06-10 11:40:04,838 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 4 predicate places. [2021-06-10 11:40:04,838 INFO L480 AbstractCegarLoop]: Abstraction has has 779 places, 746 transitions, 1735 flow [2021-06-10 11:40:04,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,838 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:04,838 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:04,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2021-06-10 11:40:04,838 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1100384585, now seen corresponding path program 1 times [2021-06-10 11:40:04,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:04,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534162570] [2021-06-10 11:40:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:04,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:04,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:04,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:04,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534162570] [2021-06-10 11:40:04,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:04,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:04,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727267422] [2021-06-10 11:40:04,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:04,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:04,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:04,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 746 transitions, 1735 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:04,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:04,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:04,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:05,097 INFO L129 PetriNetUnfolder]: 60/857 cut-off events. [2021-06-10 11:40:05,097 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:05,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 857 events. 60/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3558 event pairs, 0 based on Foata normal form. 1/770 useless extension candidates. Maximal degree in co-relation 1000. Up to 30 conditions per place. [2021-06-10 11:40:05,145 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/744 dead transitions. [2021-06-10 11:40:05,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 744 transitions, 1738 flow [2021-06-10 11:40:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:05,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:05,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:05,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:05,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:05,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:05,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,151 INFO L185 Difference]: Start difference. First operand has 779 places, 746 transitions, 1735 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:05,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 744 transitions, 1738 flow [2021-06-10 11:40:05,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 744 transitions, 1731 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:05,158 INFO L241 Difference]: Finished difference. Result has 779 places, 744 transitions, 1724 flow [2021-06-10 11:40:05,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1724, PETRI_PLACES=779, PETRI_TRANSITIONS=744} [2021-06-10 11:40:05,158 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 4 predicate places. [2021-06-10 11:40:05,158 INFO L480 AbstractCegarLoop]: Abstraction has has 779 places, 744 transitions, 1724 flow [2021-06-10 11:40:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:05,158 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:05,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2021-06-10 11:40:05,158 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1100383562, now seen corresponding path program 1 times [2021-06-10 11:40:05,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:05,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980136791] [2021-06-10 11:40:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:05,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:05,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:05,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980136791] [2021-06-10 11:40:05,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:05,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:05,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908526831] [2021-06-10 11:40:05,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:05,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:05,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:05,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 744 transitions, 1724 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:05,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:05,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:05,416 INFO L129 PetriNetUnfolder]: 60/855 cut-off events. [2021-06-10 11:40:05,416 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:05,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 855 events. 60/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3544 event pairs, 0 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1000. Up to 30 conditions per place. [2021-06-10 11:40:05,462 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/742 dead transitions. [2021-06-10 11:40:05,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 742 transitions, 1737 flow [2021-06-10 11:40:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:05,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:05,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:05,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:05,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:05,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:05,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,466 INFO L185 Difference]: Start difference. First operand has 779 places, 744 transitions, 1724 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:05,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 742 transitions, 1737 flow [2021-06-10 11:40:05,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 742 transitions, 1736 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:05,473 INFO L241 Difference]: Finished difference. Result has 778 places, 742 transitions, 1720 flow [2021-06-10 11:40:05,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=776, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1720, PETRI_PLACES=778, PETRI_TRANSITIONS=742} [2021-06-10 11:40:05,473 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 3 predicate places. [2021-06-10 11:40:05,473 INFO L480 AbstractCegarLoop]: Abstraction has has 778 places, 742 transitions, 1720 flow [2021-06-10 11:40:05,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:05,473 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:05,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2021-06-10 11:40:05,473 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1768182367, now seen corresponding path program 1 times [2021-06-10 11:40:05,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:05,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479700882] [2021-06-10 11:40:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:05,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:05,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:05,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479700882] [2021-06-10 11:40:05,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:05,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:05,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120643554] [2021-06-10 11:40:05,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:05,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:05,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:05,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 742 transitions, 1720 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:05,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:05,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:05,754 INFO L129 PetriNetUnfolder]: 59/863 cut-off events. [2021-06-10 11:40:05,754 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:05,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 863 events. 59/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3613 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1012. Up to 30 conditions per place. [2021-06-10 11:40:05,806 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/744 dead transitions. [2021-06-10 11:40:05,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 744 transitions, 1750 flow [2021-06-10 11:40:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:05,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:05,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:05,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:05,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:05,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:05,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,812 INFO L185 Difference]: Start difference. First operand has 778 places, 742 transitions, 1720 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:05,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 744 transitions, 1750 flow [2021-06-10 11:40:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 779 places, 744 transitions, 1749 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:05,819 INFO L241 Difference]: Finished difference. Result has 781 places, 744 transitions, 1743 flow [2021-06-10 11:40:05,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=777, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1743, PETRI_PLACES=781, PETRI_TRANSITIONS=744} [2021-06-10 11:40:05,819 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 6 predicate places. [2021-06-10 11:40:05,819 INFO L480 AbstractCegarLoop]: Abstraction has has 781 places, 744 transitions, 1743 flow [2021-06-10 11:40:05,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:05,819 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:05,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2021-06-10 11:40:05,820 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1768183390, now seen corresponding path program 1 times [2021-06-10 11:40:05,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:05,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783222102] [2021-06-10 11:40:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:05,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:05,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:05,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:05,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783222102] [2021-06-10 11:40:05,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:05,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:05,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110248645] [2021-06-10 11:40:05,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:05,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:05,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:05,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 744 transitions, 1743 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:05,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:05,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:05,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:06,095 INFO L129 PetriNetUnfolder]: 58/861 cut-off events. [2021-06-10 11:40:06,096 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:06,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 861 events. 58/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3604 event pairs, 0 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1009. Up to 30 conditions per place. [2021-06-10 11:40:06,142 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/744 dead transitions. [2021-06-10 11:40:06,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 744 transitions, 1755 flow [2021-06-10 11:40:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:06,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:06,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:06,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:06,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:06,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:06,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,146 INFO L185 Difference]: Start difference. First operand has 781 places, 744 transitions, 1743 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:06,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 744 transitions, 1755 flow [2021-06-10 11:40:06,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 782 places, 744 transitions, 1750 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:06,153 INFO L241 Difference]: Finished difference. Result has 784 places, 744 transitions, 1748 flow [2021-06-10 11:40:06,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1748, PETRI_PLACES=784, PETRI_TRANSITIONS=744} [2021-06-10 11:40:06,153 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 9 predicate places. [2021-06-10 11:40:06,153 INFO L480 AbstractCegarLoop]: Abstraction has has 784 places, 744 transitions, 1748 flow [2021-06-10 11:40:06,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:06,154 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:06,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2021-06-10 11:40:06,154 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1769135679, now seen corresponding path program 1 times [2021-06-10 11:40:06,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:06,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382788142] [2021-06-10 11:40:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:06,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:06,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:06,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382788142] [2021-06-10 11:40:06,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:06,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:06,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853645252] [2021-06-10 11:40:06,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:06,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:06,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:06,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 784 places, 744 transitions, 1748 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:06,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:06,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:06,443 INFO L129 PetriNetUnfolder]: 57/857 cut-off events. [2021-06-10 11:40:06,443 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:06,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 857 events. 57/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3575 event pairs, 0 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 1006. Up to 30 conditions per place. [2021-06-10 11:40:06,482 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/741 dead transitions. [2021-06-10 11:40:06,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 741 transitions, 1745 flow [2021-06-10 11:40:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:06,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:06,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:06,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:06,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:06,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:06,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,496 INFO L185 Difference]: Start difference. First operand has 784 places, 744 transitions, 1748 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:06,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 741 transitions, 1745 flow [2021-06-10 11:40:06,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 783 places, 741 transitions, 1738 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:06,502 INFO L241 Difference]: Finished difference. Result has 783 places, 741 transitions, 1728 flow [2021-06-10 11:40:06,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=781, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=783, PETRI_TRANSITIONS=741} [2021-06-10 11:40:06,503 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 8 predicate places. [2021-06-10 11:40:06,503 INFO L480 AbstractCegarLoop]: Abstraction has has 783 places, 741 transitions, 1728 flow [2021-06-10 11:40:06,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,503 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:06,503 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:06,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2021-06-10 11:40:06,503 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1769136702, now seen corresponding path program 1 times [2021-06-10 11:40:06,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:06,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367137896] [2021-06-10 11:40:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:06,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:06,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:06,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367137896] [2021-06-10 11:40:06,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:06,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:06,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072477408] [2021-06-10 11:40:06,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:06,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:06,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:06,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 741 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:06,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:06,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:06,775 INFO L129 PetriNetUnfolder]: 57/855 cut-off events. [2021-06-10 11:40:06,775 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:06,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 855 events. 57/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3561 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1007. Up to 30 conditions per place. [2021-06-10 11:40:06,823 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/739 dead transitions. [2021-06-10 11:40:06,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 739 transitions, 1741 flow [2021-06-10 11:40:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:06,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:06,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:06,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:06,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:06,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:06,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,827 INFO L185 Difference]: Start difference. First operand has 783 places, 741 transitions, 1728 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:06,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 739 transitions, 1741 flow [2021-06-10 11:40:06,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 782 places, 739 transitions, 1740 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:06,833 INFO L241 Difference]: Finished difference. Result has 782 places, 739 transitions, 1724 flow [2021-06-10 11:40:06,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1724, PETRI_PLACES=782, PETRI_TRANSITIONS=739} [2021-06-10 11:40:06,834 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 7 predicate places. [2021-06-10 11:40:06,834 INFO L480 AbstractCegarLoop]: Abstraction has has 782 places, 739 transitions, 1724 flow [2021-06-10 11:40:06,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:06,834 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:06,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2021-06-10 11:40:06,834 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1960815828, now seen corresponding path program 1 times [2021-06-10 11:40:06,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:06,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606937859] [2021-06-10 11:40:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:06,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:06,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:06,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:06,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606937859] [2021-06-10 11:40:06,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:06,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:06,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836573075] [2021-06-10 11:40:06,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:06,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:06,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:06,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:06,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 782 places, 739 transitions, 1724 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:06,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:06,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:06,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:07,110 INFO L129 PetriNetUnfolder]: 56/863 cut-off events. [2021-06-10 11:40:07,110 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:07,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 863 events. 56/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3631 event pairs, 0 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1019. Up to 30 conditions per place. [2021-06-10 11:40:07,158 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/741 dead transitions. [2021-06-10 11:40:07,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 741 transitions, 1754 flow [2021-06-10 11:40:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:07,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:07,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:07,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:07,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:07,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:07,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,161 INFO L185 Difference]: Start difference. First operand has 782 places, 739 transitions, 1724 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:07,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 784 places, 741 transitions, 1754 flow [2021-06-10 11:40:07,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 783 places, 741 transitions, 1753 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:07,168 INFO L241 Difference]: Finished difference. Result has 785 places, 741 transitions, 1747 flow [2021-06-10 11:40:07,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=781, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1747, PETRI_PLACES=785, PETRI_TRANSITIONS=741} [2021-06-10 11:40:07,168 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 10 predicate places. [2021-06-10 11:40:07,168 INFO L480 AbstractCegarLoop]: Abstraction has has 785 places, 741 transitions, 1747 flow [2021-06-10 11:40:07,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,169 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:07,169 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:07,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2021-06-10 11:40:07,169 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1960814805, now seen corresponding path program 1 times [2021-06-10 11:40:07,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:07,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190508905] [2021-06-10 11:40:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:07,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:07,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:07,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190508905] [2021-06-10 11:40:07,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:07,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:07,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755326740] [2021-06-10 11:40:07,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:07,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:07,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:07,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:07,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 785 places, 741 transitions, 1747 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:07,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:07,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:07,444 INFO L129 PetriNetUnfolder]: 54/864 cut-off events. [2021-06-10 11:40:07,444 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:07,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 864 events. 54/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3655 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1019. Up to 30 conditions per place. [2021-06-10 11:40:07,491 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/741 dead transitions. [2021-06-10 11:40:07,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 741 transitions, 1759 flow [2021-06-10 11:40:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:07,492 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:07,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:07,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:07,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:07,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:07,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,495 INFO L185 Difference]: Start difference. First operand has 785 places, 741 transitions, 1747 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:07,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 741 transitions, 1759 flow [2021-06-10 11:40:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 741 transitions, 1754 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:07,502 INFO L241 Difference]: Finished difference. Result has 787 places, 740 transitions, 1743 flow [2021-06-10 11:40:07,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=784, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1743, PETRI_PLACES=787, PETRI_TRANSITIONS=740} [2021-06-10 11:40:07,502 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 12 predicate places. [2021-06-10 11:40:07,502 INFO L480 AbstractCegarLoop]: Abstraction has has 787 places, 740 transitions, 1743 flow [2021-06-10 11:40:07,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,503 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:07,503 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:07,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2021-06-10 11:40:07,503 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1959862516, now seen corresponding path program 1 times [2021-06-10 11:40:07,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:07,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528834458] [2021-06-10 11:40:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:07,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:07,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:07,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528834458] [2021-06-10 11:40:07,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:07,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:07,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911982869] [2021-06-10 11:40:07,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:07,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:07,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:07,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 740 transitions, 1743 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:07,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:07,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:07,779 INFO L129 PetriNetUnfolder]: 54/857 cut-off events. [2021-06-10 11:40:07,780 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:07,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 857 events. 54/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3593 event pairs, 0 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 1013. Up to 30 conditions per place. [2021-06-10 11:40:07,824 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/738 dead transitions. [2021-06-10 11:40:07,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 738 transitions, 1746 flow [2021-06-10 11:40:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:07,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:07,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:07,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:07,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:07,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:07,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,828 INFO L185 Difference]: Start difference. First operand has 787 places, 740 transitions, 1743 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:07,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 789 places, 738 transitions, 1746 flow [2021-06-10 11:40:07,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 738 transitions, 1739 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:07,834 INFO L241 Difference]: Finished difference. Result has 787 places, 738 transitions, 1732 flow [2021-06-10 11:40:07,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=784, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1732, PETRI_PLACES=787, PETRI_TRANSITIONS=738} [2021-06-10 11:40:07,835 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 12 predicate places. [2021-06-10 11:40:07,835 INFO L480 AbstractCegarLoop]: Abstraction has has 787 places, 738 transitions, 1732 flow [2021-06-10 11:40:07,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:07,835 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:07,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2021-06-10 11:40:07,835 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1959861493, now seen corresponding path program 1 times [2021-06-10 11:40:07,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:07,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496124371] [2021-06-10 11:40:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:07,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:07,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:07,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:07,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496124371] [2021-06-10 11:40:07,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:07,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:07,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13684166] [2021-06-10 11:40:07,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:07,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:07,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:07,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 738 transitions, 1732 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:07,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:07,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:07,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:08,141 INFO L129 PetriNetUnfolder]: 54/855 cut-off events. [2021-06-10 11:40:08,141 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:08,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 855 events. 54/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3579 event pairs, 0 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 1013. Up to 30 conditions per place. [2021-06-10 11:40:08,180 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2021-06-10 11:40:08,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 736 transitions, 1745 flow [2021-06-10 11:40:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:08,182 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:08,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:08,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:08,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:08,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:08,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,184 INFO L185 Difference]: Start difference. First operand has 787 places, 738 transitions, 1732 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:08,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 736 transitions, 1745 flow [2021-06-10 11:40:08,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 736 transitions, 1744 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:08,190 INFO L241 Difference]: Finished difference. Result has 786 places, 736 transitions, 1728 flow [2021-06-10 11:40:08,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=784, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1728, PETRI_PLACES=786, PETRI_TRANSITIONS=736} [2021-06-10 11:40:08,190 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 11 predicate places. [2021-06-10 11:40:08,190 INFO L480 AbstractCegarLoop]: Abstraction has has 786 places, 736 transitions, 1728 flow [2021-06-10 11:40:08,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:08,191 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:08,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2021-06-10 11:40:08,191 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:08,191 INFO L82 PathProgramCache]: Analyzing trace with hash -814038676, now seen corresponding path program 1 times [2021-06-10 11:40:08,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:08,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111180769] [2021-06-10 11:40:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:08,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:08,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:08,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111180769] [2021-06-10 11:40:08,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:08,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:08,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450688882] [2021-06-10 11:40:08,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:08,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:08,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:08,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 736 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:08,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:08,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:08,461 INFO L129 PetriNetUnfolder]: 53/862 cut-off events. [2021-06-10 11:40:08,461 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:08,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 862 events. 53/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3639 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1018. Up to 30 conditions per place. [2021-06-10 11:40:08,505 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2021-06-10 11:40:08,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 737 transitions, 1744 flow [2021-06-10 11:40:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:08,507 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:08,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:08,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:08,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:08,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:08,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,509 INFO L185 Difference]: Start difference. First operand has 786 places, 736 transitions, 1728 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 737 transitions, 1744 flow [2021-06-10 11:40:08,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 737 transitions, 1743 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:08,515 INFO L241 Difference]: Finished difference. Result has 788 places, 736 transitions, 1732 flow [2021-06-10 11:40:08,516 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1732, PETRI_PLACES=788, PETRI_TRANSITIONS=736} [2021-06-10 11:40:08,516 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 13 predicate places. [2021-06-10 11:40:08,516 INFO L480 AbstractCegarLoop]: Abstraction has has 788 places, 736 transitions, 1732 flow [2021-06-10 11:40:08,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,516 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:08,516 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:08,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2021-06-10 11:40:08,516 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash -814037653, now seen corresponding path program 1 times [2021-06-10 11:40:08,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:08,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706986118] [2021-06-10 11:40:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:08,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:08,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:08,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706986118] [2021-06-10 11:40:08,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:08,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:08,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073184187] [2021-06-10 11:40:08,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:08,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:08,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:08,535 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:08,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 736 transitions, 1732 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:08,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:08,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:08,793 INFO L129 PetriNetUnfolder]: 51/864 cut-off events. [2021-06-10 11:40:08,793 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:08,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 864 events. 51/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3672 event pairs, 0 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1029. Up to 30 conditions per place. [2021-06-10 11:40:08,837 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2021-06-10 11:40:08,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 790 places, 737 transitions, 1758 flow [2021-06-10 11:40:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:08,839 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:08,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:08,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:08,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:08,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:08,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,841 INFO L185 Difference]: Start difference. First operand has 788 places, 736 transitions, 1732 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:08,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 790 places, 737 transitions, 1758 flow [2021-06-10 11:40:08,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 789 places, 737 transitions, 1757 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:08,848 INFO L241 Difference]: Finished difference. Result has 791 places, 737 transitions, 1749 flow [2021-06-10 11:40:08,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1749, PETRI_PLACES=791, PETRI_TRANSITIONS=737} [2021-06-10 11:40:08,848 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 16 predicate places. [2021-06-10 11:40:08,848 INFO L480 AbstractCegarLoop]: Abstraction has has 791 places, 737 transitions, 1749 flow [2021-06-10 11:40:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,848 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:08,848 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:08,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2021-06-10 11:40:08,848 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash -814990965, now seen corresponding path program 1 times [2021-06-10 11:40:08,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:08,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623080998] [2021-06-10 11:40:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:08,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:08,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:08,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:08,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623080998] [2021-06-10 11:40:08,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:08,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:08,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612215622] [2021-06-10 11:40:08,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:08,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:08,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:08,867 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:08,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 737 transitions, 1749 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:08,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:08,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:08,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:09,111 INFO L129 PetriNetUnfolder]: 51/857 cut-off events. [2021-06-10 11:40:09,111 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:09,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 857 events. 51/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3612 event pairs, 0 based on Foata normal form. 1/779 useless extension candidates. Maximal degree in co-relation 1015. Up to 30 conditions per place. [2021-06-10 11:40:09,155 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/735 dead transitions. [2021-06-10 11:40:09,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 735 transitions, 1751 flow [2021-06-10 11:40:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:09,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:09,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:09,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:09,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:09,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:09,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,159 INFO L185 Difference]: Start difference. First operand has 791 places, 737 transitions, 1749 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:09,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 793 places, 735 transitions, 1751 flow [2021-06-10 11:40:09,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 790 places, 735 transitions, 1743 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:09,166 INFO L241 Difference]: Finished difference. Result has 791 places, 735 transitions, 1736 flow [2021-06-10 11:40:09,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=788, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1736, PETRI_PLACES=791, PETRI_TRANSITIONS=735} [2021-06-10 11:40:09,166 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 16 predicate places. [2021-06-10 11:40:09,166 INFO L480 AbstractCegarLoop]: Abstraction has has 791 places, 735 transitions, 1736 flow [2021-06-10 11:40:09,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,167 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:09,167 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:09,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2021-06-10 11:40:09,167 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash -814991988, now seen corresponding path program 1 times [2021-06-10 11:40:09,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:09,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546973415] [2021-06-10 11:40:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:09,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:09,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:09,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546973415] [2021-06-10 11:40:09,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:09,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:09,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493229658] [2021-06-10 11:40:09,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:09,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:09,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:09,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 735 transitions, 1736 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:09,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:09,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:09,430 INFO L129 PetriNetUnfolder]: 51/855 cut-off events. [2021-06-10 11:40:09,430 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:09,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 855 events. 51/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3597 event pairs, 0 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 1019. Up to 30 conditions per place. [2021-06-10 11:40:09,474 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/733 dead transitions. [2021-06-10 11:40:09,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 733 transitions, 1749 flow [2021-06-10 11:40:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:09,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:09,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:09,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:09,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:09,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:09,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,478 INFO L185 Difference]: Start difference. First operand has 791 places, 735 transitions, 1736 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:09,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 791 places, 733 transitions, 1749 flow [2021-06-10 11:40:09,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 790 places, 733 transitions, 1748 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:09,485 INFO L241 Difference]: Finished difference. Result has 790 places, 733 transitions, 1732 flow [2021-06-10 11:40:09,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=788, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1732, PETRI_PLACES=790, PETRI_TRANSITIONS=733} [2021-06-10 11:40:09,485 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 15 predicate places. [2021-06-10 11:40:09,485 INFO L480 AbstractCegarLoop]: Abstraction has has 790 places, 733 transitions, 1732 flow [2021-06-10 11:40:09,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:09,485 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:09,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2021-06-10 11:40:09,486 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 961708964, now seen corresponding path program 1 times [2021-06-10 11:40:09,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:09,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26778077] [2021-06-10 11:40:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:09,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:09,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:09,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26778077] [2021-06-10 11:40:09,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:09,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:09,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122735610] [2021-06-10 11:40:09,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:09,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:09,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:09,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 790 places, 733 transitions, 1732 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:09,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:09,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:09,777 INFO L129 PetriNetUnfolder]: 50/863 cut-off events. [2021-06-10 11:40:09,777 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:09,810 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 863 events. 50/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3665 event pairs, 0 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1031. Up to 30 conditions per place. [2021-06-10 11:40:09,816 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/735 dead transitions. [2021-06-10 11:40:09,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 792 places, 735 transitions, 1762 flow [2021-06-10 11:40:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:09,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:09,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:09,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:09,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:09,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:09,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,820 INFO L185 Difference]: Start difference. First operand has 790 places, 733 transitions, 1732 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:09,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 792 places, 735 transitions, 1762 flow [2021-06-10 11:40:09,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 791 places, 735 transitions, 1761 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:09,826 INFO L241 Difference]: Finished difference. Result has 793 places, 735 transitions, 1755 flow [2021-06-10 11:40:09,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=789, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1755, PETRI_PLACES=793, PETRI_TRANSITIONS=735} [2021-06-10 11:40:09,826 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 18 predicate places. [2021-06-10 11:40:09,827 INFO L480 AbstractCegarLoop]: Abstraction has has 793 places, 735 transitions, 1755 flow [2021-06-10 11:40:09,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:09,827 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:09,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2021-06-10 11:40:09,827 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:09,827 INFO L82 PathProgramCache]: Analyzing trace with hash 961709987, now seen corresponding path program 1 times [2021-06-10 11:40:09,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:09,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137684765] [2021-06-10 11:40:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:09,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:09,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:09,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:09,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137684765] [2021-06-10 11:40:09,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:09,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:09,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727986706] [2021-06-10 11:40:09,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:09,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:09,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:09,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 735 transitions, 1755 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:09,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:09,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:09,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:10,097 INFO L129 PetriNetUnfolder]: 49/861 cut-off events. [2021-06-10 11:40:10,098 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:10,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 861 events. 49/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3655 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1028. Up to 30 conditions per place. [2021-06-10 11:40:10,145 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2021-06-10 11:40:10,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 735 transitions, 1767 flow [2021-06-10 11:40:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:10,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:10,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:10,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:10,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:10,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:10,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,149 INFO L185 Difference]: Start difference. First operand has 793 places, 735 transitions, 1755 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:10,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 735 transitions, 1767 flow [2021-06-10 11:40:10,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 735 transitions, 1762 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:10,156 INFO L241 Difference]: Finished difference. Result has 796 places, 735 transitions, 1760 flow [2021-06-10 11:40:10,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1760, PETRI_PLACES=796, PETRI_TRANSITIONS=735} [2021-06-10 11:40:10,156 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 21 predicate places. [2021-06-10 11:40:10,156 INFO L480 AbstractCegarLoop]: Abstraction has has 796 places, 735 transitions, 1760 flow [2021-06-10 11:40:10,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:10,157 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:10,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2021-06-10 11:40:10,157 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 962662276, now seen corresponding path program 1 times [2021-06-10 11:40:10,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:10,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527442907] [2021-06-10 11:40:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:10,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:10,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:10,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527442907] [2021-06-10 11:40:10,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:10,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:10,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721296314] [2021-06-10 11:40:10,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:10,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:10,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:10,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:10,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 735 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:10,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:10,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:10,424 INFO L129 PetriNetUnfolder]: 48/857 cut-off events. [2021-06-10 11:40:10,424 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:10,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 857 events. 48/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3628 event pairs, 0 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 1025. Up to 30 conditions per place. [2021-06-10 11:40:10,468 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/732 dead transitions. [2021-06-10 11:40:10,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 732 transitions, 1757 flow [2021-06-10 11:40:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:10,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:10,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:10,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:10,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:10,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:10,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,472 INFO L185 Difference]: Start difference. First operand has 796 places, 735 transitions, 1760 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 732 transitions, 1757 flow [2021-06-10 11:40:10,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 732 transitions, 1750 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:10,479 INFO L241 Difference]: Finished difference. Result has 795 places, 732 transitions, 1740 flow [2021-06-10 11:40:10,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1740, PETRI_PLACES=795, PETRI_TRANSITIONS=732} [2021-06-10 11:40:10,479 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 20 predicate places. [2021-06-10 11:40:10,479 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 732 transitions, 1740 flow [2021-06-10 11:40:10,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:10,480 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:10,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2021-06-10 11:40:10,480 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash 962663299, now seen corresponding path program 1 times [2021-06-10 11:40:10,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:10,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462099547] [2021-06-10 11:40:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:10,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:10,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:10,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462099547] [2021-06-10 11:40:10,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:10,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:10,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130851174] [2021-06-10 11:40:10,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:10,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:10,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:10,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 732 transitions, 1740 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:10,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:10,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:10,755 INFO L129 PetriNetUnfolder]: 48/855 cut-off events. [2021-06-10 11:40:10,755 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:10,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 855 events. 48/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3611 event pairs, 0 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1026. Up to 30 conditions per place. [2021-06-10 11:40:10,799 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/730 dead transitions. [2021-06-10 11:40:10,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 730 transitions, 1753 flow [2021-06-10 11:40:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:10,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:10,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:10,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:10,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:10,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:10,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,803 INFO L185 Difference]: Start difference. First operand has 795 places, 732 transitions, 1740 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:10,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 730 transitions, 1753 flow [2021-06-10 11:40:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 730 transitions, 1752 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:10,809 INFO L241 Difference]: Finished difference. Result has 794 places, 730 transitions, 1736 flow [2021-06-10 11:40:10,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1736, PETRI_PLACES=794, PETRI_TRANSITIONS=730} [2021-06-10 11:40:10,809 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 19 predicate places. [2021-06-10 11:40:10,809 INFO L480 AbstractCegarLoop]: Abstraction has has 794 places, 730 transitions, 1736 flow [2021-06-10 11:40:10,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:10,810 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:10,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2021-06-10 11:40:10,810 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1068792764, now seen corresponding path program 1 times [2021-06-10 11:40:10,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:10,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519988069] [2021-06-10 11:40:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:10,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:10,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:10,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:10,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519988069] [2021-06-10 11:40:10,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:10,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:10,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408913260] [2021-06-10 11:40:10,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:10,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:10,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:10,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 730 transitions, 1736 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:10,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:10,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:10,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:11,101 INFO L129 PetriNetUnfolder]: 46/860 cut-off events. [2021-06-10 11:40:11,101 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:11,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 860 events. 46/860 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3663 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1029. Up to 30 conditions per place. [2021-06-10 11:40:11,147 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2021-06-10 11:40:11,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 796 places, 731 transitions, 1752 flow [2021-06-10 11:40:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:11,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:11,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:11,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:11,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:11,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:11,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,150 INFO L185 Difference]: Start difference. First operand has 794 places, 730 transitions, 1736 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:11,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 796 places, 731 transitions, 1752 flow [2021-06-10 11:40:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 731 transitions, 1751 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:11,157 INFO L241 Difference]: Finished difference. Result has 797 places, 731 transitions, 1749 flow [2021-06-10 11:40:11,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1749, PETRI_PLACES=797, PETRI_TRANSITIONS=731} [2021-06-10 11:40:11,157 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 22 predicate places. [2021-06-10 11:40:11,157 INFO L480 AbstractCegarLoop]: Abstraction has has 797 places, 731 transitions, 1749 flow [2021-06-10 11:40:11,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:11,158 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:11,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2021-06-10 11:40:11,158 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1068791741, now seen corresponding path program 1 times [2021-06-10 11:40:11,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:11,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024800191] [2021-06-10 11:40:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:11,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:11,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:11,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024800191] [2021-06-10 11:40:11,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:11,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:11,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508491853] [2021-06-10 11:40:11,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:11,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:11,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:11,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 731 transitions, 1749 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:11,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:11,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:11,438 INFO L129 PetriNetUnfolder]: 46/861 cut-off events. [2021-06-10 11:40:11,438 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:11,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 861 events. 46/861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3671 event pairs, 0 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1037. Up to 30 conditions per place. [2021-06-10 11:40:11,479 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/732 dead transitions. [2021-06-10 11:40:11,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 732 transitions, 1775 flow [2021-06-10 11:40:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:11,480 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:11,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:11,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:11,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:11,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:11,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,482 INFO L185 Difference]: Start difference. First operand has 797 places, 731 transitions, 1749 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:11,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 732 transitions, 1775 flow [2021-06-10 11:40:11,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 732 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:11,489 INFO L241 Difference]: Finished difference. Result has 800 places, 732 transitions, 1765 flow [2021-06-10 11:40:11,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=796, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1765, PETRI_PLACES=800, PETRI_TRANSITIONS=732} [2021-06-10 11:40:11,489 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 25 predicate places. [2021-06-10 11:40:11,489 INFO L480 AbstractCegarLoop]: Abstraction has has 800 places, 732 transitions, 1765 flow [2021-06-10 11:40:11,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,489 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:11,490 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:11,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2021-06-10 11:40:11,490 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1069745053, now seen corresponding path program 1 times [2021-06-10 11:40:11,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:11,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313542337] [2021-06-10 11:40:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:11,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:11,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:11,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313542337] [2021-06-10 11:40:11,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:11,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:11,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458543016] [2021-06-10 11:40:11,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:11,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:11,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:11,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 800 places, 732 transitions, 1765 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:11,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:11,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:11,764 INFO L129 PetriNetUnfolder]: 45/857 cut-off events. [2021-06-10 11:40:11,764 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:11,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 857 events. 45/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3646 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1030. Up to 30 conditions per place. [2021-06-10 11:40:11,811 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/729 dead transitions. [2021-06-10 11:40:11,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 729 transitions, 1762 flow [2021-06-10 11:40:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:11,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:11,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:11,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:11,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:11,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:11,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,820 INFO L185 Difference]: Start difference. First operand has 800 places, 732 transitions, 1765 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:11,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 729 transitions, 1762 flow [2021-06-10 11:40:11,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 799 places, 729 transitions, 1754 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:11,827 INFO L241 Difference]: Finished difference. Result has 799 places, 729 transitions, 1744 flow [2021-06-10 11:40:11,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=797, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1744, PETRI_PLACES=799, PETRI_TRANSITIONS=729} [2021-06-10 11:40:11,828 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 24 predicate places. [2021-06-10 11:40:11,828 INFO L480 AbstractCegarLoop]: Abstraction has has 799 places, 729 transitions, 1744 flow [2021-06-10 11:40:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:11,828 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:11,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2021-06-10 11:40:11,828 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1069746076, now seen corresponding path program 1 times [2021-06-10 11:40:11,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:11,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802797578] [2021-06-10 11:40:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:11,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:11,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:11,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:11,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802797578] [2021-06-10 11:40:11,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:11,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:11,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947803674] [2021-06-10 11:40:11,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:11,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:11,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:11,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 799 places, 729 transitions, 1744 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:11,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:11,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:11,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:12,100 INFO L129 PetriNetUnfolder]: 45/855 cut-off events. [2021-06-10 11:40:12,101 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:12,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 855 events. 45/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3631 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1033. Up to 30 conditions per place. [2021-06-10 11:40:12,145 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/727 dead transitions. [2021-06-10 11:40:12,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 727 transitions, 1757 flow [2021-06-10 11:40:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:12,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:12,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:12,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:12,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:12,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:12,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,149 INFO L185 Difference]: Start difference. First operand has 799 places, 729 transitions, 1744 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:12,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 727 transitions, 1757 flow [2021-06-10 11:40:12,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 727 transitions, 1756 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:12,156 INFO L241 Difference]: Finished difference. Result has 798 places, 727 transitions, 1740 flow [2021-06-10 11:40:12,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=796, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1740, PETRI_PLACES=798, PETRI_TRANSITIONS=727} [2021-06-10 11:40:12,157 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 23 predicate places. [2021-06-10 11:40:12,157 INFO L480 AbstractCegarLoop]: Abstraction has has 798 places, 727 transitions, 1740 flow [2021-06-10 11:40:12,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:12,157 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:12,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2021-06-10 11:40:12,157 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2041737815, now seen corresponding path program 1 times [2021-06-10 11:40:12,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:12,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263896453] [2021-06-10 11:40:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:12,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:12,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:12,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263896453] [2021-06-10 11:40:12,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:12,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:12,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024865539] [2021-06-10 11:40:12,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:12,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:12,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:12,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 727 transitions, 1740 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:12,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:12,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:12,451 INFO L129 PetriNetUnfolder]: 44/863 cut-off events. [2021-06-10 11:40:12,451 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:12,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 863 events. 44/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3699 event pairs, 0 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1045. Up to 30 conditions per place. [2021-06-10 11:40:12,495 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/729 dead transitions. [2021-06-10 11:40:12,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 729 transitions, 1770 flow [2021-06-10 11:40:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:12,497 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:12,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:12,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:12,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:12,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:12,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,499 INFO L185 Difference]: Start difference. First operand has 798 places, 727 transitions, 1740 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:12,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 800 places, 729 transitions, 1770 flow [2021-06-10 11:40:12,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 799 places, 729 transitions, 1769 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:12,506 INFO L241 Difference]: Finished difference. Result has 801 places, 729 transitions, 1763 flow [2021-06-10 11:40:12,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=797, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1763, PETRI_PLACES=801, PETRI_TRANSITIONS=729} [2021-06-10 11:40:12,506 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 26 predicate places. [2021-06-10 11:40:12,506 INFO L480 AbstractCegarLoop]: Abstraction has has 801 places, 729 transitions, 1763 flow [2021-06-10 11:40:12,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,506 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:12,506 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:12,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2021-06-10 11:40:12,507 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:12,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2041738838, now seen corresponding path program 1 times [2021-06-10 11:40:12,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:12,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439887317] [2021-06-10 11:40:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:12,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:12,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:12,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439887317] [2021-06-10 11:40:12,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:12,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:12,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156851840] [2021-06-10 11:40:12,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:12,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:12,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:12,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 729 transitions, 1763 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:12,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:12,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:12,794 INFO L129 PetriNetUnfolder]: 43/861 cut-off events. [2021-06-10 11:40:12,794 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:12,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 861 events. 43/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3687 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1042. Up to 30 conditions per place. [2021-06-10 11:40:12,839 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2021-06-10 11:40:12,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 729 transitions, 1775 flow [2021-06-10 11:40:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:12,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:12,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:12,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:12,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:12,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:12,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,843 INFO L185 Difference]: Start difference. First operand has 801 places, 729 transitions, 1763 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:12,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 729 transitions, 1775 flow [2021-06-10 11:40:12,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 802 places, 729 transitions, 1770 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:12,851 INFO L241 Difference]: Finished difference. Result has 804 places, 729 transitions, 1768 flow [2021-06-10 11:40:12,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1768, PETRI_PLACES=804, PETRI_TRANSITIONS=729} [2021-06-10 11:40:12,851 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 29 predicate places. [2021-06-10 11:40:12,851 INFO L480 AbstractCegarLoop]: Abstraction has has 804 places, 729 transitions, 1768 flow [2021-06-10 11:40:12,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:12,851 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:12,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2021-06-10 11:40:12,851 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2042691127, now seen corresponding path program 1 times [2021-06-10 11:40:12,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:12,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590448042] [2021-06-10 11:40:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:12,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:12,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:12,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:12,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590448042] [2021-06-10 11:40:12,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:12,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:12,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175830796] [2021-06-10 11:40:12,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:12,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:12,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:12,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 729 transitions, 1768 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:12,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:12,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:12,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:13,140 INFO L129 PetriNetUnfolder]: 42/857 cut-off events. [2021-06-10 11:40:13,141 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:13,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 857 events. 42/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3662 event pairs, 0 based on Foata normal form. 1/788 useless extension candidates. Maximal degree in co-relation 1039. Up to 30 conditions per place. [2021-06-10 11:40:13,185 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/726 dead transitions. [2021-06-10 11:40:13,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 726 transitions, 1765 flow [2021-06-10 11:40:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:13,198 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:13,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:13,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:13,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:13,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:13,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,200 INFO L185 Difference]: Start difference. First operand has 804 places, 729 transitions, 1768 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:13,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 726 transitions, 1765 flow [2021-06-10 11:40:13,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 803 places, 726 transitions, 1758 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:13,207 INFO L241 Difference]: Finished difference. Result has 803 places, 726 transitions, 1748 flow [2021-06-10 11:40:13,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=801, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1748, PETRI_PLACES=803, PETRI_TRANSITIONS=726} [2021-06-10 11:40:13,208 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 28 predicate places. [2021-06-10 11:40:13,208 INFO L480 AbstractCegarLoop]: Abstraction has has 803 places, 726 transitions, 1748 flow [2021-06-10 11:40:13,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:13,208 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:13,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2021-06-10 11:40:13,208 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2042692150, now seen corresponding path program 1 times [2021-06-10 11:40:13,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:13,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766355345] [2021-06-10 11:40:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:13,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:13,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:13,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766355345] [2021-06-10 11:40:13,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:13,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:13,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062954364] [2021-06-10 11:40:13,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:13,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:13,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:13,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 803 places, 726 transitions, 1748 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:13,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:13,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:13,485 INFO L129 PetriNetUnfolder]: 42/855 cut-off events. [2021-06-10 11:40:13,485 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:13,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 855 events. 42/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3649 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1040. Up to 30 conditions per place. [2021-06-10 11:40:13,530 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/724 dead transitions. [2021-06-10 11:40:13,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 724 transitions, 1761 flow [2021-06-10 11:40:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:13,532 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:13,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:13,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:13,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:13,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:13,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,534 INFO L185 Difference]: Start difference. First operand has 803 places, 726 transitions, 1748 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 724 transitions, 1761 flow [2021-06-10 11:40:13,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 802 places, 724 transitions, 1760 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:13,541 INFO L241 Difference]: Finished difference. Result has 802 places, 724 transitions, 1744 flow [2021-06-10 11:40:13,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1744, PETRI_PLACES=802, PETRI_TRANSITIONS=724} [2021-06-10 11:40:13,541 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 27 predicate places. [2021-06-10 11:40:13,541 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 724 transitions, 1744 flow [2021-06-10 11:40:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:13,542 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:13,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2021-06-10 11:40:13,542 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1807884017, now seen corresponding path program 1 times [2021-06-10 11:40:13,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:13,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533502375] [2021-06-10 11:40:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:13,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:13,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:13,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533502375] [2021-06-10 11:40:13,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:13,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:13,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787619830] [2021-06-10 11:40:13,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:13,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:13,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:13,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 724 transitions, 1744 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:13,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:13,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:13,835 INFO L129 PetriNetUnfolder]: 40/860 cut-off events. [2021-06-10 11:40:13,835 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:13,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 860 events. 40/860 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3702 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1043. Up to 30 conditions per place. [2021-06-10 11:40:13,881 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2021-06-10 11:40:13,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 725 transitions, 1760 flow [2021-06-10 11:40:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:13,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:13,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:13,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:13,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:13,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:13,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,885 INFO L185 Difference]: Start difference. First operand has 802 places, 724 transitions, 1744 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:13,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 725 transitions, 1760 flow [2021-06-10 11:40:13,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 803 places, 725 transitions, 1759 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:13,892 INFO L241 Difference]: Finished difference. Result has 805 places, 725 transitions, 1757 flow [2021-06-10 11:40:13,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1743, PETRI_DIFFERENCE_MINUEND_PLACES=801, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1757, PETRI_PLACES=805, PETRI_TRANSITIONS=725} [2021-06-10 11:40:13,893 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 30 predicate places. [2021-06-10 11:40:13,893 INFO L480 AbstractCegarLoop]: Abstraction has has 805 places, 725 transitions, 1757 flow [2021-06-10 11:40:13,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:13,893 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:13,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2021-06-10 11:40:13,893 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1807882994, now seen corresponding path program 1 times [2021-06-10 11:40:13,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:13,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100881306] [2021-06-10 11:40:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:13,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:13,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:13,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:13,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100881306] [2021-06-10 11:40:13,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:13,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:13,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389489217] [2021-06-10 11:40:13,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:13,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:13,913 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:13,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 725 transitions, 1757 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:13,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:13,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:13,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:14,189 INFO L129 PetriNetUnfolder]: 40/861 cut-off events. [2021-06-10 11:40:14,189 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:14,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 861 events. 40/861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3710 event pairs, 0 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 1051. Up to 30 conditions per place. [2021-06-10 11:40:14,236 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/726 dead transitions. [2021-06-10 11:40:14,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 726 transitions, 1783 flow [2021-06-10 11:40:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:14,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:14,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:14,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:14,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:14,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:14,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,239 INFO L185 Difference]: Start difference. First operand has 805 places, 725 transitions, 1757 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 726 transitions, 1783 flow [2021-06-10 11:40:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 726 transitions, 1781 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:14,246 INFO L241 Difference]: Finished difference. Result has 808 places, 726 transitions, 1773 flow [2021-06-10 11:40:14,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=804, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1773, PETRI_PLACES=808, PETRI_TRANSITIONS=726} [2021-06-10 11:40:14,247 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 33 predicate places. [2021-06-10 11:40:14,247 INFO L480 AbstractCegarLoop]: Abstraction has has 808 places, 726 transitions, 1773 flow [2021-06-10 11:40:14,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:14,247 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:14,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2021-06-10 11:40:14,247 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1808836306, now seen corresponding path program 1 times [2021-06-10 11:40:14,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:14,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472816427] [2021-06-10 11:40:14,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:14,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:14,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:14,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:14,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472816427] [2021-06-10 11:40:14,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:14,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:14,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139758206] [2021-06-10 11:40:14,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:14,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:14,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:14,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:14,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 726 transitions, 1773 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:14,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:14,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:14,536 INFO L129 PetriNetUnfolder]: 39/857 cut-off events. [2021-06-10 11:40:14,537 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:14,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 857 events. 39/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3684 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1044. Up to 30 conditions per place. [2021-06-10 11:40:14,632 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2021-06-10 11:40:14,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 723 transitions, 1770 flow [2021-06-10 11:40:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:14,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:14,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:14,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:14,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:14,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:14,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,636 INFO L185 Difference]: Start difference. First operand has 808 places, 726 transitions, 1773 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:14,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 723 transitions, 1770 flow [2021-06-10 11:40:14,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 723 transitions, 1762 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:14,643 INFO L241 Difference]: Finished difference. Result has 807 places, 723 transitions, 1752 flow [2021-06-10 11:40:14,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=805, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1752, PETRI_PLACES=807, PETRI_TRANSITIONS=723} [2021-06-10 11:40:14,643 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 32 predicate places. [2021-06-10 11:40:14,643 INFO L480 AbstractCegarLoop]: Abstraction has has 807 places, 723 transitions, 1752 flow [2021-06-10 11:40:14,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:14,643 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:14,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2021-06-10 11:40:14,643 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1808837329, now seen corresponding path program 1 times [2021-06-10 11:40:14,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:14,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611023800] [2021-06-10 11:40:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:14,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:14,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:14,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:14,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611023800] [2021-06-10 11:40:14,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:14,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:14,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85360000] [2021-06-10 11:40:14,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:14,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:14,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:14,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 723 transitions, 1752 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:14,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:14,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:14,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:14,973 INFO L129 PetriNetUnfolder]: 39/855 cut-off events. [2021-06-10 11:40:14,973 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:15,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 855 events. 39/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3668 event pairs, 0 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1047. Up to 30 conditions per place. [2021-06-10 11:40:15,016 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/721 dead transitions. [2021-06-10 11:40:15,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 721 transitions, 1765 flow [2021-06-10 11:40:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:15,018 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:15,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:15,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:15,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:15,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:15,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,020 INFO L185 Difference]: Start difference. First operand has 807 places, 723 transitions, 1752 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:15,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 721 transitions, 1765 flow [2021-06-10 11:40:15,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 721 transitions, 1764 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:15,027 INFO L241 Difference]: Finished difference. Result has 806 places, 721 transitions, 1748 flow [2021-06-10 11:40:15,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=804, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1748, PETRI_PLACES=806, PETRI_TRANSITIONS=721} [2021-06-10 11:40:15,027 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 31 predicate places. [2021-06-10 11:40:15,027 INFO L480 AbstractCegarLoop]: Abstraction has has 806 places, 721 transitions, 1748 flow [2021-06-10 11:40:15,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:15,027 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:15,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2021-06-10 11:40:15,028 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash -395434258, now seen corresponding path program 1 times [2021-06-10 11:40:15,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:15,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652901977] [2021-06-10 11:40:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:15,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:15,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:15,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652901977] [2021-06-10 11:40:15,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:15,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:15,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76265078] [2021-06-10 11:40:15,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:15,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:15,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:15,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:15,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:15,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 721 transitions, 1748 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:15,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:15,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:15,320 INFO L129 PetriNetUnfolder]: 38/862 cut-off events. [2021-06-10 11:40:15,320 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:15,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 862 events. 38/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3725 event pairs, 0 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1052. Up to 30 conditions per place. [2021-06-10 11:40:15,364 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/722 dead transitions. [2021-06-10 11:40:15,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 722 transitions, 1764 flow [2021-06-10 11:40:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:15,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:15,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:15,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:15,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:15,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,368 INFO L185 Difference]: Start difference. First operand has 806 places, 721 transitions, 1748 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:15,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 722 transitions, 1764 flow [2021-06-10 11:40:15,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 722 transitions, 1763 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:15,374 INFO L241 Difference]: Finished difference. Result has 808 places, 721 transitions, 1752 flow [2021-06-10 11:40:15,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=805, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1752, PETRI_PLACES=808, PETRI_TRANSITIONS=721} [2021-06-10 11:40:15,374 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 33 predicate places. [2021-06-10 11:40:15,375 INFO L480 AbstractCegarLoop]: Abstraction has has 808 places, 721 transitions, 1752 flow [2021-06-10 11:40:15,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,375 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:15,375 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:15,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2021-06-10 11:40:15,375 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -395433235, now seen corresponding path program 1 times [2021-06-10 11:40:15,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:15,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159976150] [2021-06-10 11:40:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:15,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:15,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:15,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159976150] [2021-06-10 11:40:15,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:15,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:15,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730861674] [2021-06-10 11:40:15,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:15,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:15,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:15,395 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:15,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 721 transitions, 1752 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:15,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:15,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:15,674 INFO L129 PetriNetUnfolder]: 36/864 cut-off events. [2021-06-10 11:40:15,674 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:15,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 864 events. 36/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3759 event pairs, 0 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1063. Up to 30 conditions per place. [2021-06-10 11:40:15,719 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/722 dead transitions. [2021-06-10 11:40:15,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 722 transitions, 1778 flow [2021-06-10 11:40:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:15,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:15,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:15,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:15,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:15,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:15,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,723 INFO L185 Difference]: Start difference. First operand has 808 places, 721 transitions, 1752 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:15,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 722 transitions, 1778 flow [2021-06-10 11:40:15,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 722 transitions, 1777 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:15,730 INFO L241 Difference]: Finished difference. Result has 811 places, 722 transitions, 1769 flow [2021-06-10 11:40:15,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1769, PETRI_PLACES=811, PETRI_TRANSITIONS=722} [2021-06-10 11:40:15,730 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 36 predicate places. [2021-06-10 11:40:15,730 INFO L480 AbstractCegarLoop]: Abstraction has has 811 places, 722 transitions, 1769 flow [2021-06-10 11:40:15,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,730 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:15,730 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:15,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2021-06-10 11:40:15,730 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash -396386547, now seen corresponding path program 1 times [2021-06-10 11:40:15,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:15,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802350698] [2021-06-10 11:40:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:15,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:15,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:15,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:15,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802350698] [2021-06-10 11:40:15,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:15,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:15,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671116665] [2021-06-10 11:40:15,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:15,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:15,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:15,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 722 transitions, 1769 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:15,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:15,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:15,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:16,028 INFO L129 PetriNetUnfolder]: 36/857 cut-off events. [2021-06-10 11:40:16,028 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:16,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 857 events. 36/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3699 event pairs, 0 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 1049. Up to 30 conditions per place. [2021-06-10 11:40:16,080 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/720 dead transitions. [2021-06-10 11:40:16,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 720 transitions, 1771 flow [2021-06-10 11:40:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:16,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:16,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:16,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:16,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:16,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:16,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,084 INFO L185 Difference]: Start difference. First operand has 811 places, 722 transitions, 1769 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:16,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 720 transitions, 1771 flow [2021-06-10 11:40:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 810 places, 720 transitions, 1763 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:16,092 INFO L241 Difference]: Finished difference. Result has 811 places, 720 transitions, 1756 flow [2021-06-10 11:40:16,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1756, PETRI_PLACES=811, PETRI_TRANSITIONS=720} [2021-06-10 11:40:16,092 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 36 predicate places. [2021-06-10 11:40:16,092 INFO L480 AbstractCegarLoop]: Abstraction has has 811 places, 720 transitions, 1756 flow [2021-06-10 11:40:16,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,093 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:16,093 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:16,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2021-06-10 11:40:16,093 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:16,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash -396387570, now seen corresponding path program 1 times [2021-06-10 11:40:16,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:16,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095950844] [2021-06-10 11:40:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:16,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:16,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:16,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095950844] [2021-06-10 11:40:16,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:16,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:16,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905560989] [2021-06-10 11:40:16,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:16,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:16,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:16,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 720 transitions, 1756 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:16,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:16,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:16,425 INFO L129 PetriNetUnfolder]: 36/855 cut-off events. [2021-06-10 11:40:16,425 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:16,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 855 events. 36/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3684 event pairs, 0 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1053. Up to 30 conditions per place. [2021-06-10 11:40:16,462 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/718 dead transitions. [2021-06-10 11:40:16,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 811 places, 718 transitions, 1769 flow [2021-06-10 11:40:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:16,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:16,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:16,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:16,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:16,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:16,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,466 INFO L185 Difference]: Start difference. First operand has 811 places, 720 transitions, 1756 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 811 places, 718 transitions, 1769 flow [2021-06-10 11:40:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 810 places, 718 transitions, 1768 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:16,472 INFO L241 Difference]: Finished difference. Result has 810 places, 718 transitions, 1752 flow [2021-06-10 11:40:16,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1752, PETRI_PLACES=810, PETRI_TRANSITIONS=718} [2021-06-10 11:40:16,473 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 35 predicate places. [2021-06-10 11:40:16,473 INFO L480 AbstractCegarLoop]: Abstraction has has 810 places, 718 transitions, 1752 flow [2021-06-10 11:40:16,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:16,473 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:16,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2021-06-10 11:40:16,473 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash -648199637, now seen corresponding path program 1 times [2021-06-10 11:40:16,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:16,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225196400] [2021-06-10 11:40:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:16,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:16,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:16,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225196400] [2021-06-10 11:40:16,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:16,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:16,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339092666] [2021-06-10 11:40:16,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:16,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:16,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:16,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 718 transitions, 1752 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:16,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:16,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:16,827 INFO L129 PetriNetUnfolder]: 35/863 cut-off events. [2021-06-10 11:40:16,827 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:16,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 863 events. 35/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3753 event pairs, 0 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1065. Up to 30 conditions per place. [2021-06-10 11:40:16,874 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/720 dead transitions. [2021-06-10 11:40:16,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 812 places, 720 transitions, 1782 flow [2021-06-10 11:40:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:16,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:16,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:16,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:16,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:16,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:16,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,878 INFO L185 Difference]: Start difference. First operand has 810 places, 718 transitions, 1752 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:16,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 812 places, 720 transitions, 1782 flow [2021-06-10 11:40:16,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 811 places, 720 transitions, 1781 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:16,885 INFO L241 Difference]: Finished difference. Result has 813 places, 720 transitions, 1775 flow [2021-06-10 11:40:16,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1775, PETRI_PLACES=813, PETRI_TRANSITIONS=720} [2021-06-10 11:40:16,885 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 38 predicate places. [2021-06-10 11:40:16,885 INFO L480 AbstractCegarLoop]: Abstraction has has 813 places, 720 transitions, 1775 flow [2021-06-10 11:40:16,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:16,886 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:16,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2021-06-10 11:40:16,886 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -648198614, now seen corresponding path program 1 times [2021-06-10 11:40:16,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:16,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514800024] [2021-06-10 11:40:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:16,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:16,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:16,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:16,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514800024] [2021-06-10 11:40:16,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:16,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:16,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030467479] [2021-06-10 11:40:16,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:16,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:16,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:16,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:16,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 720 transitions, 1775 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:16,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:16,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:16,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:17,183 INFO L129 PetriNetUnfolder]: 34/861 cut-off events. [2021-06-10 11:40:17,183 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:17,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 861 events. 34/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3743 event pairs, 0 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1062. Up to 30 conditions per place. [2021-06-10 11:40:17,230 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/720 dead transitions. [2021-06-10 11:40:17,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 815 places, 720 transitions, 1787 flow [2021-06-10 11:40:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:17,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:17,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:17,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:17,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:17,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,234 INFO L185 Difference]: Start difference. First operand has 813 places, 720 transitions, 1775 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:17,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 815 places, 720 transitions, 1787 flow [2021-06-10 11:40:17,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 814 places, 720 transitions, 1782 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:17,241 INFO L241 Difference]: Finished difference. Result has 816 places, 720 transitions, 1780 flow [2021-06-10 11:40:17,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=812, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=816, PETRI_TRANSITIONS=720} [2021-06-10 11:40:17,242 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 41 predicate places. [2021-06-10 11:40:17,242 INFO L480 AbstractCegarLoop]: Abstraction has has 816 places, 720 transitions, 1780 flow [2021-06-10 11:40:17,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:17,242 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:17,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2021-06-10 11:40:17,242 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -647246325, now seen corresponding path program 1 times [2021-06-10 11:40:17,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:17,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008961749] [2021-06-10 11:40:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:17,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:17,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:17,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008961749] [2021-06-10 11:40:17,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:17,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:17,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74368248] [2021-06-10 11:40:17,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:17,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:17,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:17,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 720 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:17,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:17,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:17,536 INFO L129 PetriNetUnfolder]: 33/857 cut-off events. [2021-06-10 11:40:17,536 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:17,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 857 events. 33/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3715 event pairs, 0 based on Foata normal form. 1/797 useless extension candidates. Maximal degree in co-relation 1059. Up to 30 conditions per place. [2021-06-10 11:40:17,587 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/717 dead transitions. [2021-06-10 11:40:17,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 717 transitions, 1777 flow [2021-06-10 11:40:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:17,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:17,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:17,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:17,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:17,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:17,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,591 INFO L185 Difference]: Start difference. First operand has 816 places, 720 transitions, 1780 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:17,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 717 transitions, 1777 flow [2021-06-10 11:40:17,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 717 transitions, 1770 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:17,598 INFO L241 Difference]: Finished difference. Result has 815 places, 717 transitions, 1760 flow [2021-06-10 11:40:17,598 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=813, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1760, PETRI_PLACES=815, PETRI_TRANSITIONS=717} [2021-06-10 11:40:17,599 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 40 predicate places. [2021-06-10 11:40:17,599 INFO L480 AbstractCegarLoop]: Abstraction has has 815 places, 717 transitions, 1760 flow [2021-06-10 11:40:17,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:17,599 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:17,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2021-06-10 11:40:17,599 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash -647245302, now seen corresponding path program 1 times [2021-06-10 11:40:17,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:17,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164537315] [2021-06-10 11:40:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:17,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:17,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:17,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164537315] [2021-06-10 11:40:17,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:17,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:17,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91061155] [2021-06-10 11:40:17,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:17,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:17,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:17,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:17,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:17,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 717 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:17,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:17,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:17,901 INFO L129 PetriNetUnfolder]: 33/855 cut-off events. [2021-06-10 11:40:17,901 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:17,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 855 events. 33/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3701 event pairs, 0 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1060. Up to 30 conditions per place. [2021-06-10 11:40:17,945 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/715 dead transitions. [2021-06-10 11:40:17,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 815 places, 715 transitions, 1773 flow [2021-06-10 11:40:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:17,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:17,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:17,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:17,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:17,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:17,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,949 INFO L185 Difference]: Start difference. First operand has 815 places, 717 transitions, 1760 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:17,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 815 places, 715 transitions, 1773 flow [2021-06-10 11:40:17,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 814 places, 715 transitions, 1772 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:17,957 INFO L241 Difference]: Finished difference. Result has 814 places, 715 transitions, 1756 flow [2021-06-10 11:40:17,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=812, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1756, PETRI_PLACES=814, PETRI_TRANSITIONS=715} [2021-06-10 11:40:17,957 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 39 predicate places. [2021-06-10 11:40:17,957 INFO L480 AbstractCegarLoop]: Abstraction has has 814 places, 715 transitions, 1756 flow [2021-06-10 11:40:17,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:17,957 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:17,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1300 [2021-06-10 11:40:17,957 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1526797480, now seen corresponding path program 1 times [2021-06-10 11:40:17,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:17,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749679458] [2021-06-10 11:40:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:17,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:17,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:17,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:17,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749679458] [2021-06-10 11:40:17,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:17,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:17,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830590355] [2021-06-10 11:40:17,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:17,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:17,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:17,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 715 transitions, 1756 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:17,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:17,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:17,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:18,271 INFO L129 PetriNetUnfolder]: 32/863 cut-off events. [2021-06-10 11:40:18,271 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:18,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 863 events. 32/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3772 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1072. Up to 30 conditions per place. [2021-06-10 11:40:18,316 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/717 dead transitions. [2021-06-10 11:40:18,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 717 transitions, 1786 flow [2021-06-10 11:40:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:18,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:18,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:18,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:18,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:18,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,319 INFO L185 Difference]: Start difference. First operand has 814 places, 715 transitions, 1756 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:18,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 717 transitions, 1786 flow [2021-06-10 11:40:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 717 transitions, 1785 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:18,326 INFO L241 Difference]: Finished difference. Result has 817 places, 717 transitions, 1779 flow [2021-06-10 11:40:18,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=813, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1779, PETRI_PLACES=817, PETRI_TRANSITIONS=717} [2021-06-10 11:40:18,327 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 42 predicate places. [2021-06-10 11:40:18,327 INFO L480 AbstractCegarLoop]: Abstraction has has 817 places, 717 transitions, 1779 flow [2021-06-10 11:40:18,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:18,327 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:18,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1301 [2021-06-10 11:40:18,327 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1526796457, now seen corresponding path program 1 times [2021-06-10 11:40:18,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:18,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905743077] [2021-06-10 11:40:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:18,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:18,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:18,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:18,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905743077] [2021-06-10 11:40:18,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:18,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:18,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087811185] [2021-06-10 11:40:18,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:18,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:18,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:18,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 717 transitions, 1779 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:18,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:18,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:18,640 INFO L129 PetriNetUnfolder]: 30/864 cut-off events. [2021-06-10 11:40:18,641 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:18,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 864 events. 30/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3794 event pairs, 0 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1072. Up to 30 conditions per place. [2021-06-10 11:40:18,682 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/717 dead transitions. [2021-06-10 11:40:18,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 717 transitions, 1791 flow [2021-06-10 11:40:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:18,684 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:18,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:18,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:18,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:18,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:18,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,686 INFO L185 Difference]: Start difference. First operand has 817 places, 717 transitions, 1779 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:18,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 717 transitions, 1791 flow [2021-06-10 11:40:18,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 717 transitions, 1786 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:18,693 INFO L241 Difference]: Finished difference. Result has 819 places, 716 transitions, 1775 flow [2021-06-10 11:40:18,693 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1775, PETRI_PLACES=819, PETRI_TRANSITIONS=716} [2021-06-10 11:40:18,693 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 44 predicate places. [2021-06-10 11:40:18,693 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 716 transitions, 1775 flow [2021-06-10 11:40:18,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:18,694 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:18,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1302 [2021-06-10 11:40:18,694 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1525844168, now seen corresponding path program 1 times [2021-06-10 11:40:18,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:18,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029558553] [2021-06-10 11:40:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:18,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:18,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:18,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:18,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:18,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029558553] [2021-06-10 11:40:18,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:18,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:18,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405954904] [2021-06-10 11:40:18,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:18,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:18,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:18,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 716 transitions, 1775 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:18,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:18,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:18,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:18,979 INFO L129 PetriNetUnfolder]: 30/857 cut-off events. [2021-06-10 11:40:18,980 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:19,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 857 events. 30/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3733 event pairs, 0 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 1066. Up to 30 conditions per place. [2021-06-10 11:40:19,022 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/714 dead transitions. [2021-06-10 11:40:19,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 714 transitions, 1778 flow [2021-06-10 11:40:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:19,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:19,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:19,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:19,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:19,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:19,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,026 INFO L185 Difference]: Start difference. First operand has 819 places, 716 transitions, 1775 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 714 transitions, 1778 flow [2021-06-10 11:40:19,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 714 transitions, 1771 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:19,033 INFO L241 Difference]: Finished difference. Result has 819 places, 714 transitions, 1764 flow [2021-06-10 11:40:19,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1764, PETRI_PLACES=819, PETRI_TRANSITIONS=714} [2021-06-10 11:40:19,033 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 44 predicate places. [2021-06-10 11:40:19,033 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 714 transitions, 1764 flow [2021-06-10 11:40:19,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:19,034 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:19,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1303 [2021-06-10 11:40:19,034 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1525843145, now seen corresponding path program 1 times [2021-06-10 11:40:19,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:19,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945587590] [2021-06-10 11:40:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:19,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:19,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:19,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945587590] [2021-06-10 11:40:19,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:19,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:19,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372673344] [2021-06-10 11:40:19,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:19,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:19,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:19,054 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:19,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 714 transitions, 1764 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:19,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:19,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:19,332 INFO L129 PetriNetUnfolder]: 30/855 cut-off events. [2021-06-10 11:40:19,332 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:19,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 855 events. 30/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3720 event pairs, 0 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 1066. Up to 30 conditions per place. [2021-06-10 11:40:19,376 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2021-06-10 11:40:19,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 712 transitions, 1777 flow [2021-06-10 11:40:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:19,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:19,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:19,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:19,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:19,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:19,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,380 INFO L185 Difference]: Start difference. First operand has 819 places, 714 transitions, 1764 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 712 transitions, 1777 flow [2021-06-10 11:40:19,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 712 transitions, 1776 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:19,387 INFO L241 Difference]: Finished difference. Result has 818 places, 712 transitions, 1760 flow [2021-06-10 11:40:19,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1760, PETRI_PLACES=818, PETRI_TRANSITIONS=712} [2021-06-10 11:40:19,388 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 43 predicate places. [2021-06-10 11:40:19,388 INFO L480 AbstractCegarLoop]: Abstraction has has 818 places, 712 transitions, 1760 flow [2021-06-10 11:40:19,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:19,388 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:19,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1304 [2021-06-10 11:40:19,388 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1834219080, now seen corresponding path program 1 times [2021-06-10 11:40:19,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:19,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119579298] [2021-06-10 11:40:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:19,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:19,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:19,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119579298] [2021-06-10 11:40:19,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:19,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:19,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569496413] [2021-06-10 11:40:19,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:19,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:19,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:19,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 712 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:19,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:19,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:19,700 INFO L129 PetriNetUnfolder]: 29/862 cut-off events. [2021-06-10 11:40:19,700 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:19,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 862 events. 29/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3779 event pairs, 0 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1071. Up to 30 conditions per place. [2021-06-10 11:40:19,744 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/713 dead transitions. [2021-06-10 11:40:19,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 820 places, 713 transitions, 1776 flow [2021-06-10 11:40:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:19,745 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:19,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:19,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:19,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:19,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:19,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,748 INFO L185 Difference]: Start difference. First operand has 818 places, 712 transitions, 1760 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:19,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 820 places, 713 transitions, 1776 flow [2021-06-10 11:40:19,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 819 places, 713 transitions, 1775 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:19,755 INFO L241 Difference]: Finished difference. Result has 820 places, 712 transitions, 1764 flow [2021-06-10 11:40:19,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=817, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1764, PETRI_PLACES=820, PETRI_TRANSITIONS=712} [2021-06-10 11:40:19,755 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 45 predicate places. [2021-06-10 11:40:19,755 INFO L480 AbstractCegarLoop]: Abstraction has has 820 places, 712 transitions, 1764 flow [2021-06-10 11:40:19,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:19,755 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:19,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1305 [2021-06-10 11:40:19,755 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1834220103, now seen corresponding path program 1 times [2021-06-10 11:40:19,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:19,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77840700] [2021-06-10 11:40:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:19,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:19,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:19,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:19,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77840700] [2021-06-10 11:40:19,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:19,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:19,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708193241] [2021-06-10 11:40:19,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:19,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:19,777 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:19,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 712 transitions, 1764 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:19,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:19,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:19,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:20,070 INFO L129 PetriNetUnfolder]: 27/864 cut-off events. [2021-06-10 11:40:20,071 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:20,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 864 events. 27/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3812 event pairs, 0 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1082. Up to 30 conditions per place. [2021-06-10 11:40:20,113 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/713 dead transitions. [2021-06-10 11:40:20,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 713 transitions, 1790 flow [2021-06-10 11:40:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:20,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:20,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:20,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:20,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:20,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:20,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,117 INFO L185 Difference]: Start difference. First operand has 820 places, 712 transitions, 1764 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:20,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 713 transitions, 1790 flow [2021-06-10 11:40:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 713 transitions, 1789 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:20,124 INFO L241 Difference]: Finished difference. Result has 823 places, 713 transitions, 1781 flow [2021-06-10 11:40:20,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1781, PETRI_PLACES=823, PETRI_TRANSITIONS=713} [2021-06-10 11:40:20,124 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 48 predicate places. [2021-06-10 11:40:20,124 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 713 transitions, 1781 flow [2021-06-10 11:40:20,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,124 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:20,124 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:20,124 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306 [2021-06-10 11:40:20,125 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1833266791, now seen corresponding path program 1 times [2021-06-10 11:40:20,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:20,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499735273] [2021-06-10 11:40:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:20,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:20,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:20,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499735273] [2021-06-10 11:40:20,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:20,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:20,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296932553] [2021-06-10 11:40:20,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:20,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:20,145 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:20,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 713 transitions, 1781 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:20,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:20,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:20,439 INFO L129 PetriNetUnfolder]: 27/857 cut-off events. [2021-06-10 11:40:20,439 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:20,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 857 events. 27/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3753 event pairs, 0 based on Foata normal form. 1/803 useless extension candidates. Maximal degree in co-relation 1068. Up to 30 conditions per place. [2021-06-10 11:40:20,468 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/711 dead transitions. [2021-06-10 11:40:20,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 711 transitions, 1783 flow [2021-06-10 11:40:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:20,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:20,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:20,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:20,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:20,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:20,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,472 INFO L185 Difference]: Start difference. First operand has 823 places, 713 transitions, 1781 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:20,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 825 places, 711 transitions, 1783 flow [2021-06-10 11:40:20,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 711 transitions, 1775 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:20,478 INFO L241 Difference]: Finished difference. Result has 823 places, 711 transitions, 1768 flow [2021-06-10 11:40:20,478 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1768, PETRI_PLACES=823, PETRI_TRANSITIONS=711} [2021-06-10 11:40:20,478 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 48 predicate places. [2021-06-10 11:40:20,478 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 711 transitions, 1768 flow [2021-06-10 11:40:20,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,479 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:20,479 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:20,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1307 [2021-06-10 11:40:20,479 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1833265768, now seen corresponding path program 1 times [2021-06-10 11:40:20,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:20,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556853222] [2021-06-10 11:40:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:20,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:20,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:20,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556853222] [2021-06-10 11:40:20,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:20,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:20,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999649385] [2021-06-10 11:40:20,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:20,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:20,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:20,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 711 transitions, 1768 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:20,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:20,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:20,782 INFO L129 PetriNetUnfolder]: 27/855 cut-off events. [2021-06-10 11:40:20,782 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:20,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 855 events. 27/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3737 event pairs, 0 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1072. Up to 30 conditions per place. [2021-06-10 11:40:20,825 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/709 dead transitions. [2021-06-10 11:40:20,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 709 transitions, 1781 flow [2021-06-10 11:40:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:20,826 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:20,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:20,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:20,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:20,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:20,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,829 INFO L185 Difference]: Start difference. First operand has 823 places, 711 transitions, 1768 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:20,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 823 places, 709 transitions, 1781 flow [2021-06-10 11:40:20,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 709 transitions, 1780 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:20,835 INFO L241 Difference]: Finished difference. Result has 822 places, 709 transitions, 1764 flow [2021-06-10 11:40:20,836 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1764, PETRI_PLACES=822, PETRI_TRANSITIONS=709} [2021-06-10 11:40:20,836 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 47 predicate places. [2021-06-10 11:40:20,836 INFO L480 AbstractCegarLoop]: Abstraction has has 822 places, 709 transitions, 1764 flow [2021-06-10 11:40:20,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:20,836 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:20,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1308 [2021-06-10 11:40:20,836 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash -626982264, now seen corresponding path program 1 times [2021-06-10 11:40:20,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:20,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280491478] [2021-06-10 11:40:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:20,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:20,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:20,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:20,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280491478] [2021-06-10 11:40:20,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:20,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:20,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448692263] [2021-06-10 11:40:20,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:20,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:20,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:20,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 709 transitions, 1764 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:20,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:20,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:20,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:21,159 INFO L129 PetriNetUnfolder]: 26/863 cut-off events. [2021-06-10 11:40:21,159 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:21,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 863 events. 26/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3807 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1084. Up to 30 conditions per place. [2021-06-10 11:40:21,205 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2021-06-10 11:40:21,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 711 transitions, 1794 flow [2021-06-10 11:40:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:21,207 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:21,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:21,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:21,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:21,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:21,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,209 INFO L185 Difference]: Start difference. First operand has 822 places, 709 transitions, 1764 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:21,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 711 transitions, 1794 flow [2021-06-10 11:40:21,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 711 transitions, 1793 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:21,217 INFO L241 Difference]: Finished difference. Result has 825 places, 711 transitions, 1787 flow [2021-06-10 11:40:21,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=821, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1787, PETRI_PLACES=825, PETRI_TRANSITIONS=711} [2021-06-10 11:40:21,217 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 50 predicate places. [2021-06-10 11:40:21,217 INFO L480 AbstractCegarLoop]: Abstraction has has 825 places, 711 transitions, 1787 flow [2021-06-10 11:40:21,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:21,217 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:21,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1309 [2021-06-10 11:40:21,217 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -626981241, now seen corresponding path program 1 times [2021-06-10 11:40:21,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:21,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868805] [2021-06-10 11:40:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:21,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:21,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:21,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868805] [2021-06-10 11:40:21,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:21,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:21,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176558159] [2021-06-10 11:40:21,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:21,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:21,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:21,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:21,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 711 transitions, 1787 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:21,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:21,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:21,531 INFO L129 PetriNetUnfolder]: 25/861 cut-off events. [2021-06-10 11:40:21,531 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:21,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 861 events. 25/861 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3794 event pairs, 0 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1081. Up to 30 conditions per place. [2021-06-10 11:40:21,573 INFO L132 encePairwiseOnDemand]: 830/833 looper letters, 5 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2021-06-10 11:40:21,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 711 transitions, 1799 flow [2021-06-10 11:40:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:21,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:21,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:21,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:21,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:21,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:21,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,577 INFO L185 Difference]: Start difference. First operand has 825 places, 711 transitions, 1787 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:21,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 711 transitions, 1799 flow [2021-06-10 11:40:21,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 711 transitions, 1794 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:21,584 INFO L241 Difference]: Finished difference. Result has 828 places, 711 transitions, 1792 flow [2021-06-10 11:40:21,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1792, PETRI_PLACES=828, PETRI_TRANSITIONS=711} [2021-06-10 11:40:21,584 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 53 predicate places. [2021-06-10 11:40:21,584 INFO L480 AbstractCegarLoop]: Abstraction has has 828 places, 711 transitions, 1792 flow [2021-06-10 11:40:21,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:21,585 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:21,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1310 [2021-06-10 11:40:21,585 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash -626028952, now seen corresponding path program 1 times [2021-06-10 11:40:21,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:21,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698314741] [2021-06-10 11:40:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:21,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:21,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:21,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698314741] [2021-06-10 11:40:21,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:21,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:21,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856842489] [2021-06-10 11:40:21,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:21,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:21,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:21,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 711 transitions, 1792 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:21,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:21,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:21,903 INFO L129 PetriNetUnfolder]: 24/857 cut-off events. [2021-06-10 11:40:21,903 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:21,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 857 events. 24/857 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3770 event pairs, 0 based on Foata normal form. 1/806 useless extension candidates. Maximal degree in co-relation 1078. Up to 30 conditions per place. [2021-06-10 11:40:21,946 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/708 dead transitions. [2021-06-10 11:40:21,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 708 transitions, 1789 flow [2021-06-10 11:40:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:21,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:21,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:21,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:21,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:21,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:21,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,950 INFO L185 Difference]: Start difference. First operand has 828 places, 711 transitions, 1792 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:21,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 708 transitions, 1789 flow [2021-06-10 11:40:21,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 708 transitions, 1782 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:21,957 INFO L241 Difference]: Finished difference. Result has 827 places, 708 transitions, 1772 flow [2021-06-10 11:40:21,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1772, PETRI_PLACES=827, PETRI_TRANSITIONS=708} [2021-06-10 11:40:21,957 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 52 predicate places. [2021-06-10 11:40:21,957 INFO L480 AbstractCegarLoop]: Abstraction has has 827 places, 708 transitions, 1772 flow [2021-06-10 11:40:21,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:21,957 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:21,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1311 [2021-06-10 11:40:21,958 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash -626027929, now seen corresponding path program 1 times [2021-06-10 11:40:21,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:21,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045869365] [2021-06-10 11:40:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:21,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:21,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:21,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:21,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045869365] [2021-06-10 11:40:21,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:21,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:21,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89196700] [2021-06-10 11:40:21,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:21,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:21,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:21,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 708 transitions, 1772 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:21,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:21,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:21,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:22,265 INFO L129 PetriNetUnfolder]: 24/855 cut-off events. [2021-06-10 11:40:22,265 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:22,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 855 events. 24/855 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3755 event pairs, 0 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 1079. Up to 30 conditions per place. [2021-06-10 11:40:22,308 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/706 dead transitions. [2021-06-10 11:40:22,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 706 transitions, 1785 flow [2021-06-10 11:40:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:22,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:22,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:22,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:22,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:22,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:22,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,312 INFO L185 Difference]: Start difference. First operand has 827 places, 708 transitions, 1772 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:22,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 706 transitions, 1785 flow [2021-06-10 11:40:22,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 706 transitions, 1784 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:22,319 INFO L241 Difference]: Finished difference. Result has 826 places, 706 transitions, 1768 flow [2021-06-10 11:40:22,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1768, PETRI_PLACES=826, PETRI_TRANSITIONS=706} [2021-06-10 11:40:22,319 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 51 predicate places. [2021-06-10 11:40:22,319 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 706 transitions, 1768 flow [2021-06-10 11:40:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:22,320 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:22,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1312 [2021-06-10 11:40:22,320 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1895765897, now seen corresponding path program 1 times [2021-06-10 11:40:22,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:22,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448468004] [2021-06-10 11:40:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:22,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:22,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:22,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:22,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448468004] [2021-06-10 11:40:22,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:22,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:22,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331961504] [2021-06-10 11:40:22,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:22,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:22,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:22,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:22,341 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:22,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 706 transitions, 1768 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,342 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:22,342 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:22,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:22,626 INFO L129 PetriNetUnfolder]: 23/862 cut-off events. [2021-06-10 11:40:22,626 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:22,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 862 events. 23/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3812 event pairs, 0 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 1084. Up to 30 conditions per place. [2021-06-10 11:40:22,671 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/707 dead transitions. [2021-06-10 11:40:22,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 707 transitions, 1784 flow [2021-06-10 11:40:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:22,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:22,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:22,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:22,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:22,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:22,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,674 INFO L185 Difference]: Start difference. First operand has 826 places, 706 transitions, 1768 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:22,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 707 transitions, 1784 flow [2021-06-10 11:40:22,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 707 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:22,681 INFO L241 Difference]: Finished difference. Result has 828 places, 706 transitions, 1772 flow [2021-06-10 11:40:22,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1772, PETRI_PLACES=828, PETRI_TRANSITIONS=706} [2021-06-10 11:40:22,681 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 53 predicate places. [2021-06-10 11:40:22,682 INFO L480 AbstractCegarLoop]: Abstraction has has 828 places, 706 transitions, 1772 flow [2021-06-10 11:40:22,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:22,682 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:22,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1313 [2021-06-10 11:40:22,682 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1895766920, now seen corresponding path program 1 times [2021-06-10 11:40:22,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:22,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043173290] [2021-06-10 11:40:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:22,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:22,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:22,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:22,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:22,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043173290] [2021-06-10 11:40:22,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:22,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:22,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134097857] [2021-06-10 11:40:22,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:22,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:22,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:22,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 706 transitions, 1772 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:22,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:22,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:22,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:23,018 INFO L129 PetriNetUnfolder]: 21/864 cut-off events. [2021-06-10 11:40:23,018 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:23,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 864 events. 21/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3849 event pairs, 0 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1095. Up to 30 conditions per place. [2021-06-10 11:40:23,063 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/707 dead transitions. [2021-06-10 11:40:23,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 707 transitions, 1798 flow [2021-06-10 11:40:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:23,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:23,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:23,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:23,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:23,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:23,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,066 INFO L185 Difference]: Start difference. First operand has 828 places, 706 transitions, 1772 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:23,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 707 transitions, 1798 flow [2021-06-10 11:40:23,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 707 transitions, 1797 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:23,074 INFO L241 Difference]: Finished difference. Result has 831 places, 707 transitions, 1789 flow [2021-06-10 11:40:23,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=827, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1789, PETRI_PLACES=831, PETRI_TRANSITIONS=707} [2021-06-10 11:40:23,074 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 56 predicate places. [2021-06-10 11:40:23,074 INFO L480 AbstractCegarLoop]: Abstraction has has 831 places, 707 transitions, 1789 flow [2021-06-10 11:40:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:23,074 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:23,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1314 [2021-06-10 11:40:23,075 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1894813608, now seen corresponding path program 1 times [2021-06-10 11:40:23,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:23,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403547889] [2021-06-10 11:40:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:23,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:23,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:23,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403547889] [2021-06-10 11:40:23,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:23,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:23,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397099043] [2021-06-10 11:40:23,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:23,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:23,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:23,097 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:23,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 707 transitions, 1789 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:23,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:23,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:23,387 INFO L129 PetriNetUnfolder]: 21/857 cut-off events. [2021-06-10 11:40:23,387 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:23,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 857 events. 21/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3785 event pairs, 0 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 1081. Up to 30 conditions per place. [2021-06-10 11:40:23,432 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/705 dead transitions. [2021-06-10 11:40:23,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 705 transitions, 1791 flow [2021-06-10 11:40:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:23,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:23,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:23,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:23,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:23,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:23,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,436 INFO L185 Difference]: Start difference. First operand has 831 places, 707 transitions, 1789 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:23,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 705 transitions, 1791 flow [2021-06-10 11:40:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 705 transitions, 1783 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:23,444 INFO L241 Difference]: Finished difference. Result has 831 places, 705 transitions, 1776 flow [2021-06-10 11:40:23,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=831, PETRI_TRANSITIONS=705} [2021-06-10 11:40:23,444 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 56 predicate places. [2021-06-10 11:40:23,444 INFO L480 AbstractCegarLoop]: Abstraction has has 831 places, 705 transitions, 1776 flow [2021-06-10 11:40:23,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:23,444 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:23,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1315 [2021-06-10 11:40:23,444 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:23,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1894812585, now seen corresponding path program 1 times [2021-06-10 11:40:23,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:23,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775823151] [2021-06-10 11:40:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:23,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:23,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:23,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775823151] [2021-06-10 11:40:23,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:23,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:23,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517083744] [2021-06-10 11:40:23,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:23,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:23,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:23,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 705 transitions, 1776 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:23,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:23,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:23,754 INFO L129 PetriNetUnfolder]: 21/855 cut-off events. [2021-06-10 11:40:23,754 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:23,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 855 events. 21/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3771 event pairs, 0 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1085. Up to 30 conditions per place. [2021-06-10 11:40:23,797 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/703 dead transitions. [2021-06-10 11:40:23,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 703 transitions, 1789 flow [2021-06-10 11:40:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:23,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:23,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:23,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:23,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:23,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:23,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,800 INFO L185 Difference]: Start difference. First operand has 831 places, 705 transitions, 1776 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:23,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 831 places, 703 transitions, 1789 flow [2021-06-10 11:40:23,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 703 transitions, 1788 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:23,808 INFO L241 Difference]: Finished difference. Result has 830 places, 703 transitions, 1772 flow [2021-06-10 11:40:23,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1772, PETRI_PLACES=830, PETRI_TRANSITIONS=703} [2021-06-10 11:40:23,808 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 55 predicate places. [2021-06-10 11:40:23,808 INFO L480 AbstractCegarLoop]: Abstraction has has 830 places, 703 transitions, 1772 flow [2021-06-10 11:40:23,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,808 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:23,808 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:23,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1316 [2021-06-10 11:40:23,809 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -685916117, now seen corresponding path program 1 times [2021-06-10 11:40:23,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:23,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018716523] [2021-06-10 11:40:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:23,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:23,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:23,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:40:23,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018716523] [2021-06-10 11:40:23,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:23,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:23,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737986594] [2021-06-10 11:40:23,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:23,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:23,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:23,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 830 places, 703 transitions, 1772 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:23,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:23,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:23,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:24,124 INFO L129 PetriNetUnfolder]: 20/862 cut-off events. [2021-06-10 11:40:24,124 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:24,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 862 events. 20/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3830 event pairs, 0 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1090. Up to 30 conditions per place. [2021-06-10 11:40:24,168 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/704 dead transitions. [2021-06-10 11:40:24,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 832 places, 704 transitions, 1788 flow [2021-06-10 11:40:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:24,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:24,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:24,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:24,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:24,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:24,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,171 INFO L185 Difference]: Start difference. First operand has 830 places, 703 transitions, 1772 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:24,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 832 places, 704 transitions, 1788 flow [2021-06-10 11:40:24,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 831 places, 704 transitions, 1787 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:24,178 INFO L241 Difference]: Finished difference. Result has 832 places, 703 transitions, 1776 flow [2021-06-10 11:40:24,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=829, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=832, PETRI_TRANSITIONS=703} [2021-06-10 11:40:24,179 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 57 predicate places. [2021-06-10 11:40:24,179 INFO L480 AbstractCegarLoop]: Abstraction has has 832 places, 703 transitions, 1776 flow [2021-06-10 11:40:24,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:24,179 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:24,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1317 [2021-06-10 11:40:24,179 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash -685915094, now seen corresponding path program 1 times [2021-06-10 11:40:24,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:24,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319549283] [2021-06-10 11:40:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:24,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:24,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:40:24,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319549283] [2021-06-10 11:40:24,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:24,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:24,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390566307] [2021-06-10 11:40:24,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:24,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:24,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:24,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:24,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:24,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 703 transitions, 1776 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:24,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:24,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:24,514 INFO L129 PetriNetUnfolder]: 18/864 cut-off events. [2021-06-10 11:40:24,514 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:24,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 864 events. 18/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3867 event pairs, 0 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1101. Up to 30 conditions per place. [2021-06-10 11:40:24,545 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/704 dead transitions. [2021-06-10 11:40:24,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 704 transitions, 1802 flow [2021-06-10 11:40:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:24,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:24,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:24,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:24,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:24,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:24,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,549 INFO L185 Difference]: Start difference. First operand has 832 places, 703 transitions, 1776 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:24,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 834 places, 704 transitions, 1802 flow [2021-06-10 11:40:24,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 704 transitions, 1801 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:24,556 INFO L241 Difference]: Finished difference. Result has 835 places, 704 transitions, 1793 flow [2021-06-10 11:40:24,556 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1793, PETRI_PLACES=835, PETRI_TRANSITIONS=704} [2021-06-10 11:40:24,556 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 60 predicate places. [2021-06-10 11:40:24,556 INFO L480 AbstractCegarLoop]: Abstraction has has 835 places, 704 transitions, 1793 flow [2021-06-10 11:40:24,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,556 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:24,556 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:24,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1318 [2021-06-10 11:40:24,556 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -686868406, now seen corresponding path program 1 times [2021-06-10 11:40:24,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:24,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682221203] [2021-06-10 11:40:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:24,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:24,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:40:24,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682221203] [2021-06-10 11:40:24,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:24,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:24,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736960134] [2021-06-10 11:40:24,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:24,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:24,578 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:24,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 704 transitions, 1793 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:24,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:24,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:24,868 INFO L129 PetriNetUnfolder]: 18/857 cut-off events. [2021-06-10 11:40:24,868 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:24,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 857 events. 18/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3801 event pairs, 0 based on Foata normal form. 1/812 useless extension candidates. Maximal degree in co-relation 1087. Up to 30 conditions per place. [2021-06-10 11:40:24,910 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2021-06-10 11:40:24,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 702 transitions, 1795 flow [2021-06-10 11:40:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:24,912 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:24,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:24,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:24,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:24,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:24,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,914 INFO L185 Difference]: Start difference. First operand has 835 places, 704 transitions, 1793 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:24,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 837 places, 702 transitions, 1795 flow [2021-06-10 11:40:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 702 transitions, 1787 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:24,921 INFO L241 Difference]: Finished difference. Result has 835 places, 702 transitions, 1780 flow [2021-06-10 11:40:24,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=835, PETRI_TRANSITIONS=702} [2021-06-10 11:40:24,922 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 60 predicate places. [2021-06-10 11:40:24,922 INFO L480 AbstractCegarLoop]: Abstraction has has 835 places, 702 transitions, 1780 flow [2021-06-10 11:40:24,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:24,922 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:24,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1319 [2021-06-10 11:40:24,922 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -686869429, now seen corresponding path program 1 times [2021-06-10 11:40:24,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:24,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085765195] [2021-06-10 11:40:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:24,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:24,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:24,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:40:24,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085765195] [2021-06-10 11:40:24,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:24,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:24,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142381574] [2021-06-10 11:40:24,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:24,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:24,944 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:24,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 702 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:24,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:24,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:24,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:25,240 INFO L129 PetriNetUnfolder]: 18/855 cut-off events. [2021-06-10 11:40:25,240 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:25,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 855 events. 18/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3788 event pairs, 0 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1091. Up to 30 conditions per place. [2021-06-10 11:40:25,283 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/700 dead transitions. [2021-06-10 11:40:25,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 700 transitions, 1793 flow [2021-06-10 11:40:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:25,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:25,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:25,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:25,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:25,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:25,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,287 INFO L185 Difference]: Start difference. First operand has 835 places, 702 transitions, 1780 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:25,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 835 places, 700 transitions, 1793 flow [2021-06-10 11:40:25,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 700 transitions, 1792 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:25,294 INFO L241 Difference]: Finished difference. Result has 834 places, 700 transitions, 1776 flow [2021-06-10 11:40:25,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1774, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=834, PETRI_TRANSITIONS=700} [2021-06-10 11:40:25,294 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 59 predicate places. [2021-06-10 11:40:25,294 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 700 transitions, 1776 flow [2021-06-10 11:40:25,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:25,295 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:25,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1320 [2021-06-10 11:40:25,295 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1059413810, now seen corresponding path program 1 times [2021-06-10 11:40:25,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:25,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528300381] [2021-06-10 11:40:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:25,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:25,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:25,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:40:25,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528300381] [2021-06-10 11:40:25,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:25,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:25,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052587145] [2021-06-10 11:40:25,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:25,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:25,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:25,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 700 transitions, 1776 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:25,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:25,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:25,629 INFO L129 PetriNetUnfolder]: 17/862 cut-off events. [2021-06-10 11:40:25,629 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:25,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 862 events. 17/862 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3848 event pairs, 0 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1096. Up to 30 conditions per place. [2021-06-10 11:40:25,673 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/701 dead transitions. [2021-06-10 11:40:25,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 701 transitions, 1792 flow [2021-06-10 11:40:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:25,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:25,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:25,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:25,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:25,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:25,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,677 INFO L185 Difference]: Start difference. First operand has 834 places, 700 transitions, 1776 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:25,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 836 places, 701 transitions, 1792 flow [2021-06-10 11:40:25,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 835 places, 701 transitions, 1791 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:25,684 INFO L241 Difference]: Finished difference. Result has 836 places, 700 transitions, 1780 flow [2021-06-10 11:40:25,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=833, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=836, PETRI_TRANSITIONS=700} [2021-06-10 11:40:25,684 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 61 predicate places. [2021-06-10 11:40:25,684 INFO L480 AbstractCegarLoop]: Abstraction has has 836 places, 700 transitions, 1780 flow [2021-06-10 11:40:25,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,685 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:25,685 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:25,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1321 [2021-06-10 11:40:25,685 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1059412787, now seen corresponding path program 1 times [2021-06-10 11:40:25,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:25,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756283959] [2021-06-10 11:40:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:25,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:25,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:25,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:25,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:40:25,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756283959] [2021-06-10 11:40:25,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:25,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:25,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392594951] [2021-06-10 11:40:25,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:25,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:25,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:25,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 836 places, 700 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:25,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:25,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:25,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:26,029 INFO L129 PetriNetUnfolder]: 15/864 cut-off events. [2021-06-10 11:40:26,029 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:26,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 864 events. 15/864 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3881 event pairs, 0 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1107. Up to 30 conditions per place. [2021-06-10 11:40:26,073 INFO L132 encePairwiseOnDemand]: 829/833 looper letters, 9 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2021-06-10 11:40:26,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 701 transitions, 1806 flow [2021-06-10 11:40:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2299 transitions. [2021-06-10 11:40:26,074 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199679871948779 [2021-06-10 11:40:26,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2299 transitions. [2021-06-10 11:40:26,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2299 transitions. [2021-06-10 11:40:26,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:26,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2299 transitions. [2021-06-10 11:40:26,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 766.3333333333334) internal successors, (2299), 3 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,077 INFO L185 Difference]: Start difference. First operand has 836 places, 700 transitions, 1780 flow. Second operand 3 states and 2299 transitions. [2021-06-10 11:40:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 838 places, 701 transitions, 1806 flow [2021-06-10 11:40:26,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 837 places, 701 transitions, 1805 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:26,084 INFO L241 Difference]: Finished difference. Result has 839 places, 701 transitions, 1797 flow [2021-06-10 11:40:26,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=835, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1797, PETRI_PLACES=839, PETRI_TRANSITIONS=701} [2021-06-10 11:40:26,084 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 64 predicate places. [2021-06-10 11:40:26,084 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 701 transitions, 1797 flow [2021-06-10 11:40:26,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:26,085 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:26,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1322 [2021-06-10 11:40:26,085 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1060366099, now seen corresponding path program 1 times [2021-06-10 11:40:26,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:26,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977904926] [2021-06-10 11:40:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:26,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:26,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:40:26,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977904926] [2021-06-10 11:40:26,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:26,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:26,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227932885] [2021-06-10 11:40:26,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:26,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:26,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:26,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 701 transitions, 1797 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:26,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:26,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:26,406 INFO L129 PetriNetUnfolder]: 15/857 cut-off events. [2021-06-10 11:40:26,406 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:26,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 857 events. 15/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3822 event pairs, 0 based on Foata normal form. 1/815 useless extension candidates. Maximal degree in co-relation 1093. Up to 30 conditions per place. [2021-06-10 11:40:26,475 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/699 dead transitions. [2021-06-10 11:40:26,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 841 places, 699 transitions, 1799 flow [2021-06-10 11:40:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:26,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:26,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:26,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:26,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:26,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:26,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,478 INFO L185 Difference]: Start difference. First operand has 839 places, 701 transitions, 1797 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:26,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 841 places, 699 transitions, 1799 flow [2021-06-10 11:40:26,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 699 transitions, 1791 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:26,486 INFO L241 Difference]: Finished difference. Result has 839 places, 699 transitions, 1784 flow [2021-06-10 11:40:26,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1784, PETRI_PLACES=839, PETRI_TRANSITIONS=699} [2021-06-10 11:40:26,486 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 64 predicate places. [2021-06-10 11:40:26,486 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 699 transitions, 1784 flow [2021-06-10 11:40:26,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:26,486 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:26,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1323 [2021-06-10 11:40:26,487 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1060367122, now seen corresponding path program 1 times [2021-06-10 11:40:26,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:26,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383441907] [2021-06-10 11:40:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:26,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:26,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:40:26,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383441907] [2021-06-10 11:40:26,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:26,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:26,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981548631] [2021-06-10 11:40:26,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:26,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:26,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:26,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 699 transitions, 1784 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:26,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:26,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:26,821 INFO L129 PetriNetUnfolder]: 15/855 cut-off events. [2021-06-10 11:40:26,821 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:26,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 855 events. 15/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3806 event pairs, 0 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1097. Up to 30 conditions per place. [2021-06-10 11:40:26,864 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/697 dead transitions. [2021-06-10 11:40:26,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 697 transitions, 1797 flow [2021-06-10 11:40:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:26,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:26,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:26,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:26,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:26,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:26,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,867 INFO L185 Difference]: Start difference. First operand has 839 places, 699 transitions, 1784 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:26,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 697 transitions, 1797 flow [2021-06-10 11:40:26,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 697 transitions, 1796 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:26,875 INFO L241 Difference]: Finished difference. Result has 838 places, 697 transitions, 1780 flow [2021-06-10 11:40:26,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=838, PETRI_TRANSITIONS=697} [2021-06-10 11:40:26,875 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 63 predicate places. [2021-06-10 11:40:26,875 INFO L480 AbstractCegarLoop]: Abstraction has has 838 places, 697 transitions, 1780 flow [2021-06-10 11:40:26,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:26,875 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:26,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1324 [2021-06-10 11:40:26,875 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 599285489, now seen corresponding path program 1 times [2021-06-10 11:40:26,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:26,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468372138] [2021-06-10 11:40:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:26,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:26,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:26,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:40:26,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468372138] [2021-06-10 11:40:26,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:26,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:26,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407810400] [2021-06-10 11:40:26,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:26,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:26,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:26,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 838 places, 697 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:26,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:26,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:26,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:27,208 INFO L129 PetriNetUnfolder]: 14/863 cut-off events. [2021-06-10 11:40:27,209 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:27,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 863 events. 14/863 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3875 event pairs, 0 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1109. Up to 30 conditions per place. [2021-06-10 11:40:27,252 INFO L132 encePairwiseOnDemand]: 828/833 looper letters, 10 selfloop transitions, 3 changer transitions 0/699 dead transitions. [2021-06-10 11:40:27,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 840 places, 699 transitions, 1810 flow [2021-06-10 11:40:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2021-06-10 11:40:27,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9207683073229291 [2021-06-10 11:40:27,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2301 transitions. [2021-06-10 11:40:27,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2301 transitions. [2021-06-10 11:40:27,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:27,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2301 transitions. [2021-06-10 11:40:27,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 767.0) internal successors, (2301), 3 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,256 INFO L185 Difference]: Start difference. First operand has 838 places, 697 transitions, 1780 flow. Second operand 3 states and 2301 transitions. [2021-06-10 11:40:27,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 840 places, 699 transitions, 1810 flow [2021-06-10 11:40:27,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 839 places, 699 transitions, 1809 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:27,263 INFO L241 Difference]: Finished difference. Result has 841 places, 699 transitions, 1803 flow [2021-06-10 11:40:27,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1803, PETRI_PLACES=841, PETRI_TRANSITIONS=699} [2021-06-10 11:40:27,264 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 66 predicate places. [2021-06-10 11:40:27,264 INFO L480 AbstractCegarLoop]: Abstraction has has 841 places, 699 transitions, 1803 flow [2021-06-10 11:40:27,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:27,264 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:27,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325 [2021-06-10 11:40:27,264 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash 599284466, now seen corresponding path program 1 times [2021-06-10 11:40:27,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:27,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423638189] [2021-06-10 11:40:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:27,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:27,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:27,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:40:27,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423638189] [2021-06-10 11:40:27,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:27,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:27,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953528011] [2021-06-10 11:40:27,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:27,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:27,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:27,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 841 places, 699 transitions, 1803 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:27,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:27,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:27,592 INFO L129 PetriNetUnfolder]: 12/864 cut-off events. [2021-06-10 11:40:27,592 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:27,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 864 events. 12/864 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3897 event pairs, 0 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1109. Up to 30 conditions per place. [2021-06-10 11:40:27,634 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 6 selfloop transitions, 1 changer transitions 0/699 dead transitions. [2021-06-10 11:40:27,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 699 transitions, 1815 flow [2021-06-10 11:40:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2021-06-10 11:40:27,635 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.923969587835134 [2021-06-10 11:40:27,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2309 transitions. [2021-06-10 11:40:27,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2309 transitions. [2021-06-10 11:40:27,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:27,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2309 transitions. [2021-06-10 11:40:27,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.6666666666666) internal successors, (2309), 3 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,638 INFO L185 Difference]: Start difference. First operand has 841 places, 699 transitions, 1803 flow. Second operand 3 states and 2309 transitions. [2021-06-10 11:40:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 699 transitions, 1815 flow [2021-06-10 11:40:27,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 699 transitions, 1810 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:27,645 INFO L241 Difference]: Finished difference. Result has 843 places, 698 transitions, 1799 flow [2021-06-10 11:40:27,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1799, PETRI_PLACES=843, PETRI_TRANSITIONS=698} [2021-06-10 11:40:27,645 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 68 predicate places. [2021-06-10 11:40:27,645 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 698 transitions, 1799 flow [2021-06-10 11:40:27,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:27,646 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:27,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1326 [2021-06-10 11:40:27,646 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 598332177, now seen corresponding path program 1 times [2021-06-10 11:40:27,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:27,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232292011] [2021-06-10 11:40:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:27,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:27,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:27,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:27,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:40:27,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232292011] [2021-06-10 11:40:27,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:27,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:27,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57423657] [2021-06-10 11:40:27,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:27,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:27,667 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 833 [2021-06-10 11:40:27,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 698 transitions, 1799 flow. Second operand has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:27,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:27,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 833 [2021-06-10 11:40:27,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:27,970 INFO L129 PetriNetUnfolder]: 12/857 cut-off events. [2021-06-10 11:40:27,970 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:28,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 857 events. 12/857 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3838 event pairs, 0 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 1103. Up to 30 conditions per place. [2021-06-10 11:40:28,014 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 5 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2021-06-10 11:40:28,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 696 transitions, 1802 flow [2021-06-10 11:40:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2021-06-10 11:40:28,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9235694277711084 [2021-06-10 11:40:28,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2308 transitions. [2021-06-10 11:40:28,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2308 transitions. [2021-06-10 11:40:28,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:28,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2308 transitions. [2021-06-10 11:40:28,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 769.3333333333334) internal successors, (2308), 3 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,018 INFO L185 Difference]: Start difference. First operand has 843 places, 698 transitions, 1799 flow. Second operand 3 states and 2308 transitions. [2021-06-10 11:40:28,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 696 transitions, 1802 flow [2021-06-10 11:40:28,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 696 transitions, 1795 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:28,025 INFO L241 Difference]: Finished difference. Result has 843 places, 696 transitions, 1788 flow [2021-06-10 11:40:28,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1788, PETRI_PLACES=843, PETRI_TRANSITIONS=696} [2021-06-10 11:40:28,026 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 68 predicate places. [2021-06-10 11:40:28,026 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 696 transitions, 1788 flow [2021-06-10 11:40:28,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 768.3333333333334) internal successors, (2305), 3 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,026 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:28,026 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:28,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1327 [2021-06-10 11:40:28,026 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 598331154, now seen corresponding path program 1 times [2021-06-10 11:40:28,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:28,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058350448] [2021-06-10 11:40:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:28,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:28,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:28,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:28,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:28,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:28,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:40:28,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058350448] [2021-06-10 11:40:28,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:28,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:28,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145100471] [2021-06-10 11:40:28,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:28,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:28,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 833 [2021-06-10 11:40:28,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 696 transitions, 1788 flow. Second operand has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:28,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 833 [2021-06-10 11:40:28,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:28,349 INFO L129 PetriNetUnfolder]: 12/855 cut-off events. [2021-06-10 11:40:28,349 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:28,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 855 events. 12/855 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3823 event pairs, 0 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1103. Up to 30 conditions per place. [2021-06-10 11:40:28,392 INFO L132 encePairwiseOnDemand]: 831/833 looper letters, 8 selfloop transitions, 1 changer transitions 0/694 dead transitions. [2021-06-10 11:40:28,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 694 transitions, 1801 flow [2021-06-10 11:40:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2296 transitions. [2021-06-10 11:40:28,393 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2021-06-10 11:40:28,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2296 transitions. [2021-06-10 11:40:28,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2296 transitions. [2021-06-10 11:40:28,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:28,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2296 transitions. [2021-06-10 11:40:28,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 765.3333333333334) internal successors, (2296), 3 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 833.0) internal successors, (3332), 4 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,395 INFO L185 Difference]: Start difference. First operand has 843 places, 696 transitions, 1788 flow. Second operand 3 states and 2296 transitions. [2021-06-10 11:40:28,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 694 transitions, 1801 flow [2021-06-10 11:40:28,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 694 transitions, 1800 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:28,403 INFO L241 Difference]: Finished difference. Result has 842 places, 694 transitions, 1784 flow [2021-06-10 11:40:28,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=833, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1784, PETRI_PLACES=842, PETRI_TRANSITIONS=694} [2021-06-10 11:40:28,403 INFO L343 CegarLoopForPetriNet]: 775 programPoint places, 67 predicate places. [2021-06-10 11:40:28,403 INFO L480 AbstractCegarLoop]: Abstraction has has 842 places, 694 transitions, 1784 flow [2021-06-10 11:40:28,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 764.3333333333334) internal successors, (2293), 3 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:28,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:28,404 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:28,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1328 [2021-06-10 11:40:28,404 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash -260972693, now seen corresponding path program 1 times [2021-06-10 11:40:28,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:28,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368245710] [2021-06-10 11:40:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:40:28,419 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:40:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:40:28,425 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:40:28,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:40:28,445 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:40:28,445 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1329 [2021-06-10 11:40:28,445 WARN L342 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:40:28,445 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of30ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of30ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:40:28,632 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:40:28,632 INFO L253 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2021-06-10 11:40:28,633 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:40:28,633 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:40:28,633 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:40:28,633 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:40:28,633 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:40:28,633 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:40:28,633 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:40:28,633 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:40:28,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 801 places, 861 transitions, 2742 flow [2021-06-10 11:40:28,971 INFO L129 PetriNetUnfolder]: 151/1130 cut-off events. [2021-06-10 11:40:28,971 INFO L130 PetriNetUnfolder]: For 4930/4930 co-relation queries the response was YES. [2021-06-10 11:40:29,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1130 events. 151/1130 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4840 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1606. Up to 62 conditions per place. [2021-06-10 11:40:29,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 801 places, 861 transitions, 2742 flow [2021-06-10 11:40:29,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 801 places, 861 transitions, 2742 flow [2021-06-10 11:40:29,062 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2021-06-10 11:40:29,062 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:40:29,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:29,062 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-06-10 11:40:29,062 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1982734784, now seen corresponding path program 1 times [2021-06-10 11:40:29,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:29,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204031301] [2021-06-10 11:40:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:29,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:29,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:40:29,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204031301] [2021-06-10 11:40:29,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:29,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:29,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407923314] [2021-06-10 11:40:29,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:29,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:29,079 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:29,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 861 transitions, 2742 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:29,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:29,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:29,330 INFO L129 PetriNetUnfolder]: 88/889 cut-off events. [2021-06-10 11:40:29,330 INFO L130 PetriNetUnfolder]: For 4931/4931 co-relation queries the response was YES. [2021-06-10 11:40:29,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 889 events. 88/889 cut-off events. For 4931/4931 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3566 event pairs, 0 based on Foata normal form. 122/891 useless extension candidates. Maximal degree in co-relation 1377. Up to 31 conditions per place. [2021-06-10 11:40:29,388 INFO L132 encePairwiseOnDemand]: 826/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/796 dead transitions. [2021-06-10 11:40:29,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 768 places, 796 transitions, 2626 flow [2021-06-10 11:40:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2451 transitions. [2021-06-10 11:40:29,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9488966318234611 [2021-06-10 11:40:29,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2451 transitions. [2021-06-10 11:40:29,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2451 transitions. [2021-06-10 11:40:29,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:29,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2451 transitions. [2021-06-10 11:40:29,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.0) internal successors, (2451), 3 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,392 INFO L185 Difference]: Start difference. First operand has 801 places, 861 transitions, 2742 flow. Second operand 3 states and 2451 transitions. [2021-06-10 11:40:29,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 768 places, 796 transitions, 2626 flow [2021-06-10 11:40:29,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 796 transitions, 1756 flow, removed 435 selfloop flow, removed 0 redundant places. [2021-06-10 11:40:29,404 INFO L241 Difference]: Finished difference. Result has 770 places, 796 transitions, 1754 flow [2021-06-10 11:40:29,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1754, PETRI_PLACES=770, PETRI_TRANSITIONS=796} [2021-06-10 11:40:29,404 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -31 predicate places. [2021-06-10 11:40:29,404 INFO L480 AbstractCegarLoop]: Abstraction has has 770 places, 796 transitions, 1754 flow [2021-06-10 11:40:29,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:29,404 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-06-10 11:40:29,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1330 [2021-06-10 11:40:29,404 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1981781472, now seen corresponding path program 1 times [2021-06-10 11:40:29,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:29,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966607939] [2021-06-10 11:40:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:29,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:29,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:40:29,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966607939] [2021-06-10 11:40:29,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:29,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:29,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793251233] [2021-06-10 11:40:29,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:29,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:29,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:29,421 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:29,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 796 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:29,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:29,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:29,658 INFO L129 PetriNetUnfolder]: 88/888 cut-off events. [2021-06-10 11:40:29,658 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:29,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 888 events. 88/888 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3555 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 977. Up to 31 conditions per place. [2021-06-10 11:40:29,711 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 2 changer transitions 0/796 dead transitions. [2021-06-10 11:40:29,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 796 transitions, 1776 flow [2021-06-10 11:40:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:29,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:29,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:29,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:29,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:29,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,715 INFO L185 Difference]: Start difference. First operand has 770 places, 796 transitions, 1754 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:29,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 772 places, 796 transitions, 1776 flow [2021-06-10 11:40:29,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 796 transitions, 1774 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:29,722 INFO L241 Difference]: Finished difference. Result has 773 places, 796 transitions, 1764 flow [2021-06-10 11:40:29,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1764, PETRI_PLACES=773, PETRI_TRANSITIONS=796} [2021-06-10 11:40:29,723 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -28 predicate places. [2021-06-10 11:40:29,723 INFO L480 AbstractCegarLoop]: Abstraction has has 773 places, 796 transitions, 1764 flow [2021-06-10 11:40:29,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,723 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:29,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-06-10 11:40:29,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1331 [2021-06-10 11:40:29,723 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1981782495, now seen corresponding path program 1 times [2021-06-10 11:40:29,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:29,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224214219] [2021-06-10 11:40:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:29,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:29,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:29,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:40:29,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224214219] [2021-06-10 11:40:29,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:29,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:29,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175915745] [2021-06-10 11:40:29,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:29,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:29,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:29,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 796 transitions, 1764 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:29,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:29,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:29,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:29,969 INFO L129 PetriNetUnfolder]: 87/886 cut-off events. [2021-06-10 11:40:29,969 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:30,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 886 events. 87/886 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3548 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 975. Up to 31 conditions per place. [2021-06-10 11:40:30,022 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/794 dead transitions. [2021-06-10 11:40:30,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 794 transitions, 1767 flow [2021-06-10 11:40:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:30,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:30,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:30,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:30,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:30,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:30,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,026 INFO L185 Difference]: Start difference. First operand has 773 places, 796 transitions, 1764 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:30,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 794 transitions, 1767 flow [2021-06-10 11:40:30,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 794 transitions, 1761 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:40:30,033 INFO L241 Difference]: Finished difference. Result has 773 places, 794 transitions, 1751 flow [2021-06-10 11:40:30,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1751, PETRI_PLACES=773, PETRI_TRANSITIONS=794} [2021-06-10 11:40:30,034 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -28 predicate places. [2021-06-10 11:40:30,034 INFO L480 AbstractCegarLoop]: Abstraction has has 773 places, 794 transitions, 1751 flow [2021-06-10 11:40:30,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,034 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:30,034 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-06-10 11:40:30,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1332 [2021-06-10 11:40:30,034 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1982735807, now seen corresponding path program 1 times [2021-06-10 11:40:30,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:30,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012545343] [2021-06-10 11:40:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:30,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:30,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:40:30,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012545343] [2021-06-10 11:40:30,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:30,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:30,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938784218] [2021-06-10 11:40:30,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:30,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:30,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:30,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 794 transitions, 1751 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:30,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:30,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:30,298 INFO L129 PetriNetUnfolder]: 87/884 cut-off events. [2021-06-10 11:40:30,299 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-06-10 11:40:30,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 884 events. 87/884 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3537 event pairs, 0 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 981. Up to 31 conditions per place. [2021-06-10 11:40:30,352 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/792 dead transitions. [2021-06-10 11:40:30,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 792 transitions, 1763 flow [2021-06-10 11:40:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:30,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:30,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:30,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:30,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:30,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:30,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,356 INFO L185 Difference]: Start difference. First operand has 773 places, 794 transitions, 1751 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:30,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 792 transitions, 1763 flow [2021-06-10 11:40:30,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 772 places, 792 transitions, 1762 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:30,363 INFO L241 Difference]: Finished difference. Result has 772 places, 792 transitions, 1746 flow [2021-06-10 11:40:30,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1746, PETRI_PLACES=772, PETRI_TRANSITIONS=792} [2021-06-10 11:40:30,364 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -29 predicate places. [2021-06-10 11:40:30,364 INFO L480 AbstractCegarLoop]: Abstraction has has 772 places, 792 transitions, 1746 flow [2021-06-10 11:40:30,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:30,364 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:30,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1333 [2021-06-10 11:40:30,364 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash -194035959, now seen corresponding path program 1 times [2021-06-10 11:40:30,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:30,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750644037] [2021-06-10 11:40:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:30,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:30,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:40:30,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750644037] [2021-06-10 11:40:30,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:30,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:30,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522304605] [2021-06-10 11:40:30,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:30,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:30,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:30,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 792 transitions, 1746 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:30,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:30,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:30,646 INFO L129 PetriNetUnfolder]: 86/891 cut-off events. [2021-06-10 11:40:30,646 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:30,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 891 events. 86/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3592 event pairs, 0 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 985. Up to 31 conditions per place. [2021-06-10 11:40:30,683 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/793 dead transitions. [2021-06-10 11:40:30,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 793 transitions, 1762 flow [2021-06-10 11:40:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:30,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:30,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:30,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:30,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:30,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:30,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,687 INFO L185 Difference]: Start difference. First operand has 772 places, 792 transitions, 1746 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:30,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 793 transitions, 1762 flow [2021-06-10 11:40:30,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 773 places, 793 transitions, 1761 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:30,693 INFO L241 Difference]: Finished difference. Result has 774 places, 792 transitions, 1750 flow [2021-06-10 11:40:30,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1750, PETRI_PLACES=774, PETRI_TRANSITIONS=792} [2021-06-10 11:40:30,694 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -27 predicate places. [2021-06-10 11:40:30,694 INFO L480 AbstractCegarLoop]: Abstraction has has 774 places, 792 transitions, 1750 flow [2021-06-10 11:40:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:30,694 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:30,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1334 [2021-06-10 11:40:30,694 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -194034936, now seen corresponding path program 1 times [2021-06-10 11:40:30,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:30,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647389990] [2021-06-10 11:40:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:30,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:30,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:30,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:40:30,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647389990] [2021-06-10 11:40:30,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:30,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:30,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945026847] [2021-06-10 11:40:30,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:30,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:30,711 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:30,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 792 transitions, 1750 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:30,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:30,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:30,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:30,949 INFO L129 PetriNetUnfolder]: 84/893 cut-off events. [2021-06-10 11:40:30,949 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:30,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 893 events. 84/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3628 event pairs, 0 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 997. Up to 31 conditions per place. [2021-06-10 11:40:31,002 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/793 dead transitions. [2021-06-10 11:40:31,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 793 transitions, 1776 flow [2021-06-10 11:40:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:31,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:31,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:31,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:31,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:31,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:31,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,006 INFO L185 Difference]: Start difference. First operand has 774 places, 792 transitions, 1750 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:31,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 793 transitions, 1776 flow [2021-06-10 11:40:31,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 793 transitions, 1775 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:31,013 INFO L241 Difference]: Finished difference. Result has 777 places, 793 transitions, 1767 flow [2021-06-10 11:40:31,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=773, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1767, PETRI_PLACES=777, PETRI_TRANSITIONS=793} [2021-06-10 11:40:31,013 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -24 predicate places. [2021-06-10 11:40:31,013 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 793 transitions, 1767 flow [2021-06-10 11:40:31,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:31,013 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:31,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1335 [2021-06-10 11:40:31,014 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -194988248, now seen corresponding path program 1 times [2021-06-10 11:40:31,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:31,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865332473] [2021-06-10 11:40:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:31,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:31,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:40:31,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865332473] [2021-06-10 11:40:31,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:31,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:31,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435573338] [2021-06-10 11:40:31,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:31,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:31,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:31,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 793 transitions, 1767 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:31,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:31,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:31,262 INFO L129 PetriNetUnfolder]: 84/886 cut-off events. [2021-06-10 11:40:31,262 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:31,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 886 events. 84/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3566 event pairs, 0 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 982. Up to 31 conditions per place. [2021-06-10 11:40:31,315 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/791 dead transitions. [2021-06-10 11:40:31,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 791 transitions, 1769 flow [2021-06-10 11:40:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:31,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:31,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:31,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:31,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:31,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:31,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,319 INFO L185 Difference]: Start difference. First operand has 777 places, 793 transitions, 1767 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:31,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 779 places, 791 transitions, 1769 flow [2021-06-10 11:40:31,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 791 transitions, 1761 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:31,326 INFO L241 Difference]: Finished difference. Result has 777 places, 791 transitions, 1754 flow [2021-06-10 11:40:31,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1754, PETRI_PLACES=777, PETRI_TRANSITIONS=791} [2021-06-10 11:40:31,326 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -24 predicate places. [2021-06-10 11:40:31,326 INFO L480 AbstractCegarLoop]: Abstraction has has 777 places, 791 transitions, 1754 flow [2021-06-10 11:40:31,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,326 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:31,327 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:31,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1336 [2021-06-10 11:40:31,327 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash -194989271, now seen corresponding path program 1 times [2021-06-10 11:40:31,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:31,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231057949] [2021-06-10 11:40:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:31,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:31,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:40:31,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231057949] [2021-06-10 11:40:31,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:31,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:31,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455669855] [2021-06-10 11:40:31,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:31,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:31,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:31,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 791 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:31,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:31,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:31,580 INFO L129 PetriNetUnfolder]: 84/884 cut-off events. [2021-06-10 11:40:31,580 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:31,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 884 events. 84/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3551 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 987. Up to 31 conditions per place. [2021-06-10 11:40:31,631 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/789 dead transitions. [2021-06-10 11:40:31,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 789 transitions, 1767 flow [2021-06-10 11:40:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:31,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:31,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:31,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:31,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:31,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:31,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,635 INFO L185 Difference]: Start difference. First operand has 777 places, 791 transitions, 1754 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:31,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 789 transitions, 1767 flow [2021-06-10 11:40:31,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 789 transitions, 1766 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:31,642 INFO L241 Difference]: Finished difference. Result has 776 places, 789 transitions, 1750 flow [2021-06-10 11:40:31,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1750, PETRI_PLACES=776, PETRI_TRANSITIONS=789} [2021-06-10 11:40:31,643 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -25 predicate places. [2021-06-10 11:40:31,643 INFO L480 AbstractCegarLoop]: Abstraction has has 776 places, 789 transitions, 1750 flow [2021-06-10 11:40:31,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:31,643 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:31,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1337 [2021-06-10 11:40:31,643 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2106118127, now seen corresponding path program 1 times [2021-06-10 11:40:31,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:31,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094672022] [2021-06-10 11:40:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:31,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:31,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:40:31,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094672022] [2021-06-10 11:40:31,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:31,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:31,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340694171] [2021-06-10 11:40:31,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:31,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:31,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:31,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 776 places, 789 transitions, 1750 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:31,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:31,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:31,896 INFO L129 PetriNetUnfolder]: 82/889 cut-off events. [2021-06-10 11:40:31,896 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:31,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 889 events. 82/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3600 event pairs, 0 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 990. Up to 31 conditions per place. [2021-06-10 11:40:31,948 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/790 dead transitions. [2021-06-10 11:40:31,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 790 transitions, 1766 flow [2021-06-10 11:40:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:31,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:31,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:31,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:31,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:31,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,952 INFO L185 Difference]: Start difference. First operand has 776 places, 789 transitions, 1750 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 778 places, 790 transitions, 1766 flow [2021-06-10 11:40:31,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 790 transitions, 1765 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:31,959 INFO L241 Difference]: Finished difference. Result has 779 places, 790 transitions, 1763 flow [2021-06-10 11:40:31,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1749, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1763, PETRI_PLACES=779, PETRI_TRANSITIONS=790} [2021-06-10 11:40:31,960 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -22 predicate places. [2021-06-10 11:40:31,960 INFO L480 AbstractCegarLoop]: Abstraction has has 779 places, 790 transitions, 1763 flow [2021-06-10 11:40:31,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,960 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:31,960 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:31,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1338 [2021-06-10 11:40:31,960 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2106119150, now seen corresponding path program 1 times [2021-06-10 11:40:31,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:31,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194885166] [2021-06-10 11:40:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:31,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:31,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:31,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:40:31,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194885166] [2021-06-10 11:40:31,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:31,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:31,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233244580] [2021-06-10 11:40:31,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:31,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:31,978 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:31,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 790 transitions, 1763 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:31,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:31,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:31,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:32,227 INFO L129 PetriNetUnfolder]: 82/890 cut-off events. [2021-06-10 11:40:32,227 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:32,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 890 events. 82/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3610 event pairs, 0 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 998. Up to 31 conditions per place. [2021-06-10 11:40:32,283 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/791 dead transitions. [2021-06-10 11:40:32,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 791 transitions, 1789 flow [2021-06-10 11:40:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:32,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:32,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:32,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:32,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:32,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:32,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,287 INFO L185 Difference]: Start difference. First operand has 779 places, 790 transitions, 1763 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:32,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 791 transitions, 1789 flow [2021-06-10 11:40:32,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 791 transitions, 1787 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:32,295 INFO L241 Difference]: Finished difference. Result has 782 places, 791 transitions, 1779 flow [2021-06-10 11:40:32,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1779, PETRI_PLACES=782, PETRI_TRANSITIONS=791} [2021-06-10 11:40:32,295 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -19 predicate places. [2021-06-10 11:40:32,295 INFO L480 AbstractCegarLoop]: Abstraction has has 782 places, 791 transitions, 1779 flow [2021-06-10 11:40:32,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:32,295 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:32,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1339 [2021-06-10 11:40:32,295 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:32,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2105165838, now seen corresponding path program 1 times [2021-06-10 11:40:32,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:32,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461926210] [2021-06-10 11:40:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:32,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:32,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:40:32,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461926210] [2021-06-10 11:40:32,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:32,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:32,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171871429] [2021-06-10 11:40:32,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:32,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:32,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:32,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 782 places, 791 transitions, 1779 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:32,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:32,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:32,595 INFO L129 PetriNetUnfolder]: 81/886 cut-off events. [2021-06-10 11:40:32,595 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:32,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 886 events. 81/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3585 event pairs, 0 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 991. Up to 31 conditions per place. [2021-06-10 11:40:32,630 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/788 dead transitions. [2021-06-10 11:40:32,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 788 transitions, 1776 flow [2021-06-10 11:40:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:32,632 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:32,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:32,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:32,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:32,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:32,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,634 INFO L185 Difference]: Start difference. First operand has 782 places, 791 transitions, 1779 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:32,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 784 places, 788 transitions, 1776 flow [2021-06-10 11:40:32,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 788 transitions, 1768 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:32,646 INFO L241 Difference]: Finished difference. Result has 781 places, 788 transitions, 1758 flow [2021-06-10 11:40:32,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1758, PETRI_PLACES=781, PETRI_TRANSITIONS=788} [2021-06-10 11:40:32,647 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -20 predicate places. [2021-06-10 11:40:32,647 INFO L480 AbstractCegarLoop]: Abstraction has has 781 places, 788 transitions, 1758 flow [2021-06-10 11:40:32,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:32,647 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:32,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1340 [2021-06-10 11:40:32,647 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2105164815, now seen corresponding path program 1 times [2021-06-10 11:40:32,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:32,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389981574] [2021-06-10 11:40:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:32,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:32,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:40:32,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389981574] [2021-06-10 11:40:32,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:32,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:32,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500711551] [2021-06-10 11:40:32,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:32,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:32,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:32,665 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:32,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 788 transitions, 1758 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:32,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:32,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:32,907 INFO L129 PetriNetUnfolder]: 81/884 cut-off events. [2021-06-10 11:40:32,907 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:32,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 884 events. 81/884 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3570 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 994. Up to 31 conditions per place. [2021-06-10 11:40:32,963 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/786 dead transitions. [2021-06-10 11:40:32,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 786 transitions, 1771 flow [2021-06-10 11:40:32,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:32,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:32,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:32,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:32,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,967 INFO L185 Difference]: Start difference. First operand has 781 places, 788 transitions, 1758 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:32,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 786 transitions, 1771 flow [2021-06-10 11:40:32,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 786 transitions, 1770 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:32,974 INFO L241 Difference]: Finished difference. Result has 780 places, 786 transitions, 1754 flow [2021-06-10 11:40:32,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=778, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1754, PETRI_PLACES=780, PETRI_TRANSITIONS=786} [2021-06-10 11:40:32,975 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -21 predicate places. [2021-06-10 11:40:32,975 INFO L480 AbstractCegarLoop]: Abstraction has has 780 places, 786 transitions, 1754 flow [2021-06-10 11:40:32,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:32,975 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:32,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1341 [2021-06-10 11:40:32,975 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash -510689669, now seen corresponding path program 1 times [2021-06-10 11:40:32,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:32,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519997285] [2021-06-10 11:40:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:32,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:32,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:32,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:40:32,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519997285] [2021-06-10 11:40:32,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:32,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:32,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827163605] [2021-06-10 11:40:32,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:32,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:32,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:32,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:32,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:32,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 786 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:32,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:32,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:32,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:33,232 INFO L129 PetriNetUnfolder]: 79/889 cut-off events. [2021-06-10 11:40:33,232 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:33,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 889 events. 79/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3622 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 997. Up to 31 conditions per place. [2021-06-10 11:40:33,287 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/787 dead transitions. [2021-06-10 11:40:33,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 782 places, 787 transitions, 1770 flow [2021-06-10 11:40:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:33,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:33,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:33,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:33,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:33,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:33,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,291 INFO L185 Difference]: Start difference. First operand has 780 places, 786 transitions, 1754 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:33,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 782 places, 787 transitions, 1770 flow [2021-06-10 11:40:33,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 787 transitions, 1769 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:33,298 INFO L241 Difference]: Finished difference. Result has 783 places, 787 transitions, 1767 flow [2021-06-10 11:40:33,298 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1767, PETRI_PLACES=783, PETRI_TRANSITIONS=787} [2021-06-10 11:40:33,298 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -18 predicate places. [2021-06-10 11:40:33,298 INFO L480 AbstractCegarLoop]: Abstraction has has 783 places, 787 transitions, 1767 flow [2021-06-10 11:40:33,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:33,299 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:33,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1342 [2021-06-10 11:40:33,299 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash -510690692, now seen corresponding path program 1 times [2021-06-10 11:40:33,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:33,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492620646] [2021-06-10 11:40:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:33,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:33,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:40:33,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492620646] [2021-06-10 11:40:33,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:33,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:33,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452023736] [2021-06-10 11:40:33,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:33,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:33,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:33,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 787 transitions, 1767 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:33,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:33,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:33,574 INFO L129 PetriNetUnfolder]: 79/890 cut-off events. [2021-06-10 11:40:33,574 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:33,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 890 events. 79/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3628 event pairs, 0 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 1005. Up to 31 conditions per place. [2021-06-10 11:40:33,627 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/788 dead transitions. [2021-06-10 11:40:33,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 785 places, 788 transitions, 1793 flow [2021-06-10 11:40:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:33,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:33,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:33,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:33,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:33,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:33,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,631 INFO L185 Difference]: Start difference. First operand has 783 places, 787 transitions, 1767 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:33,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 785 places, 788 transitions, 1793 flow [2021-06-10 11:40:33,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 784 places, 788 transitions, 1791 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:33,638 INFO L241 Difference]: Finished difference. Result has 786 places, 788 transitions, 1783 flow [2021-06-10 11:40:33,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=782, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1783, PETRI_PLACES=786, PETRI_TRANSITIONS=788} [2021-06-10 11:40:33,639 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -15 predicate places. [2021-06-10 11:40:33,639 INFO L480 AbstractCegarLoop]: Abstraction has has 786 places, 788 transitions, 1783 flow [2021-06-10 11:40:33,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,639 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:33,639 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:33,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1343 [2021-06-10 11:40:33,639 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash -509736357, now seen corresponding path program 1 times [2021-06-10 11:40:33,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:33,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975944441] [2021-06-10 11:40:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:33,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:33,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:40:33,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975944441] [2021-06-10 11:40:33,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:33,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:33,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334584722] [2021-06-10 11:40:33,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:33,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:33,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:33,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 788 transitions, 1783 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:33,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:33,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:33,907 INFO L129 PetriNetUnfolder]: 78/887 cut-off events. [2021-06-10 11:40:33,907 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:40:33,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 887 events. 78/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3612 event pairs, 0 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 1004. Up to 31 conditions per place. [2021-06-10 11:40:33,959 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/786 dead transitions. [2021-06-10 11:40:33,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 786 transitions, 1791 flow [2021-06-10 11:40:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:40:33,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:40:33,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:40:33,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:40:33,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:33,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:40:33,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,963 INFO L185 Difference]: Start difference. First operand has 786 places, 788 transitions, 1783 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:40:33,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 786 transitions, 1791 flow [2021-06-10 11:40:33,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 786 transitions, 1790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:33,970 INFO L241 Difference]: Finished difference. Result has 787 places, 786 transitions, 1772 flow [2021-06-10 11:40:33,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1772, PETRI_PLACES=787, PETRI_TRANSITIONS=786} [2021-06-10 11:40:33,970 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -14 predicate places. [2021-06-10 11:40:33,971 INFO L480 AbstractCegarLoop]: Abstraction has has 787 places, 786 transitions, 1772 flow [2021-06-10 11:40:33,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:33,971 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:33,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1344 [2021-06-10 11:40:33,971 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash -509737380, now seen corresponding path program 1 times [2021-06-10 11:40:33,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:33,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657890586] [2021-06-10 11:40:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:33,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:33,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:33,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:40:33,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657890586] [2021-06-10 11:40:33,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:33,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:33,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565256918] [2021-06-10 11:40:33,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:33,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:33,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:33,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 786 transitions, 1772 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:33,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:33,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:33,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:34,236 INFO L129 PetriNetUnfolder]: 78/884 cut-off events. [2021-06-10 11:40:34,236 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:34,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 884 events. 78/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3586 event pairs, 0 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 998. Up to 31 conditions per place. [2021-06-10 11:40:34,291 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/783 dead transitions. [2021-06-10 11:40:34,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 783 transitions, 1773 flow [2021-06-10 11:40:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:34,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:34,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:34,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:34,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:34,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,295 INFO L185 Difference]: Start difference. First operand has 787 places, 786 transitions, 1772 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:34,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 783 transitions, 1773 flow [2021-06-10 11:40:34,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 784 places, 783 transitions, 1768 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:34,303 INFO L241 Difference]: Finished difference. Result has 784 places, 783 transitions, 1758 flow [2021-06-10 11:40:34,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=782, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1758, PETRI_PLACES=784, PETRI_TRANSITIONS=783} [2021-06-10 11:40:34,303 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -17 predicate places. [2021-06-10 11:40:34,303 INFO L480 AbstractCegarLoop]: Abstraction has has 784 places, 783 transitions, 1758 flow [2021-06-10 11:40:34,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:34,303 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:34,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1345 [2021-06-10 11:40:34,303 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash -440543289, now seen corresponding path program 1 times [2021-06-10 11:40:34,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:34,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127968087] [2021-06-10 11:40:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:34,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:34,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:34,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:40:34,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127968087] [2021-06-10 11:40:34,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:34,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:34,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125718463] [2021-06-10 11:40:34,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:34,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:34,322 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:34,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 784 places, 783 transitions, 1758 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:34,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:34,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:34,634 INFO L129 PetriNetUnfolder]: 77/891 cut-off events. [2021-06-10 11:40:34,634 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:34,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 891 events. 77/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3647 event pairs, 0 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1008. Up to 31 conditions per place. [2021-06-10 11:40:34,669 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/784 dead transitions. [2021-06-10 11:40:34,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 784 transitions, 1774 flow [2021-06-10 11:40:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:34,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:34,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:34,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:34,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:34,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:34,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,673 INFO L185 Difference]: Start difference. First operand has 784 places, 783 transitions, 1758 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 784 transitions, 1774 flow [2021-06-10 11:40:34,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 785 places, 784 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:34,679 INFO L241 Difference]: Finished difference. Result has 786 places, 783 transitions, 1762 flow [2021-06-10 11:40:34,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=783, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1762, PETRI_PLACES=786, PETRI_TRANSITIONS=783} [2021-06-10 11:40:34,680 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -15 predicate places. [2021-06-10 11:40:34,680 INFO L480 AbstractCegarLoop]: Abstraction has has 786 places, 783 transitions, 1762 flow [2021-06-10 11:40:34,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:34,680 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:34,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1346 [2021-06-10 11:40:34,680 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash -440542266, now seen corresponding path program 1 times [2021-06-10 11:40:34,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:34,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003533450] [2021-06-10 11:40:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:34,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:34,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:34,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:34,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:40:34,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003533450] [2021-06-10 11:40:34,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:34,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:34,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011779569] [2021-06-10 11:40:34,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:34,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:34,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:34,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 783 transitions, 1762 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:34,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:34,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:34,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:34,953 INFO L129 PetriNetUnfolder]: 75/893 cut-off events. [2021-06-10 11:40:34,953 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:34,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 893 events. 75/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3680 event pairs, 0 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1017. Up to 31 conditions per place. [2021-06-10 11:40:35,006 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/784 dead transitions. [2021-06-10 11:40:35,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 784 transitions, 1788 flow [2021-06-10 11:40:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:35,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:35,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:35,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:35,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:35,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:35,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,011 INFO L185 Difference]: Start difference. First operand has 786 places, 783 transitions, 1762 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:35,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 784 transitions, 1788 flow [2021-06-10 11:40:35,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 784 transitions, 1787 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:35,018 INFO L241 Difference]: Finished difference. Result has 789 places, 784 transitions, 1779 flow [2021-06-10 11:40:35,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1779, PETRI_PLACES=789, PETRI_TRANSITIONS=784} [2021-06-10 11:40:35,018 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -12 predicate places. [2021-06-10 11:40:35,018 INFO L480 AbstractCegarLoop]: Abstraction has has 789 places, 784 transitions, 1779 flow [2021-06-10 11:40:35,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,018 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:35,018 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:35,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1347 [2021-06-10 11:40:35,018 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash -441495578, now seen corresponding path program 1 times [2021-06-10 11:40:35,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:35,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055771524] [2021-06-10 11:40:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:35,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:35,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:40:35,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055771524] [2021-06-10 11:40:35,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:35,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:35,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439880102] [2021-06-10 11:40:35,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:35,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:35,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:35,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 784 transitions, 1779 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:35,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:35,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:35,281 INFO L129 PetriNetUnfolder]: 75/886 cut-off events. [2021-06-10 11:40:35,281 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:35,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 886 events. 75/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3619 event pairs, 0 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 1003. Up to 31 conditions per place. [2021-06-10 11:40:35,332 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/782 dead transitions. [2021-06-10 11:40:35,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 782 transitions, 1781 flow [2021-06-10 11:40:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:35,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:35,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:35,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:35,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:35,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:35,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,336 INFO L185 Difference]: Start difference. First operand has 789 places, 784 transitions, 1779 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:35,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 791 places, 782 transitions, 1781 flow [2021-06-10 11:40:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 782 transitions, 1773 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:35,343 INFO L241 Difference]: Finished difference. Result has 789 places, 782 transitions, 1766 flow [2021-06-10 11:40:35,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1766, PETRI_PLACES=789, PETRI_TRANSITIONS=782} [2021-06-10 11:40:35,344 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -12 predicate places. [2021-06-10 11:40:35,344 INFO L480 AbstractCegarLoop]: Abstraction has has 789 places, 782 transitions, 1766 flow [2021-06-10 11:40:35,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:35,344 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:35,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1348 [2021-06-10 11:40:35,344 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash -441496601, now seen corresponding path program 1 times [2021-06-10 11:40:35,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:35,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591839475] [2021-06-10 11:40:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:35,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:35,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:40:35,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591839475] [2021-06-10 11:40:35,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:35,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:35,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001807057] [2021-06-10 11:40:35,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:35,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:35,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:35,362 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:35,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 782 transitions, 1766 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:35,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:35,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:35,609 INFO L129 PetriNetUnfolder]: 75/884 cut-off events. [2021-06-10 11:40:35,610 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:35,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 884 events. 75/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3607 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1007. Up to 31 conditions per place. [2021-06-10 11:40:35,662 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/780 dead transitions. [2021-06-10 11:40:35,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 780 transitions, 1779 flow [2021-06-10 11:40:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:35,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:35,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:35,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:35,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:35,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:35,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,668 INFO L185 Difference]: Start difference. First operand has 789 places, 782 transitions, 1766 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:35,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 789 places, 780 transitions, 1779 flow [2021-06-10 11:40:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 780 transitions, 1778 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:35,675 INFO L241 Difference]: Finished difference. Result has 788 places, 780 transitions, 1762 flow [2021-06-10 11:40:35,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=786, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1762, PETRI_PLACES=788, PETRI_TRANSITIONS=780} [2021-06-10 11:40:35,675 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -13 predicate places. [2021-06-10 11:40:35,676 INFO L480 AbstractCegarLoop]: Abstraction has has 788 places, 780 transitions, 1762 flow [2021-06-10 11:40:35,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:35,676 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:35,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349 [2021-06-10 11:40:35,676 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1144833234, now seen corresponding path program 1 times [2021-06-10 11:40:35,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:35,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254620893] [2021-06-10 11:40:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:35,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:35,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:35,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254620893] [2021-06-10 11:40:35,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:35,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:35,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844918474] [2021-06-10 11:40:35,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:35,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:35,694 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:35,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 780 transitions, 1762 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:35,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:35,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:35,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:35,954 INFO L129 PetriNetUnfolder]: 73/889 cut-off events. [2021-06-10 11:40:35,954 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:35,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 889 events. 73/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3657 event pairs, 0 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1010. Up to 31 conditions per place. [2021-06-10 11:40:36,005 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/781 dead transitions. [2021-06-10 11:40:36,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 790 places, 781 transitions, 1778 flow [2021-06-10 11:40:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:36,007 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:36,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:36,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:36,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:36,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:36,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,009 INFO L185 Difference]: Start difference. First operand has 788 places, 780 transitions, 1762 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:36,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 790 places, 781 transitions, 1778 flow [2021-06-10 11:40:36,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 789 places, 781 transitions, 1777 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:36,017 INFO L241 Difference]: Finished difference. Result has 791 places, 781 transitions, 1775 flow [2021-06-10 11:40:36,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1775, PETRI_PLACES=791, PETRI_TRANSITIONS=781} [2021-06-10 11:40:36,017 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -10 predicate places. [2021-06-10 11:40:36,017 INFO L480 AbstractCegarLoop]: Abstraction has has 791 places, 781 transitions, 1775 flow [2021-06-10 11:40:36,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:36,017 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:36,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1350 [2021-06-10 11:40:36,017 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1144832211, now seen corresponding path program 1 times [2021-06-10 11:40:36,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:36,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497048358] [2021-06-10 11:40:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:36,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:36,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:36,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497048358] [2021-06-10 11:40:36,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:36,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:36,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635522929] [2021-06-10 11:40:36,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:36,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:36,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:36,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:36,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 781 transitions, 1775 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:36,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:36,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:36,300 INFO L129 PetriNetUnfolder]: 73/890 cut-off events. [2021-06-10 11:40:36,300 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:36,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 890 events. 73/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3661 event pairs, 0 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1018. Up to 31 conditions per place. [2021-06-10 11:40:36,354 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/782 dead transitions. [2021-06-10 11:40:36,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 782 transitions, 1801 flow [2021-06-10 11:40:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:36,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:36,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:36,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:36,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:36,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:36,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,358 INFO L185 Difference]: Start difference. First operand has 791 places, 781 transitions, 1775 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:36,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 793 places, 782 transitions, 1801 flow [2021-06-10 11:40:36,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 792 places, 782 transitions, 1799 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:36,365 INFO L241 Difference]: Finished difference. Result has 794 places, 782 transitions, 1791 flow [2021-06-10 11:40:36,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=790, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1791, PETRI_PLACES=794, PETRI_TRANSITIONS=782} [2021-06-10 11:40:36,366 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -7 predicate places. [2021-06-10 11:40:36,366 INFO L480 AbstractCegarLoop]: Abstraction has has 794 places, 782 transitions, 1791 flow [2021-06-10 11:40:36,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:36,366 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:36,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1351 [2021-06-10 11:40:36,366 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1145786546, now seen corresponding path program 1 times [2021-06-10 11:40:36,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:36,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030659977] [2021-06-10 11:40:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:36,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:36,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:36,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030659977] [2021-06-10 11:40:36,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:36,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:36,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988292196] [2021-06-10 11:40:36,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:36,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:36,386 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:36,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 782 transitions, 1791 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:36,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:36,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:36,672 INFO L129 PetriNetUnfolder]: 72/887 cut-off events. [2021-06-10 11:40:36,672 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:40:36,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 887 events. 72/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3647 event pairs, 0 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 1017. Up to 31 conditions per place. [2021-06-10 11:40:36,711 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/780 dead transitions. [2021-06-10 11:40:36,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 796 places, 780 transitions, 1799 flow [2021-06-10 11:40:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:40:36,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:40:36,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:40:36,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:40:36,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:36,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:40:36,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,715 INFO L185 Difference]: Start difference. First operand has 794 places, 782 transitions, 1791 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:40:36,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 796 places, 780 transitions, 1799 flow [2021-06-10 11:40:36,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 780 transitions, 1798 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:36,721 INFO L241 Difference]: Finished difference. Result has 795 places, 780 transitions, 1780 flow [2021-06-10 11:40:36,721 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=795, PETRI_TRANSITIONS=780} [2021-06-10 11:40:36,721 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -6 predicate places. [2021-06-10 11:40:36,721 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 780 transitions, 1780 flow [2021-06-10 11:40:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,722 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:36,722 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:36,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1352 [2021-06-10 11:40:36,722 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1145785523, now seen corresponding path program 1 times [2021-06-10 11:40:36,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:36,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853528493] [2021-06-10 11:40:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:36,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:36,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:36,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:40:36,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853528493] [2021-06-10 11:40:36,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:36,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:36,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119955356] [2021-06-10 11:40:36,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:36,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:36,740 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:36,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 780 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:36,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:36,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:36,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:36,990 INFO L129 PetriNetUnfolder]: 72/884 cut-off events. [2021-06-10 11:40:36,990 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:37,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 884 events. 72/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3620 event pairs, 0 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1011. Up to 31 conditions per place. [2021-06-10 11:40:37,040 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/777 dead transitions. [2021-06-10 11:40:37,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 777 transitions, 1781 flow [2021-06-10 11:40:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:37,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:37,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:37,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:37,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:37,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:37,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,044 INFO L185 Difference]: Start difference. First operand has 795 places, 780 transitions, 1780 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:37,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 777 transitions, 1781 flow [2021-06-10 11:40:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 792 places, 777 transitions, 1776 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:37,051 INFO L241 Difference]: Finished difference. Result has 792 places, 777 transitions, 1766 flow [2021-06-10 11:40:37,051 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=790, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1766, PETRI_PLACES=792, PETRI_TRANSITIONS=777} [2021-06-10 11:40:37,052 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -9 predicate places. [2021-06-10 11:40:37,052 INFO L480 AbstractCegarLoop]: Abstraction has has 792 places, 777 transitions, 1766 flow [2021-06-10 11:40:37,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:37,052 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:37,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1353 [2021-06-10 11:40:37,052 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:37,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash -176563041, now seen corresponding path program 1 times [2021-06-10 11:40:37,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:37,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724068508] [2021-06-10 11:40:37,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:37,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:37,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:37,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724068508] [2021-06-10 11:40:37,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:37,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:37,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987084924] [2021-06-10 11:40:37,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:37,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:37,072 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:37,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 777 transitions, 1766 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:37,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:37,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:37,337 INFO L129 PetriNetUnfolder]: 71/892 cut-off events. [2021-06-10 11:40:37,337 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:37,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 892 events. 71/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3694 event pairs, 0 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1028. Up to 31 conditions per place. [2021-06-10 11:40:37,389 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/779 dead transitions. [2021-06-10 11:40:37,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 779 transitions, 1796 flow [2021-06-10 11:40:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:37,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:37,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:37,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:37,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:37,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:37,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,393 INFO L185 Difference]: Start difference. First operand has 792 places, 777 transitions, 1766 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:37,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 779 transitions, 1796 flow [2021-06-10 11:40:37,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 779 transitions, 1795 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:37,400 INFO L241 Difference]: Finished difference. Result has 795 places, 779 transitions, 1789 flow [2021-06-10 11:40:37,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=791, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1789, PETRI_PLACES=795, PETRI_TRANSITIONS=779} [2021-06-10 11:40:37,401 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -6 predicate places. [2021-06-10 11:40:37,401 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 779 transitions, 1789 flow [2021-06-10 11:40:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:37,401 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:37,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1354 [2021-06-10 11:40:37,401 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash -176564064, now seen corresponding path program 1 times [2021-06-10 11:40:37,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:37,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678522772] [2021-06-10 11:40:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:37,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:37,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:37,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678522772] [2021-06-10 11:40:37,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:37,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:37,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426428300] [2021-06-10 11:40:37,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:37,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:37,420 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:37,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 779 transitions, 1789 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:37,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:37,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:37,684 INFO L129 PetriNetUnfolder]: 69/893 cut-off events. [2021-06-10 11:40:37,684 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:37,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 893 events. 69/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3713 event pairs, 0 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1026. Up to 31 conditions per place. [2021-06-10 11:40:37,736 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/779 dead transitions. [2021-06-10 11:40:37,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 779 transitions, 1801 flow [2021-06-10 11:40:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:37,738 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:37,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:37,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:37,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:37,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:37,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,740 INFO L185 Difference]: Start difference. First operand has 795 places, 779 transitions, 1789 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:37,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 779 transitions, 1801 flow [2021-06-10 11:40:37,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 779 transitions, 1796 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:37,747 INFO L241 Difference]: Finished difference. Result has 797 places, 778 transitions, 1785 flow [2021-06-10 11:40:37,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1785, PETRI_PLACES=797, PETRI_TRANSITIONS=778} [2021-06-10 11:40:37,747 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -4 predicate places. [2021-06-10 11:40:37,747 INFO L480 AbstractCegarLoop]: Abstraction has has 797 places, 778 transitions, 1785 flow [2021-06-10 11:40:37,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:37,748 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:37,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1355 [2021-06-10 11:40:37,748 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -177516353, now seen corresponding path program 1 times [2021-06-10 11:40:37,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:37,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638011910] [2021-06-10 11:40:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:37,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:37,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:37,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:37,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638011910] [2021-06-10 11:40:37,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:37,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:37,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803413599] [2021-06-10 11:40:37,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:37,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:37,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:37,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 778 transitions, 1785 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:37,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:37,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:37,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:38,021 INFO L129 PetriNetUnfolder]: 69/886 cut-off events. [2021-06-10 11:40:38,021 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:38,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 886 events. 69/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3655 event pairs, 0 based on Foata normal form. 1/789 useless extension candidates. Maximal degree in co-relation 1020. Up to 31 conditions per place. [2021-06-10 11:40:38,072 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/776 dead transitions. [2021-06-10 11:40:38,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 776 transitions, 1788 flow [2021-06-10 11:40:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:38,074 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:38,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:38,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:38,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:38,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:38,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,076 INFO L185 Difference]: Start difference. First operand has 797 places, 778 transitions, 1785 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:38,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 776 transitions, 1788 flow [2021-06-10 11:40:38,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 776 transitions, 1781 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:38,083 INFO L241 Difference]: Finished difference. Result has 797 places, 776 transitions, 1774 flow [2021-06-10 11:40:38,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1774, PETRI_PLACES=797, PETRI_TRANSITIONS=776} [2021-06-10 11:40:38,083 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -4 predicate places. [2021-06-10 11:40:38,084 INFO L480 AbstractCegarLoop]: Abstraction has has 797 places, 776 transitions, 1774 flow [2021-06-10 11:40:38,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:38,084 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:38,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1356 [2021-06-10 11:40:38,084 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -177517376, now seen corresponding path program 1 times [2021-06-10 11:40:38,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:38,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096785505] [2021-06-10 11:40:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:38,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:38,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:40:38,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096785505] [2021-06-10 11:40:38,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:38,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:38,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145647446] [2021-06-10 11:40:38,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:38,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:38,102 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:38,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 776 transitions, 1774 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:38,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:38,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:38,362 INFO L129 PetriNetUnfolder]: 69/884 cut-off events. [2021-06-10 11:40:38,362 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:38,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 884 events. 69/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3638 event pairs, 0 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1020. Up to 31 conditions per place. [2021-06-10 11:40:38,414 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/774 dead transitions. [2021-06-10 11:40:38,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 774 transitions, 1787 flow [2021-06-10 11:40:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:38,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:38,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:38,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:38,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:38,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:38,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,418 INFO L185 Difference]: Start difference. First operand has 797 places, 776 transitions, 1774 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:38,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 774 transitions, 1787 flow [2021-06-10 11:40:38,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 774 transitions, 1786 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:38,425 INFO L241 Difference]: Finished difference. Result has 796 places, 774 transitions, 1770 flow [2021-06-10 11:40:38,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1770, PETRI_PLACES=796, PETRI_TRANSITIONS=774} [2021-06-10 11:40:38,425 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -5 predicate places. [2021-06-10 11:40:38,425 INFO L480 AbstractCegarLoop]: Abstraction has has 796 places, 774 transitions, 1770 flow [2021-06-10 11:40:38,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:38,426 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:38,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1357 [2021-06-10 11:40:38,426 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1227252782, now seen corresponding path program 1 times [2021-06-10 11:40:38,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:38,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175582720] [2021-06-10 11:40:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:38,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:38,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:38,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175582720] [2021-06-10 11:40:38,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:38,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:38,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161507521] [2021-06-10 11:40:38,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:38,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:38,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:38,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 774 transitions, 1770 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:38,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:38,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:38,729 INFO L129 PetriNetUnfolder]: 68/892 cut-off events. [2021-06-10 11:40:38,729 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:38,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 892 events. 68/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3708 event pairs, 0 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1032. Up to 31 conditions per place. [2021-06-10 11:40:38,774 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/776 dead transitions. [2021-06-10 11:40:38,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 776 transitions, 1800 flow [2021-06-10 11:40:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:38,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:38,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:38,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:38,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:38,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:38,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,778 INFO L185 Difference]: Start difference. First operand has 796 places, 774 transitions, 1770 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:38,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 776 transitions, 1800 flow [2021-06-10 11:40:38,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 776 transitions, 1799 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:38,785 INFO L241 Difference]: Finished difference. Result has 799 places, 776 transitions, 1793 flow [2021-06-10 11:40:38,785 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=795, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1793, PETRI_PLACES=799, PETRI_TRANSITIONS=776} [2021-06-10 11:40:38,785 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -2 predicate places. [2021-06-10 11:40:38,785 INFO L480 AbstractCegarLoop]: Abstraction has has 799 places, 776 transitions, 1793 flow [2021-06-10 11:40:38,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:38,785 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:38,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1358 [2021-06-10 11:40:38,785 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1227253805, now seen corresponding path program 1 times [2021-06-10 11:40:38,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:38,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725780872] [2021-06-10 11:40:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:38,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:38,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:38,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:38,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725780872] [2021-06-10 11:40:38,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:38,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:38,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588150247] [2021-06-10 11:40:38,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:38,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:38,804 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:38,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 799 places, 776 transitions, 1793 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:38,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:38,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:38,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:39,068 INFO L129 PetriNetUnfolder]: 67/890 cut-off events. [2021-06-10 11:40:39,068 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:39,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 890 events. 67/890 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3696 event pairs, 0 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1029. Up to 31 conditions per place. [2021-06-10 11:40:39,119 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/776 dead transitions. [2021-06-10 11:40:39,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 801 places, 776 transitions, 1805 flow [2021-06-10 11:40:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:39,120 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:39,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:39,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:39,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:39,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:39,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,123 INFO L185 Difference]: Start difference. First operand has 799 places, 776 transitions, 1793 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:39,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 801 places, 776 transitions, 1805 flow [2021-06-10 11:40:39,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 776 transitions, 1800 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:39,130 INFO L241 Difference]: Finished difference. Result has 802 places, 776 transitions, 1798 flow [2021-06-10 11:40:39,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=798, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1798, PETRI_PLACES=802, PETRI_TRANSITIONS=776} [2021-06-10 11:40:39,130 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 1 predicate places. [2021-06-10 11:40:39,130 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 776 transitions, 1798 flow [2021-06-10 11:40:39,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:39,131 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:39,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1359 [2021-06-10 11:40:39,131 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1228206094, now seen corresponding path program 1 times [2021-06-10 11:40:39,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:39,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133970763] [2021-06-10 11:40:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:39,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:39,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:39,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133970763] [2021-06-10 11:40:39,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:39,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:39,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825571482] [2021-06-10 11:40:39,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:39,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:39,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:39,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 776 transitions, 1798 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:39,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:39,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:39,413 INFO L129 PetriNetUnfolder]: 66/886 cut-off events. [2021-06-10 11:40:39,413 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:40:39,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 886 events. 66/886 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3673 event pairs, 0 based on Foata normal form. 1/792 useless extension candidates. Maximal degree in co-relation 1026. Up to 31 conditions per place. [2021-06-10 11:40:39,464 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/773 dead transitions. [2021-06-10 11:40:39,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 773 transitions, 1795 flow [2021-06-10 11:40:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:39,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:39,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:39,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:39,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:39,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:39,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,468 INFO L185 Difference]: Start difference. First operand has 802 places, 776 transitions, 1798 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:39,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 773 transitions, 1795 flow [2021-06-10 11:40:39,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 773 transitions, 1788 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:39,475 INFO L241 Difference]: Finished difference. Result has 801 places, 773 transitions, 1778 flow [2021-06-10 11:40:39,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1778, PETRI_PLACES=801, PETRI_TRANSITIONS=773} [2021-06-10 11:40:39,476 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 0 predicate places. [2021-06-10 11:40:39,476 INFO L480 AbstractCegarLoop]: Abstraction has has 801 places, 773 transitions, 1778 flow [2021-06-10 11:40:39,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:39,476 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:39,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1360 [2021-06-10 11:40:39,476 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1228207117, now seen corresponding path program 1 times [2021-06-10 11:40:39,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:39,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728613488] [2021-06-10 11:40:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:39,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:39,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:40:39,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728613488] [2021-06-10 11:40:39,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:39,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:39,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672125891] [2021-06-10 11:40:39,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:39,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:39,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:39,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:39,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:39,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 773 transitions, 1778 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:39,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:39,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:39,754 INFO L129 PetriNetUnfolder]: 66/884 cut-off events. [2021-06-10 11:40:39,754 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:39,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 884 events. 66/884 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3655 event pairs, 0 based on Foata normal form. 0/788 useless extension candidates. Maximal degree in co-relation 1027. Up to 31 conditions per place. [2021-06-10 11:40:39,804 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/771 dead transitions. [2021-06-10 11:40:39,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 801 places, 771 transitions, 1791 flow [2021-06-10 11:40:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:39,806 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:39,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:39,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:39,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:39,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:39,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,808 INFO L185 Difference]: Start difference. First operand has 801 places, 773 transitions, 1778 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:39,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 801 places, 771 transitions, 1791 flow [2021-06-10 11:40:39,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 771 transitions, 1790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:39,815 INFO L241 Difference]: Finished difference. Result has 800 places, 771 transitions, 1774 flow [2021-06-10 11:40:39,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=798, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1774, PETRI_PLACES=800, PETRI_TRANSITIONS=771} [2021-06-10 11:40:39,816 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, -1 predicate places. [2021-06-10 11:40:39,816 INFO L480 AbstractCegarLoop]: Abstraction has has 800 places, 771 transitions, 1774 flow [2021-06-10 11:40:39,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:39,816 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:39,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361 [2021-06-10 11:40:39,816 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1151014524, now seen corresponding path program 1 times [2021-06-10 11:40:39,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:39,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655898088] [2021-06-10 11:40:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:39,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:39,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:39,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:39,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655898088] [2021-06-10 11:40:39,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:39,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:39,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336143175] [2021-06-10 11:40:39,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:39,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:39,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:39,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:39,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:39,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 800 places, 771 transitions, 1774 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:39,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:39,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:39,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:40,110 INFO L129 PetriNetUnfolder]: 65/892 cut-off events. [2021-06-10 11:40:40,110 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:40,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 892 events. 65/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3727 event pairs, 0 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 1039. Up to 31 conditions per place. [2021-06-10 11:40:40,161 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/773 dead transitions. [2021-06-10 11:40:40,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 773 transitions, 1804 flow [2021-06-10 11:40:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:40,163 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:40,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:40,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:40,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:40,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:40,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,165 INFO L185 Difference]: Start difference. First operand has 800 places, 771 transitions, 1774 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:40,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 773 transitions, 1804 flow [2021-06-10 11:40:40,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 773 transitions, 1803 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:40,173 INFO L241 Difference]: Finished difference. Result has 803 places, 773 transitions, 1797 flow [2021-06-10 11:40:40,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1797, PETRI_PLACES=803, PETRI_TRANSITIONS=773} [2021-06-10 11:40:40,173 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 2 predicate places. [2021-06-10 11:40:40,173 INFO L480 AbstractCegarLoop]: Abstraction has has 803 places, 773 transitions, 1797 flow [2021-06-10 11:40:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:40,174 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:40,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1362 [2021-06-10 11:40:40,174 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:40,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1151013501, now seen corresponding path program 1 times [2021-06-10 11:40:40,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:40,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138393909] [2021-06-10 11:40:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:40,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:40,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:40,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138393909] [2021-06-10 11:40:40,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:40,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:40,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928289640] [2021-06-10 11:40:40,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:40,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:40,193 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:40,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 803 places, 773 transitions, 1797 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:40,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:40,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:40,464 INFO L129 PetriNetUnfolder]: 63/893 cut-off events. [2021-06-10 11:40:40,464 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:40,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 893 events. 63/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3746 event pairs, 0 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 1039. Up to 31 conditions per place. [2021-06-10 11:40:40,514 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/773 dead transitions. [2021-06-10 11:40:40,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 805 places, 773 transitions, 1809 flow [2021-06-10 11:40:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:40,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:40,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:40,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:40,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:40,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:40,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,518 INFO L185 Difference]: Start difference. First operand has 803 places, 773 transitions, 1797 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:40,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 805 places, 773 transitions, 1809 flow [2021-06-10 11:40:40,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 804 places, 773 transitions, 1804 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:40,526 INFO L241 Difference]: Finished difference. Result has 805 places, 772 transitions, 1793 flow [2021-06-10 11:40:40,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=802, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1793, PETRI_PLACES=805, PETRI_TRANSITIONS=772} [2021-06-10 11:40:40,526 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 4 predicate places. [2021-06-10 11:40:40,526 INFO L480 AbstractCegarLoop]: Abstraction has has 805 places, 772 transitions, 1793 flow [2021-06-10 11:40:40,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:40,526 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:40,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1363 [2021-06-10 11:40:40,526 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1150061212, now seen corresponding path program 1 times [2021-06-10 11:40:40,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:40,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044621850] [2021-06-10 11:40:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:40,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:40,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:40,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044621850] [2021-06-10 11:40:40,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:40,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:40,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682190707] [2021-06-10 11:40:40,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:40,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:40,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:40,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 772 transitions, 1793 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:40,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:40,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:40,832 INFO L129 PetriNetUnfolder]: 63/886 cut-off events. [2021-06-10 11:40:40,832 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:40,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 886 events. 63/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3687 event pairs, 0 based on Foata normal form. 1/795 useless extension candidates. Maximal degree in co-relation 1033. Up to 31 conditions per place. [2021-06-10 11:40:40,882 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/770 dead transitions. [2021-06-10 11:40:40,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 770 transitions, 1796 flow [2021-06-10 11:40:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:40,884 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:40,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:40,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:40,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:40,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:40,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,886 INFO L185 Difference]: Start difference. First operand has 805 places, 772 transitions, 1793 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:40,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 770 transitions, 1796 flow [2021-06-10 11:40:40,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 804 places, 770 transitions, 1789 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:40,894 INFO L241 Difference]: Finished difference. Result has 805 places, 770 transitions, 1782 flow [2021-06-10 11:40:40,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=802, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1782, PETRI_PLACES=805, PETRI_TRANSITIONS=770} [2021-06-10 11:40:40,894 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 4 predicate places. [2021-06-10 11:40:40,894 INFO L480 AbstractCegarLoop]: Abstraction has has 805 places, 770 transitions, 1782 flow [2021-06-10 11:40:40,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:40,894 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:40,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1364 [2021-06-10 11:40:40,894 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1150060189, now seen corresponding path program 1 times [2021-06-10 11:40:40,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:40,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793941932] [2021-06-10 11:40:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:40,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:40,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:40,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:40:40,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793941932] [2021-06-10 11:40:40,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:40,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:40,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289284214] [2021-06-10 11:40:40,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:40,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:40,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:40,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:40,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 770 transitions, 1782 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:40,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:40,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:40,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:41,193 INFO L129 PetriNetUnfolder]: 63/884 cut-off events. [2021-06-10 11:40:41,194 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:41,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 884 events. 63/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3677 event pairs, 0 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 1033. Up to 31 conditions per place. [2021-06-10 11:40:41,244 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/768 dead transitions. [2021-06-10 11:40:41,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 805 places, 768 transitions, 1795 flow [2021-06-10 11:40:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:41,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:41,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:41,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:41,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:41,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:41,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,248 INFO L185 Difference]: Start difference. First operand has 805 places, 770 transitions, 1782 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:41,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 805 places, 768 transitions, 1795 flow [2021-06-10 11:40:41,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 804 places, 768 transitions, 1794 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:41,255 INFO L241 Difference]: Finished difference. Result has 804 places, 768 transitions, 1778 flow [2021-06-10 11:40:41,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=802, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1778, PETRI_PLACES=804, PETRI_TRANSITIONS=768} [2021-06-10 11:40:41,255 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 3 predicate places. [2021-06-10 11:40:41,255 INFO L480 AbstractCegarLoop]: Abstraction has has 804 places, 768 transitions, 1778 flow [2021-06-10 11:40:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:41,256 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:41,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1365 [2021-06-10 11:40:41,256 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 349373292, now seen corresponding path program 1 times [2021-06-10 11:40:41,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:41,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034895240] [2021-06-10 11:40:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:41,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:41,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:41,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:41,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034895240] [2021-06-10 11:40:41,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:41,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:41,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230115705] [2021-06-10 11:40:41,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:41,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:41,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:41,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 768 transitions, 1778 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:41,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:41,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:41,564 INFO L129 PetriNetUnfolder]: 62/892 cut-off events. [2021-06-10 11:40:41,564 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:41,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 892 events. 62/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3744 event pairs, 0 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1045. Up to 31 conditions per place. [2021-06-10 11:40:41,619 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/770 dead transitions. [2021-06-10 11:40:41,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 770 transitions, 1808 flow [2021-06-10 11:40:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:41,621 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:41,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:41,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:41,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:41,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:41,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,624 INFO L185 Difference]: Start difference. First operand has 804 places, 768 transitions, 1778 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:41,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 770 transitions, 1808 flow [2021-06-10 11:40:41,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 770 transitions, 1807 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:41,631 INFO L241 Difference]: Finished difference. Result has 807 places, 770 transitions, 1801 flow [2021-06-10 11:40:41,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1801, PETRI_PLACES=807, PETRI_TRANSITIONS=770} [2021-06-10 11:40:41,632 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 6 predicate places. [2021-06-10 11:40:41,632 INFO L480 AbstractCegarLoop]: Abstraction has has 807 places, 770 transitions, 1801 flow [2021-06-10 11:40:41,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:41,632 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:41,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1366 [2021-06-10 11:40:41,632 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 349372269, now seen corresponding path program 1 times [2021-06-10 11:40:41,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:41,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011749873] [2021-06-10 11:40:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:41,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:41,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:41,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:41,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:41,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011749873] [2021-06-10 11:40:41,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:41,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:41,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860634611] [2021-06-10 11:40:41,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:41,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:41,652 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:41,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 770 transitions, 1801 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:41,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:41,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:41,933 INFO L129 PetriNetUnfolder]: 60/893 cut-off events. [2021-06-10 11:40:41,934 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:41,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 893 events. 60/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3766 event pairs, 0 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1045. Up to 31 conditions per place. [2021-06-10 11:40:41,985 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/770 dead transitions. [2021-06-10 11:40:41,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 770 transitions, 1813 flow [2021-06-10 11:40:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:41,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:41,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:41,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:41,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:41,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:41,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,989 INFO L185 Difference]: Start difference. First operand has 807 places, 770 transitions, 1801 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:41,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 770 transitions, 1813 flow [2021-06-10 11:40:41,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 770 transitions, 1808 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:41,997 INFO L241 Difference]: Finished difference. Result has 809 places, 769 transitions, 1797 flow [2021-06-10 11:40:41,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1797, PETRI_PLACES=809, PETRI_TRANSITIONS=769} [2021-06-10 11:40:41,997 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 8 predicate places. [2021-06-10 11:40:41,997 INFO L480 AbstractCegarLoop]: Abstraction has has 809 places, 769 transitions, 1797 flow [2021-06-10 11:40:41,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:41,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:41,997 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:41,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1367 [2021-06-10 11:40:41,997 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 348419980, now seen corresponding path program 1 times [2021-06-10 11:40:41,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:41,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363512083] [2021-06-10 11:40:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:42,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:42,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:42,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363512083] [2021-06-10 11:40:42,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:42,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:42,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079587039] [2021-06-10 11:40:42,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:42,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:42,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:42,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 769 transitions, 1797 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:42,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:42,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:42,293 INFO L129 PetriNetUnfolder]: 60/886 cut-off events. [2021-06-10 11:40:42,293 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:42,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 886 events. 60/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3707 event pairs, 0 based on Foata normal form. 1/798 useless extension candidates. Maximal degree in co-relation 1039. Up to 31 conditions per place. [2021-06-10 11:40:42,345 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/767 dead transitions. [2021-06-10 11:40:42,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 811 places, 767 transitions, 1800 flow [2021-06-10 11:40:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:42,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:42,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:42,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:42,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:42,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:42,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,349 INFO L185 Difference]: Start difference. First operand has 809 places, 769 transitions, 1797 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:42,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 811 places, 767 transitions, 1800 flow [2021-06-10 11:40:42,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 767 transitions, 1793 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:42,357 INFO L241 Difference]: Finished difference. Result has 809 places, 767 transitions, 1786 flow [2021-06-10 11:40:42,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1786, PETRI_PLACES=809, PETRI_TRANSITIONS=767} [2021-06-10 11:40:42,357 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 8 predicate places. [2021-06-10 11:40:42,357 INFO L480 AbstractCegarLoop]: Abstraction has has 809 places, 767 transitions, 1786 flow [2021-06-10 11:40:42,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:42,357 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:42,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1368 [2021-06-10 11:40:42,357 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 348418957, now seen corresponding path program 1 times [2021-06-10 11:40:42,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:42,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977283205] [2021-06-10 11:40:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:42,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:42,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:40:42,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977283205] [2021-06-10 11:40:42,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:42,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:42,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960590068] [2021-06-10 11:40:42,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:42,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:42,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:42,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 767 transitions, 1786 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:42,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:42,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:42,658 INFO L129 PetriNetUnfolder]: 60/884 cut-off events. [2021-06-10 11:40:42,658 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:42,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 884 events. 60/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3694 event pairs, 0 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1039. Up to 31 conditions per place. [2021-06-10 11:40:42,779 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/765 dead transitions. [2021-06-10 11:40:42,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 765 transitions, 1799 flow [2021-06-10 11:40:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:42,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:42,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:42,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:42,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:42,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:42,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,784 INFO L185 Difference]: Start difference. First operand has 809 places, 767 transitions, 1786 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:42,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 809 places, 765 transitions, 1799 flow [2021-06-10 11:40:42,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 765 transitions, 1798 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:42,790 INFO L241 Difference]: Finished difference. Result has 808 places, 765 transitions, 1782 flow [2021-06-10 11:40:42,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1782, PETRI_PLACES=808, PETRI_TRANSITIONS=765} [2021-06-10 11:40:42,790 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 7 predicate places. [2021-06-10 11:40:42,790 INFO L480 AbstractCegarLoop]: Abstraction has has 808 places, 765 transitions, 1782 flow [2021-06-10 11:40:42,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:42,790 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:42,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1369 [2021-06-10 11:40:42,791 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1963794051, now seen corresponding path program 1 times [2021-06-10 11:40:42,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:42,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454621533] [2021-06-10 11:40:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:42,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:42,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:42,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:42,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454621533] [2021-06-10 11:40:42,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:42,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:42,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397497835] [2021-06-10 11:40:42,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:42,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:42,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:42,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:42,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:42,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 765 transitions, 1782 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:42,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:42,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:42,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:43,088 INFO L129 PetriNetUnfolder]: 58/889 cut-off events. [2021-06-10 11:40:43,088 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:43,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 889 events. 58/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3743 event pairs, 0 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 1042. Up to 31 conditions per place. [2021-06-10 11:40:43,141 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/766 dead transitions. [2021-06-10 11:40:43,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 766 transitions, 1798 flow [2021-06-10 11:40:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:43,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:43,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:43,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:43,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:43,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:43,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,145 INFO L185 Difference]: Start difference. First operand has 808 places, 765 transitions, 1782 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 766 transitions, 1798 flow [2021-06-10 11:40:43,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 766 transitions, 1797 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:43,152 INFO L241 Difference]: Finished difference. Result has 811 places, 766 transitions, 1795 flow [2021-06-10 11:40:43,152 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1795, PETRI_PLACES=811, PETRI_TRANSITIONS=766} [2021-06-10 11:40:43,152 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 10 predicate places. [2021-06-10 11:40:43,152 INFO L480 AbstractCegarLoop]: Abstraction has has 811 places, 766 transitions, 1795 flow [2021-06-10 11:40:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:43,153 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:43,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1370 [2021-06-10 11:40:43,153 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1963795074, now seen corresponding path program 1 times [2021-06-10 11:40:43,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:43,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143761067] [2021-06-10 11:40:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:43,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:43,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:43,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143761067] [2021-06-10 11:40:43,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:43,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:43,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808902735] [2021-06-10 11:40:43,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:43,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:43,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:43,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:43,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 766 transitions, 1795 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:43,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:43,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:43,459 INFO L129 PetriNetUnfolder]: 58/890 cut-off events. [2021-06-10 11:40:43,459 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:43,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 890 events. 58/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3749 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1050. Up to 31 conditions per place. [2021-06-10 11:40:43,510 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/767 dead transitions. [2021-06-10 11:40:43,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 767 transitions, 1821 flow [2021-06-10 11:40:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:43,511 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:43,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:43,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:43,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:43,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:43,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,514 INFO L185 Difference]: Start difference. First operand has 811 places, 766 transitions, 1795 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:43,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 767 transitions, 1821 flow [2021-06-10 11:40:43,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 812 places, 767 transitions, 1819 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:43,521 INFO L241 Difference]: Finished difference. Result has 814 places, 767 transitions, 1811 flow [2021-06-10 11:40:43,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=810, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1811, PETRI_PLACES=814, PETRI_TRANSITIONS=767} [2021-06-10 11:40:43,521 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 13 predicate places. [2021-06-10 11:40:43,521 INFO L480 AbstractCegarLoop]: Abstraction has has 814 places, 767 transitions, 1811 flow [2021-06-10 11:40:43,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:43,521 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:43,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1371 [2021-06-10 11:40:43,521 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1962841762, now seen corresponding path program 1 times [2021-06-10 11:40:43,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:43,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566162587] [2021-06-10 11:40:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:43,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:43,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:43,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566162587] [2021-06-10 11:40:43,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:43,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:43,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274138118] [2021-06-10 11:40:43,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:43,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:43,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:43,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 767 transitions, 1811 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:43,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:43,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:43,813 INFO L129 PetriNetUnfolder]: 57/886 cut-off events. [2021-06-10 11:40:43,814 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:43,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 886 events. 57/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3724 event pairs, 0 based on Foata normal form. 0/800 useless extension candidates. Maximal degree in co-relation 1043. Up to 31 conditions per place. [2021-06-10 11:40:43,865 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/764 dead transitions. [2021-06-10 11:40:43,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 764 transitions, 1808 flow [2021-06-10 11:40:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:43,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:43,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:43,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:43,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:43,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:43,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,870 INFO L185 Difference]: Start difference. First operand has 814 places, 767 transitions, 1811 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:43,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 764 transitions, 1808 flow [2021-06-10 11:40:43,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 764 transitions, 1800 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:43,877 INFO L241 Difference]: Finished difference. Result has 813 places, 764 transitions, 1790 flow [2021-06-10 11:40:43,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1790, PETRI_PLACES=813, PETRI_TRANSITIONS=764} [2021-06-10 11:40:43,877 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 12 predicate places. [2021-06-10 11:40:43,877 INFO L480 AbstractCegarLoop]: Abstraction has has 813 places, 764 transitions, 1790 flow [2021-06-10 11:40:43,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,878 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:43,878 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:43,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1372 [2021-06-10 11:40:43,878 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1962840739, now seen corresponding path program 1 times [2021-06-10 11:40:43,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:43,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708026603] [2021-06-10 11:40:43,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:43,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:43,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:43,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:40:43,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708026603] [2021-06-10 11:40:43,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:43,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:43,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462371869] [2021-06-10 11:40:43,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:43,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:43,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:43,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 764 transitions, 1790 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:43,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:43,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:43,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:44,173 INFO L129 PetriNetUnfolder]: 57/884 cut-off events. [2021-06-10 11:40:44,173 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:44,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 884 events. 57/884 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3707 event pairs, 0 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1046. Up to 31 conditions per place. [2021-06-10 11:40:44,222 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/762 dead transitions. [2021-06-10 11:40:44,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 762 transitions, 1803 flow [2021-06-10 11:40:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:44,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:44,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:44,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:44,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:44,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:44,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,228 INFO L185 Difference]: Start difference. First operand has 813 places, 764 transitions, 1790 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:44,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 762 transitions, 1803 flow [2021-06-10 11:40:44,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 812 places, 762 transitions, 1802 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:44,235 INFO L241 Difference]: Finished difference. Result has 812 places, 762 transitions, 1786 flow [2021-06-10 11:40:44,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=810, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1786, PETRI_PLACES=812, PETRI_TRANSITIONS=762} [2021-06-10 11:40:44,235 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 11 predicate places. [2021-06-10 11:40:44,235 INFO L480 AbstractCegarLoop]: Abstraction has has 812 places, 762 transitions, 1786 flow [2021-06-10 11:40:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:44,236 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:44,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1373 [2021-06-10 11:40:44,236 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1486488849, now seen corresponding path program 1 times [2021-06-10 11:40:44,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:44,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89689865] [2021-06-10 11:40:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:44,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:44,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:44,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89689865] [2021-06-10 11:40:44,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:44,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:44,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140889392] [2021-06-10 11:40:44,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:44,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:44,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:44,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 812 places, 762 transitions, 1786 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:44,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:44,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:44,538 INFO L129 PetriNetUnfolder]: 55/889 cut-off events. [2021-06-10 11:40:44,538 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:44,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 889 events. 55/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3762 event pairs, 0 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1049. Up to 31 conditions per place. [2021-06-10 11:40:44,588 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/763 dead transitions. [2021-06-10 11:40:44,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 763 transitions, 1802 flow [2021-06-10 11:40:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:44,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:44,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:44,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:44,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:44,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:44,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,596 INFO L185 Difference]: Start difference. First operand has 812 places, 762 transitions, 1786 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:44,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 763 transitions, 1802 flow [2021-06-10 11:40:44,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 763 transitions, 1801 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:44,603 INFO L241 Difference]: Finished difference. Result has 815 places, 763 transitions, 1799 flow [2021-06-10 11:40:44,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1799, PETRI_PLACES=815, PETRI_TRANSITIONS=763} [2021-06-10 11:40:44,603 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 14 predicate places. [2021-06-10 11:40:44,603 INFO L480 AbstractCegarLoop]: Abstraction has has 815 places, 763 transitions, 1799 flow [2021-06-10 11:40:44,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:44,604 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:44,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1374 [2021-06-10 11:40:44,604 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1486489872, now seen corresponding path program 1 times [2021-06-10 11:40:44,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:44,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265235821] [2021-06-10 11:40:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:44,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:44,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:44,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265235821] [2021-06-10 11:40:44,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:44,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:44,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117390455] [2021-06-10 11:40:44,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:44,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:44,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:44,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 763 transitions, 1799 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:44,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:44,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:44,928 INFO L129 PetriNetUnfolder]: 55/890 cut-off events. [2021-06-10 11:40:44,928 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:44,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 890 events. 55/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3768 event pairs, 0 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 1057. Up to 31 conditions per place. [2021-06-10 11:40:44,969 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/764 dead transitions. [2021-06-10 11:40:44,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 764 transitions, 1825 flow [2021-06-10 11:40:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:44,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:44,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:44,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:44,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:44,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:44,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,973 INFO L185 Difference]: Start difference. First operand has 815 places, 763 transitions, 1799 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:44,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 817 places, 764 transitions, 1825 flow [2021-06-10 11:40:44,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 816 places, 764 transitions, 1823 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:44,980 INFO L241 Difference]: Finished difference. Result has 818 places, 764 transitions, 1815 flow [2021-06-10 11:40:44,980 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=814, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=818, PETRI_TRANSITIONS=764} [2021-06-10 11:40:44,980 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 17 predicate places. [2021-06-10 11:40:44,980 INFO L480 AbstractCegarLoop]: Abstraction has has 818 places, 764 transitions, 1815 flow [2021-06-10 11:40:44,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:44,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:44,980 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:44,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1375 [2021-06-10 11:40:44,981 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1485535537, now seen corresponding path program 1 times [2021-06-10 11:40:44,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:44,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111792741] [2021-06-10 11:40:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:44,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:44,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:44,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:44,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111792741] [2021-06-10 11:40:44,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:44,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:44,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017295867] [2021-06-10 11:40:44,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:44,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:45,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:45,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 764 transitions, 1815 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:45,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:45,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:45,290 INFO L129 PetriNetUnfolder]: 54/887 cut-off events. [2021-06-10 11:40:45,290 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:40:45,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 887 events. 54/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3751 event pairs, 0 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 1056. Up to 31 conditions per place. [2021-06-10 11:40:45,343 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/762 dead transitions. [2021-06-10 11:40:45,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 820 places, 762 transitions, 1823 flow [2021-06-10 11:40:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:40:45,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:40:45,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:40:45,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:40:45,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:45,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:40:45,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,347 INFO L185 Difference]: Start difference. First operand has 818 places, 764 transitions, 1815 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:40:45,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 820 places, 762 transitions, 1823 flow [2021-06-10 11:40:45,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 819 places, 762 transitions, 1822 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:45,355 INFO L241 Difference]: Finished difference. Result has 819 places, 762 transitions, 1804 flow [2021-06-10 11:40:45,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=817, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1804, PETRI_PLACES=819, PETRI_TRANSITIONS=762} [2021-06-10 11:40:45,355 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 18 predicate places. [2021-06-10 11:40:45,355 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 762 transitions, 1804 flow [2021-06-10 11:40:45,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:45,355 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:45,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1376 [2021-06-10 11:40:45,356 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1485536560, now seen corresponding path program 1 times [2021-06-10 11:40:45,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:45,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902633772] [2021-06-10 11:40:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:45,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:45,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:45,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:40:45,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902633772] [2021-06-10 11:40:45,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:45,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:45,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531960320] [2021-06-10 11:40:45,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:45,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:45,376 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:45,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 762 transitions, 1804 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:45,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:45,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:45,657 INFO L129 PetriNetUnfolder]: 54/884 cut-off events. [2021-06-10 11:40:45,657 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:45,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 884 events. 54/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3729 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1050. Up to 31 conditions per place. [2021-06-10 11:40:45,706 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/759 dead transitions. [2021-06-10 11:40:45,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 759 transitions, 1805 flow [2021-06-10 11:40:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:45,707 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:45,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:45,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:45,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:45,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:45,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,710 INFO L185 Difference]: Start difference. First operand has 819 places, 762 transitions, 1804 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:45,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 759 transitions, 1805 flow [2021-06-10 11:40:45,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 816 places, 759 transitions, 1800 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:45,717 INFO L241 Difference]: Finished difference. Result has 816 places, 759 transitions, 1790 flow [2021-06-10 11:40:45,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=814, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1790, PETRI_PLACES=816, PETRI_TRANSITIONS=759} [2021-06-10 11:40:45,717 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 15 predicate places. [2021-06-10 11:40:45,717 INFO L480 AbstractCegarLoop]: Abstraction has has 816 places, 759 transitions, 1790 flow [2021-06-10 11:40:45,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:45,718 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:45,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1377 [2021-06-10 11:40:45,718 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash -537432478, now seen corresponding path program 1 times [2021-06-10 11:40:45,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:45,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090462136] [2021-06-10 11:40:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:45,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:45,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:45,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:45,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:45,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090462136] [2021-06-10 11:40:45,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:45,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:45,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241957132] [2021-06-10 11:40:45,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:45,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:45,737 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:45,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 759 transitions, 1790 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:45,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:45,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:45,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:46,021 INFO L129 PetriNetUnfolder]: 52/889 cut-off events. [2021-06-10 11:40:46,021 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:46,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 889 events. 52/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3780 event pairs, 0 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1058. Up to 31 conditions per place. [2021-06-10 11:40:46,071 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/760 dead transitions. [2021-06-10 11:40:46,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 760 transitions, 1806 flow [2021-06-10 11:40:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:46,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:46,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:46,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:46,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:46,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:46,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,075 INFO L185 Difference]: Start difference. First operand has 816 places, 759 transitions, 1790 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:46,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 760 transitions, 1806 flow [2021-06-10 11:40:46,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 817 places, 760 transitions, 1805 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:46,081 INFO L241 Difference]: Finished difference. Result has 819 places, 760 transitions, 1803 flow [2021-06-10 11:40:46,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=815, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1803, PETRI_PLACES=819, PETRI_TRANSITIONS=760} [2021-06-10 11:40:46,082 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 18 predicate places. [2021-06-10 11:40:46,082 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 760 transitions, 1803 flow [2021-06-10 11:40:46,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:46,082 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:46,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1378 [2021-06-10 11:40:46,082 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -537433501, now seen corresponding path program 1 times [2021-06-10 11:40:46,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:46,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618060546] [2021-06-10 11:40:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:46,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:46,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:46,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618060546] [2021-06-10 11:40:46,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:46,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:46,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468960631] [2021-06-10 11:40:46,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:46,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:46,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:46,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:46,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 760 transitions, 1803 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:46,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:46,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:46,409 INFO L129 PetriNetUnfolder]: 52/890 cut-off events. [2021-06-10 11:40:46,409 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:46,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 890 events. 52/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3786 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1064. Up to 31 conditions per place. [2021-06-10 11:40:46,459 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/761 dead transitions. [2021-06-10 11:40:46,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 761 transitions, 1829 flow [2021-06-10 11:40:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:46,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:46,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:46,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:46,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:46,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:46,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,463 INFO L185 Difference]: Start difference. First operand has 819 places, 760 transitions, 1803 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:46,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 761 transitions, 1829 flow [2021-06-10 11:40:46,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 820 places, 761 transitions, 1827 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:46,470 INFO L241 Difference]: Finished difference. Result has 822 places, 761 transitions, 1819 flow [2021-06-10 11:40:46,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1819, PETRI_PLACES=822, PETRI_TRANSITIONS=761} [2021-06-10 11:40:46,471 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 21 predicate places. [2021-06-10 11:40:46,471 INFO L480 AbstractCegarLoop]: Abstraction has has 822 places, 761 transitions, 1819 flow [2021-06-10 11:40:46,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:46,471 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:46,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1379 [2021-06-10 11:40:46,471 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash -536480189, now seen corresponding path program 1 times [2021-06-10 11:40:46,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:46,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269559930] [2021-06-10 11:40:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:46,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:46,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:46,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269559930] [2021-06-10 11:40:46,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:46,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:46,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344700697] [2021-06-10 11:40:46,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:46,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:46,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:46,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:46,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 761 transitions, 1819 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:46,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:46,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:46,789 INFO L129 PetriNetUnfolder]: 51/886 cut-off events. [2021-06-10 11:40:46,790 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:46,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 886 events. 51/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3761 event pairs, 0 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1057. Up to 31 conditions per place. [2021-06-10 11:40:46,839 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/758 dead transitions. [2021-06-10 11:40:46,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 758 transitions, 1816 flow [2021-06-10 11:40:46,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:46,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:46,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:46,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:46,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:46,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:46,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,843 INFO L185 Difference]: Start difference. First operand has 822 places, 761 transitions, 1819 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:46,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 758 transitions, 1816 flow [2021-06-10 11:40:46,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 758 transitions, 1808 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:46,893 INFO L241 Difference]: Finished difference. Result has 821 places, 758 transitions, 1798 flow [2021-06-10 11:40:46,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1798, PETRI_PLACES=821, PETRI_TRANSITIONS=758} [2021-06-10 11:40:46,893 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 20 predicate places. [2021-06-10 11:40:46,893 INFO L480 AbstractCegarLoop]: Abstraction has has 821 places, 758 transitions, 1798 flow [2021-06-10 11:40:46,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:46,894 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:46,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1380 [2021-06-10 11:40:46,894 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -536479166, now seen corresponding path program 1 times [2021-06-10 11:40:46,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:46,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362225671] [2021-06-10 11:40:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:46,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:46,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:46,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:40:46,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362225671] [2021-06-10 11:40:46,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:46,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:46,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267918880] [2021-06-10 11:40:46,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:46,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:46,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:46,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 758 transitions, 1798 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:46,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:46,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:46,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:47,193 INFO L129 PetriNetUnfolder]: 51/884 cut-off events. [2021-06-10 11:40:47,193 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:47,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 884 events. 51/884 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3748 event pairs, 0 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1060. Up to 31 conditions per place. [2021-06-10 11:40:47,243 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/756 dead transitions. [2021-06-10 11:40:47,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 756 transitions, 1811 flow [2021-06-10 11:40:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:47,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:47,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:47,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:47,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:47,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:47,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,247 INFO L185 Difference]: Start difference. First operand has 821 places, 758 transitions, 1798 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:47,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 756 transitions, 1811 flow [2021-06-10 11:40:47,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 820 places, 756 transitions, 1810 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:47,255 INFO L241 Difference]: Finished difference. Result has 820 places, 756 transitions, 1794 flow [2021-06-10 11:40:47,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1794, PETRI_PLACES=820, PETRI_TRANSITIONS=756} [2021-06-10 11:40:47,255 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 19 predicate places. [2021-06-10 11:40:47,255 INFO L480 AbstractCegarLoop]: Abstraction has has 820 places, 756 transitions, 1794 flow [2021-06-10 11:40:47,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:47,255 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:47,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1381 [2021-06-10 11:40:47,256 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1116149930, now seen corresponding path program 1 times [2021-06-10 11:40:47,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:47,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457439792] [2021-06-10 11:40:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:47,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:47,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:47,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:47,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457439792] [2021-06-10 11:40:47,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:47,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:47,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59698502] [2021-06-10 11:40:47,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:47,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:47,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:47,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 756 transitions, 1794 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:47,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:47,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:47,570 INFO L129 PetriNetUnfolder]: 49/889 cut-off events. [2021-06-10 11:40:47,570 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:47,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 889 events. 49/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3799 event pairs, 0 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 1063. Up to 31 conditions per place. [2021-06-10 11:40:47,621 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/757 dead transitions. [2021-06-10 11:40:47,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 757 transitions, 1810 flow [2021-06-10 11:40:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:47,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:47,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:47,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:47,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:47,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:47,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,625 INFO L185 Difference]: Start difference. First operand has 820 places, 756 transitions, 1794 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:47,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 757 transitions, 1810 flow [2021-06-10 11:40:47,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 757 transitions, 1809 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:47,632 INFO L241 Difference]: Finished difference. Result has 823 places, 757 transitions, 1807 flow [2021-06-10 11:40:47,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1793, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1807, PETRI_PLACES=823, PETRI_TRANSITIONS=757} [2021-06-10 11:40:47,633 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 22 predicate places. [2021-06-10 11:40:47,633 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 757 transitions, 1807 flow [2021-06-10 11:40:47,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:47,633 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:47,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1382 [2021-06-10 11:40:47,633 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1116150953, now seen corresponding path program 1 times [2021-06-10 11:40:47,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:47,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353501796] [2021-06-10 11:40:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:47,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:47,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:47,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:47,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:47,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353501796] [2021-06-10 11:40:47,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:47,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:47,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620671631] [2021-06-10 11:40:47,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:47,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:47,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:47,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:47,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:47,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 757 transitions, 1807 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:47,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:47,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:47,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:47,953 INFO L129 PetriNetUnfolder]: 49/890 cut-off events. [2021-06-10 11:40:47,953 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:47,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 890 events. 49/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3807 event pairs, 0 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1071. Up to 31 conditions per place. [2021-06-10 11:40:48,001 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/758 dead transitions. [2021-06-10 11:40:48,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 758 transitions, 1833 flow [2021-06-10 11:40:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:48,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:48,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:48,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:48,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:48,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:48,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,005 INFO L185 Difference]: Start difference. First operand has 823 places, 757 transitions, 1807 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:48,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 825 places, 758 transitions, 1833 flow [2021-06-10 11:40:48,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 824 places, 758 transitions, 1831 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:48,012 INFO L241 Difference]: Finished difference. Result has 826 places, 758 transitions, 1823 flow [2021-06-10 11:40:48,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=822, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1823, PETRI_PLACES=826, PETRI_TRANSITIONS=758} [2021-06-10 11:40:48,013 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 25 predicate places. [2021-06-10 11:40:48,013 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 758 transitions, 1823 flow [2021-06-10 11:40:48,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:48,013 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:48,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383 [2021-06-10 11:40:48,013 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1115196618, now seen corresponding path program 1 times [2021-06-10 11:40:48,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:48,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666468381] [2021-06-10 11:40:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:48,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:48,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:48,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666468381] [2021-06-10 11:40:48,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:48,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:48,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766547143] [2021-06-10 11:40:48,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:48,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:48,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:48,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 758 transitions, 1823 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:48,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:48,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:48,326 INFO L129 PetriNetUnfolder]: 48/887 cut-off events. [2021-06-10 11:40:48,326 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:40:48,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 887 events. 48/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3789 event pairs, 0 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1070. Up to 31 conditions per place. [2021-06-10 11:40:48,376 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/756 dead transitions. [2021-06-10 11:40:48,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 756 transitions, 1831 flow [2021-06-10 11:40:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:40:48,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:40:48,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:40:48,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:40:48,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:48,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:40:48,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,380 INFO L185 Difference]: Start difference. First operand has 826 places, 758 transitions, 1823 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:40:48,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 756 transitions, 1831 flow [2021-06-10 11:40:48,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 756 transitions, 1830 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:48,388 INFO L241 Difference]: Finished difference. Result has 827 places, 756 transitions, 1812 flow [2021-06-10 11:40:48,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1812, PETRI_PLACES=827, PETRI_TRANSITIONS=756} [2021-06-10 11:40:48,388 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 26 predicate places. [2021-06-10 11:40:48,388 INFO L480 AbstractCegarLoop]: Abstraction has has 827 places, 756 transitions, 1812 flow [2021-06-10 11:40:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:48,388 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:48,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1384 [2021-06-10 11:40:48,389 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1115197641, now seen corresponding path program 1 times [2021-06-10 11:40:48,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:48,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103016778] [2021-06-10 11:40:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:48,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:48,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:40:48,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103016778] [2021-06-10 11:40:48,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:48,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:48,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722499978] [2021-06-10 11:40:48,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:48,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:48,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:48,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 756 transitions, 1812 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:48,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:48,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:48,714 INFO L129 PetriNetUnfolder]: 48/884 cut-off events. [2021-06-10 11:40:48,714 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:48,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 884 events. 48/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3765 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1064. Up to 31 conditions per place. [2021-06-10 11:40:48,762 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/753 dead transitions. [2021-06-10 11:40:48,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 753 transitions, 1813 flow [2021-06-10 11:40:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:48,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:48,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:48,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:48,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:48,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:48,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,766 INFO L185 Difference]: Start difference. First operand has 827 places, 756 transitions, 1812 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:48,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 753 transitions, 1813 flow [2021-06-10 11:40:48,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 824 places, 753 transitions, 1808 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:48,773 INFO L241 Difference]: Finished difference. Result has 824 places, 753 transitions, 1798 flow [2021-06-10 11:40:48,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=822, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1798, PETRI_PLACES=824, PETRI_TRANSITIONS=753} [2021-06-10 11:40:48,773 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 23 predicate places. [2021-06-10 11:40:48,773 INFO L480 AbstractCegarLoop]: Abstraction has has 824 places, 753 transitions, 1798 flow [2021-06-10 11:40:48,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:48,773 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:48,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1385 [2021-06-10 11:40:48,773 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2044431060, now seen corresponding path program 1 times [2021-06-10 11:40:48,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:48,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506764356] [2021-06-10 11:40:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:48,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:48,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:48,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:48,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506764356] [2021-06-10 11:40:48,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:48,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:48,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737129068] [2021-06-10 11:40:48,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:48,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:48,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:48,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 824 places, 753 transitions, 1798 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:48,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:48,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:48,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:49,095 INFO L129 PetriNetUnfolder]: 47/891 cut-off events. [2021-06-10 11:40:49,095 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:49,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 891 events. 47/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3821 event pairs, 0 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1074. Up to 31 conditions per place. [2021-06-10 11:40:49,137 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/754 dead transitions. [2021-06-10 11:40:49,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 754 transitions, 1814 flow [2021-06-10 11:40:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:49,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:49,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:49,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:49,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:49,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:49,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,141 INFO L185 Difference]: Start difference. First operand has 824 places, 753 transitions, 1798 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:49,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 754 transitions, 1814 flow [2021-06-10 11:40:49,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 825 places, 754 transitions, 1813 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:49,147 INFO L241 Difference]: Finished difference. Result has 826 places, 753 transitions, 1802 flow [2021-06-10 11:40:49,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=823, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1802, PETRI_PLACES=826, PETRI_TRANSITIONS=753} [2021-06-10 11:40:49,147 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 25 predicate places. [2021-06-10 11:40:49,147 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 753 transitions, 1802 flow [2021-06-10 11:40:49,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,148 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:49,148 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:49,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1386 [2021-06-10 11:40:49,148 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2044430037, now seen corresponding path program 1 times [2021-06-10 11:40:49,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:49,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507780361] [2021-06-10 11:40:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:49,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:49,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507780361] [2021-06-10 11:40:49,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:49,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:49,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534380567] [2021-06-10 11:40:49,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:49,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:49,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:49,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 753 transitions, 1802 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:49,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:49,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:49,484 INFO L129 PetriNetUnfolder]: 45/893 cut-off events. [2021-06-10 11:40:49,484 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:49,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 893 events. 45/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3858 event pairs, 0 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1083. Up to 31 conditions per place. [2021-06-10 11:40:49,533 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/754 dead transitions. [2021-06-10 11:40:49,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 754 transitions, 1828 flow [2021-06-10 11:40:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:49,534 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:49,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:49,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:49,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:49,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:49,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,537 INFO L185 Difference]: Start difference. First operand has 826 places, 753 transitions, 1802 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 754 transitions, 1828 flow [2021-06-10 11:40:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 754 transitions, 1827 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:49,544 INFO L241 Difference]: Finished difference. Result has 829 places, 754 transitions, 1819 flow [2021-06-10 11:40:49,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1819, PETRI_PLACES=829, PETRI_TRANSITIONS=754} [2021-06-10 11:40:49,544 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 28 predicate places. [2021-06-10 11:40:49,544 INFO L480 AbstractCegarLoop]: Abstraction has has 829 places, 754 transitions, 1819 flow [2021-06-10 11:40:49,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:49,544 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:49,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1387 [2021-06-10 11:40:49,544 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2045383349, now seen corresponding path program 1 times [2021-06-10 11:40:49,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:49,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716157356] [2021-06-10 11:40:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:49,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:49,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:49,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716157356] [2021-06-10 11:40:49,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:49,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:49,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648108144] [2021-06-10 11:40:49,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:49,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:49,564 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:49,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 829 places, 754 transitions, 1819 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:49,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:49,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:49,869 INFO L129 PetriNetUnfolder]: 45/886 cut-off events. [2021-06-10 11:40:49,869 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:49,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 886 events. 45/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3791 event pairs, 0 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 1069. Up to 31 conditions per place. [2021-06-10 11:40:49,917 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/752 dead transitions. [2021-06-10 11:40:49,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 752 transitions, 1821 flow [2021-06-10 11:40:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:49,918 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:49,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:49,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:49,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:49,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:49,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,921 INFO L185 Difference]: Start difference. First operand has 829 places, 754 transitions, 1819 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:49,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 831 places, 752 transitions, 1821 flow [2021-06-10 11:40:49,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 828 places, 752 transitions, 1813 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:49,928 INFO L241 Difference]: Finished difference. Result has 829 places, 752 transitions, 1806 flow [2021-06-10 11:40:49,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=826, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1806, PETRI_PLACES=829, PETRI_TRANSITIONS=752} [2021-06-10 11:40:49,928 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 28 predicate places. [2021-06-10 11:40:49,928 INFO L480 AbstractCegarLoop]: Abstraction has has 829 places, 752 transitions, 1806 flow [2021-06-10 11:40:49,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:49,929 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:49,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1388 [2021-06-10 11:40:49,929 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2045384372, now seen corresponding path program 1 times [2021-06-10 11:40:49,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:49,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549066055] [2021-06-10 11:40:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:49,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:49,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:49,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:40:49,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549066055] [2021-06-10 11:40:49,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:49,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:49,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987648208] [2021-06-10 11:40:49,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:49,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:49,949 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:49,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 829 places, 752 transitions, 1806 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:49,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:49,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:49,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:50,239 INFO L129 PetriNetUnfolder]: 45/884 cut-off events. [2021-06-10 11:40:50,239 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:50,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 884 events. 45/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3777 event pairs, 0 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 1073. Up to 31 conditions per place. [2021-06-10 11:40:50,286 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/750 dead transitions. [2021-06-10 11:40:50,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 829 places, 750 transitions, 1819 flow [2021-06-10 11:40:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:50,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:50,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:50,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:50,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:50,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:50,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,290 INFO L185 Difference]: Start difference. First operand has 829 places, 752 transitions, 1806 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:50,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 829 places, 750 transitions, 1819 flow [2021-06-10 11:40:50,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 828 places, 750 transitions, 1818 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:50,297 INFO L241 Difference]: Finished difference. Result has 828 places, 750 transitions, 1802 flow [2021-06-10 11:40:50,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=826, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1802, PETRI_PLACES=828, PETRI_TRANSITIONS=750} [2021-06-10 11:40:50,297 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 27 predicate places. [2021-06-10 11:40:50,297 INFO L480 AbstractCegarLoop]: Abstraction has has 828 places, 750 transitions, 1802 flow [2021-06-10 11:40:50,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:50,297 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:50,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1389 [2021-06-10 11:40:50,297 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1088068927, now seen corresponding path program 1 times [2021-06-10 11:40:50,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:50,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064765119] [2021-06-10 11:40:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:50,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:50,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:50,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:50,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064765119] [2021-06-10 11:40:50,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:50,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:50,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360605990] [2021-06-10 11:40:50,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:50,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:50,318 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:50,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 750 transitions, 1802 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:50,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:50,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:50,615 INFO L129 PetriNetUnfolder]: 43/889 cut-off events. [2021-06-10 11:40:50,615 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:50,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 889 events. 43/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3830 event pairs, 0 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1076. Up to 31 conditions per place. [2021-06-10 11:40:50,662 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/751 dead transitions. [2021-06-10 11:40:50,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 751 transitions, 1818 flow [2021-06-10 11:40:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:50,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:50,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:50,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:50,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:50,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:50,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,666 INFO L185 Difference]: Start difference. First operand has 828 places, 750 transitions, 1802 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:50,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 751 transitions, 1818 flow [2021-06-10 11:40:50,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 751 transitions, 1817 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:50,673 INFO L241 Difference]: Finished difference. Result has 831 places, 751 transitions, 1815 flow [2021-06-10 11:40:50,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=827, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=831, PETRI_TRANSITIONS=751} [2021-06-10 11:40:50,674 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 30 predicate places. [2021-06-10 11:40:50,674 INFO L480 AbstractCegarLoop]: Abstraction has has 831 places, 751 transitions, 1815 flow [2021-06-10 11:40:50,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:50,674 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:50,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1390 [2021-06-10 11:40:50,674 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1088069950, now seen corresponding path program 1 times [2021-06-10 11:40:50,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:50,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125240485] [2021-06-10 11:40:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:50,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:50,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:50,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:50,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:50,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125240485] [2021-06-10 11:40:50,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:50,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:50,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653062599] [2021-06-10 11:40:50,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:50,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:50,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:50,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:50,694 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:50,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 751 transitions, 1815 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:50,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:50,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:50,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:51,010 INFO L129 PetriNetUnfolder]: 43/890 cut-off events. [2021-06-10 11:40:51,010 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:40:51,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 890 events. 43/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3840 event pairs, 0 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1084. Up to 31 conditions per place. [2021-06-10 11:40:51,041 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/752 dead transitions. [2021-06-10 11:40:51,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 752 transitions, 1841 flow [2021-06-10 11:40:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:51,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:51,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:51,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:51,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:51,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:51,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,045 INFO L185 Difference]: Start difference. First operand has 831 places, 751 transitions, 1815 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:51,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 752 transitions, 1841 flow [2021-06-10 11:40:51,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 832 places, 752 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:51,051 INFO L241 Difference]: Finished difference. Result has 834 places, 752 transitions, 1831 flow [2021-06-10 11:40:51,051 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=830, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1831, PETRI_PLACES=834, PETRI_TRANSITIONS=752} [2021-06-10 11:40:51,051 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 33 predicate places. [2021-06-10 11:40:51,051 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 752 transitions, 1831 flow [2021-06-10 11:40:51,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:51,052 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:51,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1391 [2021-06-10 11:40:51,052 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1087115615, now seen corresponding path program 1 times [2021-06-10 11:40:51,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:51,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758467557] [2021-06-10 11:40:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:51,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:51,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:51,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758467557] [2021-06-10 11:40:51,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:51,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:51,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885125481] [2021-06-10 11:40:51,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:51,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:51,072 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:51,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 752 transitions, 1831 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:51,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:51,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:51,367 INFO L129 PetriNetUnfolder]: 42/887 cut-off events. [2021-06-10 11:40:51,367 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:40:51,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 887 events. 42/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3822 event pairs, 0 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 1083. Up to 31 conditions per place. [2021-06-10 11:40:51,415 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/750 dead transitions. [2021-06-10 11:40:51,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 750 transitions, 1839 flow [2021-06-10 11:40:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:40:51,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:40:51,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:40:51,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:40:51,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:51,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:40:51,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,419 INFO L185 Difference]: Start difference. First operand has 834 places, 752 transitions, 1831 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:40:51,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 836 places, 750 transitions, 1839 flow [2021-06-10 11:40:51,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 835 places, 750 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:51,426 INFO L241 Difference]: Finished difference. Result has 835 places, 750 transitions, 1820 flow [2021-06-10 11:40:51,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=833, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1820, PETRI_PLACES=835, PETRI_TRANSITIONS=750} [2021-06-10 11:40:51,426 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 34 predicate places. [2021-06-10 11:40:51,426 INFO L480 AbstractCegarLoop]: Abstraction has has 835 places, 750 transitions, 1820 flow [2021-06-10 11:40:51,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:51,427 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:51,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1392 [2021-06-10 11:40:51,427 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1087116638, now seen corresponding path program 1 times [2021-06-10 11:40:51,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:51,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567065374] [2021-06-10 11:40:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:51,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:51,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:40:51,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567065374] [2021-06-10 11:40:51,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:51,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:51,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438042214] [2021-06-10 11:40:51,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:51,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:51,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:51,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 750 transitions, 1820 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:51,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:51,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:51,734 INFO L129 PetriNetUnfolder]: 42/884 cut-off events. [2021-06-10 11:40:51,734 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:51,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 884 events. 42/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3800 event pairs, 0 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1077. Up to 31 conditions per place. [2021-06-10 11:40:51,782 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/747 dead transitions. [2021-06-10 11:40:51,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 747 transitions, 1821 flow [2021-06-10 11:40:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:51,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:51,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:51,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:51,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:51,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:51,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,786 INFO L185 Difference]: Start difference. First operand has 835 places, 750 transitions, 1820 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:51,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 835 places, 747 transitions, 1821 flow [2021-06-10 11:40:51,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 832 places, 747 transitions, 1816 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:51,793 INFO L241 Difference]: Finished difference. Result has 832 places, 747 transitions, 1806 flow [2021-06-10 11:40:51,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=830, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1806, PETRI_PLACES=832, PETRI_TRANSITIONS=747} [2021-06-10 11:40:51,793 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 31 predicate places. [2021-06-10 11:40:51,793 INFO L480 AbstractCegarLoop]: Abstraction has has 832 places, 747 transitions, 1806 flow [2021-06-10 11:40:51,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:51,793 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:51,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1393 [2021-06-10 11:40:51,793 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1948919577, now seen corresponding path program 1 times [2021-06-10 11:40:51,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:51,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815555054] [2021-06-10 11:40:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:51,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:51,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:51,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:51,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815555054] [2021-06-10 11:40:51,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:51,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:51,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894077169] [2021-06-10 11:40:51,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:51,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:51,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:51,824 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:51,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 747 transitions, 1806 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:51,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:51,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:51,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:52,133 INFO L129 PetriNetUnfolder]: 41/891 cut-off events. [2021-06-10 11:40:52,133 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:52,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 891 events. 41/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3856 event pairs, 0 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1087. Up to 31 conditions per place. [2021-06-10 11:40:52,182 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/748 dead transitions. [2021-06-10 11:40:52,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 748 transitions, 1822 flow [2021-06-10 11:40:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:52,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:52,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:52,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:52,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:52,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:52,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,186 INFO L185 Difference]: Start difference. First operand has 832 places, 747 transitions, 1806 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:52,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 834 places, 748 transitions, 1822 flow [2021-06-10 11:40:52,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 748 transitions, 1821 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:52,194 INFO L241 Difference]: Finished difference. Result has 834 places, 747 transitions, 1810 flow [2021-06-10 11:40:52,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=834, PETRI_TRANSITIONS=747} [2021-06-10 11:40:52,194 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 33 predicate places. [2021-06-10 11:40:52,194 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 747 transitions, 1810 flow [2021-06-10 11:40:52,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:52,195 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:52,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1394 [2021-06-10 11:40:52,195 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1948920600, now seen corresponding path program 1 times [2021-06-10 11:40:52,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:52,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840433061] [2021-06-10 11:40:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:52,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:52,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:52,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:52,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840433061] [2021-06-10 11:40:52,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:52,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:52,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327870494] [2021-06-10 11:40:52,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:52,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:52,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:52,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 747 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:52,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:52,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:52,536 INFO L129 PetriNetUnfolder]: 39/893 cut-off events. [2021-06-10 11:40:52,536 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:52,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 893 events. 39/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3892 event pairs, 0 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1096. Up to 31 conditions per place. [2021-06-10 11:40:52,584 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/748 dead transitions. [2021-06-10 11:40:52,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 748 transitions, 1836 flow [2021-06-10 11:40:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:40:52,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:40:52,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:40:52,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:40:52,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:52,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:40:52,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,588 INFO L185 Difference]: Start difference. First operand has 834 places, 747 transitions, 1810 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:40:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 836 places, 748 transitions, 1836 flow [2021-06-10 11:40:52,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 835 places, 748 transitions, 1835 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:52,595 INFO L241 Difference]: Finished difference. Result has 837 places, 748 transitions, 1827 flow [2021-06-10 11:40:52,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=833, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1827, PETRI_PLACES=837, PETRI_TRANSITIONS=748} [2021-06-10 11:40:52,596 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 36 predicate places. [2021-06-10 11:40:52,596 INFO L480 AbstractCegarLoop]: Abstraction has has 837 places, 748 transitions, 1827 flow [2021-06-10 11:40:52,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:52,596 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:52,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1395 [2021-06-10 11:40:52,596 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:52,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1947967288, now seen corresponding path program 1 times [2021-06-10 11:40:52,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:52,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539850728] [2021-06-10 11:40:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:52,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:52,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:52,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:52,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:52,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539850728] [2021-06-10 11:40:52,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:52,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:52,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139867615] [2021-06-10 11:40:52,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:52,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:52,616 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:52,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 748 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:52,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:52,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:52,912 INFO L129 PetriNetUnfolder]: 39/886 cut-off events. [2021-06-10 11:40:52,912 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:52,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 886 events. 39/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3829 event pairs, 0 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 1082. Up to 31 conditions per place. [2021-06-10 11:40:52,960 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/746 dead transitions. [2021-06-10 11:40:52,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 746 transitions, 1829 flow [2021-06-10 11:40:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:52,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:52,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:52,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:52,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:52,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:52,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,964 INFO L185 Difference]: Start difference. First operand has 837 places, 748 transitions, 1827 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:52,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 746 transitions, 1829 flow [2021-06-10 11:40:52,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 836 places, 746 transitions, 1821 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:52,972 INFO L241 Difference]: Finished difference. Result has 837 places, 746 transitions, 1814 flow [2021-06-10 11:40:52,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=834, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1814, PETRI_PLACES=837, PETRI_TRANSITIONS=746} [2021-06-10 11:40:52,972 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 36 predicate places. [2021-06-10 11:40:52,972 INFO L480 AbstractCegarLoop]: Abstraction has has 837 places, 746 transitions, 1814 flow [2021-06-10 11:40:52,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:52,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:52,973 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:52,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1396 [2021-06-10 11:40:52,973 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1947966265, now seen corresponding path program 1 times [2021-06-10 11:40:52,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:52,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008004349] [2021-06-10 11:40:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:53,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:53,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:40:53,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008004349] [2021-06-10 11:40:53,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:53,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:53,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633105826] [2021-06-10 11:40:53,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:53,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:53,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:53,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 746 transitions, 1814 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:53,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:53,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:53,311 INFO L129 PetriNetUnfolder]: 39/884 cut-off events. [2021-06-10 11:40:53,311 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:53,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 884 events. 39/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3816 event pairs, 0 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1086. Up to 31 conditions per place. [2021-06-10 11:40:53,359 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/744 dead transitions. [2021-06-10 11:40:53,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 744 transitions, 1827 flow [2021-06-10 11:40:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:53,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:53,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:53,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:53,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:53,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:53,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,363 INFO L185 Difference]: Start difference. First operand has 837 places, 746 transitions, 1814 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:53,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 837 places, 744 transitions, 1827 flow [2021-06-10 11:40:53,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 836 places, 744 transitions, 1826 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:53,370 INFO L241 Difference]: Finished difference. Result has 836 places, 744 transitions, 1810 flow [2021-06-10 11:40:53,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=834, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=836, PETRI_TRANSITIONS=744} [2021-06-10 11:40:53,371 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 35 predicate places. [2021-06-10 11:40:53,371 INFO L480 AbstractCegarLoop]: Abstraction has has 836 places, 744 transitions, 1810 flow [2021-06-10 11:40:53,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:53,371 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:53,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1397 [2021-06-10 11:40:53,371 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:53,371 INFO L82 PathProgramCache]: Analyzing trace with hash 810398224, now seen corresponding path program 1 times [2021-06-10 11:40:53,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:53,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144868548] [2021-06-10 11:40:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:53,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:53,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:53,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144868548] [2021-06-10 11:40:53,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:53,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:53,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345568024] [2021-06-10 11:40:53,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:53,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:53,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:53,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:53,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 836 places, 744 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:53,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:53,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:53,698 INFO L129 PetriNetUnfolder]: 38/892 cut-off events. [2021-06-10 11:40:53,698 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:53,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 892 events. 38/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3883 event pairs, 0 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1098. Up to 31 conditions per place. [2021-06-10 11:40:53,746 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/746 dead transitions. [2021-06-10 11:40:53,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 746 transitions, 1840 flow [2021-06-10 11:40:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:53,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:53,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:53,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:53,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:53,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:53,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,750 INFO L185 Difference]: Start difference. First operand has 836 places, 744 transitions, 1810 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:53,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 838 places, 746 transitions, 1840 flow [2021-06-10 11:40:53,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 837 places, 746 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:53,757 INFO L241 Difference]: Finished difference. Result has 839 places, 746 transitions, 1833 flow [2021-06-10 11:40:53,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=835, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1833, PETRI_PLACES=839, PETRI_TRANSITIONS=746} [2021-06-10 11:40:53,758 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 38 predicate places. [2021-06-10 11:40:53,758 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 746 transitions, 1833 flow [2021-06-10 11:40:53,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:53,758 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:53,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1398 [2021-06-10 11:40:53,758 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:53,758 INFO L82 PathProgramCache]: Analyzing trace with hash 810397201, now seen corresponding path program 1 times [2021-06-10 11:40:53,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:53,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733322193] [2021-06-10 11:40:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:53,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:53,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:53,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:53,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733322193] [2021-06-10 11:40:53,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:53,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:53,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184991170] [2021-06-10 11:40:53,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:53,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:53,779 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:53,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 746 transitions, 1833 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:53,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:53,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:53,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:54,082 INFO L129 PetriNetUnfolder]: 36/893 cut-off events. [2021-06-10 11:40:54,082 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:54,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 893 events. 36/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3906 event pairs, 0 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1098. Up to 31 conditions per place. [2021-06-10 11:40:54,132 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/746 dead transitions. [2021-06-10 11:40:54,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 841 places, 746 transitions, 1845 flow [2021-06-10 11:40:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:54,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:54,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:54,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:54,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:54,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:54,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,137 INFO L185 Difference]: Start difference. First operand has 839 places, 746 transitions, 1833 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:54,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 841 places, 746 transitions, 1845 flow [2021-06-10 11:40:54,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 840 places, 746 transitions, 1840 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:54,144 INFO L241 Difference]: Finished difference. Result has 841 places, 745 transitions, 1829 flow [2021-06-10 11:40:54,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=838, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1829, PETRI_PLACES=841, PETRI_TRANSITIONS=745} [2021-06-10 11:40:54,145 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 40 predicate places. [2021-06-10 11:40:54,145 INFO L480 AbstractCegarLoop]: Abstraction has has 841 places, 745 transitions, 1829 flow [2021-06-10 11:40:54,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:54,145 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:54,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1399 [2021-06-10 11:40:54,145 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 809444912, now seen corresponding path program 1 times [2021-06-10 11:40:54,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:54,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936256500] [2021-06-10 11:40:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:54,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:54,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:54,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936256500] [2021-06-10 11:40:54,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:54,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:54,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457503124] [2021-06-10 11:40:54,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:54,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:54,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:54,167 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:54,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 841 places, 745 transitions, 1829 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:54,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:54,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:54,477 INFO L129 PetriNetUnfolder]: 36/886 cut-off events. [2021-06-10 11:40:54,477 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:54,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 886 events. 36/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3844 event pairs, 0 based on Foata normal form. 1/822 useless extension candidates. Maximal degree in co-relation 1092. Up to 31 conditions per place. [2021-06-10 11:40:54,525 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/743 dead transitions. [2021-06-10 11:40:54,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 743 transitions, 1832 flow [2021-06-10 11:40:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:54,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:54,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:54,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:54,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:54,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:54,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,529 INFO L185 Difference]: Start difference. First operand has 841 places, 745 transitions, 1829 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:54,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 743 transitions, 1832 flow [2021-06-10 11:40:54,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 840 places, 743 transitions, 1825 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:54,536 INFO L241 Difference]: Finished difference. Result has 841 places, 743 transitions, 1818 flow [2021-06-10 11:40:54,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=838, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1818, PETRI_PLACES=841, PETRI_TRANSITIONS=743} [2021-06-10 11:40:54,536 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 40 predicate places. [2021-06-10 11:40:54,536 INFO L480 AbstractCegarLoop]: Abstraction has has 841 places, 743 transitions, 1818 flow [2021-06-10 11:40:54,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,537 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:54,537 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:54,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1400 [2021-06-10 11:40:54,537 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 809443889, now seen corresponding path program 1 times [2021-06-10 11:40:54,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:54,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639960824] [2021-06-10 11:40:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:54,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:54,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:40:54,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639960824] [2021-06-10 11:40:54,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:54,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:54,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46507905] [2021-06-10 11:40:54,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:54,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:54,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:54,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 841 places, 743 transitions, 1818 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:54,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:54,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:54,863 INFO L129 PetriNetUnfolder]: 36/884 cut-off events. [2021-06-10 11:40:54,863 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:54,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 884 events. 36/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3829 event pairs, 0 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1092. Up to 31 conditions per place. [2021-06-10 11:40:54,910 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/741 dead transitions. [2021-06-10 11:40:54,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 841 places, 741 transitions, 1831 flow [2021-06-10 11:40:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:54,912 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:54,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:54,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:54,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:54,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,914 INFO L185 Difference]: Start difference. First operand has 841 places, 743 transitions, 1818 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:54,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 841 places, 741 transitions, 1831 flow [2021-06-10 11:40:54,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 840 places, 741 transitions, 1830 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:54,921 INFO L241 Difference]: Finished difference. Result has 840 places, 741 transitions, 1814 flow [2021-06-10 11:40:54,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=838, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1814, PETRI_PLACES=840, PETRI_TRANSITIONS=741} [2021-06-10 11:40:54,922 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 39 predicate places. [2021-06-10 11:40:54,922 INFO L480 AbstractCegarLoop]: Abstraction has has 840 places, 741 transitions, 1814 flow [2021-06-10 11:40:54,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:54,922 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:54,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1401 [2021-06-10 11:40:54,922 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash 936199945, now seen corresponding path program 1 times [2021-06-10 11:40:54,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:54,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638180118] [2021-06-10 11:40:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:54,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:54,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:54,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:54,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638180118] [2021-06-10 11:40:54,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:54,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:54,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927794138] [2021-06-10 11:40:54,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:54,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:54,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:54,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 840 places, 741 transitions, 1814 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:54,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:54,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:54,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:55,252 INFO L129 PetriNetUnfolder]: 35/892 cut-off events. [2021-06-10 11:40:55,252 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:55,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 892 events. 35/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3902 event pairs, 0 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1104. Up to 31 conditions per place. [2021-06-10 11:40:55,294 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/743 dead transitions. [2021-06-10 11:40:55,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 842 places, 743 transitions, 1844 flow [2021-06-10 11:40:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:55,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:55,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:55,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:55,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:55,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:55,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,298 INFO L185 Difference]: Start difference. First operand has 840 places, 741 transitions, 1814 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:55,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 842 places, 743 transitions, 1844 flow [2021-06-10 11:40:55,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 841 places, 743 transitions, 1843 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:55,305 INFO L241 Difference]: Finished difference. Result has 843 places, 743 transitions, 1837 flow [2021-06-10 11:40:55,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=839, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1837, PETRI_PLACES=843, PETRI_TRANSITIONS=743} [2021-06-10 11:40:55,305 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 42 predicate places. [2021-06-10 11:40:55,305 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 743 transitions, 1837 flow [2021-06-10 11:40:55,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,306 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:55,306 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:55,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1402 [2021-06-10 11:40:55,306 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 936198922, now seen corresponding path program 1 times [2021-06-10 11:40:55,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:55,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692192145] [2021-06-10 11:40:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:55,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:55,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:55,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:55,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692192145] [2021-06-10 11:40:55,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:55,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:55,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409489521] [2021-06-10 11:40:55,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:55,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:55,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:55,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 743 transitions, 1837 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:55,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:55,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:55,631 INFO L129 PetriNetUnfolder]: 33/893 cut-off events. [2021-06-10 11:40:55,631 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:55,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 893 events. 33/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3925 event pairs, 0 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1104. Up to 31 conditions per place. [2021-06-10 11:40:55,678 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/743 dead transitions. [2021-06-10 11:40:55,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 743 transitions, 1849 flow [2021-06-10 11:40:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:55,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:55,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:55,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:55,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:55,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:55,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,682 INFO L185 Difference]: Start difference. First operand has 843 places, 743 transitions, 1837 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 743 transitions, 1849 flow [2021-06-10 11:40:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 743 transitions, 1844 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:55,689 INFO L241 Difference]: Finished difference. Result has 845 places, 742 transitions, 1833 flow [2021-06-10 11:40:55,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=842, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1833, PETRI_PLACES=845, PETRI_TRANSITIONS=742} [2021-06-10 11:40:55,689 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 44 predicate places. [2021-06-10 11:40:55,689 INFO L480 AbstractCegarLoop]: Abstraction has has 845 places, 742 transitions, 1833 flow [2021-06-10 11:40:55,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:55,690 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:55,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1403 [2021-06-10 11:40:55,690 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash 935246633, now seen corresponding path program 1 times [2021-06-10 11:40:55,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:55,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448759215] [2021-06-10 11:40:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:55,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:55,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:55,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:55,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:55,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448759215] [2021-06-10 11:40:55,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:55,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:55,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707599636] [2021-06-10 11:40:55,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:55,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:55,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:55,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 742 transitions, 1833 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:55,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:55,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:55,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:56,008 INFO L129 PetriNetUnfolder]: 33/886 cut-off events. [2021-06-10 11:40:56,008 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:56,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 886 events. 33/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3863 event pairs, 0 based on Foata normal form. 1/825 useless extension candidates. Maximal degree in co-relation 1098. Up to 31 conditions per place. [2021-06-10 11:40:56,055 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/740 dead transitions. [2021-06-10 11:40:56,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 740 transitions, 1836 flow [2021-06-10 11:40:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:56,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:56,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:56,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:56,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:56,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:56,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,059 INFO L185 Difference]: Start difference. First operand has 845 places, 742 transitions, 1833 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:56,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 740 transitions, 1836 flow [2021-06-10 11:40:56,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 740 transitions, 1829 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:56,066 INFO L241 Difference]: Finished difference. Result has 845 places, 740 transitions, 1822 flow [2021-06-10 11:40:56,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=842, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1822, PETRI_PLACES=845, PETRI_TRANSITIONS=740} [2021-06-10 11:40:56,067 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 44 predicate places. [2021-06-10 11:40:56,067 INFO L480 AbstractCegarLoop]: Abstraction has has 845 places, 740 transitions, 1822 flow [2021-06-10 11:40:56,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:56,067 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:56,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1404 [2021-06-10 11:40:56,067 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 935245610, now seen corresponding path program 1 times [2021-06-10 11:40:56,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:56,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202783826] [2021-06-10 11:40:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:56,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:56,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:40:56,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202783826] [2021-06-10 11:40:56,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:56,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:56,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061204764] [2021-06-10 11:40:56,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:56,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:56,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:56,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 740 transitions, 1822 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:56,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:56,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:56,393 INFO L129 PetriNetUnfolder]: 33/884 cut-off events. [2021-06-10 11:40:56,393 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:56,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 884 events. 33/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3846 event pairs, 0 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1098. Up to 31 conditions per place. [2021-06-10 11:40:56,440 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/738 dead transitions. [2021-06-10 11:40:56,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 738 transitions, 1835 flow [2021-06-10 11:40:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:56,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:56,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:56,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:56,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:56,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:56,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,444 INFO L185 Difference]: Start difference. First operand has 845 places, 740 transitions, 1822 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 738 transitions, 1835 flow [2021-06-10 11:40:56,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 738 transitions, 1834 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:56,451 INFO L241 Difference]: Finished difference. Result has 844 places, 738 transitions, 1818 flow [2021-06-10 11:40:56,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=842, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1818, PETRI_PLACES=844, PETRI_TRANSITIONS=738} [2021-06-10 11:40:56,452 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 43 predicate places. [2021-06-10 11:40:56,452 INFO L480 AbstractCegarLoop]: Abstraction has has 844 places, 738 transitions, 1818 flow [2021-06-10 11:40:56,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:56,452 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:56,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1405 [2021-06-10 11:40:56,452 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 298530435, now seen corresponding path program 1 times [2021-06-10 11:40:56,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:56,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138502192] [2021-06-10 11:40:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:56,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:56,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:56,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138502192] [2021-06-10 11:40:56,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:56,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:56,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582293723] [2021-06-10 11:40:56,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:56,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:56,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:56,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 844 places, 738 transitions, 1818 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:56,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:56,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:56,801 INFO L129 PetriNetUnfolder]: 32/892 cut-off events. [2021-06-10 11:40:56,801 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:56,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 892 events. 32/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3916 event pairs, 0 based on Foata normal form. 0/829 useless extension candidates. Maximal degree in co-relation 1110. Up to 31 conditions per place. [2021-06-10 11:40:56,850 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/740 dead transitions. [2021-06-10 11:40:56,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 740 transitions, 1848 flow [2021-06-10 11:40:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:56,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:56,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:56,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:56,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:56,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:56,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,854 INFO L185 Difference]: Start difference. First operand has 844 places, 738 transitions, 1818 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:56,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 740 transitions, 1848 flow [2021-06-10 11:40:56,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 845 places, 740 transitions, 1847 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:56,861 INFO L241 Difference]: Finished difference. Result has 847 places, 740 transitions, 1841 flow [2021-06-10 11:40:56,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1841, PETRI_PLACES=847, PETRI_TRANSITIONS=740} [2021-06-10 11:40:56,862 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 46 predicate places. [2021-06-10 11:40:56,862 INFO L480 AbstractCegarLoop]: Abstraction has has 847 places, 740 transitions, 1841 flow [2021-06-10 11:40:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:56,862 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:56,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1406 [2021-06-10 11:40:56,862 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash 298529412, now seen corresponding path program 1 times [2021-06-10 11:40:56,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:56,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495414384] [2021-06-10 11:40:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:56,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:56,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:56,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:56,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495414384] [2021-06-10 11:40:56,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:56,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:56,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414131854] [2021-06-10 11:40:56,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:56,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:56,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:56,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 847 places, 740 transitions, 1841 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:56,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:56,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:56,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:57,199 INFO L129 PetriNetUnfolder]: 30/893 cut-off events. [2021-06-10 11:40:57,199 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:57,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 893 events. 30/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3938 event pairs, 0 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1110. Up to 31 conditions per place. [2021-06-10 11:40:57,236 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/740 dead transitions. [2021-06-10 11:40:57,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 740 transitions, 1853 flow [2021-06-10 11:40:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:57,238 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:57,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:57,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:57,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:57,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:57,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,240 INFO L185 Difference]: Start difference. First operand has 847 places, 740 transitions, 1841 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:57,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 849 places, 740 transitions, 1853 flow [2021-06-10 11:40:57,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 740 transitions, 1848 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:57,247 INFO L241 Difference]: Finished difference. Result has 849 places, 739 transitions, 1837 flow [2021-06-10 11:40:57,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=846, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1837, PETRI_PLACES=849, PETRI_TRANSITIONS=739} [2021-06-10 11:40:57,248 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 48 predicate places. [2021-06-10 11:40:57,248 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 739 transitions, 1837 flow [2021-06-10 11:40:57,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:57,248 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:57,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1407 [2021-06-10 11:40:57,248 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 297577123, now seen corresponding path program 1 times [2021-06-10 11:40:57,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:57,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303781563] [2021-06-10 11:40:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:57,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:57,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:57,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:57,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303781563] [2021-06-10 11:40:57,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:57,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:57,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424430459] [2021-06-10 11:40:57,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:57,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:57,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:57,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 739 transitions, 1837 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:57,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:57,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:57,583 INFO L129 PetriNetUnfolder]: 30/886 cut-off events. [2021-06-10 11:40:57,583 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:57,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 886 events. 30/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3883 event pairs, 0 based on Foata normal form. 1/828 useless extension candidates. Maximal degree in co-relation 1104. Up to 31 conditions per place. [2021-06-10 11:40:57,629 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2021-06-10 11:40:57,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 737 transitions, 1840 flow [2021-06-10 11:40:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:57,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:57,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:57,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:57,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:57,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:57,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,633 INFO L185 Difference]: Start difference. First operand has 849 places, 739 transitions, 1837 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:57,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 737 transitions, 1840 flow [2021-06-10 11:40:57,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 737 transitions, 1833 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:57,640 INFO L241 Difference]: Finished difference. Result has 849 places, 737 transitions, 1826 flow [2021-06-10 11:40:57,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=846, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1826, PETRI_PLACES=849, PETRI_TRANSITIONS=737} [2021-06-10 11:40:57,640 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 48 predicate places. [2021-06-10 11:40:57,640 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 737 transitions, 1826 flow [2021-06-10 11:40:57,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:57,641 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:57,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1408 [2021-06-10 11:40:57,641 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 297576100, now seen corresponding path program 1 times [2021-06-10 11:40:57,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:57,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311019821] [2021-06-10 11:40:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:57,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:57,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:57,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:57,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:40:57,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311019821] [2021-06-10 11:40:57,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:57,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:57,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979500319] [2021-06-10 11:40:57,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:57,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:57,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:57,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 737 transitions, 1826 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:57,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:57,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:57,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:57,963 INFO L129 PetriNetUnfolder]: 30/884 cut-off events. [2021-06-10 11:40:57,963 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:58,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 884 events. 30/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3868 event pairs, 0 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 1104. Up to 31 conditions per place. [2021-06-10 11:40:58,008 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/735 dead transitions. [2021-06-10 11:40:58,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 735 transitions, 1839 flow [2021-06-10 11:40:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:58,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:58,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:58,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:58,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:58,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:58,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,012 INFO L185 Difference]: Start difference. First operand has 849 places, 737 transitions, 1826 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:58,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 849 places, 735 transitions, 1839 flow [2021-06-10 11:40:58,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 735 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:58,019 INFO L241 Difference]: Finished difference. Result has 848 places, 735 transitions, 1822 flow [2021-06-10 11:40:58,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=846, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1822, PETRI_PLACES=848, PETRI_TRANSITIONS=735} [2021-06-10 11:40:58,019 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 47 predicate places. [2021-06-10 11:40:58,019 INFO L480 AbstractCegarLoop]: Abstraction has has 848 places, 735 transitions, 1822 flow [2021-06-10 11:40:58,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:58,020 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:58,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1409 [2021-06-10 11:40:58,020 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 423206910, now seen corresponding path program 1 times [2021-06-10 11:40:58,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:58,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707424922] [2021-06-10 11:40:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:58,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:40:58,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:58,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707424922] [2021-06-10 11:40:58,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:58,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:58,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361989556] [2021-06-10 11:40:58,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:58,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:58,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:58,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 735 transitions, 1822 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:58,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:58,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:58,357 INFO L129 PetriNetUnfolder]: 29/892 cut-off events. [2021-06-10 11:40:58,357 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:58,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 892 events. 29/892 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3938 event pairs, 0 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1116. Up to 31 conditions per place. [2021-06-10 11:40:58,404 INFO L132 encePairwiseOnDemand]: 856/861 looper letters, 10 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2021-06-10 11:40:58,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 737 transitions, 1852 flow [2021-06-10 11:40:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2021-06-10 11:40:58,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210220673635308 [2021-06-10 11:40:58,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2379 transitions. [2021-06-10 11:40:58,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2379 transitions. [2021-06-10 11:40:58,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:58,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2379 transitions. [2021-06-10 11:40:58,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,408 INFO L185 Difference]: Start difference. First operand has 848 places, 735 transitions, 1822 flow. Second operand 3 states and 2379 transitions. [2021-06-10 11:40:58,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 737 transitions, 1852 flow [2021-06-10 11:40:58,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 737 transitions, 1851 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:58,416 INFO L241 Difference]: Finished difference. Result has 851 places, 737 transitions, 1845 flow [2021-06-10 11:40:58,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1845, PETRI_PLACES=851, PETRI_TRANSITIONS=737} [2021-06-10 11:40:58,416 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 50 predicate places. [2021-06-10 11:40:58,416 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 737 transitions, 1845 flow [2021-06-10 11:40:58,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:58,416 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:58,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1410 [2021-06-10 11:40:58,417 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 423205887, now seen corresponding path program 1 times [2021-06-10 11:40:58,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:58,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360990357] [2021-06-10 11:40:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:58,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:58,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:58,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360990357] [2021-06-10 11:40:58,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:58,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:58,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432402656] [2021-06-10 11:40:58,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:58,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:58,438 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:58,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 737 transitions, 1845 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:58,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:58,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:58,758 INFO L129 PetriNetUnfolder]: 27/893 cut-off events. [2021-06-10 11:40:58,758 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:58,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 893 events. 27/893 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3960 event pairs, 0 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 1116. Up to 31 conditions per place. [2021-06-10 11:40:58,805 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2021-06-10 11:40:58,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 737 transitions, 1857 flow [2021-06-10 11:40:58,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:58,807 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:58,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:58,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:58,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:58,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:58,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,809 INFO L185 Difference]: Start difference. First operand has 851 places, 737 transitions, 1845 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:58,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 737 transitions, 1857 flow [2021-06-10 11:40:58,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 852 places, 737 transitions, 1852 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:58,817 INFO L241 Difference]: Finished difference. Result has 853 places, 736 transitions, 1841 flow [2021-06-10 11:40:58,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=850, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1841, PETRI_PLACES=853, PETRI_TRANSITIONS=736} [2021-06-10 11:40:58,817 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 52 predicate places. [2021-06-10 11:40:58,817 INFO L480 AbstractCegarLoop]: Abstraction has has 853 places, 736 transitions, 1841 flow [2021-06-10 11:40:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:58,817 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:58,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1411 [2021-06-10 11:40:58,817 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 422253598, now seen corresponding path program 1 times [2021-06-10 11:40:58,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:58,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814524442] [2021-06-10 11:40:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:58,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:58,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:58,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:58,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814524442] [2021-06-10 11:40:58,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:58,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:58,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4831320] [2021-06-10 11:40:58,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:58,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:58,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:58,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:58,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 736 transitions, 1841 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:58,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:58,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:58,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:59,156 INFO L129 PetriNetUnfolder]: 27/886 cut-off events. [2021-06-10 11:40:59,156 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:40:59,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 886 events. 27/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3898 event pairs, 0 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 1110. Up to 31 conditions per place. [2021-06-10 11:40:59,190 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/734 dead transitions. [2021-06-10 11:40:59,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 734 transitions, 1844 flow [2021-06-10 11:40:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:40:59,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:40:59,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:40:59,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:40:59,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:59,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:40:59,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,194 INFO L185 Difference]: Start difference. First operand has 853 places, 736 transitions, 1841 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:40:59,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 734 transitions, 1844 flow [2021-06-10 11:40:59,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 852 places, 734 transitions, 1837 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:40:59,201 INFO L241 Difference]: Finished difference. Result has 853 places, 734 transitions, 1830 flow [2021-06-10 11:40:59,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=850, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=853, PETRI_TRANSITIONS=734} [2021-06-10 11:40:59,201 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 52 predicate places. [2021-06-10 11:40:59,201 INFO L480 AbstractCegarLoop]: Abstraction has has 853 places, 734 transitions, 1830 flow [2021-06-10 11:40:59,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:59,201 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:59,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1412 [2021-06-10 11:40:59,201 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash 422252575, now seen corresponding path program 1 times [2021-06-10 11:40:59,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:59,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799356828] [2021-06-10 11:40:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:59,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:59,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:40:59,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799356828] [2021-06-10 11:40:59,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:59,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:59,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422429691] [2021-06-10 11:40:59,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:59,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:59,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:59,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 734 transitions, 1830 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:59,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:59,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:59,532 INFO L129 PetriNetUnfolder]: 27/884 cut-off events. [2021-06-10 11:40:59,532 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:40:59,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 884 events. 27/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3882 event pairs, 0 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1110. Up to 31 conditions per place. [2021-06-10 11:40:59,577 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/732 dead transitions. [2021-06-10 11:40:59,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 732 transitions, 1843 flow [2021-06-10 11:40:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:40:59,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:40:59,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:40:59,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:40:59,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:59,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:40:59,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,581 INFO L185 Difference]: Start difference. First operand has 853 places, 734 transitions, 1830 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:40:59,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 732 transitions, 1843 flow [2021-06-10 11:40:59,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 852 places, 732 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:59,588 INFO L241 Difference]: Finished difference. Result has 852 places, 732 transitions, 1826 flow [2021-06-10 11:40:59,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=850, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1826, PETRI_PLACES=852, PETRI_TRANSITIONS=732} [2021-06-10 11:40:59,589 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 51 predicate places. [2021-06-10 11:40:59,589 INFO L480 AbstractCegarLoop]: Abstraction has has 852 places, 732 transitions, 1826 flow [2021-06-10 11:40:59,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:59,589 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:59,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1413 [2021-06-10 11:40:59,589 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1514737894, now seen corresponding path program 1 times [2021-06-10 11:40:59,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:59,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413164689] [2021-06-10 11:40:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:59,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:40:59,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:59,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413164689] [2021-06-10 11:40:59,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:59,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:59,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505965522] [2021-06-10 11:40:59,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:59,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:59,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:40:59,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 852 places, 732 transitions, 1826 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:59,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:40:59,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:40:59,919 INFO L129 PetriNetUnfolder]: 25/889 cut-off events. [2021-06-10 11:40:59,919 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:40:59,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 889 events. 25/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3934 event pairs, 0 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1113. Up to 31 conditions per place. [2021-06-10 11:40:59,964 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2021-06-10 11:40:59,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 733 transitions, 1842 flow [2021-06-10 11:40:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:40:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:40:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:40:59,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:40:59,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:40:59,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:40:59,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:40:59,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:40:59,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,968 INFO L185 Difference]: Start difference. First operand has 852 places, 732 transitions, 1826 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:40:59,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 854 places, 733 transitions, 1842 flow [2021-06-10 11:40:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 853 places, 733 transitions, 1841 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:40:59,975 INFO L241 Difference]: Finished difference. Result has 855 places, 733 transitions, 1839 flow [2021-06-10 11:40:59,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=855, PETRI_TRANSITIONS=733} [2021-06-10 11:40:59,975 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 54 predicate places. [2021-06-10 11:40:59,975 INFO L480 AbstractCegarLoop]: Abstraction has has 855 places, 733 transitions, 1839 flow [2021-06-10 11:40:59,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:40:59,976 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:40:59,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1414 [2021-06-10 11:40:59,976 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:40:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:40:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1514738917, now seen corresponding path program 1 times [2021-06-10 11:40:59,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:40:59,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560225052] [2021-06-10 11:40:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:40:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:40:59,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:40:59,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:40:59,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:40:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:40:59,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560225052] [2021-06-10 11:40:59,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:40:59,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:40:59,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623863772] [2021-06-10 11:40:59,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:40:59,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:40:59,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:40:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:40:59,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:40:59,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 855 places, 733 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:40:59,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:40:59,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:40:59,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:00,314 INFO L129 PetriNetUnfolder]: 25/890 cut-off events. [2021-06-10 11:41:00,315 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:00,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 890 events. 25/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3942 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1121. Up to 31 conditions per place. [2021-06-10 11:41:00,361 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/734 dead transitions. [2021-06-10 11:41:00,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 857 places, 734 transitions, 1865 flow [2021-06-10 11:41:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:41:00,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:41:00,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:41:00,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:41:00,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:00,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:41:00,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,365 INFO L185 Difference]: Start difference. First operand has 855 places, 733 transitions, 1839 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:41:00,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 857 places, 734 transitions, 1865 flow [2021-06-10 11:41:00,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 856 places, 734 transitions, 1863 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:00,372 INFO L241 Difference]: Finished difference. Result has 858 places, 734 transitions, 1855 flow [2021-06-10 11:41:00,372 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=854, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=858, PETRI_TRANSITIONS=734} [2021-06-10 11:41:00,372 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 57 predicate places. [2021-06-10 11:41:00,372 INFO L480 AbstractCegarLoop]: Abstraction has has 858 places, 734 transitions, 1855 flow [2021-06-10 11:41:00,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:00,373 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:00,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1415 [2021-06-10 11:41:00,373 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1513784582, now seen corresponding path program 1 times [2021-06-10 11:41:00,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:00,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187983988] [2021-06-10 11:41:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:00,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:00,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187983988] [2021-06-10 11:41:00,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:00,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:00,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125289482] [2021-06-10 11:41:00,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:00,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:00,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:00,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 734 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:00,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:00,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:00,712 INFO L129 PetriNetUnfolder]: 24/887 cut-off events. [2021-06-10 11:41:00,713 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:41:00,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 887 events. 24/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3924 event pairs, 0 based on Foata normal form. 2/835 useless extension candidates. Maximal degree in co-relation 1120. Up to 31 conditions per place. [2021-06-10 11:41:00,757 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/732 dead transitions. [2021-06-10 11:41:00,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 860 places, 732 transitions, 1863 flow [2021-06-10 11:41:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:41:00,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:41:00,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:41:00,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:41:00,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:00,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:41:00,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,761 INFO L185 Difference]: Start difference. First operand has 858 places, 734 transitions, 1855 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:41:00,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 860 places, 732 transitions, 1863 flow [2021-06-10 11:41:00,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 732 transitions, 1862 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:00,768 INFO L241 Difference]: Finished difference. Result has 859 places, 732 transitions, 1844 flow [2021-06-10 11:41:00,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1844, PETRI_PLACES=859, PETRI_TRANSITIONS=732} [2021-06-10 11:41:00,769 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 58 predicate places. [2021-06-10 11:41:00,769 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 732 transitions, 1844 flow [2021-06-10 11:41:00,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:00,769 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:00,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1416 [2021-06-10 11:41:00,769 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1513785605, now seen corresponding path program 1 times [2021-06-10 11:41:00,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:00,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297214746] [2021-06-10 11:41:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:00,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:00,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:00,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:00,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:00,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297214746] [2021-06-10 11:41:00,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:00,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:00,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574887586] [2021-06-10 11:41:00,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:00,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:00,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:00,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:00,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 732 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:00,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:00,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:00,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:01,103 INFO L129 PetriNetUnfolder]: 24/884 cut-off events. [2021-06-10 11:41:01,103 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:01,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 884 events. 24/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3902 event pairs, 0 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1114. Up to 31 conditions per place. [2021-06-10 11:41:01,135 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/729 dead transitions. [2021-06-10 11:41:01,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 729 transitions, 1845 flow [2021-06-10 11:41:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:41:01,137 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:41:01,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:41:01,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:41:01,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:01,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:41:01,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,139 INFO L185 Difference]: Start difference. First operand has 859 places, 732 transitions, 1844 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:41:01,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 729 transitions, 1845 flow [2021-06-10 11:41:01,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 856 places, 729 transitions, 1840 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:01,146 INFO L241 Difference]: Finished difference. Result has 856 places, 729 transitions, 1830 flow [2021-06-10 11:41:01,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=854, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=856, PETRI_TRANSITIONS=729} [2021-06-10 11:41:01,147 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 55 predicate places. [2021-06-10 11:41:01,147 INFO L480 AbstractCegarLoop]: Abstraction has has 856 places, 729 transitions, 1830 flow [2021-06-10 11:41:01,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:01,147 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:01,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1417 [2021-06-10 11:41:01,147 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:01,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1694368745, now seen corresponding path program 1 times [2021-06-10 11:41:01,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:01,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331316237] [2021-06-10 11:41:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:01,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:01,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:01,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331316237] [2021-06-10 11:41:01,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:01,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:01,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808863396] [2021-06-10 11:41:01,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:01,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:01,170 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:01,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 729 transitions, 1830 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:01,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:01,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:01,493 INFO L129 PetriNetUnfolder]: 22/889 cut-off events. [2021-06-10 11:41:01,493 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:01,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 889 events. 22/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3950 event pairs, 0 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1122. Up to 31 conditions per place. [2021-06-10 11:41:01,539 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2021-06-10 11:41:01,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 730 transitions, 1846 flow [2021-06-10 11:41:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:41:01,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:41:01,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:41:01,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:41:01,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:01,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:41:01,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,543 INFO L185 Difference]: Start difference. First operand has 856 places, 729 transitions, 1830 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:41:01,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 730 transitions, 1846 flow [2021-06-10 11:41:01,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 730 transitions, 1845 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:01,550 INFO L241 Difference]: Finished difference. Result has 859 places, 730 transitions, 1843 flow [2021-06-10 11:41:01,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=855, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1843, PETRI_PLACES=859, PETRI_TRANSITIONS=730} [2021-06-10 11:41:01,551 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 58 predicate places. [2021-06-10 11:41:01,551 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 730 transitions, 1843 flow [2021-06-10 11:41:01,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,551 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:01,551 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:01,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1418 [2021-06-10 11:41:01,551 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1694369768, now seen corresponding path program 1 times [2021-06-10 11:41:01,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:01,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429767325] [2021-06-10 11:41:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:01,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:01,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:01,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429767325] [2021-06-10 11:41:01,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:01,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:01,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91233812] [2021-06-10 11:41:01,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:01,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:01,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:01,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 730 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:01,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:01,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:01,895 INFO L129 PetriNetUnfolder]: 22/890 cut-off events. [2021-06-10 11:41:01,896 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:01,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 890 events. 22/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3957 event pairs, 0 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1128. Up to 31 conditions per place. [2021-06-10 11:41:01,942 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/731 dead transitions. [2021-06-10 11:41:01,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 731 transitions, 1869 flow [2021-06-10 11:41:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:41:01,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:41:01,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:41:01,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:41:01,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:01,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:41:01,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,946 INFO L185 Difference]: Start difference. First operand has 859 places, 730 transitions, 1843 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:41:01,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 731 transitions, 1869 flow [2021-06-10 11:41:01,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 860 places, 731 transitions, 1867 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:01,953 INFO L241 Difference]: Finished difference. Result has 862 places, 731 transitions, 1859 flow [2021-06-10 11:41:01,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=858, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=862, PETRI_TRANSITIONS=731} [2021-06-10 11:41:01,953 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 61 predicate places. [2021-06-10 11:41:01,953 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 731 transitions, 1859 flow [2021-06-10 11:41:01,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:01,954 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:01,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1419 [2021-06-10 11:41:01,954 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1693416456, now seen corresponding path program 1 times [2021-06-10 11:41:01,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:01,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199877322] [2021-06-10 11:41:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:01,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:01,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:01,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:01,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199877322] [2021-06-10 11:41:01,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:01,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:01,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15770704] [2021-06-10 11:41:01,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:01,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:01,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:01,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:01,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:01,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 731 transitions, 1859 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:01,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:01,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:01,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:02,291 INFO L129 PetriNetUnfolder]: 21/886 cut-off events. [2021-06-10 11:41:02,291 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:02,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 886 events. 21/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3932 event pairs, 0 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 1121. Up to 31 conditions per place. [2021-06-10 11:41:02,336 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/728 dead transitions. [2021-06-10 11:41:02,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 728 transitions, 1856 flow [2021-06-10 11:41:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:41:02,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:41:02,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:41:02,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:41:02,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:02,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:41:02,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,340 INFO L185 Difference]: Start difference. First operand has 862 places, 731 transitions, 1859 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:41:02,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 728 transitions, 1856 flow [2021-06-10 11:41:02,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 861 places, 728 transitions, 1848 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:02,348 INFO L241 Difference]: Finished difference. Result has 861 places, 728 transitions, 1838 flow [2021-06-10 11:41:02,348 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=859, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1838, PETRI_PLACES=861, PETRI_TRANSITIONS=728} [2021-06-10 11:41:02,348 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 60 predicate places. [2021-06-10 11:41:02,348 INFO L480 AbstractCegarLoop]: Abstraction has has 861 places, 728 transitions, 1838 flow [2021-06-10 11:41:02,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,348 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:02,348 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:02,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1420 [2021-06-10 11:41:02,348 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:02,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1693415433, now seen corresponding path program 1 times [2021-06-10 11:41:02,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:02,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513453414] [2021-06-10 11:41:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:02,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:02,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:02,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:02,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513453414] [2021-06-10 11:41:02,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:02,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:02,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036275710] [2021-06-10 11:41:02,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:02,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:02,370 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:02,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 728 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:02,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:02,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:02,688 INFO L129 PetriNetUnfolder]: 21/884 cut-off events. [2021-06-10 11:41:02,688 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:02,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 884 events. 21/884 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3919 event pairs, 0 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1124. Up to 31 conditions per place. [2021-06-10 11:41:02,733 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/726 dead transitions. [2021-06-10 11:41:02,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 726 transitions, 1851 flow [2021-06-10 11:41:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:41:02,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:41:02,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:41:02,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:41:02,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:02,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:41:02,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,737 INFO L185 Difference]: Start difference. First operand has 861 places, 728 transitions, 1838 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:41:02,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 726 transitions, 1851 flow [2021-06-10 11:41:02,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 860 places, 726 transitions, 1850 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:02,744 INFO L241 Difference]: Finished difference. Result has 860 places, 726 transitions, 1834 flow [2021-06-10 11:41:02,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=858, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1834, PETRI_PLACES=860, PETRI_TRANSITIONS=726} [2021-06-10 11:41:02,745 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 59 predicate places. [2021-06-10 11:41:02,745 INFO L480 AbstractCegarLoop]: Abstraction has has 860 places, 726 transitions, 1834 flow [2021-06-10 11:41:02,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:02,745 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:02,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1421 [2021-06-10 11:41:02,745 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1289639818, now seen corresponding path program 1 times [2021-06-10 11:41:02,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:02,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760683204] [2021-06-10 11:41:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:02,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:02,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:02,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:02,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:02,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760683204] [2021-06-10 11:41:02,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:02,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:02,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813158767] [2021-06-10 11:41:02,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:02,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:02,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:02,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 860 places, 726 transitions, 1834 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:02,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:02,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:02,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:03,085 INFO L129 PetriNetUnfolder]: 20/891 cut-off events. [2021-06-10 11:41:03,085 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:03,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 891 events. 20/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3979 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1129. Up to 31 conditions per place. [2021-06-10 11:41:03,116 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/727 dead transitions. [2021-06-10 11:41:03,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 727 transitions, 1850 flow [2021-06-10 11:41:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:41:03,117 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:41:03,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:41:03,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:41:03,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:03,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:41:03,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,120 INFO L185 Difference]: Start difference. First operand has 860 places, 726 transitions, 1834 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:41:03,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 727 transitions, 1850 flow [2021-06-10 11:41:03,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 861 places, 727 transitions, 1849 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:03,126 INFO L241 Difference]: Finished difference. Result has 862 places, 726 transitions, 1838 flow [2021-06-10 11:41:03,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=859, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1838, PETRI_PLACES=862, PETRI_TRANSITIONS=726} [2021-06-10 11:41:03,127 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 61 predicate places. [2021-06-10 11:41:03,127 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 726 transitions, 1838 flow [2021-06-10 11:41:03,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:03,127 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:03,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1422 [2021-06-10 11:41:03,127 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1289638795, now seen corresponding path program 1 times [2021-06-10 11:41:03,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:03,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353131614] [2021-06-10 11:41:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:03,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:03,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:03,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353131614] [2021-06-10 11:41:03,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:03,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:03,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096351153] [2021-06-10 11:41:03,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:03,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:03,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:03,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 726 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:03,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:03,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:03,498 INFO L129 PetriNetUnfolder]: 18/893 cut-off events. [2021-06-10 11:41:03,498 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:03,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 893 events. 18/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4015 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1140. Up to 31 conditions per place. [2021-06-10 11:41:03,546 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/727 dead transitions. [2021-06-10 11:41:03,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 727 transitions, 1864 flow [2021-06-10 11:41:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:41:03,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:41:03,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:41:03,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:41:03,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:03,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:41:03,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,550 INFO L185 Difference]: Start difference. First operand has 862 places, 726 transitions, 1838 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:41:03,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 727 transitions, 1864 flow [2021-06-10 11:41:03,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 863 places, 727 transitions, 1863 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:03,558 INFO L241 Difference]: Finished difference. Result has 865 places, 727 transitions, 1855 flow [2021-06-10 11:41:03,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=861, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=865, PETRI_TRANSITIONS=727} [2021-06-10 11:41:03,558 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 64 predicate places. [2021-06-10 11:41:03,558 INFO L480 AbstractCegarLoop]: Abstraction has has 865 places, 727 transitions, 1855 flow [2021-06-10 11:41:03,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:03,559 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:03,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1423 [2021-06-10 11:41:03,559 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1290592107, now seen corresponding path program 1 times [2021-06-10 11:41:03,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:03,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424358416] [2021-06-10 11:41:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:03,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:03,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:03,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424358416] [2021-06-10 11:41:03,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:03,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:03,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811794579] [2021-06-10 11:41:03,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:03,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:03,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:03,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 865 places, 727 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:03,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:03,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:03,911 INFO L129 PetriNetUnfolder]: 18/886 cut-off events. [2021-06-10 11:41:03,911 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:03,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 886 events. 18/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3952 event pairs, 0 based on Foata normal form. 1/840 useless extension candidates. Maximal degree in co-relation 1126. Up to 31 conditions per place. [2021-06-10 11:41:03,956 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/725 dead transitions. [2021-06-10 11:41:03,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 725 transitions, 1857 flow [2021-06-10 11:41:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:41:03,958 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:41:03,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:41:03,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:41:03,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:03,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:41:03,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,960 INFO L185 Difference]: Start difference. First operand has 865 places, 727 transitions, 1855 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:41:03,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 725 transitions, 1857 flow [2021-06-10 11:41:03,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 864 places, 725 transitions, 1849 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:03,968 INFO L241 Difference]: Finished difference. Result has 865 places, 725 transitions, 1842 flow [2021-06-10 11:41:03,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=862, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1842, PETRI_PLACES=865, PETRI_TRANSITIONS=725} [2021-06-10 11:41:03,968 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 64 predicate places. [2021-06-10 11:41:03,968 INFO L480 AbstractCegarLoop]: Abstraction has has 865 places, 725 transitions, 1842 flow [2021-06-10 11:41:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:03,968 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:03,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1424 [2021-06-10 11:41:03,968 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1290593130, now seen corresponding path program 1 times [2021-06-10 11:41:03,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:03,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906847348] [2021-06-10 11:41:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:03,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:03,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:03,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:03,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906847348] [2021-06-10 11:41:03,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:03,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:03,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730501274] [2021-06-10 11:41:03,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:03,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:03,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:03,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:03,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 865 places, 725 transitions, 1842 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:03,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:03,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:03,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:04,312 INFO L129 PetriNetUnfolder]: 18/884 cut-off events. [2021-06-10 11:41:04,312 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:04,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 884 events. 18/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3934 event pairs, 0 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 1130. Up to 31 conditions per place. [2021-06-10 11:41:04,358 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2021-06-10 11:41:04,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 865 places, 723 transitions, 1855 flow [2021-06-10 11:41:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:41:04,359 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:41:04,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:41:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:41:04,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:04,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:41:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,362 INFO L185 Difference]: Start difference. First operand has 865 places, 725 transitions, 1842 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:41:04,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 865 places, 723 transitions, 1855 flow [2021-06-10 11:41:04,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 864 places, 723 transitions, 1854 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:04,370 INFO L241 Difference]: Finished difference. Result has 864 places, 723 transitions, 1838 flow [2021-06-10 11:41:04,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=862, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1838, PETRI_PLACES=864, PETRI_TRANSITIONS=723} [2021-06-10 11:41:04,370 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 63 predicate places. [2021-06-10 11:41:04,370 INFO L480 AbstractCegarLoop]: Abstraction has has 864 places, 723 transitions, 1838 flow [2021-06-10 11:41:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:04,370 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:04,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1425 [2021-06-10 11:41:04,370 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash 918509332, now seen corresponding path program 1 times [2021-06-10 11:41:04,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:04,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893389369] [2021-06-10 11:41:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:04,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:04,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:04,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:04,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893389369] [2021-06-10 11:41:04,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:04,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:04,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261563794] [2021-06-10 11:41:04,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:04,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:04,396 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:04,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 864 places, 723 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:04,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:04,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:04,721 INFO L129 PetriNetUnfolder]: 16/889 cut-off events. [2021-06-10 11:41:04,721 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:04,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 889 events. 16/889 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3985 event pairs, 0 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 1133. Up to 31 conditions per place. [2021-06-10 11:41:04,768 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 5 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2021-06-10 11:41:04,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 724 transitions, 1854 flow [2021-06-10 11:41:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:41:04,770 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:41:04,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:41:04,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:41:04,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:04,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:41:04,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,772 INFO L185 Difference]: Start difference. First operand has 864 places, 723 transitions, 1838 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:41:04,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 866 places, 724 transitions, 1854 flow [2021-06-10 11:41:04,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 865 places, 724 transitions, 1853 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:04,780 INFO L241 Difference]: Finished difference. Result has 867 places, 724 transitions, 1851 flow [2021-06-10 11:41:04,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=863, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=867, PETRI_TRANSITIONS=724} [2021-06-10 11:41:04,780 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 66 predicate places. [2021-06-10 11:41:04,780 INFO L480 AbstractCegarLoop]: Abstraction has has 867 places, 724 transitions, 1851 flow [2021-06-10 11:41:04,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:04,780 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:04,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1426 [2021-06-10 11:41:04,780 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash 918508309, now seen corresponding path program 1 times [2021-06-10 11:41:04,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:04,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730957511] [2021-06-10 11:41:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:04,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:04,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:04,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:04,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:04,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730957511] [2021-06-10 11:41:04,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:04,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:04,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424402177] [2021-06-10 11:41:04,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:04,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:04,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:04,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 867 places, 724 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:04,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:04,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:04,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:05,133 INFO L129 PetriNetUnfolder]: 16/890 cut-off events. [2021-06-10 11:41:05,133 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:05,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 890 events. 16/890 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3991 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1141. Up to 31 conditions per place. [2021-06-10 11:41:05,165 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/725 dead transitions. [2021-06-10 11:41:05,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 725 transitions, 1877 flow [2021-06-10 11:41:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:41:05,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:41:05,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:41:05,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:41:05,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:05,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:41:05,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,169 INFO L185 Difference]: Start difference. First operand has 867 places, 724 transitions, 1851 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:41:05,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 725 transitions, 1877 flow [2021-06-10 11:41:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 725 transitions, 1875 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:05,176 INFO L241 Difference]: Finished difference. Result has 870 places, 725 transitions, 1867 flow [2021-06-10 11:41:05,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=866, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=870, PETRI_TRANSITIONS=725} [2021-06-10 11:41:05,176 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 69 predicate places. [2021-06-10 11:41:05,177 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 725 transitions, 1867 flow [2021-06-10 11:41:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:05,177 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:05,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1427 [2021-06-10 11:41:05,177 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash 919462644, now seen corresponding path program 1 times [2021-06-10 11:41:05,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:05,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333393853] [2021-06-10 11:41:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:05,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:05,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:05,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:05,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333393853] [2021-06-10 11:41:05,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:05,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:05,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998713842] [2021-06-10 11:41:05,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:05,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:05,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:05,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:05,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 725 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:05,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:05,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:05,538 INFO L129 PetriNetUnfolder]: 15/887 cut-off events. [2021-06-10 11:41:05,538 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:41:05,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 887 events. 15/887 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3977 event pairs, 0 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 1140. Up to 31 conditions per place. [2021-06-10 11:41:05,585 INFO L132 encePairwiseOnDemand]: 858/861 looper letters, 9 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2021-06-10 11:41:05,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 723 transitions, 1875 flow [2021-06-10 11:41:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2021-06-10 11:41:05,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9198606271777003 [2021-06-10 11:41:05,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2376 transitions. [2021-06-10 11:41:05,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2376 transitions. [2021-06-10 11:41:05,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:05,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2376 transitions. [2021-06-10 11:41:05,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.0) internal successors, (2376), 3 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,589 INFO L185 Difference]: Start difference. First operand has 870 places, 725 transitions, 1867 flow. Second operand 3 states and 2376 transitions. [2021-06-10 11:41:05,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 872 places, 723 transitions, 1875 flow [2021-06-10 11:41:05,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 723 transitions, 1874 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:05,596 INFO L241 Difference]: Finished difference. Result has 871 places, 723 transitions, 1856 flow [2021-06-10 11:41:05,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1856, PETRI_PLACES=871, PETRI_TRANSITIONS=723} [2021-06-10 11:41:05,596 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 70 predicate places. [2021-06-10 11:41:05,596 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 723 transitions, 1856 flow [2021-06-10 11:41:05,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:05,597 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:05,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1428 [2021-06-10 11:41:05,597 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 919461621, now seen corresponding path program 1 times [2021-06-10 11:41:05,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:05,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253546483] [2021-06-10 11:41:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:05,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:05,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:05,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:05,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:05,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253546483] [2021-06-10 11:41:05,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:05,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:05,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382111899] [2021-06-10 11:41:05,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:05,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:05,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:05,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 723 transitions, 1856 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:05,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:05,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:05,947 INFO L129 PetriNetUnfolder]: 15/884 cut-off events. [2021-06-10 11:41:05,947 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:05,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 884 events. 15/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3954 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1134. Up to 31 conditions per place. [2021-06-10 11:41:05,993 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/720 dead transitions. [2021-06-10 11:41:05,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 720 transitions, 1857 flow [2021-06-10 11:41:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:41:05,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:41:05,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:41:05,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:41:05,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:05,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:41:05,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:05,997 INFO L185 Difference]: Start difference. First operand has 871 places, 723 transitions, 1856 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:41:05,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 720 transitions, 1857 flow [2021-06-10 11:41:06,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 720 transitions, 1852 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:06,005 INFO L241 Difference]: Finished difference. Result has 868 places, 720 transitions, 1842 flow [2021-06-10 11:41:06,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=866, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1842, PETRI_PLACES=868, PETRI_TRANSITIONS=720} [2021-06-10 11:41:06,005 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 67 predicate places. [2021-06-10 11:41:06,005 INFO L480 AbstractCegarLoop]: Abstraction has has 868 places, 720 transitions, 1842 flow [2021-06-10 11:41:06,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:06,006 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:06,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1429 [2021-06-10 11:41:06,006 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash 772988917, now seen corresponding path program 1 times [2021-06-10 11:41:06,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:06,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863518646] [2021-06-10 11:41:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:06,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:06,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:06,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863518646] [2021-06-10 11:41:06,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:06,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:06,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025546065] [2021-06-10 11:41:06,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:06,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:06,029 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:06,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 868 places, 720 transitions, 1842 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:06,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:06,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:06,369 INFO L129 PetriNetUnfolder]: 14/891 cut-off events. [2021-06-10 11:41:06,369 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:06,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 891 events. 14/891 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4015 event pairs, 0 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1144. Up to 31 conditions per place. [2021-06-10 11:41:06,415 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 6 selfloop transitions, 1 changer transitions 0/721 dead transitions. [2021-06-10 11:41:06,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 721 transitions, 1858 flow [2021-06-10 11:41:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions. [2021-06-10 11:41:06,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2021-06-10 11:41:06,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2387 transitions. [2021-06-10 11:41:06,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2387 transitions. [2021-06-10 11:41:06,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:06,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2387 transitions. [2021-06-10 11:41:06,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.6666666666666) internal successors, (2387), 3 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,419 INFO L185 Difference]: Start difference. First operand has 868 places, 720 transitions, 1842 flow. Second operand 3 states and 2387 transitions. [2021-06-10 11:41:06,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 721 transitions, 1858 flow [2021-06-10 11:41:06,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 869 places, 721 transitions, 1857 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:06,426 INFO L241 Difference]: Finished difference. Result has 870 places, 720 transitions, 1846 flow [2021-06-10 11:41:06,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1846, PETRI_PLACES=870, PETRI_TRANSITIONS=720} [2021-06-10 11:41:06,426 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 69 predicate places. [2021-06-10 11:41:06,426 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 720 transitions, 1846 flow [2021-06-10 11:41:06,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:06,427 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:06,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1430 [2021-06-10 11:41:06,427 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 772989940, now seen corresponding path program 1 times [2021-06-10 11:41:06,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:06,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799842830] [2021-06-10 11:41:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:06,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:06,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:06,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799842830] [2021-06-10 11:41:06,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:06,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:06,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353970439] [2021-06-10 11:41:06,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:06,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:06,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:06,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:06,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 720 transitions, 1846 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:06,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:06,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:06,792 INFO L129 PetriNetUnfolder]: 12/893 cut-off events. [2021-06-10 11:41:06,793 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:06,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 893 events. 12/893 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4049 event pairs, 0 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1153. Up to 31 conditions per place. [2021-06-10 11:41:06,838 INFO L132 encePairwiseOnDemand]: 857/861 looper letters, 9 selfloop transitions, 3 changer transitions 0/721 dead transitions. [2021-06-10 11:41:06,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 721 transitions, 1872 flow [2021-06-10 11:41:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2377 transitions. [2021-06-10 11:41:06,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202477739063105 [2021-06-10 11:41:06,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2377 transitions. [2021-06-10 11:41:06,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2377 transitions. [2021-06-10 11:41:06,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:06,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2377 transitions. [2021-06-10 11:41:06,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 792.3333333333334) internal successors, (2377), 3 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,842 INFO L185 Difference]: Start difference. First operand has 870 places, 720 transitions, 1846 flow. Second operand 3 states and 2377 transitions. [2021-06-10 11:41:06,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 872 places, 721 transitions, 1872 flow [2021-06-10 11:41:06,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 721 transitions, 1871 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:06,850 INFO L241 Difference]: Finished difference. Result has 873 places, 721 transitions, 1863 flow [2021-06-10 11:41:06,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1863, PETRI_PLACES=873, PETRI_TRANSITIONS=721} [2021-06-10 11:41:06,850 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 72 predicate places. [2021-06-10 11:41:06,850 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 721 transitions, 1863 flow [2021-06-10 11:41:06,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:06,850 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:06,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1431 [2021-06-10 11:41:06,851 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 772036628, now seen corresponding path program 1 times [2021-06-10 11:41:06,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:06,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714819389] [2021-06-10 11:41:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:06,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:06,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:06,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:06,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714819389] [2021-06-10 11:41:06,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:06,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:06,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929017124] [2021-06-10 11:41:06,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:06,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:06,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:06,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 861 [2021-06-10 11:41:06,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 721 transitions, 1863 flow. Second operand has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:06,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:06,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 861 [2021-06-10 11:41:06,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:07,194 INFO L129 PetriNetUnfolder]: 12/886 cut-off events. [2021-06-10 11:41:07,194 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:07,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 886 events. 12/886 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3988 event pairs, 0 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 1139. Up to 31 conditions per place. [2021-06-10 11:41:07,229 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 5 selfloop transitions, 1 changer transitions 0/719 dead transitions. [2021-06-10 11:41:07,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 719 transitions, 1865 flow [2021-06-10 11:41:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2386 transitions. [2021-06-10 11:41:07,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9237320944638018 [2021-06-10 11:41:07,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2386 transitions. [2021-06-10 11:41:07,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2386 transitions. [2021-06-10 11:41:07,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:07,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2386 transitions. [2021-06-10 11:41:07,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 795.3333333333334) internal successors, (2386), 3 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,233 INFO L185 Difference]: Start difference. First operand has 873 places, 721 transitions, 1863 flow. Second operand 3 states and 2386 transitions. [2021-06-10 11:41:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 719 transitions, 1865 flow [2021-06-10 11:41:07,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 872 places, 719 transitions, 1857 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:07,240 INFO L241 Difference]: Finished difference. Result has 873 places, 719 transitions, 1850 flow [2021-06-10 11:41:07,240 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=870, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1850, PETRI_PLACES=873, PETRI_TRANSITIONS=719} [2021-06-10 11:41:07,240 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 72 predicate places. [2021-06-10 11:41:07,240 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 719 transitions, 1850 flow [2021-06-10 11:41:07,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 794.3333333333334) internal successors, (2383), 3 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:07,241 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:07,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1432 [2021-06-10 11:41:07,241 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash 772035605, now seen corresponding path program 1 times [2021-06-10 11:41:07,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:07,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381555667] [2021-06-10 11:41:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:07,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:07,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:07,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:07,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:07,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:07,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:07,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381555667] [2021-06-10 11:41:07,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:07,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:07,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185095654] [2021-06-10 11:41:07,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:07,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:07,264 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 861 [2021-06-10 11:41:07,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 719 transitions, 1850 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:07,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 861 [2021-06-10 11:41:07,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:07,593 INFO L129 PetriNetUnfolder]: 12/884 cut-off events. [2021-06-10 11:41:07,593 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:07,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 884 events. 12/884 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3974 event pairs, 0 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 1143. Up to 31 conditions per place. [2021-06-10 11:41:07,638 INFO L132 encePairwiseOnDemand]: 859/861 looper letters, 8 selfloop transitions, 1 changer transitions 0/717 dead transitions. [2021-06-10 11:41:07,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 717 transitions, 1863 flow [2021-06-10 11:41:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2374 transitions. [2021-06-10 11:41:07,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9190863337204801 [2021-06-10 11:41:07,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2374 transitions. [2021-06-10 11:41:07,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2374 transitions. [2021-06-10 11:41:07,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:07,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2374 transitions. [2021-06-10 11:41:07,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 861.0) internal successors, (3444), 4 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,642 INFO L185 Difference]: Start difference. First operand has 873 places, 719 transitions, 1850 flow. Second operand 3 states and 2374 transitions. [2021-06-10 11:41:07,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 717 transitions, 1863 flow [2021-06-10 11:41:07,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 872 places, 717 transitions, 1862 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:07,649 INFO L241 Difference]: Finished difference. Result has 872 places, 717 transitions, 1846 flow [2021-06-10 11:41:07,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=861, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=870, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1846, PETRI_PLACES=872, PETRI_TRANSITIONS=717} [2021-06-10 11:41:07,650 INFO L343 CegarLoopForPetriNet]: 801 programPoint places, 71 predicate places. [2021-06-10 11:41:07,650 INFO L480 AbstractCegarLoop]: Abstraction has has 872 places, 717 transitions, 1846 flow [2021-06-10 11:41:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:07,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:07,650 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:07,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1433 [2021-06-10 11:41:07,650 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 917919929, now seen corresponding path program 1 times [2021-06-10 11:41:07,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:07,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718442334] [2021-06-10 11:41:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:41:07,665 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:41:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:41:07,670 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:41:07,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:41:07,686 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:41:07,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1434 [2021-06-10 11:41:07,686 WARN L342 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:41:07,686 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2021-06-10 11:41:07,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,841 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of31ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of31ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:07,842 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:41:07,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2021-06-10 11:41:07,843 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:41:07,843 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:41:07,843 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:41:07,843 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:41:07,843 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:41:07,843 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:41:07,843 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:41:07,843 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:41:07,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 827 places, 889 transitions, 2863 flow [2021-06-10 11:41:08,206 INFO L129 PetriNetUnfolder]: 156/1167 cut-off events. [2021-06-10 11:41:08,206 INFO L130 PetriNetUnfolder]: For 5425/5425 co-relation queries the response was YES. [2021-06-10 11:41:08,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1167 events. 156/1167 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4993 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1676. Up to 64 conditions per place. [2021-06-10 11:41:08,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 827 places, 889 transitions, 2863 flow [2021-06-10 11:41:08,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 827 places, 889 transitions, 2863 flow [2021-06-10 11:41:08,307 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:41:08,308 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:41:08,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:08,308 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-06-10 11:41:08,308 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 714788635, now seen corresponding path program 1 times [2021-06-10 11:41:08,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:08,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605104116] [2021-06-10 11:41:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:08,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:08,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:08,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:08,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605104116] [2021-06-10 11:41:08,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:08,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:08,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641759569] [2021-06-10 11:41:08,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:08,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:08,326 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:08,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 889 transitions, 2863 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:08,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:08,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:08,627 INFO L129 PetriNetUnfolder]: 92/921 cut-off events. [2021-06-10 11:41:08,627 INFO L130 PetriNetUnfolder]: For 5426/5426 co-relation queries the response was YES. [2021-06-10 11:41:08,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 921 events. 92/921 cut-off events. For 5426/5426 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3702 event pairs, 0 based on Foata normal form. 132/928 useless extension candidates. Maximal degree in co-relation 1443. Up to 32 conditions per place. [2021-06-10 11:41:08,692 INFO L132 encePairwiseOnDemand]: 851/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/823 dead transitions. [2021-06-10 11:41:08,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 823 transitions, 2757 flow [2021-06-10 11:41:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2523 transitions. [2021-06-10 11:41:08,694 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9460067491563554 [2021-06-10 11:41:08,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2523 transitions. [2021-06-10 11:41:08,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2523 transitions. [2021-06-10 11:41:08,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:08,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2523 transitions. [2021-06-10 11:41:08,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 841.0) internal successors, (2523), 3 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,697 INFO L185 Difference]: Start difference. First operand has 827 places, 889 transitions, 2863 flow. Second operand 3 states and 2523 transitions. [2021-06-10 11:41:08,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 793 places, 823 transitions, 2757 flow [2021-06-10 11:41:08,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 823 transitions, 1827 flow, removed 465 selfloop flow, removed 0 redundant places. [2021-06-10 11:41:08,707 INFO L241 Difference]: Finished difference. Result has 795 places, 823 transitions, 1821 flow [2021-06-10 11:41:08,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=791, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1821, PETRI_PLACES=795, PETRI_TRANSITIONS=823} [2021-06-10 11:41:08,708 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -32 predicate places. [2021-06-10 11:41:08,708 INFO L480 AbstractCegarLoop]: Abstraction has has 795 places, 823 transitions, 1821 flow [2021-06-10 11:41:08,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:08,708 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-06-10 11:41:08,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1435 [2021-06-10 11:41:08,708 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash 713834300, now seen corresponding path program 1 times [2021-06-10 11:41:08,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:08,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988049639] [2021-06-10 11:41:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:08,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:08,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:08,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:08,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:08,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988049639] [2021-06-10 11:41:08,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:08,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:08,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743176208] [2021-06-10 11:41:08,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:08,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:08,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:08,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 823 transitions, 1821 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:08,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:08,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:08,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:08,995 INFO L129 PetriNetUnfolder]: 90/919 cut-off events. [2021-06-10 11:41:08,995 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:41:09,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 919 events. 90/919 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3697 event pairs, 0 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 1012. Up to 32 conditions per place. [2021-06-10 11:41:09,053 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 10 selfloop transitions, 1 changer transitions 0/821 dead transitions. [2021-06-10 11:41:09,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 821 transitions, 1831 flow [2021-06-10 11:41:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:09,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:09,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:09,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:09,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:09,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:09,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,057 INFO L185 Difference]: Start difference. First operand has 795 places, 823 transitions, 1821 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:09,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 821 transitions, 1831 flow [2021-06-10 11:41:09,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 821 transitions, 1830 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:09,065 INFO L241 Difference]: Finished difference. Result has 796 places, 821 transitions, 1810 flow [2021-06-10 11:41:09,065 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=796, PETRI_TRANSITIONS=821} [2021-06-10 11:41:09,065 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -31 predicate places. [2021-06-10 11:41:09,065 INFO L480 AbstractCegarLoop]: Abstraction has has 796 places, 821 transitions, 1810 flow [2021-06-10 11:41:09,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:09,065 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-06-10 11:41:09,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1436 [2021-06-10 11:41:09,065 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 713835323, now seen corresponding path program 1 times [2021-06-10 11:41:09,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:09,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70994370] [2021-06-10 11:41:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:09,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:09,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:09,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70994370] [2021-06-10 11:41:09,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:09,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:09,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995160074] [2021-06-10 11:41:09,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:09,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:09,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:09,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:09,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 796 places, 821 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:09,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:09,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:09,339 INFO L129 PetriNetUnfolder]: 90/916 cut-off events. [2021-06-10 11:41:09,339 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-10 11:41:09,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 916 events. 90/916 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3673 event pairs, 0 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1011. Up to 32 conditions per place. [2021-06-10 11:41:09,389 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/821 dead transitions. [2021-06-10 11:41:09,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 821 transitions, 1822 flow [2021-06-10 11:41:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:09,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:09,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:09,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:09,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:09,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:09,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,393 INFO L185 Difference]: Start difference. First operand has 796 places, 821 transitions, 1810 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:09,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 821 transitions, 1822 flow [2021-06-10 11:41:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 821 transitions, 1819 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:09,400 INFO L241 Difference]: Finished difference. Result has 799 places, 821 transitions, 1817 flow [2021-06-10 11:41:09,400 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=795, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=820, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1817, PETRI_PLACES=799, PETRI_TRANSITIONS=821} [2021-06-10 11:41:09,400 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -28 predicate places. [2021-06-10 11:41:09,400 INFO L480 AbstractCegarLoop]: Abstraction has has 799 places, 821 transitions, 1817 flow [2021-06-10 11:41:09,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:09,401 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-06-10 11:41:09,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1437 [2021-06-10 11:41:09,401 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 714787612, now seen corresponding path program 1 times [2021-06-10 11:41:09,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:09,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189858017] [2021-06-10 11:41:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:09,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:09,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:09,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189858017] [2021-06-10 11:41:09,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:09,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:09,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288373428] [2021-06-10 11:41:09,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:09,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:09,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:09,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 799 places, 821 transitions, 1817 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:09,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:09,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:09,669 INFO L129 PetriNetUnfolder]: 90/913 cut-off events. [2021-06-10 11:41:09,669 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:09,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 913 events. 90/913 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3654 event pairs, 0 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 1008. Up to 32 conditions per place. [2021-06-10 11:41:09,725 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/818 dead transitions. [2021-06-10 11:41:09,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 818 transitions, 1817 flow [2021-06-10 11:41:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:09,726 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:09,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:09,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:09,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:09,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:09,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,729 INFO L185 Difference]: Start difference. First operand has 799 places, 821 transitions, 1817 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 818 transitions, 1817 flow [2021-06-10 11:41:09,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 818 transitions, 1813 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:41:09,736 INFO L241 Difference]: Finished difference. Result has 797 places, 818 transitions, 1803 flow [2021-06-10 11:41:09,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=795, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1803, PETRI_PLACES=797, PETRI_TRANSITIONS=818} [2021-06-10 11:41:09,736 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -30 predicate places. [2021-06-10 11:41:09,736 INFO L480 AbstractCegarLoop]: Abstraction has has 797 places, 818 transitions, 1803 flow [2021-06-10 11:41:09,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:09,737 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:09,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1438 [2021-06-10 11:41:09,737 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1162562850, now seen corresponding path program 1 times [2021-06-10 11:41:09,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:09,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759811055] [2021-06-10 11:41:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:09,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:09,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:09,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:09,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759811055] [2021-06-10 11:41:09,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:09,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:09,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897642696] [2021-06-10 11:41:09,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:09,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:09,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:09,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 818 transitions, 1803 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:09,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:09,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:09,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:10,023 INFO L129 PetriNetUnfolder]: 89/921 cut-off events. [2021-06-10 11:41:10,024 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:10,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 921 events. 89/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3725 event pairs, 0 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 1027. Up to 32 conditions per place. [2021-06-10 11:41:10,080 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/820 dead transitions. [2021-06-10 11:41:10,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 820 transitions, 1833 flow [2021-06-10 11:41:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:10,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:10,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:10,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:10,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:10,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:10,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,084 INFO L185 Difference]: Start difference. First operand has 797 places, 818 transitions, 1803 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:10,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 820 transitions, 1833 flow [2021-06-10 11:41:10,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 820 transitions, 1832 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:10,091 INFO L241 Difference]: Finished difference. Result has 800 places, 820 transitions, 1826 flow [2021-06-10 11:41:10,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=796, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1826, PETRI_PLACES=800, PETRI_TRANSITIONS=820} [2021-06-10 11:41:10,092 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -27 predicate places. [2021-06-10 11:41:10,092 INFO L480 AbstractCegarLoop]: Abstraction has has 800 places, 820 transitions, 1826 flow [2021-06-10 11:41:10,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:10,092 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:10,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1439 [2021-06-10 11:41:10,092 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1162563873, now seen corresponding path program 1 times [2021-06-10 11:41:10,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:10,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802318778] [2021-06-10 11:41:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:10,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:10,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:10,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802318778] [2021-06-10 11:41:10,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:10,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:10,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496358177] [2021-06-10 11:41:10,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:10,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:10,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:10,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 800 places, 820 transitions, 1826 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:10,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:10,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:10,376 INFO L129 PetriNetUnfolder]: 87/922 cut-off events. [2021-06-10 11:41:10,376 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:10,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 922 events. 87/922 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3747 event pairs, 0 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 1024. Up to 32 conditions per place. [2021-06-10 11:41:10,432 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/820 dead transitions. [2021-06-10 11:41:10,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 820 transitions, 1838 flow [2021-06-10 11:41:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:10,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:10,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:10,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:10,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:10,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:10,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,437 INFO L185 Difference]: Start difference. First operand has 800 places, 820 transitions, 1826 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:10,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 820 transitions, 1838 flow [2021-06-10 11:41:10,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 820 transitions, 1833 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:10,444 INFO L241 Difference]: Finished difference. Result has 802 places, 819 transitions, 1822 flow [2021-06-10 11:41:10,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1822, PETRI_PLACES=802, PETRI_TRANSITIONS=819} [2021-06-10 11:41:10,444 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -25 predicate places. [2021-06-10 11:41:10,444 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 819 transitions, 1822 flow [2021-06-10 11:41:10,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:10,444 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:10,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1440 [2021-06-10 11:41:10,444 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:10,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:10,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1163516162, now seen corresponding path program 1 times [2021-06-10 11:41:10,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:10,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120289866] [2021-06-10 11:41:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:10,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:10,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:10,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120289866] [2021-06-10 11:41:10,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:10,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:10,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115929843] [2021-06-10 11:41:10,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:10,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:10,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:10,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 819 transitions, 1822 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:10,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:10,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:10,720 INFO L129 PetriNetUnfolder]: 87/915 cut-off events. [2021-06-10 11:41:10,721 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:10,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 915 events. 87/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3688 event pairs, 0 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 1019. Up to 32 conditions per place. [2021-06-10 11:41:10,776 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2021-06-10 11:41:10,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 817 transitions, 1825 flow [2021-06-10 11:41:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:10,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:10,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:10,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:10,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:10,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:10,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,781 INFO L185 Difference]: Start difference. First operand has 802 places, 819 transitions, 1822 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:10,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 817 transitions, 1825 flow [2021-06-10 11:41:10,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 817 transitions, 1818 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:10,788 INFO L241 Difference]: Finished difference. Result has 802 places, 817 transitions, 1811 flow [2021-06-10 11:41:10,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1811, PETRI_PLACES=802, PETRI_TRANSITIONS=817} [2021-06-10 11:41:10,788 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -25 predicate places. [2021-06-10 11:41:10,788 INFO L480 AbstractCegarLoop]: Abstraction has has 802 places, 817 transitions, 1811 flow [2021-06-10 11:41:10,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:10,789 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:10,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1441 [2021-06-10 11:41:10,789 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1163517185, now seen corresponding path program 1 times [2021-06-10 11:41:10,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:10,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316386500] [2021-06-10 11:41:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:10,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:10,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:10,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:10,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316386500] [2021-06-10 11:41:10,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:10,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:10,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706440953] [2021-06-10 11:41:10,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:10,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:10,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:10,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 817 transitions, 1811 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:10,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:10,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:10,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:11,067 INFO L129 PetriNetUnfolder]: 87/913 cut-off events. [2021-06-10 11:41:11,067 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:11,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 913 events. 87/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3673 event pairs, 0 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1019. Up to 32 conditions per place. [2021-06-10 11:41:11,124 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/815 dead transitions. [2021-06-10 11:41:11,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 815 transitions, 1824 flow [2021-06-10 11:41:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:11,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:11,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:11,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:11,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:11,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:11,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,128 INFO L185 Difference]: Start difference. First operand has 802 places, 817 transitions, 1811 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:11,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 802 places, 815 transitions, 1824 flow [2021-06-10 11:41:11,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 801 places, 815 transitions, 1823 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:11,135 INFO L241 Difference]: Finished difference. Result has 801 places, 815 transitions, 1807 flow [2021-06-10 11:41:11,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1807, PETRI_PLACES=801, PETRI_TRANSITIONS=815} [2021-06-10 11:41:11,135 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -26 predicate places. [2021-06-10 11:41:11,135 INFO L480 AbstractCegarLoop]: Abstraction has has 801 places, 815 transitions, 1807 flow [2021-06-10 11:41:11,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,136 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:11,136 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:11,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1442 [2021-06-10 11:41:11,136 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash -171905758, now seen corresponding path program 1 times [2021-06-10 11:41:11,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:11,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401776778] [2021-06-10 11:41:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:11,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:11,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:11,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401776778] [2021-06-10 11:41:11,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:11,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:11,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358565296] [2021-06-10 11:41:11,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:11,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:11,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:11,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:11,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:11,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 815 transitions, 1807 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:11,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:11,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:11,437 INFO L129 PetriNetUnfolder]: 86/921 cut-off events. [2021-06-10 11:41:11,437 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:11,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 921 events. 86/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3743 event pairs, 0 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1031. Up to 32 conditions per place. [2021-06-10 11:41:11,494 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/817 dead transitions. [2021-06-10 11:41:11,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 817 transitions, 1837 flow [2021-06-10 11:41:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:11,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:11,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:11,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:11,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:11,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:11,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,498 INFO L185 Difference]: Start difference. First operand has 801 places, 815 transitions, 1807 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:11,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 817 transitions, 1837 flow [2021-06-10 11:41:11,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 802 places, 817 transitions, 1836 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:11,505 INFO L241 Difference]: Finished difference. Result has 804 places, 817 transitions, 1830 flow [2021-06-10 11:41:11,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=804, PETRI_TRANSITIONS=817} [2021-06-10 11:41:11,505 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -23 predicate places. [2021-06-10 11:41:11,505 INFO L480 AbstractCegarLoop]: Abstraction has has 804 places, 817 transitions, 1830 flow [2021-06-10 11:41:11,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:11,505 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:11,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1443 [2021-06-10 11:41:11,506 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash -171906781, now seen corresponding path program 1 times [2021-06-10 11:41:11,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:11,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431675408] [2021-06-10 11:41:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:11,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:11,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:11,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431675408] [2021-06-10 11:41:11,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:11,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:11,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106805693] [2021-06-10 11:41:11,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:11,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:11,523 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:11,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 817 transitions, 1830 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:11,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:11,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:11,791 INFO L129 PetriNetUnfolder]: 84/922 cut-off events. [2021-06-10 11:41:11,791 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:11,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 922 events. 84/922 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3764 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1031. Up to 32 conditions per place. [2021-06-10 11:41:11,847 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2021-06-10 11:41:11,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 817 transitions, 1842 flow [2021-06-10 11:41:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:11,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:11,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:11,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:11,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:11,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:11,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,851 INFO L185 Difference]: Start difference. First operand has 804 places, 817 transitions, 1830 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:11,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 817 transitions, 1842 flow [2021-06-10 11:41:11,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 817 transitions, 1837 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:11,858 INFO L241 Difference]: Finished difference. Result has 806 places, 816 transitions, 1826 flow [2021-06-10 11:41:11,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1826, PETRI_PLACES=806, PETRI_TRANSITIONS=816} [2021-06-10 11:41:11,859 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -21 predicate places. [2021-06-10 11:41:11,859 INFO L480 AbstractCegarLoop]: Abstraction has has 806 places, 816 transitions, 1826 flow [2021-06-10 11:41:11,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:11,859 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:11,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1444 [2021-06-10 11:41:11,859 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash -172859070, now seen corresponding path program 1 times [2021-06-10 11:41:11,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:11,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193556468] [2021-06-10 11:41:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:11,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:11,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:11,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:11,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193556468] [2021-06-10 11:41:11,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:11,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:11,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926082700] [2021-06-10 11:41:11,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:11,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:11,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:11,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 816 transitions, 1826 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:11,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:11,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:11,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:12,141 INFO L129 PetriNetUnfolder]: 84/915 cut-off events. [2021-06-10 11:41:12,141 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:12,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 915 events. 84/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3707 event pairs, 0 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 1025. Up to 32 conditions per place. [2021-06-10 11:41:12,197 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/814 dead transitions. [2021-06-10 11:41:12,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 814 transitions, 1829 flow [2021-06-10 11:41:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:12,198 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:12,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:12,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:12,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:12,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:12,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,201 INFO L185 Difference]: Start difference. First operand has 806 places, 816 transitions, 1826 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:12,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 814 transitions, 1829 flow [2021-06-10 11:41:12,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 814 transitions, 1822 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:12,208 INFO L241 Difference]: Finished difference. Result has 806 places, 814 transitions, 1815 flow [2021-06-10 11:41:12,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=806, PETRI_TRANSITIONS=814} [2021-06-10 11:41:12,208 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -21 predicate places. [2021-06-10 11:41:12,208 INFO L480 AbstractCegarLoop]: Abstraction has has 806 places, 814 transitions, 1815 flow [2021-06-10 11:41:12,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:12,209 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:12,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1445 [2021-06-10 11:41:12,209 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -172860093, now seen corresponding path program 1 times [2021-06-10 11:41:12,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:12,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598676411] [2021-06-10 11:41:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:12,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:12,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598676411] [2021-06-10 11:41:12,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:12,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:12,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091353606] [2021-06-10 11:41:12,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:12,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:12,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:12,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 814 transitions, 1815 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:12,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:12,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:12,494 INFO L129 PetriNetUnfolder]: 84/913 cut-off events. [2021-06-10 11:41:12,494 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:12,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 913 events. 84/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3693 event pairs, 0 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1025. Up to 32 conditions per place. [2021-06-10 11:41:12,550 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/812 dead transitions. [2021-06-10 11:41:12,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 812 transitions, 1828 flow [2021-06-10 11:41:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:12,551 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:12,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:12,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:12,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:12,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:12,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,554 INFO L185 Difference]: Start difference. First operand has 806 places, 814 transitions, 1815 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:12,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 812 transitions, 1828 flow [2021-06-10 11:41:12,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 812 transitions, 1827 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:12,561 INFO L241 Difference]: Finished difference. Result has 805 places, 812 transitions, 1811 flow [2021-06-10 11:41:12,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1811, PETRI_PLACES=805, PETRI_TRANSITIONS=812} [2021-06-10 11:41:12,561 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -22 predicate places. [2021-06-10 11:41:12,561 INFO L480 AbstractCegarLoop]: Abstraction has has 805 places, 812 transitions, 1811 flow [2021-06-10 11:41:12,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:12,562 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:12,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1446 [2021-06-10 11:41:12,562 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1889170040, now seen corresponding path program 1 times [2021-06-10 11:41:12,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:12,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153927856] [2021-06-10 11:41:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:12,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:12,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:12,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153927856] [2021-06-10 11:41:12,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:12,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:12,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035448728] [2021-06-10 11:41:12,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:12,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:12,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:12,579 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:12,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 812 transitions, 1811 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:12,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:12,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:12,869 INFO L129 PetriNetUnfolder]: 83/921 cut-off events. [2021-06-10 11:41:12,869 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:12,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 921 events. 83/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3761 event pairs, 0 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1037. Up to 32 conditions per place. [2021-06-10 11:41:12,927 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/814 dead transitions. [2021-06-10 11:41:12,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 807 places, 814 transitions, 1841 flow [2021-06-10 11:41:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:12,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:12,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:12,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:12,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:12,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:12,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,931 INFO L185 Difference]: Start difference. First operand has 805 places, 812 transitions, 1811 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:12,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 807 places, 814 transitions, 1841 flow [2021-06-10 11:41:12,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 814 transitions, 1840 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:12,939 INFO L241 Difference]: Finished difference. Result has 808 places, 814 transitions, 1834 flow [2021-06-10 11:41:12,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=804, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1834, PETRI_PLACES=808, PETRI_TRANSITIONS=814} [2021-06-10 11:41:12,939 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -19 predicate places. [2021-06-10 11:41:12,939 INFO L480 AbstractCegarLoop]: Abstraction has has 808 places, 814 transitions, 1834 flow [2021-06-10 11:41:12,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:12,939 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:12,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1447 [2021-06-10 11:41:12,939 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1889169017, now seen corresponding path program 1 times [2021-06-10 11:41:12,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:12,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422292838] [2021-06-10 11:41:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:12,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:12,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:12,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:12,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422292838] [2021-06-10 11:41:12,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:12,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:12,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155032913] [2021-06-10 11:41:12,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:12,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:12,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:12,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:12,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 814 transitions, 1834 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:12,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:12,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:12,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:13,256 INFO L129 PetriNetUnfolder]: 82/919 cut-off events. [2021-06-10 11:41:13,256 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:13,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 919 events. 82/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3750 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1034. Up to 32 conditions per place. [2021-06-10 11:41:13,291 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/814 dead transitions. [2021-06-10 11:41:13,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 814 transitions, 1846 flow [2021-06-10 11:41:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:13,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:13,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:13,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:13,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:13,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:13,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,304 INFO L185 Difference]: Start difference. First operand has 808 places, 814 transitions, 1834 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:13,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 814 transitions, 1846 flow [2021-06-10 11:41:13,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 814 transitions, 1841 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:13,311 INFO L241 Difference]: Finished difference. Result has 811 places, 814 transitions, 1839 flow [2021-06-10 11:41:13,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=811, PETRI_TRANSITIONS=814} [2021-06-10 11:41:13,311 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -16 predicate places. [2021-06-10 11:41:13,311 INFO L480 AbstractCegarLoop]: Abstraction has has 811 places, 814 transitions, 1839 flow [2021-06-10 11:41:13,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,312 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:13,312 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:13,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1448 [2021-06-10 11:41:13,312 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1888216728, now seen corresponding path program 1 times [2021-06-10 11:41:13,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:13,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370526426] [2021-06-10 11:41:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:13,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:13,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:13,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:13,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370526426] [2021-06-10 11:41:13,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:13,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:13,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702897792] [2021-06-10 11:41:13,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:13,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:13,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:13,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 814 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:13,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:13,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:13,636 INFO L129 PetriNetUnfolder]: 81/915 cut-off events. [2021-06-10 11:41:13,636 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:13,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 915 events. 81/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3726 event pairs, 0 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 1031. Up to 32 conditions per place. [2021-06-10 11:41:13,694 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/811 dead transitions. [2021-06-10 11:41:13,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 811 transitions, 1836 flow [2021-06-10 11:41:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:13,695 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:13,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:13,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:13,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:13,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:13,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,698 INFO L185 Difference]: Start difference. First operand has 811 places, 814 transitions, 1839 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:13,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 811 transitions, 1836 flow [2021-06-10 11:41:13,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 810 places, 811 transitions, 1829 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:13,705 INFO L241 Difference]: Finished difference. Result has 810 places, 811 transitions, 1819 flow [2021-06-10 11:41:13,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1819, PETRI_PLACES=810, PETRI_TRANSITIONS=811} [2021-06-10 11:41:13,706 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -17 predicate places. [2021-06-10 11:41:13,706 INFO L480 AbstractCegarLoop]: Abstraction has has 810 places, 811 transitions, 1819 flow [2021-06-10 11:41:13,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,706 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:13,706 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:13,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1449 [2021-06-10 11:41:13,706 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1888215705, now seen corresponding path program 1 times [2021-06-10 11:41:13,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:13,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88964573] [2021-06-10 11:41:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:13,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:13,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:13,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:13,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:13,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88964573] [2021-06-10 11:41:13,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:13,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:13,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477672798] [2021-06-10 11:41:13,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:13,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:13,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:13,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 811 transitions, 1819 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:13,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:13,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:13,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:14,001 INFO L129 PetriNetUnfolder]: 81/913 cut-off events. [2021-06-10 11:41:14,001 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:14,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 913 events. 81/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3709 event pairs, 0 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1032. Up to 32 conditions per place. [2021-06-10 11:41:14,057 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/809 dead transitions. [2021-06-10 11:41:14,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 809 transitions, 1832 flow [2021-06-10 11:41:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:14,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:14,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:14,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:14,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:14,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:14,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,061 INFO L185 Difference]: Start difference. First operand has 810 places, 811 transitions, 1819 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:14,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 809 transitions, 1832 flow [2021-06-10 11:41:14,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 809 transitions, 1831 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:14,069 INFO L241 Difference]: Finished difference. Result has 809 places, 809 transitions, 1815 flow [2021-06-10 11:41:14,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=809, PETRI_TRANSITIONS=809} [2021-06-10 11:41:14,069 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -18 predicate places. [2021-06-10 11:41:14,069 INFO L480 AbstractCegarLoop]: Abstraction has has 809 places, 809 transitions, 1815 flow [2021-06-10 11:41:14,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,069 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:14,069 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:14,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1450 [2021-06-10 11:41:14,069 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1272154803, now seen corresponding path program 1 times [2021-06-10 11:41:14,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:14,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019336792] [2021-06-10 11:41:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:14,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:14,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:14,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019336792] [2021-06-10 11:41:14,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:14,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:14,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367249715] [2021-06-10 11:41:14,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:14,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:14,087 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:14,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 809 transitions, 1815 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:14,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:14,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:14,363 INFO L129 PetriNetUnfolder]: 79/918 cut-off events. [2021-06-10 11:41:14,363 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:14,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 918 events. 79/918 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3760 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1035. Up to 32 conditions per place. [2021-06-10 11:41:14,419 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/810 dead transitions. [2021-06-10 11:41:14,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 811 places, 810 transitions, 1831 flow [2021-06-10 11:41:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:14,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:14,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:14,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:14,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:14,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:14,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,423 INFO L185 Difference]: Start difference. First operand has 809 places, 809 transitions, 1815 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:14,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 811 places, 810 transitions, 1831 flow [2021-06-10 11:41:14,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 810 places, 810 transitions, 1830 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:14,430 INFO L241 Difference]: Finished difference. Result has 812 places, 810 transitions, 1828 flow [2021-06-10 11:41:14,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1828, PETRI_PLACES=812, PETRI_TRANSITIONS=810} [2021-06-10 11:41:14,431 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -15 predicate places. [2021-06-10 11:41:14,431 INFO L480 AbstractCegarLoop]: Abstraction has has 812 places, 810 transitions, 1828 flow [2021-06-10 11:41:14,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:14,431 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:14,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1451 [2021-06-10 11:41:14,431 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1272155826, now seen corresponding path program 1 times [2021-06-10 11:41:14,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:14,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881704082] [2021-06-10 11:41:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:14,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:14,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:14,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881704082] [2021-06-10 11:41:14,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:14,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:14,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585366123] [2021-06-10 11:41:14,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:14,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:14,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:14,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 812 places, 810 transitions, 1828 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:14,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:14,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:14,745 INFO L129 PetriNetUnfolder]: 79/919 cut-off events. [2021-06-10 11:41:14,745 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:14,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 919 events. 79/919 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3768 event pairs, 0 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1043. Up to 32 conditions per place. [2021-06-10 11:41:14,805 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/811 dead transitions. [2021-06-10 11:41:14,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 811 transitions, 1854 flow [2021-06-10 11:41:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:14,807 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:14,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:14,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,810 INFO L185 Difference]: Start difference. First operand has 812 places, 810 transitions, 1828 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 811 transitions, 1854 flow [2021-06-10 11:41:14,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 811 transitions, 1852 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:14,817 INFO L241 Difference]: Finished difference. Result has 815 places, 811 transitions, 1844 flow [2021-06-10 11:41:14,818 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1844, PETRI_PLACES=815, PETRI_TRANSITIONS=811} [2021-06-10 11:41:14,818 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -12 predicate places. [2021-06-10 11:41:14,818 INFO L480 AbstractCegarLoop]: Abstraction has has 815 places, 811 transitions, 1844 flow [2021-06-10 11:41:14,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,818 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:14,818 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:14,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1452 [2021-06-10 11:41:14,818 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1271202514, now seen corresponding path program 1 times [2021-06-10 11:41:14,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:14,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885983657] [2021-06-10 11:41:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:14,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:14,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:14,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:14,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885983657] [2021-06-10 11:41:14,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:14,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:14,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591712218] [2021-06-10 11:41:14,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:14,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:14,837 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:14,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 811 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:14,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:14,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:14,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:15,122 INFO L129 PetriNetUnfolder]: 78/915 cut-off events. [2021-06-10 11:41:15,122 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:15,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 915 events. 78/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3741 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1036. Up to 32 conditions per place. [2021-06-10 11:41:15,178 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/808 dead transitions. [2021-06-10 11:41:15,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 808 transitions, 1841 flow [2021-06-10 11:41:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:15,180 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:15,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:15,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:15,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:15,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:15,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,183 INFO L185 Difference]: Start difference. First operand has 815 places, 811 transitions, 1844 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:15,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 817 places, 808 transitions, 1841 flow [2021-06-10 11:41:15,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 814 places, 808 transitions, 1833 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:15,190 INFO L241 Difference]: Finished difference. Result has 814 places, 808 transitions, 1823 flow [2021-06-10 11:41:15,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=812, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1823, PETRI_PLACES=814, PETRI_TRANSITIONS=808} [2021-06-10 11:41:15,190 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -13 predicate places. [2021-06-10 11:41:15,190 INFO L480 AbstractCegarLoop]: Abstraction has has 814 places, 808 transitions, 1823 flow [2021-06-10 11:41:15,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:15,191 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:15,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1453 [2021-06-10 11:41:15,191 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1271201491, now seen corresponding path program 1 times [2021-06-10 11:41:15,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:15,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463437087] [2021-06-10 11:41:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:15,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:15,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:15,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463437087] [2021-06-10 11:41:15,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:15,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:15,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206129748] [2021-06-10 11:41:15,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:15,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:15,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:15,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 808 transitions, 1823 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:15,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:15,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:15,480 INFO L129 PetriNetUnfolder]: 78/913 cut-off events. [2021-06-10 11:41:15,480 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:15,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 913 events. 78/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3726 event pairs, 0 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 1039. Up to 32 conditions per place. [2021-06-10 11:41:15,526 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/806 dead transitions. [2021-06-10 11:41:15,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 814 places, 806 transitions, 1836 flow [2021-06-10 11:41:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:15,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:15,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:15,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:15,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:15,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:15,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,530 INFO L185 Difference]: Start difference. First operand has 814 places, 808 transitions, 1823 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:15,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 814 places, 806 transitions, 1836 flow [2021-06-10 11:41:15,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 806 transitions, 1835 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:15,537 INFO L241 Difference]: Finished difference. Result has 813 places, 806 transitions, 1819 flow [2021-06-10 11:41:15,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1819, PETRI_PLACES=813, PETRI_TRANSITIONS=806} [2021-06-10 11:41:15,537 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -14 predicate places. [2021-06-10 11:41:15,537 INFO L480 AbstractCegarLoop]: Abstraction has has 813 places, 806 transitions, 1819 flow [2021-06-10 11:41:15,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,537 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:15,537 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:15,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1454 [2021-06-10 11:41:15,537 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:15,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1715591957, now seen corresponding path program 1 times [2021-06-10 11:41:15,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:15,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047213088] [2021-06-10 11:41:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:15,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:15,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:41:15,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047213088] [2021-06-10 11:41:15,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:15,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:15,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824114483] [2021-06-10 11:41:15,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:15,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:15,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:15,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:15,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 813 places, 806 transitions, 1819 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:15,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:15,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:15,836 INFO L129 PetriNetUnfolder]: 77/921 cut-off events. [2021-06-10 11:41:15,836 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:15,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 921 events. 77/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3796 event pairs, 0 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 1051. Up to 32 conditions per place. [2021-06-10 11:41:15,891 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/808 dead transitions. [2021-06-10 11:41:15,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 815 places, 808 transitions, 1849 flow [2021-06-10 11:41:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:15,892 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:15,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:15,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:15,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:15,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:15,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,895 INFO L185 Difference]: Start difference. First operand has 813 places, 806 transitions, 1819 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:15,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 815 places, 808 transitions, 1849 flow [2021-06-10 11:41:15,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 814 places, 808 transitions, 1848 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:15,902 INFO L241 Difference]: Finished difference. Result has 816 places, 808 transitions, 1842 flow [2021-06-10 11:41:15,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=812, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1842, PETRI_PLACES=816, PETRI_TRANSITIONS=808} [2021-06-10 11:41:15,903 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -11 predicate places. [2021-06-10 11:41:15,903 INFO L480 AbstractCegarLoop]: Abstraction has has 816 places, 808 transitions, 1842 flow [2021-06-10 11:41:15,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:15,903 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:15,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1455 [2021-06-10 11:41:15,903 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1715592980, now seen corresponding path program 1 times [2021-06-10 11:41:15,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:15,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292777488] [2021-06-10 11:41:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:15,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:15,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:15,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:41:15,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292777488] [2021-06-10 11:41:15,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:15,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:15,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733410221] [2021-06-10 11:41:15,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:15,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:15,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:15,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:15,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:15,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 808 transitions, 1842 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:15,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:15,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:15,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:16,201 INFO L129 PetriNetUnfolder]: 76/919 cut-off events. [2021-06-10 11:41:16,201 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:16,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 919 events. 76/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3786 event pairs, 0 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1048. Up to 32 conditions per place. [2021-06-10 11:41:16,257 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2021-06-10 11:41:16,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 808 transitions, 1854 flow [2021-06-10 11:41:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:16,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:16,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:16,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:16,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:16,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:16,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,261 INFO L185 Difference]: Start difference. First operand has 816 places, 808 transitions, 1842 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:16,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 808 transitions, 1854 flow [2021-06-10 11:41:16,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 817 places, 808 transitions, 1849 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:16,268 INFO L241 Difference]: Finished difference. Result has 819 places, 808 transitions, 1847 flow [2021-06-10 11:41:16,269 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=815, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1847, PETRI_PLACES=819, PETRI_TRANSITIONS=808} [2021-06-10 11:41:16,269 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -8 predicate places. [2021-06-10 11:41:16,269 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 808 transitions, 1847 flow [2021-06-10 11:41:16,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:16,269 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:16,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1456 [2021-06-10 11:41:16,269 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1716545269, now seen corresponding path program 1 times [2021-06-10 11:41:16,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:16,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444758489] [2021-06-10 11:41:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:16,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:16,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:16,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:41:16,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444758489] [2021-06-10 11:41:16,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:16,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:16,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020723036] [2021-06-10 11:41:16,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:16,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:16,287 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:16,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 808 transitions, 1847 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:16,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:16,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:16,569 INFO L129 PetriNetUnfolder]: 75/915 cut-off events. [2021-06-10 11:41:16,569 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:16,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 915 events. 75/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3763 event pairs, 0 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 1045. Up to 32 conditions per place. [2021-06-10 11:41:16,624 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/805 dead transitions. [2021-06-10 11:41:16,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 805 transitions, 1844 flow [2021-06-10 11:41:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:16,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:16,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:16,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:16,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:16,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:16,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,628 INFO L185 Difference]: Start difference. First operand has 819 places, 808 transitions, 1847 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:16,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 805 transitions, 1844 flow [2021-06-10 11:41:16,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 805 transitions, 1837 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:16,635 INFO L241 Difference]: Finished difference. Result has 818 places, 805 transitions, 1827 flow [2021-06-10 11:41:16,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1827, PETRI_PLACES=818, PETRI_TRANSITIONS=805} [2021-06-10 11:41:16,636 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -9 predicate places. [2021-06-10 11:41:16,636 INFO L480 AbstractCegarLoop]: Abstraction has has 818 places, 805 transitions, 1827 flow [2021-06-10 11:41:16,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:16,636 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:16,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1457 [2021-06-10 11:41:16,636 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1716546292, now seen corresponding path program 1 times [2021-06-10 11:41:16,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:16,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849668462] [2021-06-10 11:41:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:16,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:16,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:16,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:16,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:41:16,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849668462] [2021-06-10 11:41:16,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:16,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:16,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475755811] [2021-06-10 11:41:16,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:16,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:16,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:16,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 805 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:16,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:16,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:16,939 INFO L129 PetriNetUnfolder]: 75/913 cut-off events. [2021-06-10 11:41:16,939 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:16,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 913 events. 75/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3748 event pairs, 0 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1046. Up to 32 conditions per place. [2021-06-10 11:41:16,993 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/803 dead transitions. [2021-06-10 11:41:16,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 803 transitions, 1840 flow [2021-06-10 11:41:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:16,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:16,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:16,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:16,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:16,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:16,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:16,997 INFO L185 Difference]: Start difference. First operand has 818 places, 805 transitions, 1827 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:16,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 803 transitions, 1840 flow [2021-06-10 11:41:17,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 817 places, 803 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:17,005 INFO L241 Difference]: Finished difference. Result has 817 places, 803 transitions, 1823 flow [2021-06-10 11:41:17,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=815, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1823, PETRI_PLACES=817, PETRI_TRANSITIONS=803} [2021-06-10 11:41:17,005 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -10 predicate places. [2021-06-10 11:41:17,005 INFO L480 AbstractCegarLoop]: Abstraction has has 817 places, 803 transitions, 1823 flow [2021-06-10 11:41:17,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:17,005 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:17,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1458 [2021-06-10 11:41:17,006 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:17,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash -906296771, now seen corresponding path program 1 times [2021-06-10 11:41:17,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:17,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399798798] [2021-06-10 11:41:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:17,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:17,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:41:17,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399798798] [2021-06-10 11:41:17,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:17,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:17,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256274661] [2021-06-10 11:41:17,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:17,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:17,029 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:17,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 803 transitions, 1823 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:17,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:17,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:17,320 INFO L129 PetriNetUnfolder]: 74/920 cut-off events. [2021-06-10 11:41:17,320 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:17,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 920 events. 74/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3804 event pairs, 0 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1051. Up to 32 conditions per place. [2021-06-10 11:41:17,460 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/804 dead transitions. [2021-06-10 11:41:17,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 804 transitions, 1839 flow [2021-06-10 11:41:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:17,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:17,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:17,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:17,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:17,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:17,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,464 INFO L185 Difference]: Start difference. First operand has 817 places, 803 transitions, 1823 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:17,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 804 transitions, 1839 flow [2021-06-10 11:41:17,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 804 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:17,471 INFO L241 Difference]: Finished difference. Result has 819 places, 803 transitions, 1827 flow [2021-06-10 11:41:17,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1827, PETRI_PLACES=819, PETRI_TRANSITIONS=803} [2021-06-10 11:41:17,471 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -8 predicate places. [2021-06-10 11:41:17,471 INFO L480 AbstractCegarLoop]: Abstraction has has 819 places, 803 transitions, 1827 flow [2021-06-10 11:41:17,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:17,471 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:17,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1459 [2021-06-10 11:41:17,472 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:17,472 INFO L82 PathProgramCache]: Analyzing trace with hash -906295748, now seen corresponding path program 1 times [2021-06-10 11:41:17,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:17,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147636919] [2021-06-10 11:41:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:17,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:17,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:41:17,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147636919] [2021-06-10 11:41:17,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:17,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:17,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631656306] [2021-06-10 11:41:17,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:17,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:17,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:17,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:17,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 803 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:17,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:17,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:17,792 INFO L129 PetriNetUnfolder]: 72/922 cut-off events. [2021-06-10 11:41:17,792 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:17,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 922 events. 72/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3836 event pairs, 0 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1062. Up to 32 conditions per place. [2021-06-10 11:41:17,849 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/804 dead transitions. [2021-06-10 11:41:17,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 804 transitions, 1853 flow [2021-06-10 11:41:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:17,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:17,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:17,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:17,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:17,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:17,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,853 INFO L185 Difference]: Start difference. First operand has 819 places, 803 transitions, 1827 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:17,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 804 transitions, 1853 flow [2021-06-10 11:41:17,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 820 places, 804 transitions, 1852 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:17,860 INFO L241 Difference]: Finished difference. Result has 822 places, 804 transitions, 1844 flow [2021-06-10 11:41:17,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1844, PETRI_PLACES=822, PETRI_TRANSITIONS=804} [2021-06-10 11:41:17,861 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -5 predicate places. [2021-06-10 11:41:17,861 INFO L480 AbstractCegarLoop]: Abstraction has has 822 places, 804 transitions, 1844 flow [2021-06-10 11:41:17,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:17,861 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:17,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1460 [2021-06-10 11:41:17,861 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash -907249060, now seen corresponding path program 1 times [2021-06-10 11:41:17,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:17,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117054515] [2021-06-10 11:41:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:17,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:17,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:17,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:41:17,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117054515] [2021-06-10 11:41:17,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:17,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:17,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409521728] [2021-06-10 11:41:17,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:17,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:17,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:17,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:17,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 804 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:17,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:17,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:17,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:18,169 INFO L129 PetriNetUnfolder]: 72/915 cut-off events. [2021-06-10 11:41:18,169 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:18,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 915 events. 72/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3778 event pairs, 0 based on Foata normal form. 1/814 useless extension candidates. Maximal degree in co-relation 1048. Up to 32 conditions per place. [2021-06-10 11:41:18,223 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/802 dead transitions. [2021-06-10 11:41:18,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 802 transitions, 1846 flow [2021-06-10 11:41:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:18,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:18,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:18,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:18,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:18,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:18,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,227 INFO L185 Difference]: Start difference. First operand has 822 places, 804 transitions, 1844 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:18,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 802 transitions, 1846 flow [2021-06-10 11:41:18,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 802 transitions, 1838 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:18,235 INFO L241 Difference]: Finished difference. Result has 822 places, 802 transitions, 1831 flow [2021-06-10 11:41:18,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1831, PETRI_PLACES=822, PETRI_TRANSITIONS=802} [2021-06-10 11:41:18,235 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -5 predicate places. [2021-06-10 11:41:18,235 INFO L480 AbstractCegarLoop]: Abstraction has has 822 places, 802 transitions, 1831 flow [2021-06-10 11:41:18,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:18,236 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:18,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1461 [2021-06-10 11:41:18,236 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:18,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:18,236 INFO L82 PathProgramCache]: Analyzing trace with hash -907250083, now seen corresponding path program 1 times [2021-06-10 11:41:18,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:18,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767924549] [2021-06-10 11:41:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:18,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:18,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:18,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:41:18,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767924549] [2021-06-10 11:41:18,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:18,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:18,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664452534] [2021-06-10 11:41:18,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:18,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:18,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:18,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 802 transitions, 1831 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:18,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:18,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:18,552 INFO L129 PetriNetUnfolder]: 72/913 cut-off events. [2021-06-10 11:41:18,552 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:18,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 913 events. 72/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3765 event pairs, 0 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1052. Up to 32 conditions per place. [2021-06-10 11:41:18,608 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/800 dead transitions. [2021-06-10 11:41:18,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 800 transitions, 1844 flow [2021-06-10 11:41:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:18,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:18,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:18,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:18,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:18,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:18,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,612 INFO L185 Difference]: Start difference. First operand has 822 places, 802 transitions, 1831 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 800 transitions, 1844 flow [2021-06-10 11:41:18,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 800 transitions, 1843 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:18,620 INFO L241 Difference]: Finished difference. Result has 821 places, 800 transitions, 1827 flow [2021-06-10 11:41:18,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1827, PETRI_PLACES=821, PETRI_TRANSITIONS=800} [2021-06-10 11:41:18,620 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -6 predicate places. [2021-06-10 11:41:18,620 INFO L480 AbstractCegarLoop]: Abstraction has has 821 places, 800 transitions, 1827 flow [2021-06-10 11:41:18,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:18,620 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:18,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1462 [2021-06-10 11:41:18,621 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash 677546118, now seen corresponding path program 1 times [2021-06-10 11:41:18,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:18,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126374765] [2021-06-10 11:41:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:18,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:18,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:18,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:18,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:41:18,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126374765] [2021-06-10 11:41:18,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:18,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:18,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636264596] [2021-06-10 11:41:18,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:18,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:18,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:18,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 800 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:18,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:18,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:18,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:18,941 INFO L129 PetriNetUnfolder]: 71/920 cut-off events. [2021-06-10 11:41:18,941 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:18,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 920 events. 71/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3823 event pairs, 0 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1057. Up to 32 conditions per place. [2021-06-10 11:41:19,000 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/801 dead transitions. [2021-06-10 11:41:19,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 801 transitions, 1843 flow [2021-06-10 11:41:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:19,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:19,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:19,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:19,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:19,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:19,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,029 INFO L185 Difference]: Start difference. First operand has 821 places, 800 transitions, 1827 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:19,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 823 places, 801 transitions, 1843 flow [2021-06-10 11:41:19,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 801 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:19,038 INFO L241 Difference]: Finished difference. Result has 823 places, 800 transitions, 1831 flow [2021-06-10 11:41:19,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1831, PETRI_PLACES=823, PETRI_TRANSITIONS=800} [2021-06-10 11:41:19,038 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -4 predicate places. [2021-06-10 11:41:19,038 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 800 transitions, 1831 flow [2021-06-10 11:41:19,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:19,038 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:19,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1463 [2021-06-10 11:41:19,039 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 677547141, now seen corresponding path program 1 times [2021-06-10 11:41:19,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:19,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407662281] [2021-06-10 11:41:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:19,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:19,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:41:19,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407662281] [2021-06-10 11:41:19,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:19,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:19,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156115197] [2021-06-10 11:41:19,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:19,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:19,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:19,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 800 transitions, 1831 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:19,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:19,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:19,359 INFO L129 PetriNetUnfolder]: 69/922 cut-off events. [2021-06-10 11:41:19,359 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:19,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 922 events. 69/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3857 event pairs, 0 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 1068. Up to 32 conditions per place. [2021-06-10 11:41:19,413 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/801 dead transitions. [2021-06-10 11:41:19,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 801 transitions, 1857 flow [2021-06-10 11:41:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:19,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:19,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:19,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:19,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:19,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:19,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,417 INFO L185 Difference]: Start difference. First operand has 823 places, 800 transitions, 1831 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:19,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 825 places, 801 transitions, 1857 flow [2021-06-10 11:41:19,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 824 places, 801 transitions, 1856 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:19,424 INFO L241 Difference]: Finished difference. Result has 826 places, 801 transitions, 1848 flow [2021-06-10 11:41:19,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=822, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1848, PETRI_PLACES=826, PETRI_TRANSITIONS=801} [2021-06-10 11:41:19,425 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -1 predicate places. [2021-06-10 11:41:19,425 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 801 transitions, 1848 flow [2021-06-10 11:41:19,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:19,425 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:19,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1464 [2021-06-10 11:41:19,425 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 676593829, now seen corresponding path program 1 times [2021-06-10 11:41:19,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:19,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112244537] [2021-06-10 11:41:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:19,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:19,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:41:19,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112244537] [2021-06-10 11:41:19,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:19,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:19,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010062302] [2021-06-10 11:41:19,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:19,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:19,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:19,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:19,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:19,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 801 transitions, 1848 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:19,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:19,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:19,725 INFO L129 PetriNetUnfolder]: 69/915 cut-off events. [2021-06-10 11:41:19,725 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:19,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 915 events. 69/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3797 event pairs, 0 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 1054. Up to 32 conditions per place. [2021-06-10 11:41:19,773 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/799 dead transitions. [2021-06-10 11:41:19,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 799 transitions, 1850 flow [2021-06-10 11:41:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:19,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:19,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:19,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:19,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:19,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:19,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,777 INFO L185 Difference]: Start difference. First operand has 826 places, 801 transitions, 1848 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:19,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 799 transitions, 1850 flow [2021-06-10 11:41:19,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 825 places, 799 transitions, 1842 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:19,784 INFO L241 Difference]: Finished difference. Result has 826 places, 799 transitions, 1835 flow [2021-06-10 11:41:19,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=823, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1835, PETRI_PLACES=826, PETRI_TRANSITIONS=799} [2021-06-10 11:41:19,784 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -1 predicate places. [2021-06-10 11:41:19,784 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 799 transitions, 1835 flow [2021-06-10 11:41:19,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:19,785 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:19,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1465 [2021-06-10 11:41:19,785 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 676592806, now seen corresponding path program 1 times [2021-06-10 11:41:19,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:19,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075726807] [2021-06-10 11:41:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:19,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:19,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:19,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:41:19,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075726807] [2021-06-10 11:41:19,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:19,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:19,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917305787] [2021-06-10 11:41:19,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:19,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:19,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:19,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:19,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 799 transitions, 1835 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:19,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:19,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:19,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:20,088 INFO L129 PetriNetUnfolder]: 69/913 cut-off events. [2021-06-10 11:41:20,088 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:20,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 913 events. 69/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3782 event pairs, 0 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1058. Up to 32 conditions per place. [2021-06-10 11:41:20,141 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/797 dead transitions. [2021-06-10 11:41:20,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 797 transitions, 1848 flow [2021-06-10 11:41:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:20,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:20,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:20,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:20,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:20,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:20,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,145 INFO L185 Difference]: Start difference. First operand has 826 places, 799 transitions, 1835 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:20,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 797 transitions, 1848 flow [2021-06-10 11:41:20,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 825 places, 797 transitions, 1847 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:20,153 INFO L241 Difference]: Finished difference. Result has 825 places, 797 transitions, 1831 flow [2021-06-10 11:41:20,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=823, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1831, PETRI_PLACES=825, PETRI_TRANSITIONS=797} [2021-06-10 11:41:20,153 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, -2 predicate places. [2021-06-10 11:41:20,153 INFO L480 AbstractCegarLoop]: Abstraction has has 825 places, 797 transitions, 1831 flow [2021-06-10 11:41:20,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:20,153 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:20,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1466 [2021-06-10 11:41:20,153 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1729239472, now seen corresponding path program 1 times [2021-06-10 11:41:20,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:20,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942885681] [2021-06-10 11:41:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:20,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:20,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:41:20,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942885681] [2021-06-10 11:41:20,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:20,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:20,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942534344] [2021-06-10 11:41:20,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:20,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:20,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:20,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 797 transitions, 1831 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:20,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:20,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:20,466 INFO L129 PetriNetUnfolder]: 68/920 cut-off events. [2021-06-10 11:41:20,466 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:20,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 920 events. 68/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3840 event pairs, 0 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 1063. Up to 32 conditions per place. [2021-06-10 11:41:20,520 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/798 dead transitions. [2021-06-10 11:41:20,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 798 transitions, 1847 flow [2021-06-10 11:41:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:20,521 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:20,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:20,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:20,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:20,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:20,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,524 INFO L185 Difference]: Start difference. First operand has 825 places, 797 transitions, 1831 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:20,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 798 transitions, 1847 flow [2021-06-10 11:41:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 798 transitions, 1846 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:20,531 INFO L241 Difference]: Finished difference. Result has 827 places, 797 transitions, 1835 flow [2021-06-10 11:41:20,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1835, PETRI_PLACES=827, PETRI_TRANSITIONS=797} [2021-06-10 11:41:20,531 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 0 predicate places. [2021-06-10 11:41:20,532 INFO L480 AbstractCegarLoop]: Abstraction has has 827 places, 797 transitions, 1835 flow [2021-06-10 11:41:20,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:20,532 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:20,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1467 [2021-06-10 11:41:20,532 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1729238449, now seen corresponding path program 1 times [2021-06-10 11:41:20,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:20,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387239350] [2021-06-10 11:41:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:20,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:20,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:41:20,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387239350] [2021-06-10 11:41:20,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:20,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:20,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482863811] [2021-06-10 11:41:20,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:20,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:20,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:20,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 797 transitions, 1835 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:20,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:20,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:20,852 INFO L129 PetriNetUnfolder]: 66/922 cut-off events. [2021-06-10 11:41:20,852 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:20,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 922 events. 66/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3877 event pairs, 0 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1074. Up to 32 conditions per place. [2021-06-10 11:41:20,906 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/798 dead transitions. [2021-06-10 11:41:20,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 829 places, 798 transitions, 1861 flow [2021-06-10 11:41:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:20,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:20,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:20,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:20,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:20,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:20,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,911 INFO L185 Difference]: Start difference. First operand has 827 places, 797 transitions, 1835 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:20,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 829 places, 798 transitions, 1861 flow [2021-06-10 11:41:20,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 828 places, 798 transitions, 1860 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:20,918 INFO L241 Difference]: Finished difference. Result has 830 places, 798 transitions, 1852 flow [2021-06-10 11:41:20,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=826, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1852, PETRI_PLACES=830, PETRI_TRANSITIONS=798} [2021-06-10 11:41:20,918 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 3 predicate places. [2021-06-10 11:41:20,918 INFO L480 AbstractCegarLoop]: Abstraction has has 830 places, 798 transitions, 1852 flow [2021-06-10 11:41:20,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:20,919 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:20,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1468 [2021-06-10 11:41:20,919 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1730191761, now seen corresponding path program 1 times [2021-06-10 11:41:20,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:20,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838692325] [2021-06-10 11:41:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:20,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:20,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:20,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:41:20,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838692325] [2021-06-10 11:41:20,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:20,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:20,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240264220] [2021-06-10 11:41:20,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:20,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:20,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:20,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 830 places, 798 transitions, 1852 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:20,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:20,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:20,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:21,230 INFO L129 PetriNetUnfolder]: 66/915 cut-off events. [2021-06-10 11:41:21,230 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:21,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 915 events. 66/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3813 event pairs, 0 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 1060. Up to 32 conditions per place. [2021-06-10 11:41:21,284 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/796 dead transitions. [2021-06-10 11:41:21,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 832 places, 796 transitions, 1854 flow [2021-06-10 11:41:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:21,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:21,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:21,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:21,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:21,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:21,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,288 INFO L185 Difference]: Start difference. First operand has 830 places, 798 transitions, 1852 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:21,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 832 places, 796 transitions, 1854 flow [2021-06-10 11:41:21,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 796 transitions, 1846 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:21,296 INFO L241 Difference]: Finished difference. Result has 830 places, 796 transitions, 1839 flow [2021-06-10 11:41:21,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=827, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=830, PETRI_TRANSITIONS=796} [2021-06-10 11:41:21,296 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 3 predicate places. [2021-06-10 11:41:21,296 INFO L480 AbstractCegarLoop]: Abstraction has has 830 places, 796 transitions, 1839 flow [2021-06-10 11:41:21,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:21,297 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:21,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1469 [2021-06-10 11:41:21,297 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1730192784, now seen corresponding path program 1 times [2021-06-10 11:41:21,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:21,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044202460] [2021-06-10 11:41:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:21,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:21,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:21,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:41:21,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044202460] [2021-06-10 11:41:21,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:21,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:21,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261450039] [2021-06-10 11:41:21,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:21,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:21,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:21,316 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:21,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 830 places, 796 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:21,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:21,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:21,620 INFO L129 PetriNetUnfolder]: 66/913 cut-off events. [2021-06-10 11:41:21,621 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:21,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 913 events. 66/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3796 event pairs, 0 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1064. Up to 32 conditions per place. [2021-06-10 11:41:21,656 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/794 dead transitions. [2021-06-10 11:41:21,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 794 transitions, 1852 flow [2021-06-10 11:41:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:21,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:21,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:21,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:21,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:21,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:21,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,660 INFO L185 Difference]: Start difference. First operand has 830 places, 796 transitions, 1839 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:21,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 794 transitions, 1852 flow [2021-06-10 11:41:21,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 794 transitions, 1851 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:21,667 INFO L241 Difference]: Finished difference. Result has 829 places, 794 transitions, 1835 flow [2021-06-10 11:41:21,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=827, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1835, PETRI_PLACES=829, PETRI_TRANSITIONS=794} [2021-06-10 11:41:21,667 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 2 predicate places. [2021-06-10 11:41:21,667 INFO L480 AbstractCegarLoop]: Abstraction has has 829 places, 794 transitions, 1835 flow [2021-06-10 11:41:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:21,667 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:21,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1470 [2021-06-10 11:41:21,667 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2125080806, now seen corresponding path program 1 times [2021-06-10 11:41:21,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:21,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14937167] [2021-06-10 11:41:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:21,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:21,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:21,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:21,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:41:21,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14937167] [2021-06-10 11:41:21,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:21,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:21,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619090306] [2021-06-10 11:41:21,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:21,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:21,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:21,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 829 places, 794 transitions, 1835 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:21,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:21,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:21,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:21,992 INFO L129 PetriNetUnfolder]: 65/921 cut-off events. [2021-06-10 11:41:21,992 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:22,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 921 events. 65/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3871 event pairs, 0 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 1076. Up to 32 conditions per place. [2021-06-10 11:41:22,046 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/796 dead transitions. [2021-06-10 11:41:22,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 796 transitions, 1865 flow [2021-06-10 11:41:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:22,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:22,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:22,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:22,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:22,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:22,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,050 INFO L185 Difference]: Start difference. First operand has 829 places, 794 transitions, 1835 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:22,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 831 places, 796 transitions, 1865 flow [2021-06-10 11:41:22,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 796 transitions, 1864 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:22,057 INFO L241 Difference]: Finished difference. Result has 832 places, 796 transitions, 1858 flow [2021-06-10 11:41:22,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1858, PETRI_PLACES=832, PETRI_TRANSITIONS=796} [2021-06-10 11:41:22,058 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 5 predicate places. [2021-06-10 11:41:22,058 INFO L480 AbstractCegarLoop]: Abstraction has has 832 places, 796 transitions, 1858 flow [2021-06-10 11:41:22,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:22,058 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:22,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1471 [2021-06-10 11:41:22,058 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2125081829, now seen corresponding path program 1 times [2021-06-10 11:41:22,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:22,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787773664] [2021-06-10 11:41:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:22,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:22,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:41:22,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787773664] [2021-06-10 11:41:22,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:22,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:22,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004150145] [2021-06-10 11:41:22,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:22,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:22,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:22,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 796 transitions, 1858 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:22,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:22,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:22,382 INFO L129 PetriNetUnfolder]: 63/922 cut-off events. [2021-06-10 11:41:22,382 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:22,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 922 events. 63/922 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3891 event pairs, 0 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1076. Up to 32 conditions per place. [2021-06-10 11:41:22,437 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/796 dead transitions. [2021-06-10 11:41:22,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 796 transitions, 1870 flow [2021-06-10 11:41:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:22,439 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:22,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:22,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:22,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:22,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:22,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,441 INFO L185 Difference]: Start difference. First operand has 832 places, 796 transitions, 1858 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:22,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 834 places, 796 transitions, 1870 flow [2021-06-10 11:41:22,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 796 transitions, 1865 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:22,449 INFO L241 Difference]: Finished difference. Result has 834 places, 795 transitions, 1854 flow [2021-06-10 11:41:22,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1854, PETRI_PLACES=834, PETRI_TRANSITIONS=795} [2021-06-10 11:41:22,449 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 7 predicate places. [2021-06-10 11:41:22,449 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 795 transitions, 1854 flow [2021-06-10 11:41:22,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:22,450 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:22,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1472 [2021-06-10 11:41:22,450 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2126034118, now seen corresponding path program 1 times [2021-06-10 11:41:22,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:22,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840204235] [2021-06-10 11:41:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:22,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:22,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:41:22,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840204235] [2021-06-10 11:41:22,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:22,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:22,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605684240] [2021-06-10 11:41:22,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:22,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:22,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:22,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:22,469 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:22,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 795 transitions, 1854 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:22,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:22,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:22,765 INFO L129 PetriNetUnfolder]: 63/915 cut-off events. [2021-06-10 11:41:22,765 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:22,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 915 events. 63/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3834 event pairs, 0 based on Foata normal form. 1/823 useless extension candidates. Maximal degree in co-relation 1070. Up to 32 conditions per place. [2021-06-10 11:41:22,818 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/793 dead transitions. [2021-06-10 11:41:22,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 793 transitions, 1857 flow [2021-06-10 11:41:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:22,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:22,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:22,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:22,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:22,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:22,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,822 INFO L185 Difference]: Start difference. First operand has 834 places, 795 transitions, 1854 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:22,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 836 places, 793 transitions, 1857 flow [2021-06-10 11:41:22,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 793 transitions, 1850 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:22,829 INFO L241 Difference]: Finished difference. Result has 834 places, 793 transitions, 1843 flow [2021-06-10 11:41:22,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1843, PETRI_PLACES=834, PETRI_TRANSITIONS=793} [2021-06-10 11:41:22,830 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 7 predicate places. [2021-06-10 11:41:22,830 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 793 transitions, 1843 flow [2021-06-10 11:41:22,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:22,830 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:22,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1473 [2021-06-10 11:41:22,830 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2126035141, now seen corresponding path program 1 times [2021-06-10 11:41:22,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:22,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92638258] [2021-06-10 11:41:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:22,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:22,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:22,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:41:22,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92638258] [2021-06-10 11:41:22,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:22,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:22,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647954748] [2021-06-10 11:41:22,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:22,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:22,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:22,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 793 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:22,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:22,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:22,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:23,150 INFO L129 PetriNetUnfolder]: 63/913 cut-off events. [2021-06-10 11:41:23,150 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:23,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 913 events. 63/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3819 event pairs, 0 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1070. Up to 32 conditions per place. [2021-06-10 11:41:23,204 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/791 dead transitions. [2021-06-10 11:41:23,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 791 transitions, 1856 flow [2021-06-10 11:41:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:23,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:23,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:23,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:23,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:23,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:23,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,208 INFO L185 Difference]: Start difference. First operand has 834 places, 793 transitions, 1843 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:23,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 834 places, 791 transitions, 1856 flow [2021-06-10 11:41:23,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 791 transitions, 1855 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:23,216 INFO L241 Difference]: Finished difference. Result has 833 places, 791 transitions, 1839 flow [2021-06-10 11:41:23,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=833, PETRI_TRANSITIONS=791} [2021-06-10 11:41:23,216 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 6 predicate places. [2021-06-10 11:41:23,216 INFO L480 AbstractCegarLoop]: Abstraction has has 833 places, 791 transitions, 1839 flow [2021-06-10 11:41:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:23,216 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:23,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1474 [2021-06-10 11:41:23,216 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 438985095, now seen corresponding path program 1 times [2021-06-10 11:41:23,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:23,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024221416] [2021-06-10 11:41:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:23,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:23,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:23,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:41:23,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024221416] [2021-06-10 11:41:23,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:23,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:23,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128242392] [2021-06-10 11:41:23,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:23,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:23,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:23,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 833 places, 791 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:23,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:23,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:23,546 INFO L129 PetriNetUnfolder]: 62/921 cut-off events. [2021-06-10 11:41:23,546 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:23,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 921 events. 62/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3888 event pairs, 0 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1082. Up to 32 conditions per place. [2021-06-10 11:41:23,600 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/793 dead transitions. [2021-06-10 11:41:23,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 793 transitions, 1869 flow [2021-06-10 11:41:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:23,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:23,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:23,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:23,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:23,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:23,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,604 INFO L185 Difference]: Start difference. First operand has 833 places, 791 transitions, 1839 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:23,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 835 places, 793 transitions, 1869 flow [2021-06-10 11:41:23,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 793 transitions, 1868 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:23,657 INFO L241 Difference]: Finished difference. Result has 836 places, 793 transitions, 1862 flow [2021-06-10 11:41:23,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1862, PETRI_PLACES=836, PETRI_TRANSITIONS=793} [2021-06-10 11:41:23,657 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 9 predicate places. [2021-06-10 11:41:23,657 INFO L480 AbstractCegarLoop]: Abstraction has has 836 places, 793 transitions, 1862 flow [2021-06-10 11:41:23,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:23,657 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:23,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1475 [2021-06-10 11:41:23,658 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash 438986118, now seen corresponding path program 1 times [2021-06-10 11:41:23,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:23,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095992434] [2021-06-10 11:41:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:23,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:23,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:23,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:23,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:41:23,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095992434] [2021-06-10 11:41:23,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:23,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:23,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614469926] [2021-06-10 11:41:23,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:23,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:23,677 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:23,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 836 places, 793 transitions, 1862 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:23,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:23,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:23,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:23,981 INFO L129 PetriNetUnfolder]: 61/919 cut-off events. [2021-06-10 11:41:23,981 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:24,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 919 events. 61/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3875 event pairs, 0 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1079. Up to 32 conditions per place. [2021-06-10 11:41:24,036 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/793 dead transitions. [2021-06-10 11:41:24,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 793 transitions, 1874 flow [2021-06-10 11:41:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:24,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:24,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:24,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:24,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:24,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,040 INFO L185 Difference]: Start difference. First operand has 836 places, 793 transitions, 1862 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:24,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 838 places, 793 transitions, 1874 flow [2021-06-10 11:41:24,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 837 places, 793 transitions, 1869 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:24,047 INFO L241 Difference]: Finished difference. Result has 839 places, 793 transitions, 1867 flow [2021-06-10 11:41:24,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=835, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=839, PETRI_TRANSITIONS=793} [2021-06-10 11:41:24,048 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 12 predicate places. [2021-06-10 11:41:24,048 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 793 transitions, 1867 flow [2021-06-10 11:41:24,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:24,048 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:24,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1476 [2021-06-10 11:41:24,048 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash 439938407, now seen corresponding path program 1 times [2021-06-10 11:41:24,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:24,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360208559] [2021-06-10 11:41:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:24,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:24,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:41:24,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360208559] [2021-06-10 11:41:24,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:24,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:24,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914494972] [2021-06-10 11:41:24,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:24,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:24,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:24,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 793 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:24,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:24,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:24,369 INFO L129 PetriNetUnfolder]: 60/915 cut-off events. [2021-06-10 11:41:24,370 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:24,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 915 events. 60/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3848 event pairs, 0 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1076. Up to 32 conditions per place. [2021-06-10 11:41:24,425 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/790 dead transitions. [2021-06-10 11:41:24,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 841 places, 790 transitions, 1864 flow [2021-06-10 11:41:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:24,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:24,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:24,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:24,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:24,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:24,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,429 INFO L185 Difference]: Start difference. First operand has 839 places, 793 transitions, 1867 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:24,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 841 places, 790 transitions, 1864 flow [2021-06-10 11:41:24,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 790 transitions, 1857 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:24,436 INFO L241 Difference]: Finished difference. Result has 838 places, 790 transitions, 1847 flow [2021-06-10 11:41:24,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1847, PETRI_PLACES=838, PETRI_TRANSITIONS=790} [2021-06-10 11:41:24,437 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 11 predicate places. [2021-06-10 11:41:24,437 INFO L480 AbstractCegarLoop]: Abstraction has has 838 places, 790 transitions, 1847 flow [2021-06-10 11:41:24,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,437 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:24,437 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:24,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1477 [2021-06-10 11:41:24,437 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 439939430, now seen corresponding path program 1 times [2021-06-10 11:41:24,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:24,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941285889] [2021-06-10 11:41:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:24,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:24,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:41:24,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941285889] [2021-06-10 11:41:24,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:24,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:24,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212539277] [2021-06-10 11:41:24,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:24,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:24,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:24,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:24,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 838 places, 790 transitions, 1847 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:24,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:24,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:24,757 INFO L129 PetriNetUnfolder]: 60/913 cut-off events. [2021-06-10 11:41:24,757 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:24,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 913 events. 60/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3832 event pairs, 0 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1077. Up to 32 conditions per place. [2021-06-10 11:41:24,811 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/788 dead transitions. [2021-06-10 11:41:24,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 788 transitions, 1860 flow [2021-06-10 11:41:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:24,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:24,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:24,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:24,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:24,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:24,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,815 INFO L185 Difference]: Start difference. First operand has 838 places, 790 transitions, 1847 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:24,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 838 places, 788 transitions, 1860 flow [2021-06-10 11:41:24,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 837 places, 788 transitions, 1859 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:24,822 INFO L241 Difference]: Finished difference. Result has 837 places, 788 transitions, 1843 flow [2021-06-10 11:41:24,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=835, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1843, PETRI_PLACES=837, PETRI_TRANSITIONS=788} [2021-06-10 11:41:24,823 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 10 predicate places. [2021-06-10 11:41:24,823 INFO L480 AbstractCegarLoop]: Abstraction has has 837 places, 788 transitions, 1843 flow [2021-06-10 11:41:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:24,823 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:24,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1478 [2021-06-10 11:41:24,823 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1138446036, now seen corresponding path program 1 times [2021-06-10 11:41:24,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:24,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201414708] [2021-06-10 11:41:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:24,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:24,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:24,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:41:24,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201414708] [2021-06-10 11:41:24,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:24,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:24,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828839374] [2021-06-10 11:41:24,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:24,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:24,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:24,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 788 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:24,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:24,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:24,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:25,160 INFO L129 PetriNetUnfolder]: 59/921 cut-off events. [2021-06-10 11:41:25,160 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:25,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 921 events. 59/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3906 event pairs, 0 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1089. Up to 32 conditions per place. [2021-06-10 11:41:25,214 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/790 dead transitions. [2021-06-10 11:41:25,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 790 transitions, 1873 flow [2021-06-10 11:41:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:25,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:25,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:25,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:25,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:25,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:25,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,218 INFO L185 Difference]: Start difference. First operand has 837 places, 788 transitions, 1843 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:25,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 790 transitions, 1873 flow [2021-06-10 11:41:25,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 790 transitions, 1872 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:25,226 INFO L241 Difference]: Finished difference. Result has 840 places, 790 transitions, 1866 flow [2021-06-10 11:41:25,227 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1866, PETRI_PLACES=840, PETRI_TRANSITIONS=790} [2021-06-10 11:41:25,227 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 13 predicate places. [2021-06-10 11:41:25,227 INFO L480 AbstractCegarLoop]: Abstraction has has 840 places, 790 transitions, 1866 flow [2021-06-10 11:41:25,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:25,227 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:25,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1479 [2021-06-10 11:41:25,227 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:25,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1138447059, now seen corresponding path program 1 times [2021-06-10 11:41:25,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:25,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374554094] [2021-06-10 11:41:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:25,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:25,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:25,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:41:25,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374554094] [2021-06-10 11:41:25,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:25,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:25,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826757825] [2021-06-10 11:41:25,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:25,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:25,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:25,247 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:25,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 840 places, 790 transitions, 1866 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:25,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:25,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:25,556 INFO L129 PetriNetUnfolder]: 58/919 cut-off events. [2021-06-10 11:41:25,557 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:25,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 919 events. 58/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3892 event pairs, 0 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1086. Up to 32 conditions per place. [2021-06-10 11:41:25,610 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/790 dead transitions. [2021-06-10 11:41:25,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 842 places, 790 transitions, 1878 flow [2021-06-10 11:41:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:25,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:25,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:25,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:25,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:25,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:25,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,614 INFO L185 Difference]: Start difference. First operand has 840 places, 790 transitions, 1866 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:25,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 842 places, 790 transitions, 1878 flow [2021-06-10 11:41:25,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 841 places, 790 transitions, 1873 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:25,622 INFO L241 Difference]: Finished difference. Result has 843 places, 790 transitions, 1871 flow [2021-06-10 11:41:25,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=839, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1871, PETRI_PLACES=843, PETRI_TRANSITIONS=790} [2021-06-10 11:41:25,622 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 16 predicate places. [2021-06-10 11:41:25,623 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 790 transitions, 1871 flow [2021-06-10 11:41:25,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:25,623 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:25,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1480 [2021-06-10 11:41:25,623 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1139399348, now seen corresponding path program 1 times [2021-06-10 11:41:25,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:25,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493847962] [2021-06-10 11:41:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:25,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:25,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:25,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:25,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:41:25,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493847962] [2021-06-10 11:41:25,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:25,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:25,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091436255] [2021-06-10 11:41:25,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:25,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:25,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:25,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 790 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:25,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:25,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:25,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:25,946 INFO L129 PetriNetUnfolder]: 57/915 cut-off events. [2021-06-10 11:41:25,947 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:25,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 915 events. 57/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3869 event pairs, 0 based on Foata normal form. 1/829 useless extension candidates. Maximal degree in co-relation 1083. Up to 32 conditions per place. [2021-06-10 11:41:25,998 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/787 dead transitions. [2021-06-10 11:41:25,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 787 transitions, 1868 flow [2021-06-10 11:41:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:26,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:26,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:26,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:26,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:26,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:26,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,002 INFO L185 Difference]: Start difference. First operand has 843 places, 790 transitions, 1871 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:26,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 787 transitions, 1868 flow [2021-06-10 11:41:26,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 787 transitions, 1861 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:26,010 INFO L241 Difference]: Finished difference. Result has 842 places, 787 transitions, 1851 flow [2021-06-10 11:41:26,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=842, PETRI_TRANSITIONS=787} [2021-06-10 11:41:26,010 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 15 predicate places. [2021-06-10 11:41:26,010 INFO L480 AbstractCegarLoop]: Abstraction has has 842 places, 787 transitions, 1851 flow [2021-06-10 11:41:26,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:26,010 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:26,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1481 [2021-06-10 11:41:26,010 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1139400371, now seen corresponding path program 1 times [2021-06-10 11:41:26,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:26,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878563854] [2021-06-10 11:41:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:26,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:26,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:41:26,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878563854] [2021-06-10 11:41:26,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:26,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:26,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547209919] [2021-06-10 11:41:26,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:26,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:26,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:26,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:26,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 787 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:26,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:26,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:26,332 INFO L129 PetriNetUnfolder]: 57/913 cut-off events. [2021-06-10 11:41:26,332 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:26,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 913 events. 57/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3854 event pairs, 0 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 1084. Up to 32 conditions per place. [2021-06-10 11:41:26,384 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/785 dead transitions. [2021-06-10 11:41:26,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 842 places, 785 transitions, 1864 flow [2021-06-10 11:41:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:26,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:26,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:26,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:26,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:26,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:26,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,388 INFO L185 Difference]: Start difference. First operand has 842 places, 787 transitions, 1851 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:26,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 842 places, 785 transitions, 1864 flow [2021-06-10 11:41:26,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 841 places, 785 transitions, 1863 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:26,396 INFO L241 Difference]: Finished difference. Result has 841 places, 785 transitions, 1847 flow [2021-06-10 11:41:26,396 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=839, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1847, PETRI_PLACES=841, PETRI_TRANSITIONS=785} [2021-06-10 11:41:26,396 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 14 predicate places. [2021-06-10 11:41:26,396 INFO L480 AbstractCegarLoop]: Abstraction has has 841 places, 785 transitions, 1847 flow [2021-06-10 11:41:26,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,396 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:26,396 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:26,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1482 [2021-06-10 11:41:26,397 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:26,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1509012606, now seen corresponding path program 1 times [2021-06-10 11:41:26,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:26,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920779495] [2021-06-10 11:41:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:26,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:26,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:41:26,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920779495] [2021-06-10 11:41:26,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:26,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:26,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688025420] [2021-06-10 11:41:26,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:26,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:26,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:26,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 841 places, 785 transitions, 1847 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:26,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:26,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:26,726 INFO L129 PetriNetUnfolder]: 56/920 cut-off events. [2021-06-10 11:41:26,726 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:26,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 920 events. 56/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3909 event pairs, 0 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1089. Up to 32 conditions per place. [2021-06-10 11:41:26,780 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/786 dead transitions. [2021-06-10 11:41:26,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 786 transitions, 1863 flow [2021-06-10 11:41:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:26,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:26,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:26,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:26,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:26,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:26,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,784 INFO L185 Difference]: Start difference. First operand has 841 places, 785 transitions, 1847 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:26,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 786 transitions, 1863 flow [2021-06-10 11:41:26,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 786 transitions, 1862 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:26,791 INFO L241 Difference]: Finished difference. Result has 843 places, 785 transitions, 1851 flow [2021-06-10 11:41:26,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=843, PETRI_TRANSITIONS=785} [2021-06-10 11:41:26,792 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 16 predicate places. [2021-06-10 11:41:26,792 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 785 transitions, 1851 flow [2021-06-10 11:41:26,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,792 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:26,792 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:26,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1483 [2021-06-10 11:41:26,792 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1509011583, now seen corresponding path program 1 times [2021-06-10 11:41:26,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:26,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880914741] [2021-06-10 11:41:26,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:26,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:26,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:26,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:41:26,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880914741] [2021-06-10 11:41:26,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:26,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:26,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128772570] [2021-06-10 11:41:26,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:26,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:26,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:26,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 785 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:26,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:26,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:26,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:27,133 INFO L129 PetriNetUnfolder]: 54/922 cut-off events. [2021-06-10 11:41:27,133 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:27,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 922 events. 54/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3947 event pairs, 0 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1100. Up to 32 conditions per place. [2021-06-10 11:41:27,186 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/786 dead transitions. [2021-06-10 11:41:27,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 786 transitions, 1877 flow [2021-06-10 11:41:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:27,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:27,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:27,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:27,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:27,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:27,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,191 INFO L185 Difference]: Start difference. First operand has 843 places, 785 transitions, 1851 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:27,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 845 places, 786 transitions, 1877 flow [2021-06-10 11:41:27,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 844 places, 786 transitions, 1876 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:27,199 INFO L241 Difference]: Finished difference. Result has 846 places, 786 transitions, 1868 flow [2021-06-10 11:41:27,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=842, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=846, PETRI_TRANSITIONS=786} [2021-06-10 11:41:27,199 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 19 predicate places. [2021-06-10 11:41:27,199 INFO L480 AbstractCegarLoop]: Abstraction has has 846 places, 786 transitions, 1868 flow [2021-06-10 11:41:27,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,199 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:27,199 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:27,199 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1484 [2021-06-10 11:41:27,199 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1509964895, now seen corresponding path program 1 times [2021-06-10 11:41:27,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:27,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573561590] [2021-06-10 11:41:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:27,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:27,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:41:27,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573561590] [2021-06-10 11:41:27,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:27,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:27,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974376979] [2021-06-10 11:41:27,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:27,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:27,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:27,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 786 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:27,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:27,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:27,530 INFO L129 PetriNetUnfolder]: 54/915 cut-off events. [2021-06-10 11:41:27,530 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:27,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 915 events. 54/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3884 event pairs, 0 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 1086. Up to 32 conditions per place. [2021-06-10 11:41:27,585 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/784 dead transitions. [2021-06-10 11:41:27,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 848 places, 784 transitions, 1870 flow [2021-06-10 11:41:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:27,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:27,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:27,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:27,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:27,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:27,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,589 INFO L185 Difference]: Start difference. First operand has 846 places, 786 transitions, 1868 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:27,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 848 places, 784 transitions, 1870 flow [2021-06-10 11:41:27,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 845 places, 784 transitions, 1862 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:27,597 INFO L241 Difference]: Finished difference. Result has 846 places, 784 transitions, 1855 flow [2021-06-10 11:41:27,597 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=846, PETRI_TRANSITIONS=784} [2021-06-10 11:41:27,597 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 19 predicate places. [2021-06-10 11:41:27,597 INFO L480 AbstractCegarLoop]: Abstraction has has 846 places, 784 transitions, 1855 flow [2021-06-10 11:41:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:27,597 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:27,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1485 [2021-06-10 11:41:27,597 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1509965918, now seen corresponding path program 1 times [2021-06-10 11:41:27,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:27,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943899722] [2021-06-10 11:41:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:27,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:27,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:41:27,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943899722] [2021-06-10 11:41:27,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:27,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:27,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885037932] [2021-06-10 11:41:27,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:27,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:27,617 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:27,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 784 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:27,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:27,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:27,923 INFO L129 PetriNetUnfolder]: 54/913 cut-off events. [2021-06-10 11:41:27,923 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:27,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 913 events. 54/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3871 event pairs, 0 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1090. Up to 32 conditions per place. [2021-06-10 11:41:27,967 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/782 dead transitions. [2021-06-10 11:41:27,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 782 transitions, 1868 flow [2021-06-10 11:41:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:27,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:27,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:27,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:27,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:27,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:27,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,971 INFO L185 Difference]: Start difference. First operand has 846 places, 784 transitions, 1855 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:27,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 782 transitions, 1868 flow [2021-06-10 11:41:27,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 845 places, 782 transitions, 1867 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:27,978 INFO L241 Difference]: Finished difference. Result has 845 places, 782 transitions, 1851 flow [2021-06-10 11:41:27,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=845, PETRI_TRANSITIONS=782} [2021-06-10 11:41:27,978 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 18 predicate places. [2021-06-10 11:41:27,978 INFO L480 AbstractCegarLoop]: Abstraction has has 845 places, 782 transitions, 1851 flow [2021-06-10 11:41:27,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:27,979 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:27,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1486 [2021-06-10 11:41:27,979 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 399400784, now seen corresponding path program 1 times [2021-06-10 11:41:27,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:27,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751192541] [2021-06-10 11:41:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:27,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:27,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:27,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:41:27,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751192541] [2021-06-10 11:41:27,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:27,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:27,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707023395] [2021-06-10 11:41:27,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:27,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:27,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:27,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 782 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:27,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:27,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:27,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:28,316 INFO L129 PetriNetUnfolder]: 53/921 cut-off events. [2021-06-10 11:41:28,317 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:28,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 921 events. 53/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3939 event pairs, 0 based on Foata normal form. 0/836 useless extension candidates. Maximal degree in co-relation 1102. Up to 32 conditions per place. [2021-06-10 11:41:28,369 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/784 dead transitions. [2021-06-10 11:41:28,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 784 transitions, 1881 flow [2021-06-10 11:41:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:28,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:28,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:28,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:28,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:28,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:28,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,373 INFO L185 Difference]: Start difference. First operand has 845 places, 782 transitions, 1851 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:28,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 784 transitions, 1881 flow [2021-06-10 11:41:28,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 784 transitions, 1880 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:28,381 INFO L241 Difference]: Finished difference. Result has 848 places, 784 transitions, 1874 flow [2021-06-10 11:41:28,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1874, PETRI_PLACES=848, PETRI_TRANSITIONS=784} [2021-06-10 11:41:28,381 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 21 predicate places. [2021-06-10 11:41:28,381 INFO L480 AbstractCegarLoop]: Abstraction has has 848 places, 784 transitions, 1874 flow [2021-06-10 11:41:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,381 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:28,381 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:28,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1487 [2021-06-10 11:41:28,382 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 399399761, now seen corresponding path program 1 times [2021-06-10 11:41:28,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:28,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334089941] [2021-06-10 11:41:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:28,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:28,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:28,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:41:28,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334089941] [2021-06-10 11:41:28,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:28,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:28,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505203099] [2021-06-10 11:41:28,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:28,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:28,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:28,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:28,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 784 transitions, 1874 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:28,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:28,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:28,720 INFO L129 PetriNetUnfolder]: 51/922 cut-off events. [2021-06-10 11:41:28,721 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:28,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 922 events. 51/922 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3962 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1102. Up to 32 conditions per place. [2021-06-10 11:41:28,772 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/784 dead transitions. [2021-06-10 11:41:28,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 784 transitions, 1886 flow [2021-06-10 11:41:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:28,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:28,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:28,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:28,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:28,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:28,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,777 INFO L185 Difference]: Start difference. First operand has 848 places, 784 transitions, 1874 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:28,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 784 transitions, 1886 flow [2021-06-10 11:41:28,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 784 transitions, 1881 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:28,784 INFO L241 Difference]: Finished difference. Result has 850 places, 783 transitions, 1870 flow [2021-06-10 11:41:28,785 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1870, PETRI_PLACES=850, PETRI_TRANSITIONS=783} [2021-06-10 11:41:28,785 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 23 predicate places. [2021-06-10 11:41:28,785 INFO L480 AbstractCegarLoop]: Abstraction has has 850 places, 783 transitions, 1870 flow [2021-06-10 11:41:28,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:28,785 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:28,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1488 [2021-06-10 11:41:28,785 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 398447472, now seen corresponding path program 1 times [2021-06-10 11:41:28,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:28,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834683147] [2021-06-10 11:41:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:28,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:28,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:28,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:28,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:41:28,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834683147] [2021-06-10 11:41:28,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:28,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:28,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539517958] [2021-06-10 11:41:28,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:28,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:28,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:28,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 783 transitions, 1870 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:28,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:28,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:28,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:29,115 INFO L129 PetriNetUnfolder]: 51/915 cut-off events. [2021-06-10 11:41:29,115 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:29,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 915 events. 51/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3902 event pairs, 0 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 1096. Up to 32 conditions per place. [2021-06-10 11:41:29,166 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/781 dead transitions. [2021-06-10 11:41:29,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 781 transitions, 1873 flow [2021-06-10 11:41:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:29,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:29,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:29,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:29,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:29,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:29,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,170 INFO L185 Difference]: Start difference. First operand has 850 places, 783 transitions, 1870 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:29,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 781 transitions, 1873 flow [2021-06-10 11:41:29,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 781 transitions, 1866 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:29,178 INFO L241 Difference]: Finished difference. Result has 850 places, 781 transitions, 1859 flow [2021-06-10 11:41:29,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=850, PETRI_TRANSITIONS=781} [2021-06-10 11:41:29,179 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 23 predicate places. [2021-06-10 11:41:29,179 INFO L480 AbstractCegarLoop]: Abstraction has has 850 places, 781 transitions, 1859 flow [2021-06-10 11:41:29,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:29,179 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:29,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1489 [2021-06-10 11:41:29,179 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 398446449, now seen corresponding path program 1 times [2021-06-10 11:41:29,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:29,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333332460] [2021-06-10 11:41:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:29,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:29,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:41:29,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333332460] [2021-06-10 11:41:29,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:29,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:29,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251002100] [2021-06-10 11:41:29,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:29,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:29,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:29,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:29,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 781 transitions, 1859 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:29,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:29,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:29,516 INFO L129 PetriNetUnfolder]: 51/913 cut-off events. [2021-06-10 11:41:29,516 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:29,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 913 events. 51/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3885 event pairs, 0 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1096. Up to 32 conditions per place. [2021-06-10 11:41:29,567 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/779 dead transitions. [2021-06-10 11:41:29,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 779 transitions, 1872 flow [2021-06-10 11:41:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:29,569 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:29,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:29,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:29,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:29,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:29,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,571 INFO L185 Difference]: Start difference. First operand has 850 places, 781 transitions, 1859 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:29,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 779 transitions, 1872 flow [2021-06-10 11:41:29,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 779 transitions, 1871 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:29,579 INFO L241 Difference]: Finished difference. Result has 849 places, 779 transitions, 1855 flow [2021-06-10 11:41:29,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=849, PETRI_TRANSITIONS=779} [2021-06-10 11:41:29,580 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 22 predicate places. [2021-06-10 11:41:29,580 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 779 transitions, 1855 flow [2021-06-10 11:41:29,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:29,580 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:29,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1490 [2021-06-10 11:41:29,580 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1248852897, now seen corresponding path program 1 times [2021-06-10 11:41:29,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:29,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411337142] [2021-06-10 11:41:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:29,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:29,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:41:29,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411337142] [2021-06-10 11:41:29,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:29,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:29,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839747934] [2021-06-10 11:41:29,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:29,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:29,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:29,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 779 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:29,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:29,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:29,912 INFO L129 PetriNetUnfolder]: 50/920 cut-off events. [2021-06-10 11:41:29,912 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:29,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 920 events. 50/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3948 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1101. Up to 32 conditions per place. [2021-06-10 11:41:29,953 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/780 dead transitions. [2021-06-10 11:41:29,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 780 transitions, 1871 flow [2021-06-10 11:41:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:29,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:29,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:29,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:29,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:29,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:29,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,957 INFO L185 Difference]: Start difference. First operand has 849 places, 779 transitions, 1855 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:29,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 780 transitions, 1871 flow [2021-06-10 11:41:29,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 780 transitions, 1870 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:29,964 INFO L241 Difference]: Finished difference. Result has 851 places, 779 transitions, 1859 flow [2021-06-10 11:41:29,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=851, PETRI_TRANSITIONS=779} [2021-06-10 11:41:29,964 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 24 predicate places. [2021-06-10 11:41:29,964 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 779 transitions, 1859 flow [2021-06-10 11:41:29,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,965 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:29,965 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:29,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1491 [2021-06-10 11:41:29,965 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1248853920, now seen corresponding path program 1 times [2021-06-10 11:41:29,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:29,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39318459] [2021-06-10 11:41:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:29,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:29,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:29,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:41:29,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39318459] [2021-06-10 11:41:29,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:29,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:29,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540875093] [2021-06-10 11:41:29,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:29,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:29,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:29,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 779 transitions, 1859 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:29,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:29,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:29,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:30,307 INFO L129 PetriNetUnfolder]: 48/922 cut-off events. [2021-06-10 11:41:30,308 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:30,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 922 events. 48/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3981 event pairs, 0 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 1112. Up to 32 conditions per place. [2021-06-10 11:41:30,359 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/780 dead transitions. [2021-06-10 11:41:30,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 780 transitions, 1885 flow [2021-06-10 11:41:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:30,361 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:30,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:30,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:30,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:30,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:30,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,363 INFO L185 Difference]: Start difference. First operand has 851 places, 779 transitions, 1859 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:30,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 780 transitions, 1885 flow [2021-06-10 11:41:30,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 852 places, 780 transitions, 1884 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:30,371 INFO L241 Difference]: Finished difference. Result has 854 places, 780 transitions, 1876 flow [2021-06-10 11:41:30,371 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=850, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=779, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=854, PETRI_TRANSITIONS=780} [2021-06-10 11:41:30,371 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 27 predicate places. [2021-06-10 11:41:30,371 INFO L480 AbstractCegarLoop]: Abstraction has has 854 places, 780 transitions, 1876 flow [2021-06-10 11:41:30,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:30,372 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:30,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1492 [2021-06-10 11:41:30,372 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1247900608, now seen corresponding path program 1 times [2021-06-10 11:41:30,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:30,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107060162] [2021-06-10 11:41:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:30,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:30,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:30,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:41:30,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107060162] [2021-06-10 11:41:30,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:30,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:30,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003538757] [2021-06-10 11:41:30,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:30,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:30,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:30,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 780 transitions, 1876 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:30,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:30,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:30,704 INFO L129 PetriNetUnfolder]: 48/915 cut-off events. [2021-06-10 11:41:30,704 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:30,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 915 events. 48/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3919 event pairs, 0 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 1098. Up to 32 conditions per place. [2021-06-10 11:41:30,755 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/778 dead transitions. [2021-06-10 11:41:30,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 778 transitions, 1878 flow [2021-06-10 11:41:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:30,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:30,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:30,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:30,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:30,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:30,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,759 INFO L185 Difference]: Start difference. First operand has 854 places, 780 transitions, 1876 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:30,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 856 places, 778 transitions, 1878 flow [2021-06-10 11:41:30,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 853 places, 778 transitions, 1870 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:30,766 INFO L241 Difference]: Finished difference. Result has 854 places, 778 transitions, 1863 flow [2021-06-10 11:41:30,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1863, PETRI_PLACES=854, PETRI_TRANSITIONS=778} [2021-06-10 11:41:30,766 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 27 predicate places. [2021-06-10 11:41:30,766 INFO L480 AbstractCegarLoop]: Abstraction has has 854 places, 778 transitions, 1863 flow [2021-06-10 11:41:30,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,767 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:30,767 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:30,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1493 [2021-06-10 11:41:30,767 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:30,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1247899585, now seen corresponding path program 1 times [2021-06-10 11:41:30,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:30,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114862561] [2021-06-10 11:41:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:30,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:30,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:30,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:30,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:41:30,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114862561] [2021-06-10 11:41:30,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:30,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:30,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831038971] [2021-06-10 11:41:30,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:30,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:30,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:30,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:30,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:30,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 778 transitions, 1863 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:30,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:30,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:30,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:31,094 INFO L129 PetriNetUnfolder]: 48/913 cut-off events. [2021-06-10 11:41:31,094 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:31,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 913 events. 48/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3902 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1102. Up to 32 conditions per place. [2021-06-10 11:41:31,145 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/776 dead transitions. [2021-06-10 11:41:31,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 776 transitions, 1876 flow [2021-06-10 11:41:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:31,146 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:31,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:31,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:31,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:31,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:31,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,149 INFO L185 Difference]: Start difference. First operand has 854 places, 778 transitions, 1863 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:31,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 854 places, 776 transitions, 1876 flow [2021-06-10 11:41:31,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 853 places, 776 transitions, 1875 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:31,156 INFO L241 Difference]: Finished difference. Result has 853 places, 776 transitions, 1859 flow [2021-06-10 11:41:31,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=853, PETRI_TRANSITIONS=776} [2021-06-10 11:41:31,156 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 26 predicate places. [2021-06-10 11:41:31,156 INFO L480 AbstractCegarLoop]: Abstraction has has 853 places, 776 transitions, 1859 flow [2021-06-10 11:41:31,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:31,157 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:31,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1494 [2021-06-10 11:41:31,157 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:31,157 INFO L82 PathProgramCache]: Analyzing trace with hash 46371601, now seen corresponding path program 1 times [2021-06-10 11:41:31,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:31,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089096416] [2021-06-10 11:41:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:31,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:31,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:41:31,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089096416] [2021-06-10 11:41:31,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:31,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:31,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566086223] [2021-06-10 11:41:31,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:31,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:31,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:31,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 776 transitions, 1859 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:31,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:31,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:31,487 INFO L129 PetriNetUnfolder]: 46/918 cut-off events. [2021-06-10 11:41:31,487 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:31,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 918 events. 46/918 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3956 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1105. Up to 32 conditions per place. [2021-06-10 11:41:31,538 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/777 dead transitions. [2021-06-10 11:41:31,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 777 transitions, 1875 flow [2021-06-10 11:41:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:31,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:31,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:31,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:31,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:31,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:31,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,542 INFO L185 Difference]: Start difference. First operand has 853 places, 776 transitions, 1859 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:31,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 777 transitions, 1875 flow [2021-06-10 11:41:31,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 854 places, 777 transitions, 1874 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:31,549 INFO L241 Difference]: Finished difference. Result has 856 places, 777 transitions, 1872 flow [2021-06-10 11:41:31,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1872, PETRI_PLACES=856, PETRI_TRANSITIONS=777} [2021-06-10 11:41:31,550 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 29 predicate places. [2021-06-10 11:41:31,550 INFO L480 AbstractCegarLoop]: Abstraction has has 856 places, 777 transitions, 1872 flow [2021-06-10 11:41:31,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,550 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:31,550 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:31,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1495 [2021-06-10 11:41:31,550 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 46370578, now seen corresponding path program 1 times [2021-06-10 11:41:31,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:31,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168839145] [2021-06-10 11:41:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:31,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:31,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:41:31,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168839145] [2021-06-10 11:41:31,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:31,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:31,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355206254] [2021-06-10 11:41:31,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:31,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:31,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:31,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 777 transitions, 1872 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:31,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:31,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:31,891 INFO L129 PetriNetUnfolder]: 46/919 cut-off events. [2021-06-10 11:41:31,891 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:31,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 919 events. 46/919 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3964 event pairs, 0 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 1113. Up to 32 conditions per place. [2021-06-10 11:41:31,932 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/778 dead transitions. [2021-06-10 11:41:31,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 778 transitions, 1898 flow [2021-06-10 11:41:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:31,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:31,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:31,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:31,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:31,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:31,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,936 INFO L185 Difference]: Start difference. First operand has 856 places, 777 transitions, 1872 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:31,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 778 transitions, 1898 flow [2021-06-10 11:41:31,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 778 transitions, 1896 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:31,943 INFO L241 Difference]: Finished difference. Result has 859 places, 778 transitions, 1888 flow [2021-06-10 11:41:31,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=855, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1888, PETRI_PLACES=859, PETRI_TRANSITIONS=778} [2021-06-10 11:41:31,944 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 32 predicate places. [2021-06-10 11:41:31,944 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 778 transitions, 1888 flow [2021-06-10 11:41:31,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:31,944 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:31,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1496 [2021-06-10 11:41:31,944 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash 47323890, now seen corresponding path program 1 times [2021-06-10 11:41:31,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:31,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140136594] [2021-06-10 11:41:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:31,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:31,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:31,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:41:31,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140136594] [2021-06-10 11:41:31,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:31,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:31,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610489710] [2021-06-10 11:41:31,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:31,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:31,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:31,964 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:31,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 778 transitions, 1888 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:31,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:31,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:31,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:32,284 INFO L129 PetriNetUnfolder]: 45/915 cut-off events. [2021-06-10 11:41:32,284 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:32,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 915 events. 45/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3940 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1106. Up to 32 conditions per place. [2021-06-10 11:41:32,337 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/775 dead transitions. [2021-06-10 11:41:32,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 775 transitions, 1885 flow [2021-06-10 11:41:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:32,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:32,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:32,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:32,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:32,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:32,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,341 INFO L185 Difference]: Start difference. First operand has 859 places, 778 transitions, 1888 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:32,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 775 transitions, 1885 flow [2021-06-10 11:41:32,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 775 transitions, 1877 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:32,349 INFO L241 Difference]: Finished difference. Result has 858 places, 775 transitions, 1867 flow [2021-06-10 11:41:32,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=858, PETRI_TRANSITIONS=775} [2021-06-10 11:41:32,349 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 31 predicate places. [2021-06-10 11:41:32,349 INFO L480 AbstractCegarLoop]: Abstraction has has 858 places, 775 transitions, 1867 flow [2021-06-10 11:41:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:32,350 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:32,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1497 [2021-06-10 11:41:32,350 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 47324913, now seen corresponding path program 1 times [2021-06-10 11:41:32,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:32,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516688748] [2021-06-10 11:41:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:32,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:32,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:32,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:41:32,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516688748] [2021-06-10 11:41:32,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:32,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:32,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768749564] [2021-06-10 11:41:32,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:32,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:32,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:32,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 775 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:32,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:32,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:32,689 INFO L129 PetriNetUnfolder]: 45/913 cut-off events. [2021-06-10 11:41:32,689 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:32,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 913 events. 45/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3925 event pairs, 0 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1109. Up to 32 conditions per place. [2021-06-10 11:41:32,739 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/773 dead transitions. [2021-06-10 11:41:32,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 773 transitions, 1880 flow [2021-06-10 11:41:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:32,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:32,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:32,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:32,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:32,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:32,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,744 INFO L185 Difference]: Start difference. First operand has 858 places, 775 transitions, 1867 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 773 transitions, 1880 flow [2021-06-10 11:41:32,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 773 transitions, 1879 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:32,751 INFO L241 Difference]: Finished difference. Result has 857 places, 773 transitions, 1863 flow [2021-06-10 11:41:32,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=855, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1863, PETRI_PLACES=857, PETRI_TRANSITIONS=773} [2021-06-10 11:41:32,751 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 30 predicate places. [2021-06-10 11:41:32,751 INFO L480 AbstractCegarLoop]: Abstraction has has 857 places, 773 transitions, 1863 flow [2021-06-10 11:41:32,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:32,752 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:32,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1498 [2021-06-10 11:41:32,752 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1146101956, now seen corresponding path program 1 times [2021-06-10 11:41:32,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:32,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913946098] [2021-06-10 11:41:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:32,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:32,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:32,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:32,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:41:32,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913946098] [2021-06-10 11:41:32,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:32,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:32,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562426319] [2021-06-10 11:41:32,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:32,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:32,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:32,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 773 transitions, 1863 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:32,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:32,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:32,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:33,095 INFO L129 PetriNetUnfolder]: 44/920 cut-off events. [2021-06-10 11:41:33,095 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:33,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 920 events. 44/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3980 event pairs, 0 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1114. Up to 32 conditions per place. [2021-06-10 11:41:33,147 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/774 dead transitions. [2021-06-10 11:41:33,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 774 transitions, 1879 flow [2021-06-10 11:41:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:33,149 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:33,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:33,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:33,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:33,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:33,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,151 INFO L185 Difference]: Start difference. First operand has 857 places, 773 transitions, 1863 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:33,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 774 transitions, 1879 flow [2021-06-10 11:41:33,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 774 transitions, 1878 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:33,159 INFO L241 Difference]: Finished difference. Result has 859 places, 773 transitions, 1867 flow [2021-06-10 11:41:33,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=859, PETRI_TRANSITIONS=773} [2021-06-10 11:41:33,159 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 32 predicate places. [2021-06-10 11:41:33,159 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 773 transitions, 1867 flow [2021-06-10 11:41:33,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:33,160 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:33,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1499 [2021-06-10 11:41:33,160 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1146102979, now seen corresponding path program 1 times [2021-06-10 11:41:33,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:33,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310566828] [2021-06-10 11:41:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:33,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:33,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:33,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:41:33,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310566828] [2021-06-10 11:41:33,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:33,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:33,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707978646] [2021-06-10 11:41:33,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:33,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:33,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:33,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 773 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:33,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:33,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:33,521 INFO L129 PetriNetUnfolder]: 42/922 cut-off events. [2021-06-10 11:41:33,521 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:33,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 922 events. 42/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4016 event pairs, 0 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1125. Up to 32 conditions per place. [2021-06-10 11:41:33,574 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/774 dead transitions. [2021-06-10 11:41:33,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 774 transitions, 1893 flow [2021-06-10 11:41:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:33,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:33,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:33,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:33,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:33,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:33,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,578 INFO L185 Difference]: Start difference. First operand has 859 places, 773 transitions, 1867 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 774 transitions, 1893 flow [2021-06-10 11:41:33,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 860 places, 774 transitions, 1892 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:33,586 INFO L241 Difference]: Finished difference. Result has 862 places, 774 transitions, 1884 flow [2021-06-10 11:41:33,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=858, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1884, PETRI_PLACES=862, PETRI_TRANSITIONS=774} [2021-06-10 11:41:33,587 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 35 predicate places. [2021-06-10 11:41:33,587 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 774 transitions, 1884 flow [2021-06-10 11:41:33,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:33,587 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:33,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1500 [2021-06-10 11:41:33,587 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:33,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:33,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1145149667, now seen corresponding path program 1 times [2021-06-10 11:41:33,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:33,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214134155] [2021-06-10 11:41:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:33,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:33,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:33,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:33,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:41:33,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214134155] [2021-06-10 11:41:33,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:33,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:33,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297715375] [2021-06-10 11:41:33,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:33,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:33,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:33,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 774 transitions, 1884 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:33,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:33,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:33,934 INFO L129 PetriNetUnfolder]: 42/915 cut-off events. [2021-06-10 11:41:33,934 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:33,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 915 events. 42/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3955 event pairs, 0 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 1111. Up to 32 conditions per place. [2021-06-10 11:41:33,974 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/772 dead transitions. [2021-06-10 11:41:33,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 772 transitions, 1886 flow [2021-06-10 11:41:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:33,976 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:33,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:33,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:33,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:33,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:33,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,979 INFO L185 Difference]: Start difference. First operand has 862 places, 774 transitions, 1884 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:33,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 772 transitions, 1886 flow [2021-06-10 11:41:33,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 861 places, 772 transitions, 1878 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:33,986 INFO L241 Difference]: Finished difference. Result has 862 places, 772 transitions, 1871 flow [2021-06-10 11:41:33,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=859, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1871, PETRI_PLACES=862, PETRI_TRANSITIONS=772} [2021-06-10 11:41:33,986 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 35 predicate places. [2021-06-10 11:41:33,987 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 772 transitions, 1871 flow [2021-06-10 11:41:33,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:33,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:33,987 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:33,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1501 [2021-06-10 11:41:33,987 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1145148644, now seen corresponding path program 1 times [2021-06-10 11:41:33,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:33,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14365883] [2021-06-10 11:41:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:34,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:34,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:41:34,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14365883] [2021-06-10 11:41:34,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:34,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:34,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213963206] [2021-06-10 11:41:34,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:34,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:34,008 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:34,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 772 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:34,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:34,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:34,329 INFO L129 PetriNetUnfolder]: 42/913 cut-off events. [2021-06-10 11:41:34,329 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:34,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 913 events. 42/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3939 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1115. Up to 32 conditions per place. [2021-06-10 11:41:34,382 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/770 dead transitions. [2021-06-10 11:41:34,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 770 transitions, 1884 flow [2021-06-10 11:41:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:34,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:34,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:34,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:34,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:34,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:34,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,387 INFO L185 Difference]: Start difference. First operand has 862 places, 772 transitions, 1871 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:34,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 770 transitions, 1884 flow [2021-06-10 11:41:34,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 861 places, 770 transitions, 1883 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:34,395 INFO L241 Difference]: Finished difference. Result has 861 places, 770 transitions, 1867 flow [2021-06-10 11:41:34,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=859, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=861, PETRI_TRANSITIONS=770} [2021-06-10 11:41:34,395 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 34 predicate places. [2021-06-10 11:41:34,395 INFO L480 AbstractCegarLoop]: Abstraction has has 861 places, 770 transitions, 1867 flow [2021-06-10 11:41:34,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:34,395 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:34,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1502 [2021-06-10 11:41:34,395 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1765364663, now seen corresponding path program 1 times [2021-06-10 11:41:34,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:34,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917591735] [2021-06-10 11:41:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:34,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:34,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:41:34,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917591735] [2021-06-10 11:41:34,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:34,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:34,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439112313] [2021-06-10 11:41:34,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:34,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:34,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:34,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:34,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 770 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:34,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:34,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:34,754 INFO L129 PetriNetUnfolder]: 41/921 cut-off events. [2021-06-10 11:41:34,754 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:34,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 921 events. 41/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4011 event pairs, 0 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 1127. Up to 32 conditions per place. [2021-06-10 11:41:34,808 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/772 dead transitions. [2021-06-10 11:41:34,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 772 transitions, 1897 flow [2021-06-10 11:41:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:34,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:34,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:34,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:34,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:34,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:34,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,812 INFO L185 Difference]: Start difference. First operand has 861 places, 770 transitions, 1867 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:34,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 772 transitions, 1897 flow [2021-06-10 11:41:34,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 862 places, 772 transitions, 1896 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:34,820 INFO L241 Difference]: Finished difference. Result has 864 places, 772 transitions, 1890 flow [2021-06-10 11:41:34,820 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1890, PETRI_PLACES=864, PETRI_TRANSITIONS=772} [2021-06-10 11:41:34,820 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 37 predicate places. [2021-06-10 11:41:34,820 INFO L480 AbstractCegarLoop]: Abstraction has has 864 places, 772 transitions, 1890 flow [2021-06-10 11:41:34,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:34,821 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:34,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1503 [2021-06-10 11:41:34,821 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1765365686, now seen corresponding path program 1 times [2021-06-10 11:41:34,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:34,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298741676] [2021-06-10 11:41:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:34,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:34,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:34,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:41:34,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298741676] [2021-06-10 11:41:34,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:34,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:34,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52396107] [2021-06-10 11:41:34,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:34,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:34,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:34,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 864 places, 772 transitions, 1890 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:34,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:34,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:34,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:35,175 INFO L129 PetriNetUnfolder]: 40/919 cut-off events. [2021-06-10 11:41:35,175 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:35,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 919 events. 40/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3999 event pairs, 0 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1124. Up to 32 conditions per place. [2021-06-10 11:41:35,230 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/772 dead transitions. [2021-06-10 11:41:35,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 772 transitions, 1902 flow [2021-06-10 11:41:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:35,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:35,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:35,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:35,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:35,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:35,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,234 INFO L185 Difference]: Start difference. First operand has 864 places, 772 transitions, 1890 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 866 places, 772 transitions, 1902 flow [2021-06-10 11:41:35,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 865 places, 772 transitions, 1897 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:35,243 INFO L241 Difference]: Finished difference. Result has 867 places, 772 transitions, 1895 flow [2021-06-10 11:41:35,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=863, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=867, PETRI_TRANSITIONS=772} [2021-06-10 11:41:35,243 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 40 predicate places. [2021-06-10 11:41:35,243 INFO L480 AbstractCegarLoop]: Abstraction has has 867 places, 772 transitions, 1895 flow [2021-06-10 11:41:35,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:35,256 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:35,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1504 [2021-06-10 11:41:35,257 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1766317975, now seen corresponding path program 1 times [2021-06-10 11:41:35,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:35,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107762770] [2021-06-10 11:41:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:35,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:35,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:35,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:41:35,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107762770] [2021-06-10 11:41:35,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:35,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:35,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48250285] [2021-06-10 11:41:35,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:35,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:35,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:35,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 867 places, 772 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:35,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:35,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:35,621 INFO L129 PetriNetUnfolder]: 39/915 cut-off events. [2021-06-10 11:41:35,621 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:35,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 915 events. 39/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3974 event pairs, 0 based on Foata normal form. 1/847 useless extension candidates. Maximal degree in co-relation 1121. Up to 32 conditions per place. [2021-06-10 11:41:35,677 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/769 dead transitions. [2021-06-10 11:41:35,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 769 transitions, 1892 flow [2021-06-10 11:41:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:35,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:35,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:35,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:35,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:35,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:35,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,681 INFO L185 Difference]: Start difference. First operand has 867 places, 772 transitions, 1895 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:35,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 769 transitions, 1892 flow [2021-06-10 11:41:35,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 769 transitions, 1885 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:35,689 INFO L241 Difference]: Finished difference. Result has 866 places, 769 transitions, 1875 flow [2021-06-10 11:41:35,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=866, PETRI_TRANSITIONS=769} [2021-06-10 11:41:35,689 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 39 predicate places. [2021-06-10 11:41:35,689 INFO L480 AbstractCegarLoop]: Abstraction has has 866 places, 769 transitions, 1875 flow [2021-06-10 11:41:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:35,689 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:35,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1505 [2021-06-10 11:41:35,689 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1766318998, now seen corresponding path program 1 times [2021-06-10 11:41:35,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:35,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824743737] [2021-06-10 11:41:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:35,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:35,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:35,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:35,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:41:35,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824743737] [2021-06-10 11:41:35,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:35,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:35,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315542960] [2021-06-10 11:41:35,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:35,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:35,711 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:35,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 769 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:35,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:35,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:35,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:36,041 INFO L129 PetriNetUnfolder]: 39/913 cut-off events. [2021-06-10 11:41:36,041 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:36,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 913 events. 39/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3959 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1122. Up to 32 conditions per place. [2021-06-10 11:41:36,084 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/767 dead transitions. [2021-06-10 11:41:36,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 767 transitions, 1888 flow [2021-06-10 11:41:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:36,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:36,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:36,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:36,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:36,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:36,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,088 INFO L185 Difference]: Start difference. First operand has 866 places, 769 transitions, 1875 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 866 places, 767 transitions, 1888 flow [2021-06-10 11:41:36,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 865 places, 767 transitions, 1887 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:36,095 INFO L241 Difference]: Finished difference. Result has 865 places, 767 transitions, 1871 flow [2021-06-10 11:41:36,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=863, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1871, PETRI_PLACES=865, PETRI_TRANSITIONS=767} [2021-06-10 11:41:36,095 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 38 predicate places. [2021-06-10 11:41:36,095 INFO L480 AbstractCegarLoop]: Abstraction has has 865 places, 767 transitions, 1871 flow [2021-06-10 11:41:36,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:36,096 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:36,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1506 [2021-06-10 11:41:36,096 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1091421429, now seen corresponding path program 1 times [2021-06-10 11:41:36,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:36,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776136496] [2021-06-10 11:41:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:36,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:36,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:36,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:41:36,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776136496] [2021-06-10 11:41:36,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:36,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:36,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960082141] [2021-06-10 11:41:36,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:36,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:36,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:36,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 865 places, 767 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:36,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:36,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:36,462 INFO L129 PetriNetUnfolder]: 38/921 cut-off events. [2021-06-10 11:41:36,463 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:36,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 921 events. 38/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4029 event pairs, 0 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1134. Up to 32 conditions per place. [2021-06-10 11:41:36,515 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/769 dead transitions. [2021-06-10 11:41:36,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 769 transitions, 1901 flow [2021-06-10 11:41:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:36,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:36,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:36,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:36,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:36,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:36,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,519 INFO L185 Difference]: Start difference. First operand has 865 places, 767 transitions, 1871 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 769 transitions, 1901 flow [2021-06-10 11:41:36,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 769 transitions, 1900 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:36,527 INFO L241 Difference]: Finished difference. Result has 868 places, 769 transitions, 1894 flow [2021-06-10 11:41:36,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1894, PETRI_PLACES=868, PETRI_TRANSITIONS=769} [2021-06-10 11:41:36,527 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 41 predicate places. [2021-06-10 11:41:36,527 INFO L480 AbstractCegarLoop]: Abstraction has has 868 places, 769 transitions, 1894 flow [2021-06-10 11:41:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:36,528 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:36,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1507 [2021-06-10 11:41:36,528 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1091420406, now seen corresponding path program 1 times [2021-06-10 11:41:36,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:36,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884023396] [2021-06-10 11:41:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:36,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:36,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:36,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:41:36,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884023396] [2021-06-10 11:41:36,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:36,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:36,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822804630] [2021-06-10 11:41:36,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:36,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:36,549 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:36,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 868 places, 769 transitions, 1894 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:36,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:36,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:36,905 INFO L129 PetriNetUnfolder]: 37/919 cut-off events. [2021-06-10 11:41:36,905 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:36,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 919 events. 37/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4013 event pairs, 0 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1131. Up to 32 conditions per place. [2021-06-10 11:41:36,958 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/769 dead transitions. [2021-06-10 11:41:36,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 769 transitions, 1906 flow [2021-06-10 11:41:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:36,960 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:36,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:36,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:36,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:36,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,963 INFO L185 Difference]: Start difference. First operand has 868 places, 769 transitions, 1894 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:36,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 769 transitions, 1906 flow [2021-06-10 11:41:36,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 869 places, 769 transitions, 1901 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:36,971 INFO L241 Difference]: Finished difference. Result has 871 places, 769 transitions, 1899 flow [2021-06-10 11:41:36,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=871, PETRI_TRANSITIONS=769} [2021-06-10 11:41:36,971 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 44 predicate places. [2021-06-10 11:41:36,972 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 769 transitions, 1899 flow [2021-06-10 11:41:36,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:36,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:36,972 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:36,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1508 [2021-06-10 11:41:36,972 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:36,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1090468117, now seen corresponding path program 1 times [2021-06-10 11:41:36,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:36,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548303110] [2021-06-10 11:41:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:36,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:36,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:36,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:37,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:41:37,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548303110] [2021-06-10 11:41:37,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:37,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:37,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387435564] [2021-06-10 11:41:37,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:37,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:37,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:37,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:37,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 769 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:37,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:37,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:37,353 INFO L129 PetriNetUnfolder]: 36/915 cut-off events. [2021-06-10 11:41:37,353 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:37,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 915 events. 36/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3989 event pairs, 0 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 1128. Up to 32 conditions per place. [2021-06-10 11:41:37,405 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/766 dead transitions. [2021-06-10 11:41:37,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 766 transitions, 1896 flow [2021-06-10 11:41:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:37,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:37,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:37,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:37,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:37,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:37,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,409 INFO L185 Difference]: Start difference. First operand has 871 places, 769 transitions, 1899 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:37,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 766 transitions, 1896 flow [2021-06-10 11:41:37,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 766 transitions, 1889 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:37,416 INFO L241 Difference]: Finished difference. Result has 870 places, 766 transitions, 1879 flow [2021-06-10 11:41:37,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=870, PETRI_TRANSITIONS=766} [2021-06-10 11:41:37,417 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 43 predicate places. [2021-06-10 11:41:37,417 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 766 transitions, 1879 flow [2021-06-10 11:41:37,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:37,417 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:37,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1509 [2021-06-10 11:41:37,417 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1090467094, now seen corresponding path program 1 times [2021-06-10 11:41:37,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:37,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411297820] [2021-06-10 11:41:37,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:37,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:37,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:37,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:41:37,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411297820] [2021-06-10 11:41:37,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:37,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:37,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696394564] [2021-06-10 11:41:37,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:37,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:37,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:37,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 766 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:37,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:37,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:37,787 INFO L129 PetriNetUnfolder]: 36/913 cut-off events. [2021-06-10 11:41:37,788 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:37,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 913 events. 36/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3973 event pairs, 0 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 1129. Up to 32 conditions per place. [2021-06-10 11:41:37,840 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/764 dead transitions. [2021-06-10 11:41:37,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 764 transitions, 1892 flow [2021-06-10 11:41:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:37,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:37,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:37,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:37,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:37,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:37,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,844 INFO L185 Difference]: Start difference. First operand has 870 places, 766 transitions, 1879 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:37,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 764 transitions, 1892 flow [2021-06-10 11:41:37,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 869 places, 764 transitions, 1891 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:37,852 INFO L241 Difference]: Finished difference. Result has 869 places, 764 transitions, 1875 flow [2021-06-10 11:41:37,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=869, PETRI_TRANSITIONS=764} [2021-06-10 11:41:37,852 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 42 predicate places. [2021-06-10 11:41:37,852 INFO L480 AbstractCegarLoop]: Abstraction has has 869 places, 764 transitions, 1875 flow [2021-06-10 11:41:37,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:37,853 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:37,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1510 [2021-06-10 11:41:37,853 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash 125654880, now seen corresponding path program 1 times [2021-06-10 11:41:37,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:37,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380576647] [2021-06-10 11:41:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:37,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:37,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:37,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:37,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:41:37,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380576647] [2021-06-10 11:41:37,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:37,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:37,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72164838] [2021-06-10 11:41:37,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:37,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:37,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:37,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 869 places, 764 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:37,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:37,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:37,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:38,219 INFO L129 PetriNetUnfolder]: 35/921 cut-off events. [2021-06-10 11:41:38,219 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:38,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 921 events. 35/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4047 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1141. Up to 32 conditions per place. [2021-06-10 11:41:38,264 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/766 dead transitions. [2021-06-10 11:41:38,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 766 transitions, 1905 flow [2021-06-10 11:41:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:38,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:38,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:38,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:38,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:38,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:38,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,268 INFO L185 Difference]: Start difference. First operand has 869 places, 764 transitions, 1875 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:38,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 766 transitions, 1905 flow [2021-06-10 11:41:38,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 766 transitions, 1904 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:38,275 INFO L241 Difference]: Finished difference. Result has 872 places, 766 transitions, 1898 flow [2021-06-10 11:41:38,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1898, PETRI_PLACES=872, PETRI_TRANSITIONS=766} [2021-06-10 11:41:38,276 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 45 predicate places. [2021-06-10 11:41:38,276 INFO L480 AbstractCegarLoop]: Abstraction has has 872 places, 766 transitions, 1898 flow [2021-06-10 11:41:38,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:38,276 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:38,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1511 [2021-06-10 11:41:38,276 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash 125655903, now seen corresponding path program 1 times [2021-06-10 11:41:38,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:38,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214267368] [2021-06-10 11:41:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:38,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:38,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:38,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:41:38,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214267368] [2021-06-10 11:41:38,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:38,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:38,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213276839] [2021-06-10 11:41:38,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:38,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:38,297 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:38,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 872 places, 766 transitions, 1898 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:38,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:38,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:38,640 INFO L129 PetriNetUnfolder]: 34/919 cut-off events. [2021-06-10 11:41:38,641 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:38,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 919 events. 34/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4035 event pairs, 0 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1138. Up to 32 conditions per place. [2021-06-10 11:41:38,693 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/766 dead transitions. [2021-06-10 11:41:38,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 874 places, 766 transitions, 1910 flow [2021-06-10 11:41:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:38,695 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:38,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:38,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:38,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:38,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:38,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,697 INFO L185 Difference]: Start difference. First operand has 872 places, 766 transitions, 1898 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:38,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 874 places, 766 transitions, 1910 flow [2021-06-10 11:41:38,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 873 places, 766 transitions, 1905 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:38,705 INFO L241 Difference]: Finished difference. Result has 875 places, 766 transitions, 1903 flow [2021-06-10 11:41:38,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=871, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=875, PETRI_TRANSITIONS=766} [2021-06-10 11:41:38,706 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 48 predicate places. [2021-06-10 11:41:38,706 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 766 transitions, 1903 flow [2021-06-10 11:41:38,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,706 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:38,706 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:38,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1512 [2021-06-10 11:41:38,706 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 126608192, now seen corresponding path program 1 times [2021-06-10 11:41:38,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:38,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521099564] [2021-06-10 11:41:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:38,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:38,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:38,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:38,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:41:38,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521099564] [2021-06-10 11:41:38,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:38,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:38,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566541031] [2021-06-10 11:41:38,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:38,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:38,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:38,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 766 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:38,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:38,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:38,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:39,060 INFO L129 PetriNetUnfolder]: 33/915 cut-off events. [2021-06-10 11:41:39,060 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:39,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 915 events. 33/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4010 event pairs, 0 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 1135. Up to 32 conditions per place. [2021-06-10 11:41:39,110 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/763 dead transitions. [2021-06-10 11:41:39,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 763 transitions, 1900 flow [2021-06-10 11:41:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:39,112 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:39,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:39,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:39,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:39,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:39,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,115 INFO L185 Difference]: Start difference. First operand has 875 places, 766 transitions, 1903 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:39,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 763 transitions, 1900 flow [2021-06-10 11:41:39,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 763 transitions, 1893 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:39,122 INFO L241 Difference]: Finished difference. Result has 874 places, 763 transitions, 1883 flow [2021-06-10 11:41:39,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1883, PETRI_PLACES=874, PETRI_TRANSITIONS=763} [2021-06-10 11:41:39,122 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 47 predicate places. [2021-06-10 11:41:39,122 INFO L480 AbstractCegarLoop]: Abstraction has has 874 places, 763 transitions, 1883 flow [2021-06-10 11:41:39,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,123 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:39,123 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:39,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1513 [2021-06-10 11:41:39,123 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 126609215, now seen corresponding path program 1 times [2021-06-10 11:41:39,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:39,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333848927] [2021-06-10 11:41:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:39,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:39,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:41:39,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333848927] [2021-06-10 11:41:39,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:39,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:39,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678517405] [2021-06-10 11:41:39,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:39,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:39,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:39,145 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:39,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 763 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:39,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:39,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:39,484 INFO L129 PetriNetUnfolder]: 33/913 cut-off events. [2021-06-10 11:41:39,484 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:39,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 913 events. 33/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3995 event pairs, 0 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1136. Up to 32 conditions per place. [2021-06-10 11:41:39,536 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/761 dead transitions. [2021-06-10 11:41:39,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 874 places, 761 transitions, 1896 flow [2021-06-10 11:41:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:39,538 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:39,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:39,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:39,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:39,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:39,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,540 INFO L185 Difference]: Start difference. First operand has 874 places, 763 transitions, 1883 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:39,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 874 places, 761 transitions, 1896 flow [2021-06-10 11:41:39,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 873 places, 761 transitions, 1895 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:39,548 INFO L241 Difference]: Finished difference. Result has 873 places, 761 transitions, 1879 flow [2021-06-10 11:41:39,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=871, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=873, PETRI_TRANSITIONS=761} [2021-06-10 11:41:39,548 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 46 predicate places. [2021-06-10 11:41:39,548 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 761 transitions, 1879 flow [2021-06-10 11:41:39,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:39,548 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:39,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1514 [2021-06-10 11:41:39,548 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 925918998, now seen corresponding path program 1 times [2021-06-10 11:41:39,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:39,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597570289] [2021-06-10 11:41:39,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:39,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:39,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:41:39,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597570289] [2021-06-10 11:41:39,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:39,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:39,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844553728] [2021-06-10 11:41:39,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:39,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:39,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:39,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 761 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:39,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:39,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:39,912 INFO L129 PetriNetUnfolder]: 32/920 cut-off events. [2021-06-10 11:41:39,913 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:39,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 920 events. 32/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4050 event pairs, 0 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 1141. Up to 32 conditions per place. [2021-06-10 11:41:39,964 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/762 dead transitions. [2021-06-10 11:41:39,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 762 transitions, 1895 flow [2021-06-10 11:41:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:39,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:39,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:39,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:39,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:39,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:39,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,968 INFO L185 Difference]: Start difference. First operand has 873 places, 761 transitions, 1879 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:39,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 762 transitions, 1895 flow [2021-06-10 11:41:39,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 762 transitions, 1894 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:39,975 INFO L241 Difference]: Finished difference. Result has 875 places, 761 transitions, 1883 flow [2021-06-10 11:41:39,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1883, PETRI_PLACES=875, PETRI_TRANSITIONS=761} [2021-06-10 11:41:39,976 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 48 predicate places. [2021-06-10 11:41:39,976 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 761 transitions, 1883 flow [2021-06-10 11:41:39,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:39,976 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:39,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1515 [2021-06-10 11:41:39,976 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 925920021, now seen corresponding path program 1 times [2021-06-10 11:41:39,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:39,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726089274] [2021-06-10 11:41:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:39,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:39,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:39,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:41:39,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726089274] [2021-06-10 11:41:39,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:39,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:39,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982672991] [2021-06-10 11:41:39,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:39,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:39,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:39,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:39,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 761 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:39,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:39,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:39,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:40,347 INFO L129 PetriNetUnfolder]: 30/922 cut-off events. [2021-06-10 11:41:40,348 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:40,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 922 events. 30/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4086 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1152. Up to 32 conditions per place. [2021-06-10 11:41:40,394 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/762 dead transitions. [2021-06-10 11:41:40,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 762 transitions, 1909 flow [2021-06-10 11:41:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:40,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:40,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:40,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:40,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:40,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:40,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,399 INFO L185 Difference]: Start difference. First operand has 875 places, 761 transitions, 1883 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:40,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 762 transitions, 1909 flow [2021-06-10 11:41:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 876 places, 762 transitions, 1908 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:40,406 INFO L241 Difference]: Finished difference. Result has 878 places, 762 transitions, 1900 flow [2021-06-10 11:41:40,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=874, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1900, PETRI_PLACES=878, PETRI_TRANSITIONS=762} [2021-06-10 11:41:40,406 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 51 predicate places. [2021-06-10 11:41:40,406 INFO L480 AbstractCegarLoop]: Abstraction has has 878 places, 762 transitions, 1900 flow [2021-06-10 11:41:40,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,406 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:40,407 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:40,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1516 [2021-06-10 11:41:40,407 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash 924966709, now seen corresponding path program 1 times [2021-06-10 11:41:40,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:40,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267228463] [2021-06-10 11:41:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:40,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:40,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:40,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:41:40,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267228463] [2021-06-10 11:41:40,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:40,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:40,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162348954] [2021-06-10 11:41:40,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:40,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:40,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:40,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 762 transitions, 1900 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:40,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:40,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:40,762 INFO L129 PetriNetUnfolder]: 30/915 cut-off events. [2021-06-10 11:41:40,762 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:40,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 915 events. 30/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4024 event pairs, 0 based on Foata normal form. 1/856 useless extension candidates. Maximal degree in co-relation 1138. Up to 32 conditions per place. [2021-06-10 11:41:40,813 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/760 dead transitions. [2021-06-10 11:41:40,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 760 transitions, 1902 flow [2021-06-10 11:41:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:40,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:40,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:40,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:40,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:40,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:40,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,817 INFO L185 Difference]: Start difference. First operand has 878 places, 762 transitions, 1900 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:40,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 760 transitions, 1902 flow [2021-06-10 11:41:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 877 places, 760 transitions, 1894 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:40,824 INFO L241 Difference]: Finished difference. Result has 878 places, 760 transitions, 1887 flow [2021-06-10 11:41:40,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=875, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=878, PETRI_TRANSITIONS=760} [2021-06-10 11:41:40,825 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 51 predicate places. [2021-06-10 11:41:40,825 INFO L480 AbstractCegarLoop]: Abstraction has has 878 places, 760 transitions, 1887 flow [2021-06-10 11:41:40,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:40,825 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:40,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1517 [2021-06-10 11:41:40,825 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 924965686, now seen corresponding path program 1 times [2021-06-10 11:41:40,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:40,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780999023] [2021-06-10 11:41:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:40,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:40,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:40,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:40,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:41:40,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780999023] [2021-06-10 11:41:40,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:40,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:40,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592856783] [2021-06-10 11:41:40,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:40,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:40,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:40,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 760 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:40,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:40,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:40,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:41,185 INFO L129 PetriNetUnfolder]: 30/913 cut-off events. [2021-06-10 11:41:41,185 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:41,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 913 events. 30/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4007 event pairs, 0 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1142. Up to 32 conditions per place. [2021-06-10 11:41:41,235 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/758 dead transitions. [2021-06-10 11:41:41,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 878 places, 758 transitions, 1900 flow [2021-06-10 11:41:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:41,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:41,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:41,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:41,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:41,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:41,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,239 INFO L185 Difference]: Start difference. First operand has 878 places, 760 transitions, 1887 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:41,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 878 places, 758 transitions, 1900 flow [2021-06-10 11:41:41,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 877 places, 758 transitions, 1899 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:41,247 INFO L241 Difference]: Finished difference. Result has 877 places, 758 transitions, 1883 flow [2021-06-10 11:41:41,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=875, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1883, PETRI_PLACES=877, PETRI_TRANSITIONS=758} [2021-06-10 11:41:41,247 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 50 predicate places. [2021-06-10 11:41:41,247 INFO L480 AbstractCegarLoop]: Abstraction has has 877 places, 758 transitions, 1883 flow [2021-06-10 11:41:41,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:41,247 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:41,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1518 [2021-06-10 11:41:41,247 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1971908371, now seen corresponding path program 1 times [2021-06-10 11:41:41,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:41,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549394296] [2021-06-10 11:41:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:41,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:41,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:41,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:41,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549394296] [2021-06-10 11:41:41,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:41,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:41,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139266087] [2021-06-10 11:41:41,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:41,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:41,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:41,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 758 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:41,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:41,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:41,614 INFO L129 PetriNetUnfolder]: 29/920 cut-off events. [2021-06-10 11:41:41,614 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:41,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 920 events. 29/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4071 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1147. Up to 32 conditions per place. [2021-06-10 11:41:41,665 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/759 dead transitions. [2021-06-10 11:41:41,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 759 transitions, 1899 flow [2021-06-10 11:41:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:41,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:41,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:41,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:41,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:41,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:41,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,669 INFO L185 Difference]: Start difference. First operand has 877 places, 758 transitions, 1883 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:41,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 759 transitions, 1899 flow [2021-06-10 11:41:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 878 places, 759 transitions, 1898 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:41,676 INFO L241 Difference]: Finished difference. Result has 879 places, 758 transitions, 1887 flow [2021-06-10 11:41:41,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=879, PETRI_TRANSITIONS=758} [2021-06-10 11:41:41,676 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 52 predicate places. [2021-06-10 11:41:41,676 INFO L480 AbstractCegarLoop]: Abstraction has has 879 places, 758 transitions, 1887 flow [2021-06-10 11:41:41,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:41,677 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:41,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1519 [2021-06-10 11:41:41,677 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1971907348, now seen corresponding path program 1 times [2021-06-10 11:41:41,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:41,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380754654] [2021-06-10 11:41:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:41,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:41,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:41,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:41,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:41,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380754654] [2021-06-10 11:41:41,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:41,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:41,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258873650] [2021-06-10 11:41:41,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:41,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:41,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:41,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 758 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:41,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:41,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:41,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:42,060 INFO L129 PetriNetUnfolder]: 27/922 cut-off events. [2021-06-10 11:41:42,061 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:42,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 922 events. 27/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4103 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1158. Up to 32 conditions per place. [2021-06-10 11:41:42,112 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/759 dead transitions. [2021-06-10 11:41:42,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 759 transitions, 1913 flow [2021-06-10 11:41:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:42,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:42,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:42,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:42,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:42,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:42,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,116 INFO L185 Difference]: Start difference. First operand has 879 places, 758 transitions, 1887 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:42,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 881 places, 759 transitions, 1913 flow [2021-06-10 11:41:42,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 880 places, 759 transitions, 1912 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:42,124 INFO L241 Difference]: Finished difference. Result has 882 places, 759 transitions, 1904 flow [2021-06-10 11:41:42,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=878, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=882, PETRI_TRANSITIONS=759} [2021-06-10 11:41:42,125 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 55 predicate places. [2021-06-10 11:41:42,125 INFO L480 AbstractCegarLoop]: Abstraction has has 882 places, 759 transitions, 1904 flow [2021-06-10 11:41:42,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:42,125 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:42,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1520 [2021-06-10 11:41:42,125 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1972860660, now seen corresponding path program 1 times [2021-06-10 11:41:42,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:42,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369950222] [2021-06-10 11:41:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:42,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:42,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:42,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369950222] [2021-06-10 11:41:42,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:42,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:42,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601898951] [2021-06-10 11:41:42,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:42,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:42,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:42,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 882 places, 759 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:42,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:42,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:42,491 INFO L129 PetriNetUnfolder]: 27/915 cut-off events. [2021-06-10 11:41:42,491 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:42,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 915 events. 27/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4044 event pairs, 0 based on Foata normal form. 1/859 useless extension candidates. Maximal degree in co-relation 1144. Up to 32 conditions per place. [2021-06-10 11:41:42,541 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/757 dead transitions. [2021-06-10 11:41:42,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 757 transitions, 1906 flow [2021-06-10 11:41:42,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:42,542 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:42,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:42,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:42,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:42,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:42,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,545 INFO L185 Difference]: Start difference. First operand has 882 places, 759 transitions, 1904 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:42,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 884 places, 757 transitions, 1906 flow [2021-06-10 11:41:42,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 757 transitions, 1898 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:42,552 INFO L241 Difference]: Finished difference. Result has 882 places, 757 transitions, 1891 flow [2021-06-10 11:41:42,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=879, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=882, PETRI_TRANSITIONS=757} [2021-06-10 11:41:42,553 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 55 predicate places. [2021-06-10 11:41:42,553 INFO L480 AbstractCegarLoop]: Abstraction has has 882 places, 757 transitions, 1891 flow [2021-06-10 11:41:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:42,553 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:42,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1521 [2021-06-10 11:41:42,553 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1972861683, now seen corresponding path program 1 times [2021-06-10 11:41:42,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:42,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76553623] [2021-06-10 11:41:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:42,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:42,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:41:42,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76553623] [2021-06-10 11:41:42,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:42,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:42,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791798938] [2021-06-10 11:41:42,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:42,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:42,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:42,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 882 places, 757 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:42,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:42,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:42,915 INFO L129 PetriNetUnfolder]: 27/913 cut-off events. [2021-06-10 11:41:42,915 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:42,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 913 events. 27/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4026 event pairs, 0 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1148. Up to 32 conditions per place. [2021-06-10 11:41:42,966 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/755 dead transitions. [2021-06-10 11:41:42,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 755 transitions, 1904 flow [2021-06-10 11:41:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:42,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:42,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:42,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:42,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:42,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:42,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,970 INFO L185 Difference]: Start difference. First operand has 882 places, 757 transitions, 1891 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:42,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 755 transitions, 1904 flow [2021-06-10 11:41:42,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 755 transitions, 1903 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:42,977 INFO L241 Difference]: Finished difference. Result has 881 places, 755 transitions, 1887 flow [2021-06-10 11:41:42,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=879, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=881, PETRI_TRANSITIONS=755} [2021-06-10 11:41:42,978 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 54 predicate places. [2021-06-10 11:41:42,978 INFO L480 AbstractCegarLoop]: Abstraction has has 881 places, 755 transitions, 1887 flow [2021-06-10 11:41:42,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:42,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:42,978 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:42,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1522 [2021-06-10 11:41:42,978 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash -34310075, now seen corresponding path program 1 times [2021-06-10 11:41:42,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:42,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101942487] [2021-06-10 11:41:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:42,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:42,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:42,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:42,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101942487] [2021-06-10 11:41:42,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:42,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:42,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500777144] [2021-06-10 11:41:42,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:42,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:42,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:42,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:43,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:43,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 755 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:43,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:43,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:43,345 INFO L129 PetriNetUnfolder]: 26/920 cut-off events. [2021-06-10 11:41:43,346 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:43,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 920 events. 26/920 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4087 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1153. Up to 32 conditions per place. [2021-06-10 11:41:43,397 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/756 dead transitions. [2021-06-10 11:41:43,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 756 transitions, 1903 flow [2021-06-10 11:41:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:43,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:43,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:43,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:43,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:43,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:43,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,401 INFO L185 Difference]: Start difference. First operand has 881 places, 755 transitions, 1887 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:43,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 756 transitions, 1903 flow [2021-06-10 11:41:43,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 756 transitions, 1902 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:43,409 INFO L241 Difference]: Finished difference. Result has 883 places, 755 transitions, 1891 flow [2021-06-10 11:41:43,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=883, PETRI_TRANSITIONS=755} [2021-06-10 11:41:43,409 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 56 predicate places. [2021-06-10 11:41:43,409 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 755 transitions, 1891 flow [2021-06-10 11:41:43,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:43,409 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:43,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1523 [2021-06-10 11:41:43,409 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash -34309052, now seen corresponding path program 1 times [2021-06-10 11:41:43,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:43,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717648430] [2021-06-10 11:41:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:43,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:43,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:43,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:43,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717648430] [2021-06-10 11:41:43,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:43,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:43,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844240058] [2021-06-10 11:41:43,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:43,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:43,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:43,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:43,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 755 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:43,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:43,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:43,798 INFO L129 PetriNetUnfolder]: 24/922 cut-off events. [2021-06-10 11:41:43,799 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:43,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 922 events. 24/922 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4120 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1164. Up to 32 conditions per place. [2021-06-10 11:41:43,851 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/756 dead transitions. [2021-06-10 11:41:43,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 756 transitions, 1917 flow [2021-06-10 11:41:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:43,852 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:43,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:43,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:43,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:43,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:43,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,855 INFO L185 Difference]: Start difference. First operand has 883 places, 755 transitions, 1891 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:43,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 756 transitions, 1917 flow [2021-06-10 11:41:43,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 756 transitions, 1916 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:43,863 INFO L241 Difference]: Finished difference. Result has 886 places, 756 transitions, 1908 flow [2021-06-10 11:41:43,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1908, PETRI_PLACES=886, PETRI_TRANSITIONS=756} [2021-06-10 11:41:43,864 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 59 predicate places. [2021-06-10 11:41:43,864 INFO L480 AbstractCegarLoop]: Abstraction has has 886 places, 756 transitions, 1908 flow [2021-06-10 11:41:43,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:43,864 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:43,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1524 [2021-06-10 11:41:43,864 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -35262364, now seen corresponding path program 1 times [2021-06-10 11:41:43,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:43,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429841416] [2021-06-10 11:41:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:43,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:43,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:43,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:43,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:43,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429841416] [2021-06-10 11:41:43,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:43,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:43,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254586132] [2021-06-10 11:41:43,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:43,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:43,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:43,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:43,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 756 transitions, 1908 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:43,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:43,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:43,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:44,268 INFO L129 PetriNetUnfolder]: 24/915 cut-off events. [2021-06-10 11:41:44,268 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:44,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 915 events. 24/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4060 event pairs, 0 based on Foata normal form. 1/862 useless extension candidates. Maximal degree in co-relation 1150. Up to 32 conditions per place. [2021-06-10 11:41:44,297 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/754 dead transitions. [2021-06-10 11:41:44,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 754 transitions, 1910 flow [2021-06-10 11:41:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:44,298 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:44,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:44,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:44,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:44,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:44,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,301 INFO L185 Difference]: Start difference. First operand has 886 places, 756 transitions, 1908 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:44,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 754 transitions, 1910 flow [2021-06-10 11:41:44,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 885 places, 754 transitions, 1902 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:44,308 INFO L241 Difference]: Finished difference. Result has 886 places, 754 transitions, 1895 flow [2021-06-10 11:41:44,308 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=886, PETRI_TRANSITIONS=754} [2021-06-10 11:41:44,308 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 59 predicate places. [2021-06-10 11:41:44,308 INFO L480 AbstractCegarLoop]: Abstraction has has 886 places, 754 transitions, 1895 flow [2021-06-10 11:41:44,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:44,308 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:44,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1525 [2021-06-10 11:41:44,309 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -35263387, now seen corresponding path program 1 times [2021-06-10 11:41:44,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:44,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288808082] [2021-06-10 11:41:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:44,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:44,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:44,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:41:44,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288808082] [2021-06-10 11:41:44,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:44,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:44,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395075639] [2021-06-10 11:41:44,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:44,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:44,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:44,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 754 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:44,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:44,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:44,677 INFO L129 PetriNetUnfolder]: 24/913 cut-off events. [2021-06-10 11:41:44,677 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:44,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 913 events. 24/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4043 event pairs, 0 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1154. Up to 32 conditions per place. [2021-06-10 11:41:44,727 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/752 dead transitions. [2021-06-10 11:41:44,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 886 places, 752 transitions, 1908 flow [2021-06-10 11:41:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:44,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:44,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:44,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:44,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:44,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:44,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,732 INFO L185 Difference]: Start difference. First operand has 886 places, 754 transitions, 1895 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:44,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 886 places, 752 transitions, 1908 flow [2021-06-10 11:41:44,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 885 places, 752 transitions, 1907 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:44,740 INFO L241 Difference]: Finished difference. Result has 885 places, 752 transitions, 1891 flow [2021-06-10 11:41:44,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=885, PETRI_TRANSITIONS=752} [2021-06-10 11:41:44,740 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 58 predicate places. [2021-06-10 11:41:44,740 INFO L480 AbstractCegarLoop]: Abstraction has has 885 places, 752 transitions, 1891 flow [2021-06-10 11:41:44,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:44,741 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:44,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1526 [2021-06-10 11:41:44,741 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2140073026, now seen corresponding path program 1 times [2021-06-10 11:41:44,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:44,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57878879] [2021-06-10 11:41:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:44,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:44,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:44,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:44,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:44,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57878879] [2021-06-10 11:41:44,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:44,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:44,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091959507] [2021-06-10 11:41:44,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:44,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:44,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:44,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 752 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:44,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:44,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:44,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:45,118 INFO L129 PetriNetUnfolder]: 23/921 cut-off events. [2021-06-10 11:41:45,118 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:45,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 921 events. 23/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4113 event pairs, 0 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1166. Up to 32 conditions per place. [2021-06-10 11:41:45,168 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/754 dead transitions. [2021-06-10 11:41:45,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 754 transitions, 1921 flow [2021-06-10 11:41:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:45,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:45,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:45,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:45,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:45,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:45,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,172 INFO L185 Difference]: Start difference. First operand has 885 places, 752 transitions, 1891 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:45,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 754 transitions, 1921 flow [2021-06-10 11:41:45,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 754 transitions, 1920 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:45,180 INFO L241 Difference]: Finished difference. Result has 888 places, 754 transitions, 1914 flow [2021-06-10 11:41:45,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1914, PETRI_PLACES=888, PETRI_TRANSITIONS=754} [2021-06-10 11:41:45,180 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 61 predicate places. [2021-06-10 11:41:45,180 INFO L480 AbstractCegarLoop]: Abstraction has has 888 places, 754 transitions, 1914 flow [2021-06-10 11:41:45,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:45,181 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:45,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1527 [2021-06-10 11:41:45,181 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2140072003, now seen corresponding path program 1 times [2021-06-10 11:41:45,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:45,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370856991] [2021-06-10 11:41:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:45,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:45,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:45,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:45,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370856991] [2021-06-10 11:41:45,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:45,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:45,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8165234] [2021-06-10 11:41:45,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:45,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:45,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:45,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 888 places, 754 transitions, 1914 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:45,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:45,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:45,558 INFO L129 PetriNetUnfolder]: 22/919 cut-off events. [2021-06-10 11:41:45,558 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:45,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 919 events. 22/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4104 event pairs, 0 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1163. Up to 32 conditions per place. [2021-06-10 11:41:45,610 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/754 dead transitions. [2021-06-10 11:41:45,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 890 places, 754 transitions, 1926 flow [2021-06-10 11:41:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:45,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:45,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:45,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:45,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:45,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:45,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,614 INFO L185 Difference]: Start difference. First operand has 888 places, 754 transitions, 1914 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:45,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 890 places, 754 transitions, 1926 flow [2021-06-10 11:41:45,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 889 places, 754 transitions, 1921 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:45,622 INFO L241 Difference]: Finished difference. Result has 891 places, 754 transitions, 1919 flow [2021-06-10 11:41:45,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=887, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1919, PETRI_PLACES=891, PETRI_TRANSITIONS=754} [2021-06-10 11:41:45,622 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 64 predicate places. [2021-06-10 11:41:45,622 INFO L480 AbstractCegarLoop]: Abstraction has has 891 places, 754 transitions, 1919 flow [2021-06-10 11:41:45,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:45,623 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:45,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1528 [2021-06-10 11:41:45,623 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2139119714, now seen corresponding path program 1 times [2021-06-10 11:41:45,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:45,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447712958] [2021-06-10 11:41:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:45,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:45,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:45,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:45,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:45,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447712958] [2021-06-10 11:41:45,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:45,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:45,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803922476] [2021-06-10 11:41:45,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:45,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:45,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:45,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 754 transitions, 1919 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:45,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:45,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:45,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:45,997 INFO L129 PetriNetUnfolder]: 21/915 cut-off events. [2021-06-10 11:41:45,997 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:46,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 915 events. 21/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4080 event pairs, 0 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 1160. Up to 32 conditions per place. [2021-06-10 11:41:46,046 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/751 dead transitions. [2021-06-10 11:41:46,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 751 transitions, 1916 flow [2021-06-10 11:41:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:46,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:46,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:46,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:46,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:46,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:46,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,050 INFO L185 Difference]: Start difference. First operand has 891 places, 754 transitions, 1919 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:46,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 751 transitions, 1916 flow [2021-06-10 11:41:46,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 751 transitions, 1909 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:46,058 INFO L241 Difference]: Finished difference. Result has 890 places, 751 transitions, 1899 flow [2021-06-10 11:41:46,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=890, PETRI_TRANSITIONS=751} [2021-06-10 11:41:46,058 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 63 predicate places. [2021-06-10 11:41:46,058 INFO L480 AbstractCegarLoop]: Abstraction has has 890 places, 751 transitions, 1899 flow [2021-06-10 11:41:46,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:46,058 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:46,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1529 [2021-06-10 11:41:46,058 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2139118691, now seen corresponding path program 1 times [2021-06-10 11:41:46,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:46,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501044495] [2021-06-10 11:41:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:46,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:46,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:41:46,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501044495] [2021-06-10 11:41:46,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:46,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:46,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340899940] [2021-06-10 11:41:46,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:46,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:46,081 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:46,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 890 places, 751 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:46,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:46,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:46,423 INFO L129 PetriNetUnfolder]: 21/913 cut-off events. [2021-06-10 11:41:46,424 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:46,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 913 events. 21/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4065 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1161. Up to 32 conditions per place. [2021-06-10 11:41:46,461 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/749 dead transitions. [2021-06-10 11:41:46,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 890 places, 749 transitions, 1912 flow [2021-06-10 11:41:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:46,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:46,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:46,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:46,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:46,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:46,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,466 INFO L185 Difference]: Start difference. First operand has 890 places, 751 transitions, 1899 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 890 places, 749 transitions, 1912 flow [2021-06-10 11:41:46,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 889 places, 749 transitions, 1911 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:46,473 INFO L241 Difference]: Finished difference. Result has 889 places, 749 transitions, 1895 flow [2021-06-10 11:41:46,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=887, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=889, PETRI_TRANSITIONS=749} [2021-06-10 11:41:46,473 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 62 predicate places. [2021-06-10 11:41:46,473 INFO L480 AbstractCegarLoop]: Abstraction has has 889 places, 749 transitions, 1895 flow [2021-06-10 11:41:46,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:46,474 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:46,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1530 [2021-06-10 11:41:46,474 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash -964115561, now seen corresponding path program 1 times [2021-06-10 11:41:46,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:46,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533206002] [2021-06-10 11:41:46,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:46,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:46,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:46,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533206002] [2021-06-10 11:41:46,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:46,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:46,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180058247] [2021-06-10 11:41:46,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:46,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:46,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:46,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 889 places, 749 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:46,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:46,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:46,843 INFO L129 PetriNetUnfolder]: 19/918 cut-off events. [2021-06-10 11:41:46,843 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:46,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 918 events. 19/918 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4110 event pairs, 0 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1164. Up to 32 conditions per place. [2021-06-10 11:41:46,892 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/750 dead transitions. [2021-06-10 11:41:46,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 750 transitions, 1911 flow [2021-06-10 11:41:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:46,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:46,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:46,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:46,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:46,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:46,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,896 INFO L185 Difference]: Start difference. First operand has 889 places, 749 transitions, 1895 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:46,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 750 transitions, 1911 flow [2021-06-10 11:41:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 750 transitions, 1910 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:46,903 INFO L241 Difference]: Finished difference. Result has 892 places, 750 transitions, 1908 flow [2021-06-10 11:41:46,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1908, PETRI_PLACES=892, PETRI_TRANSITIONS=750} [2021-06-10 11:41:46,904 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 65 predicate places. [2021-06-10 11:41:46,904 INFO L480 AbstractCegarLoop]: Abstraction has has 892 places, 750 transitions, 1908 flow [2021-06-10 11:41:46,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:46,904 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:46,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1531 [2021-06-10 11:41:46,904 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -964116584, now seen corresponding path program 1 times [2021-06-10 11:41:46,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:46,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071828020] [2021-06-10 11:41:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:46,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:46,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:46,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:46,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071828020] [2021-06-10 11:41:46,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:46,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:46,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360980792] [2021-06-10 11:41:46,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:46,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:46,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:46,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 892 places, 750 transitions, 1908 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:46,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:46,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:46,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:47,286 INFO L129 PetriNetUnfolder]: 19/919 cut-off events. [2021-06-10 11:41:47,286 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:47,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 919 events. 19/919 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4117 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1172. Up to 32 conditions per place. [2021-06-10 11:41:47,337 INFO L132 encePairwiseOnDemand]: 885/889 looper letters, 9 selfloop transitions, 3 changer transitions 0/751 dead transitions. [2021-06-10 11:41:47,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 751 transitions, 1934 flow [2021-06-10 11:41:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2455 transitions. [2021-06-10 11:41:47,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205099362579677 [2021-06-10 11:41:47,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2455 transitions. [2021-06-10 11:41:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2455 transitions. [2021-06-10 11:41:47,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:47,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2455 transitions. [2021-06-10 11:41:47,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 818.3333333333334) internal successors, (2455), 3 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,342 INFO L185 Difference]: Start difference. First operand has 892 places, 750 transitions, 1908 flow. Second operand 3 states and 2455 transitions. [2021-06-10 11:41:47,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 751 transitions, 1934 flow [2021-06-10 11:41:47,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 893 places, 751 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:47,350 INFO L241 Difference]: Finished difference. Result has 895 places, 751 transitions, 1924 flow [2021-06-10 11:41:47,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=895, PETRI_TRANSITIONS=751} [2021-06-10 11:41:47,350 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 68 predicate places. [2021-06-10 11:41:47,350 INFO L480 AbstractCegarLoop]: Abstraction has has 895 places, 751 transitions, 1924 flow [2021-06-10 11:41:47,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,351 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:47,351 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:47,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1532 [2021-06-10 11:41:47,351 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -963163272, now seen corresponding path program 1 times [2021-06-10 11:41:47,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:47,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308169776] [2021-06-10 11:41:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:47,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:47,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:47,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:47,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308169776] [2021-06-10 11:41:47,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:47,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:47,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090568281] [2021-06-10 11:41:47,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:47,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:47,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:47,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 751 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:47,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:47,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:47,739 INFO L129 PetriNetUnfolder]: 18/915 cut-off events. [2021-06-10 11:41:47,740 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:47,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 915 events. 18/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4093 event pairs, 0 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1165. Up to 32 conditions per place. [2021-06-10 11:41:47,789 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/748 dead transitions. [2021-06-10 11:41:47,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 748 transitions, 1921 flow [2021-06-10 11:41:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:47,791 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:47,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:47,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:47,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:47,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:47,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,794 INFO L185 Difference]: Start difference. First operand has 895 places, 751 transitions, 1924 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:47,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 897 places, 748 transitions, 1921 flow [2021-06-10 11:41:47,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 748 transitions, 1913 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:47,802 INFO L241 Difference]: Finished difference. Result has 894 places, 748 transitions, 1903 flow [2021-06-10 11:41:47,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=894, PETRI_TRANSITIONS=748} [2021-06-10 11:41:47,802 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 67 predicate places. [2021-06-10 11:41:47,802 INFO L480 AbstractCegarLoop]: Abstraction has has 894 places, 748 transitions, 1903 flow [2021-06-10 11:41:47,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:47,802 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:47,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1533 [2021-06-10 11:41:47,802 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash -963162249, now seen corresponding path program 1 times [2021-06-10 11:41:47,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:47,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501291983] [2021-06-10 11:41:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:47,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:47,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:47,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:47,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:41:47,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501291983] [2021-06-10 11:41:47,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:47,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:47,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520556029] [2021-06-10 11:41:47,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:47,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:47,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:47,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 748 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:47,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:47,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:47,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:48,205 INFO L129 PetriNetUnfolder]: 18/913 cut-off events. [2021-06-10 11:41:48,205 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:48,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 913 events. 18/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4077 event pairs, 0 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1168. Up to 32 conditions per place. [2021-06-10 11:41:48,256 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/746 dead transitions. [2021-06-10 11:41:48,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 746 transitions, 1916 flow [2021-06-10 11:41:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:48,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:48,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:48,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:48,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:48,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:48,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,260 INFO L185 Difference]: Start difference. First operand has 894 places, 748 transitions, 1903 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:48,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 746 transitions, 1916 flow [2021-06-10 11:41:48,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 893 places, 746 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:48,268 INFO L241 Difference]: Finished difference. Result has 893 places, 746 transitions, 1899 flow [2021-06-10 11:41:48,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=893, PETRI_TRANSITIONS=746} [2021-06-10 11:41:48,268 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 66 predicate places. [2021-06-10 11:41:48,268 INFO L480 AbstractCegarLoop]: Abstraction has has 893 places, 746 transitions, 1899 flow [2021-06-10 11:41:48,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:48,269 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:48,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1534 [2021-06-10 11:41:48,269 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1668675469, now seen corresponding path program 1 times [2021-06-10 11:41:48,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:48,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360908449] [2021-06-10 11:41:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:48,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:48,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:48,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:48,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360908449] [2021-06-10 11:41:48,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:48,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:48,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83805237] [2021-06-10 11:41:48,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:48,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:48,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:48,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 893 places, 746 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:48,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:48,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:48,650 INFO L129 PetriNetUnfolder]: 17/921 cut-off events. [2021-06-10 11:41:48,650 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:48,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 921 events. 17/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4151 event pairs, 0 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 1180. Up to 32 conditions per place. [2021-06-10 11:41:48,696 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/748 dead transitions. [2021-06-10 11:41:48,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 748 transitions, 1929 flow [2021-06-10 11:41:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:48,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:48,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:48,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:48,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:48,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,700 INFO L185 Difference]: Start difference. First operand has 893 places, 746 transitions, 1899 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 895 places, 748 transitions, 1929 flow [2021-06-10 11:41:48,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 748 transitions, 1928 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:48,708 INFO L241 Difference]: Finished difference. Result has 896 places, 748 transitions, 1922 flow [2021-06-10 11:41:48,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1922, PETRI_PLACES=896, PETRI_TRANSITIONS=748} [2021-06-10 11:41:48,708 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 69 predicate places. [2021-06-10 11:41:48,708 INFO L480 AbstractCegarLoop]: Abstraction has has 896 places, 748 transitions, 1922 flow [2021-06-10 11:41:48,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:48,708 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:48,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1535 [2021-06-10 11:41:48,708 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1668674446, now seen corresponding path program 1 times [2021-06-10 11:41:48,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:48,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782269989] [2021-06-10 11:41:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:48,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:48,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:48,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:48,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:48,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782269989] [2021-06-10 11:41:48,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:48,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:48,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922477627] [2021-06-10 11:41:48,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:48,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:48,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:48,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:48,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 748 transitions, 1922 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:48,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:48,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:48,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:49,088 INFO L129 PetriNetUnfolder]: 16/919 cut-off events. [2021-06-10 11:41:49,088 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:49,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 919 events. 16/919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4140 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1177. Up to 32 conditions per place. [2021-06-10 11:41:49,138 INFO L132 encePairwiseOnDemand]: 886/889 looper letters, 5 selfloop transitions, 2 changer transitions 0/748 dead transitions. [2021-06-10 11:41:49,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 898 places, 748 transitions, 1934 flow [2021-06-10 11:41:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:49,139 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:49,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:49,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:49,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:49,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:49,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,142 INFO L185 Difference]: Start difference. First operand has 896 places, 748 transitions, 1922 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:49,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 898 places, 748 transitions, 1934 flow [2021-06-10 11:41:49,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 897 places, 748 transitions, 1929 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:49,150 INFO L241 Difference]: Finished difference. Result has 899 places, 748 transitions, 1927 flow [2021-06-10 11:41:49,150 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=895, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1927, PETRI_PLACES=899, PETRI_TRANSITIONS=748} [2021-06-10 11:41:49,150 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 72 predicate places. [2021-06-10 11:41:49,150 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 748 transitions, 1927 flow [2021-06-10 11:41:49,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:49,150 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:49,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1536 [2021-06-10 11:41:49,150 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1667722157, now seen corresponding path program 1 times [2021-06-10 11:41:49,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:49,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816981967] [2021-06-10 11:41:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:49,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:49,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:49,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:49,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816981967] [2021-06-10 11:41:49,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:49,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:49,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104646509] [2021-06-10 11:41:49,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:49,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:49,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:49,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:49,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:49,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 748 transitions, 1927 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:49,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:49,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:49,541 INFO L129 PetriNetUnfolder]: 15/915 cut-off events. [2021-06-10 11:41:49,541 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:49,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 915 events. 15/915 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4114 event pairs, 0 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 1174. Up to 32 conditions per place. [2021-06-10 11:41:49,592 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/745 dead transitions. [2021-06-10 11:41:49,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 745 transitions, 1924 flow [2021-06-10 11:41:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:49,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:49,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:49,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:49,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:49,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:49,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,596 INFO L185 Difference]: Start difference. First operand has 899 places, 748 transitions, 1927 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:49,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 745 transitions, 1924 flow [2021-06-10 11:41:49,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 745 transitions, 1917 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:49,604 INFO L241 Difference]: Finished difference. Result has 898 places, 745 transitions, 1907 flow [2021-06-10 11:41:49,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=898, PETRI_TRANSITIONS=745} [2021-06-10 11:41:49,604 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 71 predicate places. [2021-06-10 11:41:49,604 INFO L480 AbstractCegarLoop]: Abstraction has has 898 places, 745 transitions, 1907 flow [2021-06-10 11:41:49,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,605 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:49,605 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:49,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1537 [2021-06-10 11:41:49,605 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1667721134, now seen corresponding path program 1 times [2021-06-10 11:41:49,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:49,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595638703] [2021-06-10 11:41:49,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:49,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:49,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:49,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:49,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:41:49,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595638703] [2021-06-10 11:41:49,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:49,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:49,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424794592] [2021-06-10 11:41:49,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:49,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:49,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:49,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:49,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:49,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 745 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:49,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:49,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:49,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:50,015 INFO L129 PetriNetUnfolder]: 15/913 cut-off events. [2021-06-10 11:41:50,015 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:50,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 913 events. 15/913 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4099 event pairs, 0 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1175. Up to 32 conditions per place. [2021-06-10 11:41:50,064 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/743 dead transitions. [2021-06-10 11:41:50,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 898 places, 743 transitions, 1920 flow [2021-06-10 11:41:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:50,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:50,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:50,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:50,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:50,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:50,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,068 INFO L185 Difference]: Start difference. First operand has 898 places, 745 transitions, 1907 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:50,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 898 places, 743 transitions, 1920 flow [2021-06-10 11:41:50,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 897 places, 743 transitions, 1919 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:50,076 INFO L241 Difference]: Finished difference. Result has 897 places, 743 transitions, 1903 flow [2021-06-10 11:41:50,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=895, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=897, PETRI_TRANSITIONS=743} [2021-06-10 11:41:50,076 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 70 predicate places. [2021-06-10 11:41:50,076 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 743 transitions, 1903 flow [2021-06-10 11:41:50,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:50,076 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:50,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538 [2021-06-10 11:41:50,076 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1813851310, now seen corresponding path program 1 times [2021-06-10 11:41:50,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:50,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711962815] [2021-06-10 11:41:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:50,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:50,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:50,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:41:50,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711962815] [2021-06-10 11:41:50,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:50,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:50,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696059156] [2021-06-10 11:41:50,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:50,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:50,100 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:50,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 743 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:50,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:50,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:50,499 INFO L129 PetriNetUnfolder]: 14/921 cut-off events. [2021-06-10 11:41:50,499 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:50,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 921 events. 14/921 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4169 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1187. Up to 32 conditions per place. [2021-06-10 11:41:50,529 INFO L132 encePairwiseOnDemand]: 884/889 looper letters, 10 selfloop transitions, 3 changer transitions 0/745 dead transitions. [2021-06-10 11:41:50,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 745 transitions, 1933 flow [2021-06-10 11:41:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2457 transitions. [2021-06-10 11:41:50,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212598425196851 [2021-06-10 11:41:50,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2457 transitions. [2021-06-10 11:41:50,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2457 transitions. [2021-06-10 11:41:50,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:50,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2457 transitions. [2021-06-10 11:41:50,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 819.0) internal successors, (2457), 3 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,533 INFO L185 Difference]: Start difference. First operand has 897 places, 743 transitions, 1903 flow. Second operand 3 states and 2457 transitions. [2021-06-10 11:41:50,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 745 transitions, 1933 flow [2021-06-10 11:41:50,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 745 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:50,540 INFO L241 Difference]: Finished difference. Result has 900 places, 745 transitions, 1926 flow [2021-06-10 11:41:50,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=900, PETRI_TRANSITIONS=745} [2021-06-10 11:41:50,540 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 73 predicate places. [2021-06-10 11:41:50,540 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 745 transitions, 1926 flow [2021-06-10 11:41:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:50,540 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:50,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1539 [2021-06-10 11:41:50,540 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1813850287, now seen corresponding path program 1 times [2021-06-10 11:41:50,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:50,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662906214] [2021-06-10 11:41:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:50,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:50,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:50,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:50,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:41:50,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662906214] [2021-06-10 11:41:50,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:50,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466116615] [2021-06-10 11:41:50,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:50,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:50,563 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:50,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 745 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:50,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:50,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:50,923 INFO L129 PetriNetUnfolder]: 12/922 cut-off events. [2021-06-10 11:41:50,923 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:50,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 922 events. 12/922 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4187 event pairs, 0 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1187. Up to 32 conditions per place. [2021-06-10 11:41:50,973 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 6 selfloop transitions, 1 changer transitions 0/745 dead transitions. [2021-06-10 11:41:50,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 745 transitions, 1938 flow [2021-06-10 11:41:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2465 transitions. [2021-06-10 11:41:50,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242594675665542 [2021-06-10 11:41:50,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2465 transitions. [2021-06-10 11:41:50,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2465 transitions. [2021-06-10 11:41:50,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:50,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2465 transitions. [2021-06-10 11:41:50,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.6666666666666) internal successors, (2465), 3 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,977 INFO L185 Difference]: Start difference. First operand has 900 places, 745 transitions, 1926 flow. Second operand 3 states and 2465 transitions. [2021-06-10 11:41:50,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 745 transitions, 1938 flow [2021-06-10 11:41:50,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 745 transitions, 1933 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:50,985 INFO L241 Difference]: Finished difference. Result has 902 places, 744 transitions, 1922 flow [2021-06-10 11:41:50,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1922, PETRI_PLACES=902, PETRI_TRANSITIONS=744} [2021-06-10 11:41:50,985 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 75 predicate places. [2021-06-10 11:41:50,985 INFO L480 AbstractCegarLoop]: Abstraction has has 902 places, 744 transitions, 1922 flow [2021-06-10 11:41:50,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:50,986 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:50,986 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:50,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1540 [2021-06-10 11:41:50,986 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1812897998, now seen corresponding path program 1 times [2021-06-10 11:41:50,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:50,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722272504] [2021-06-10 11:41:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:51,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:51,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:51,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:41:51,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722272504] [2021-06-10 11:41:51,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:51,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:51,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314247507] [2021-06-10 11:41:51,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:51,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:51,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:51,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 819 out of 889 [2021-06-10 11:41:51,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 744 transitions, 1922 flow. Second operand has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:51,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 819 of 889 [2021-06-10 11:41:51,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:51,374 INFO L129 PetriNetUnfolder]: 12/915 cut-off events. [2021-06-10 11:41:51,374 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:51,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 915 events. 12/915 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4130 event pairs, 0 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 1181. Up to 32 conditions per place. [2021-06-10 11:41:51,423 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 5 selfloop transitions, 1 changer transitions 0/742 dead transitions. [2021-06-10 11:41:51,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 742 transitions, 1925 flow [2021-06-10 11:41:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2464 transitions. [2021-06-10 11:41:51,424 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238845144356955 [2021-06-10 11:41:51,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2464 transitions. [2021-06-10 11:41:51,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2464 transitions. [2021-06-10 11:41:51,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:51,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2464 transitions. [2021-06-10 11:41:51,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 821.3333333333334) internal successors, (2464), 3 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,427 INFO L185 Difference]: Start difference. First operand has 902 places, 744 transitions, 1922 flow. Second operand 3 states and 2464 transitions. [2021-06-10 11:41:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 742 transitions, 1925 flow [2021-06-10 11:41:51,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 742 transitions, 1918 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:51,435 INFO L241 Difference]: Finished difference. Result has 902 places, 742 transitions, 1911 flow [2021-06-10 11:41:51,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=902, PETRI_TRANSITIONS=742} [2021-06-10 11:41:51,435 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 75 predicate places. [2021-06-10 11:41:51,435 INFO L480 AbstractCegarLoop]: Abstraction has has 902 places, 742 transitions, 1911 flow [2021-06-10 11:41:51,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 820.3333333333334) internal successors, (2461), 3 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:51,436 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:51,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1541 [2021-06-10 11:41:51,436 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1812896975, now seen corresponding path program 1 times [2021-06-10 11:41:51,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:51,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888896633] [2021-06-10 11:41:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:51,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:51,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:51,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:51,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:41:51,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888896633] [2021-06-10 11:41:51,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:51,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:51,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324626429] [2021-06-10 11:41:51,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:51,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:51,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 889 [2021-06-10 11:41:51,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 742 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:51,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 889 [2021-06-10 11:41:51,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:51,822 INFO L129 PetriNetUnfolder]: 12/913 cut-off events. [2021-06-10 11:41:51,822 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:51,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 913 events. 12/913 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4113 event pairs, 0 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1181. Up to 32 conditions per place. [2021-06-10 11:41:51,870 INFO L132 encePairwiseOnDemand]: 887/889 looper letters, 8 selfloop transitions, 1 changer transitions 0/740 dead transitions. [2021-06-10 11:41:51,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 740 transitions, 1924 flow [2021-06-10 11:41:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2452 transitions. [2021-06-10 11:41:51,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9193850768653918 [2021-06-10 11:41:51,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2452 transitions. [2021-06-10 11:41:51,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2452 transitions. [2021-06-10 11:41:51,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:51,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2452 transitions. [2021-06-10 11:41:51,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 817.3333333333334) internal successors, (2452), 3 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,874 INFO L185 Difference]: Start difference. First operand has 902 places, 742 transitions, 1911 flow. Second operand 3 states and 2452 transitions. [2021-06-10 11:41:51,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 740 transitions, 1924 flow [2021-06-10 11:41:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 740 transitions, 1923 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:51,882 INFO L241 Difference]: Finished difference. Result has 901 places, 740 transitions, 1907 flow [2021-06-10 11:41:51,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=889, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=901, PETRI_TRANSITIONS=740} [2021-06-10 11:41:51,882 INFO L343 CegarLoopForPetriNet]: 827 programPoint places, 74 predicate places. [2021-06-10 11:41:51,882 INFO L480 AbstractCegarLoop]: Abstraction has has 901 places, 740 transitions, 1907 flow [2021-06-10 11:41:51,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 816.3333333333334) internal successors, (2449), 3 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:51,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:51,883 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:51,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1542 [2021-06-10 11:41:51,883 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 864667710, now seen corresponding path program 1 times [2021-06-10 11:41:51,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:51,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436157925] [2021-06-10 11:41:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:41:51,898 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:41:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:41:51,903 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:41:51,920 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:41:51,920 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:41:51,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1543 [2021-06-10 11:41:51,920 WARN L342 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:41:51,920 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,980 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,983 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,986 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,988 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,991 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,994 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,995 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,998 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:51,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,000 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,002 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,006 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,007 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,008 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,009 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,010 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,011 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,012 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,013 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,014 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,018 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,035 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,036 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,037 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,042 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,049 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,052 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of32ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of32ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:41:52,080 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:41:52,080 INFO L253 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-06-10 11:41:52,081 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:41:52,081 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:41:52,081 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:41:52,081 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:41:52,081 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:41:52,081 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:41:52,081 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:41:52,081 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:41:52,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 853 places, 917 transitions, 2986 flow [2021-06-10 11:41:52,506 INFO L129 PetriNetUnfolder]: 161/1204 cut-off events. [2021-06-10 11:41:52,506 INFO L130 PetriNetUnfolder]: For 5952/5952 co-relation queries the response was YES. [2021-06-10 11:41:52,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1204 events. 161/1204 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5166 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 1747. Up to 66 conditions per place. [2021-06-10 11:41:52,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 853 places, 917 transitions, 2986 flow [2021-06-10 11:41:52,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 853 places, 917 transitions, 2986 flow [2021-06-10 11:41:52,667 INFO L129 PetriNetUnfolder]: 9/102 cut-off events. [2021-06-10 11:41:52,667 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:41:52,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:52,667 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-06-10 11:41:52,667 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1634104394, now seen corresponding path program 1 times [2021-06-10 11:41:52,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:52,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552435868] [2021-06-10 11:41:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:52,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:52,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:52,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:52,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:52,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:52,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:52,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552435868] [2021-06-10 11:41:52,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:52,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:52,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169084878] [2021-06-10 11:41:52,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:52,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:52,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:52,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:52,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 917 transitions, 2986 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:52,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:52,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:52,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:52,995 INFO L129 PetriNetUnfolder]: 94/947 cut-off events. [2021-06-10 11:41:52,995 INFO L130 PetriNetUnfolder]: For 5953/5953 co-relation queries the response was YES. [2021-06-10 11:41:53,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 947 events. 94/947 cut-off events. For 5953/5953 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3804 event pairs, 0 based on Foata normal form. 130/949 useless extension candidates. Maximal degree in co-relation 1502. Up to 33 conditions per place. [2021-06-10 11:41:53,064 INFO L132 encePairwiseOnDemand]: 880/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/848 dead transitions. [2021-06-10 11:41:53,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 848 transitions, 2862 flow [2021-06-10 11:41:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:41:53,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2021-06-10 11:41:53,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:41:53,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:41:53,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:53,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:41:53,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,069 INFO L185 Difference]: Start difference. First operand has 853 places, 917 transitions, 2986 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:41:53,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 818 places, 848 transitions, 2862 flow [2021-06-10 11:41:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 818 places, 848 transitions, 1870 flow, removed 496 selfloop flow, removed 0 redundant places. [2021-06-10 11:41:53,083 INFO L241 Difference]: Finished difference. Result has 820 places, 848 transitions, 1868 flow [2021-06-10 11:41:53,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=820, PETRI_TRANSITIONS=848} [2021-06-10 11:41:53,083 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -33 predicate places. [2021-06-10 11:41:53,083 INFO L480 AbstractCegarLoop]: Abstraction has has 820 places, 848 transitions, 1868 flow [2021-06-10 11:41:53,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:53,083 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-06-10 11:41:53,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1544 [2021-06-10 11:41:53,083 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1633151082, now seen corresponding path program 1 times [2021-06-10 11:41:53,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:53,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238306481] [2021-06-10 11:41:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:53,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:53,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:53,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238306481] [2021-06-10 11:41:53,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:53,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:53,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115359905] [2021-06-10 11:41:53,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:53,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:53,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:53,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 848 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:53,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:53,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:53,403 INFO L129 PetriNetUnfolder]: 94/946 cut-off events. [2021-06-10 11:41:53,403 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:53,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 946 events. 94/946 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3796 event pairs, 0 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 1041. Up to 33 conditions per place. [2021-06-10 11:41:53,469 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 2 changer transitions 0/848 dead transitions. [2021-06-10 11:41:53,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 848 transitions, 1890 flow [2021-06-10 11:41:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:41:53,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:41:53,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:41:53,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:41:53,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:53,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:41:53,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,474 INFO L185 Difference]: Start difference. First operand has 820 places, 848 transitions, 1868 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:41:53,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 848 transitions, 1890 flow [2021-06-10 11:41:53,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 848 transitions, 1888 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:53,482 INFO L241 Difference]: Finished difference. Result has 823 places, 848 transitions, 1878 flow [2021-06-10 11:41:53,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1878, PETRI_PLACES=823, PETRI_TRANSITIONS=848} [2021-06-10 11:41:53,482 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -30 predicate places. [2021-06-10 11:41:53,482 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 848 transitions, 1878 flow [2021-06-10 11:41:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:53,483 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-06-10 11:41:53,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1545 [2021-06-10 11:41:53,483 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1633152105, now seen corresponding path program 1 times [2021-06-10 11:41:53,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:53,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236716504] [2021-06-10 11:41:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:53,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:53,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,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-06-10 11:41:53,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236716504] [2021-06-10 11:41:53,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:53,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:53,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056013847] [2021-06-10 11:41:53,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:53,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:53,502 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:53,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 848 transitions, 1878 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:53,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:53,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:53,784 INFO L129 PetriNetUnfolder]: 93/944 cut-off events. [2021-06-10 11:41:53,784 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:41:53,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 944 events. 93/944 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3789 event pairs, 0 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 1039. Up to 33 conditions per place. [2021-06-10 11:41:53,846 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/846 dead transitions. [2021-06-10 11:41:53,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 846 transitions, 1881 flow [2021-06-10 11:41:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:41:53,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:41:53,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:41:53,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:41:53,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:53,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:41:53,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,850 INFO L185 Difference]: Start difference. First operand has 823 places, 848 transitions, 1878 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:41:53,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 825 places, 846 transitions, 1881 flow [2021-06-10 11:41:53,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 846 transitions, 1875 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:41:53,858 INFO L241 Difference]: Finished difference. Result has 823 places, 846 transitions, 1865 flow [2021-06-10 11:41:53,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=821, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1865, PETRI_PLACES=823, PETRI_TRANSITIONS=846} [2021-06-10 11:41:53,858 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -30 predicate places. [2021-06-10 11:41:53,858 INFO L480 AbstractCegarLoop]: Abstraction has has 823 places, 846 transitions, 1865 flow [2021-06-10 11:41:53,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:53,859 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-06-10 11:41:53,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1546 [2021-06-10 11:41:53,859 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1634105417, now seen corresponding path program 1 times [2021-06-10 11:41:53,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:53,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911328946] [2021-06-10 11:41:53,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:53,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:53,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:41:53,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911328946] [2021-06-10 11:41:53,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:53,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:53,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018499146] [2021-06-10 11:41:53,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:53,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:53,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:53,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 846 transitions, 1865 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:53,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:53,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:53,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:54,161 INFO L129 PetriNetUnfolder]: 93/942 cut-off events. [2021-06-10 11:41:54,162 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-10 11:41:54,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 942 events. 93/942 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3775 event pairs, 0 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1045. Up to 33 conditions per place. [2021-06-10 11:41:54,222 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/844 dead transitions. [2021-06-10 11:41:54,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 844 transitions, 1877 flow [2021-06-10 11:41:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:41:54,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:41:54,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:41:54,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:41:54,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:54,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:41:54,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,226 INFO L185 Difference]: Start difference. First operand has 823 places, 846 transitions, 1865 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:41:54,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 823 places, 844 transitions, 1877 flow [2021-06-10 11:41:54,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 844 transitions, 1876 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:54,234 INFO L241 Difference]: Finished difference. Result has 822 places, 844 transitions, 1860 flow [2021-06-10 11:41:54,234 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1860, PETRI_PLACES=822, PETRI_TRANSITIONS=844} [2021-06-10 11:41:54,234 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -31 predicate places. [2021-06-10 11:41:54,234 INFO L480 AbstractCegarLoop]: Abstraction has has 822 places, 844 transitions, 1860 flow [2021-06-10 11:41:54,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:54,234 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:54,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1547 [2021-06-10 11:41:54,235 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1218771508, now seen corresponding path program 1 times [2021-06-10 11:41:54,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:54,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180014427] [2021-06-10 11:41:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:54,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:54,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:54,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:54,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180014427] [2021-06-10 11:41:54,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:54,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:54,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930334318] [2021-06-10 11:41:54,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:54,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:54,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:54,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 844 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:54,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:54,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:54,550 INFO L129 PetriNetUnfolder]: 92/950 cut-off events. [2021-06-10 11:41:54,550 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:54,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 950 events. 92/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3847 event pairs, 0 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 1056. Up to 33 conditions per place. [2021-06-10 11:41:54,613 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/846 dead transitions. [2021-06-10 11:41:54,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 846 transitions, 1890 flow [2021-06-10 11:41:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:41:54,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:41:54,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:41:54,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:41:54,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:54,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:41:54,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:41:54,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,617 INFO L185 Difference]: Start difference. First operand has 822 places, 844 transitions, 1860 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:41:54,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 846 transitions, 1890 flow [2021-06-10 11:41:54,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 846 transitions, 1889 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:54,625 INFO L241 Difference]: Finished difference. Result has 825 places, 846 transitions, 1883 flow [2021-06-10 11:41:54,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=821, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1883, PETRI_PLACES=825, PETRI_TRANSITIONS=846} [2021-06-10 11:41:54,625 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -28 predicate places. [2021-06-10 11:41:54,625 INFO L480 AbstractCegarLoop]: Abstraction has has 825 places, 846 transitions, 1883 flow [2021-06-10 11:41:54,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:54,626 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:54,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1548 [2021-06-10 11:41:54,626 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1218770485, now seen corresponding path program 1 times [2021-06-10 11:41:54,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:54,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102177352] [2021-06-10 11:41:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:54,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:54,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:54,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:54,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:54,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102177352] [2021-06-10 11:41:54,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:54,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:54,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436442893] [2021-06-10 11:41:54,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:54,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:54,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:54,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 846 transitions, 1883 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:54,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:54,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:54,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:54,941 INFO L129 PetriNetUnfolder]: 90/951 cut-off events. [2021-06-10 11:41:54,941 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:54,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 951 events. 90/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3869 event pairs, 0 based on Foata normal form. 0/829 useless extension candidates. Maximal degree in co-relation 1056. Up to 33 conditions per place. [2021-06-10 11:41:55,001 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/846 dead transitions. [2021-06-10 11:41:55,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 846 transitions, 1895 flow [2021-06-10 11:41:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:41:55,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:41:55,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:41:55,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:41:55,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:55,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:41:55,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,005 INFO L185 Difference]: Start difference. First operand has 825 places, 846 transitions, 1883 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:41:55,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 846 transitions, 1895 flow [2021-06-10 11:41:55,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 846 transitions, 1890 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:55,012 INFO L241 Difference]: Finished difference. Result has 827 places, 845 transitions, 1879 flow [2021-06-10 11:41:55,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=827, PETRI_TRANSITIONS=845} [2021-06-10 11:41:55,012 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -26 predicate places. [2021-06-10 11:41:55,012 INFO L480 AbstractCegarLoop]: Abstraction has has 827 places, 845 transitions, 1879 flow [2021-06-10 11:41:55,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:55,013 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:55,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1549 [2021-06-10 11:41:55,013 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1217818196, now seen corresponding path program 1 times [2021-06-10 11:41:55,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:55,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537109579] [2021-06-10 11:41:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:55,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:55,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:55,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537109579] [2021-06-10 11:41:55,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:55,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:55,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883599786] [2021-06-10 11:41:55,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:55,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:55,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:55,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 845 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:55,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:55,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:55,329 INFO L129 PetriNetUnfolder]: 90/944 cut-off events. [2021-06-10 11:41:55,329 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:55,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 944 events. 90/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3811 event pairs, 0 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 1051. Up to 33 conditions per place. [2021-06-10 11:41:55,391 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/843 dead transitions. [2021-06-10 11:41:55,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 829 places, 843 transitions, 1882 flow [2021-06-10 11:41:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:41:55,393 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:41:55,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:41:55,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:41:55,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:55,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:41:55,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,396 INFO L185 Difference]: Start difference. First operand has 827 places, 845 transitions, 1879 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:41:55,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 829 places, 843 transitions, 1882 flow [2021-06-10 11:41:55,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 843 transitions, 1875 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:55,404 INFO L241 Difference]: Finished difference. Result has 827 places, 843 transitions, 1868 flow [2021-06-10 11:41:55,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=827, PETRI_TRANSITIONS=843} [2021-06-10 11:41:55,404 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -26 predicate places. [2021-06-10 11:41:55,404 INFO L480 AbstractCegarLoop]: Abstraction has has 827 places, 843 transitions, 1868 flow [2021-06-10 11:41:55,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:55,404 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:55,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1550 [2021-06-10 11:41:55,405 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1217817173, now seen corresponding path program 1 times [2021-06-10 11:41:55,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:55,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981981147] [2021-06-10 11:41:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:55,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:55,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:41:55,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981981147] [2021-06-10 11:41:55,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:55,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:55,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645593306] [2021-06-10 11:41:55,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:55,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:55,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:55,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 843 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:55,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:55,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:55,719 INFO L129 PetriNetUnfolder]: 90/942 cut-off events. [2021-06-10 11:41:55,719 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:55,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 942 events. 90/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3798 event pairs, 0 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 1051. Up to 33 conditions per place. [2021-06-10 11:41:55,780 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/841 dead transitions. [2021-06-10 11:41:55,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 841 transitions, 1881 flow [2021-06-10 11:41:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:41:55,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:41:55,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:41:55,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:41:55,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:55,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:41:55,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,784 INFO L185 Difference]: Start difference. First operand has 827 places, 843 transitions, 1868 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:41:55,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 827 places, 841 transitions, 1881 flow [2021-06-10 11:41:55,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 841 transitions, 1880 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:55,792 INFO L241 Difference]: Finished difference. Result has 826 places, 841 transitions, 1864 flow [2021-06-10 11:41:55,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1864, PETRI_PLACES=826, PETRI_TRANSITIONS=841} [2021-06-10 11:41:55,792 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -27 predicate places. [2021-06-10 11:41:55,792 INFO L480 AbstractCegarLoop]: Abstraction has has 826 places, 841 transitions, 1864 flow [2021-06-10 11:41:55,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:55,793 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:55,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1551 [2021-06-10 11:41:55,793 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1596724948, now seen corresponding path program 1 times [2021-06-10 11:41:55,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:55,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051571993] [2021-06-10 11:41:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:55,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:55,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:55,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:55,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051571993] [2021-06-10 11:41:55,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:55,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:55,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511083027] [2021-06-10 11:41:55,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:55,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:55,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:55,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 826 places, 841 transitions, 1864 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:55,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:55,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:55,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:56,104 INFO L129 PetriNetUnfolder]: 89/949 cut-off events. [2021-06-10 11:41:56,104 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:56,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 949 events. 89/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3855 event pairs, 0 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1056. Up to 33 conditions per place. [2021-06-10 11:41:56,164 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/842 dead transitions. [2021-06-10 11:41:56,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 842 transitions, 1880 flow [2021-06-10 11:41:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:41:56,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:41:56,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:41:56,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:41:56,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:56,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:41:56,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,168 INFO L185 Difference]: Start difference. First operand has 826 places, 841 transitions, 1864 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:41:56,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 842 transitions, 1880 flow [2021-06-10 11:41:56,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 842 transitions, 1879 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:56,176 INFO L241 Difference]: Finished difference. Result has 828 places, 841 transitions, 1868 flow [2021-06-10 11:41:56,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=828, PETRI_TRANSITIONS=841} [2021-06-10 11:41:56,176 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -25 predicate places. [2021-06-10 11:41:56,176 INFO L480 AbstractCegarLoop]: Abstraction has has 828 places, 841 transitions, 1868 flow [2021-06-10 11:41:56,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:56,177 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:56,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1552 [2021-06-10 11:41:56,177 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1596725971, now seen corresponding path program 1 times [2021-06-10 11:41:56,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:56,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91138658] [2021-06-10 11:41:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:56,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:56,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:56,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91138658] [2021-06-10 11:41:56,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:56,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:56,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689702603] [2021-06-10 11:41:56,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:56,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:56,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:56,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 841 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:56,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:56,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:56,500 INFO L129 PetriNetUnfolder]: 87/951 cut-off events. [2021-06-10 11:41:56,500 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:56,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 951 events. 87/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3891 event pairs, 0 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1067. Up to 33 conditions per place. [2021-06-10 11:41:56,562 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/842 dead transitions. [2021-06-10 11:41:56,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 830 places, 842 transitions, 1894 flow [2021-06-10 11:41:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:41:56,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:41:56,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:41:56,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:41:56,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:56,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:41:56,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,566 INFO L185 Difference]: Start difference. First operand has 828 places, 841 transitions, 1868 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:41:56,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 830 places, 842 transitions, 1894 flow [2021-06-10 11:41:56,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 842 transitions, 1893 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:56,573 INFO L241 Difference]: Finished difference. Result has 831 places, 842 transitions, 1885 flow [2021-06-10 11:41:56,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=827, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1885, PETRI_PLACES=831, PETRI_TRANSITIONS=842} [2021-06-10 11:41:56,574 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -22 predicate places. [2021-06-10 11:41:56,574 INFO L480 AbstractCegarLoop]: Abstraction has has 831 places, 842 transitions, 1885 flow [2021-06-10 11:41:56,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:56,574 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:56,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1553 [2021-06-10 11:41:56,574 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1595772659, now seen corresponding path program 1 times [2021-06-10 11:41:56,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:56,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111648912] [2021-06-10 11:41:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:56,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:56,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:56,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111648912] [2021-06-10 11:41:56,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:56,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:56,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069161770] [2021-06-10 11:41:56,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:56,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:56,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:56,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 842 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:56,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:56,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:56,885 INFO L129 PetriNetUnfolder]: 87/944 cut-off events. [2021-06-10 11:41:56,885 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:56,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 944 events. 87/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3828 event pairs, 0 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 1053. Up to 33 conditions per place. [2021-06-10 11:41:56,927 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/840 dead transitions. [2021-06-10 11:41:56,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 840 transitions, 1887 flow [2021-06-10 11:41:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:41:56,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:41:56,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:41:56,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:41:56,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:56,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:41:56,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,931 INFO L185 Difference]: Start difference. First operand has 831 places, 842 transitions, 1885 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:41:56,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 840 transitions, 1887 flow [2021-06-10 11:41:56,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 840 transitions, 1879 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:56,938 INFO L241 Difference]: Finished difference. Result has 831 places, 840 transitions, 1872 flow [2021-06-10 11:41:56,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1872, PETRI_PLACES=831, PETRI_TRANSITIONS=840} [2021-06-10 11:41:56,938 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -22 predicate places. [2021-06-10 11:41:56,939 INFO L480 AbstractCegarLoop]: Abstraction has has 831 places, 840 transitions, 1872 flow [2021-06-10 11:41:56,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:56,939 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:56,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1554 [2021-06-10 11:41:56,939 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1595771636, now seen corresponding path program 1 times [2021-06-10 11:41:56,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:56,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649050460] [2021-06-10 11:41:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:56,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:56,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:56,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:41:56,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649050460] [2021-06-10 11:41:56,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:56,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:56,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473395029] [2021-06-10 11:41:56,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:56,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:56,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:56,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 840 transitions, 1872 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:56,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:56,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:56,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:57,254 INFO L129 PetriNetUnfolder]: 87/942 cut-off events. [2021-06-10 11:41:57,254 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:57,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 942 events. 87/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3815 event pairs, 0 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1057. Up to 33 conditions per place. [2021-06-10 11:41:57,317 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/838 dead transitions. [2021-06-10 11:41:57,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 838 transitions, 1885 flow [2021-06-10 11:41:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:41:57,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:41:57,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:41:57,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:41:57,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:57,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:41:57,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,321 INFO L185 Difference]: Start difference. First operand has 831 places, 840 transitions, 1872 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:41:57,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 831 places, 838 transitions, 1885 flow [2021-06-10 11:41:57,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 838 transitions, 1884 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:57,329 INFO L241 Difference]: Finished difference. Result has 830 places, 838 transitions, 1868 flow [2021-06-10 11:41:57,330 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=830, PETRI_TRANSITIONS=838} [2021-06-10 11:41:57,330 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -23 predicate places. [2021-06-10 11:41:57,330 INFO L480 AbstractCegarLoop]: Abstraction has has 830 places, 838 transitions, 1868 flow [2021-06-10 11:41:57,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:57,330 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:57,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1555 [2021-06-10 11:41:57,330 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1706873356, now seen corresponding path program 1 times [2021-06-10 11:41:57,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:57,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093204674] [2021-06-10 11:41:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:57,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:57,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:57,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:57,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093204674] [2021-06-10 11:41:57,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:57,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:57,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338367613] [2021-06-10 11:41:57,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:57,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:57,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:57,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:57,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:57,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 830 places, 838 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:57,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:57,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:57,660 INFO L129 PetriNetUnfolder]: 86/949 cut-off events. [2021-06-10 11:41:57,660 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:57,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 949 events. 86/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3872 event pairs, 0 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 1062. Up to 33 conditions per place. [2021-06-10 11:41:57,721 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/839 dead transitions. [2021-06-10 11:41:57,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 832 places, 839 transitions, 1884 flow [2021-06-10 11:41:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:41:57,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:41:57,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:41:57,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:41:57,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:57,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:41:57,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,725 INFO L185 Difference]: Start difference. First operand has 830 places, 838 transitions, 1868 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:41:57,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 832 places, 839 transitions, 1884 flow [2021-06-10 11:41:57,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 831 places, 839 transitions, 1883 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:57,732 INFO L241 Difference]: Finished difference. Result has 832 places, 838 transitions, 1872 flow [2021-06-10 11:41:57,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=829, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1872, PETRI_PLACES=832, PETRI_TRANSITIONS=838} [2021-06-10 11:41:57,733 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -21 predicate places. [2021-06-10 11:41:57,733 INFO L480 AbstractCegarLoop]: Abstraction has has 832 places, 838 transitions, 1872 flow [2021-06-10 11:41:57,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,733 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:57,733 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:57,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1556 [2021-06-10 11:41:57,733 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1706872333, now seen corresponding path program 1 times [2021-06-10 11:41:57,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:57,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675083741] [2021-06-10 11:41:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:57,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:57,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:57,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:57,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:57,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675083741] [2021-06-10 11:41:57,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:57,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:57,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664661100] [2021-06-10 11:41:57,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:57,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:57,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:57,751 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:57,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 832 places, 838 transitions, 1872 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:57,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:57,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:57,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:58,056 INFO L129 PetriNetUnfolder]: 84/951 cut-off events. [2021-06-10 11:41:58,057 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:58,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 951 events. 84/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3908 event pairs, 0 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1073. Up to 33 conditions per place. [2021-06-10 11:41:58,117 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/839 dead transitions. [2021-06-10 11:41:58,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 839 transitions, 1898 flow [2021-06-10 11:41:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:41:58,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:41:58,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:41:58,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:41:58,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:58,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:41:58,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,121 INFO L185 Difference]: Start difference. First operand has 832 places, 838 transitions, 1872 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:41:58,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 834 places, 839 transitions, 1898 flow [2021-06-10 11:41:58,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 833 places, 839 transitions, 1897 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:58,128 INFO L241 Difference]: Finished difference. Result has 835 places, 839 transitions, 1889 flow [2021-06-10 11:41:58,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=835, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=835, PETRI_TRANSITIONS=839} [2021-06-10 11:41:58,129 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -18 predicate places. [2021-06-10 11:41:58,129 INFO L480 AbstractCegarLoop]: Abstraction has has 835 places, 839 transitions, 1889 flow [2021-06-10 11:41:58,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:58,129 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:58,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1557 [2021-06-10 11:41:58,129 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1707825645, now seen corresponding path program 1 times [2021-06-10 11:41:58,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:58,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103270773] [2021-06-10 11:41:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:58,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:58,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:58,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103270773] [2021-06-10 11:41:58,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:58,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:58,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729307076] [2021-06-10 11:41:58,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:58,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:58,147 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:58,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 839 transitions, 1889 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:58,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:58,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:58,450 INFO L129 PetriNetUnfolder]: 84/944 cut-off events. [2021-06-10 11:41:58,450 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:58,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 944 events. 84/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3842 event pairs, 0 based on Foata normal form. 1/830 useless extension candidates. Maximal degree in co-relation 1059. Up to 33 conditions per place. [2021-06-10 11:41:58,512 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/837 dead transitions. [2021-06-10 11:41:58,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 837 transitions, 1891 flow [2021-06-10 11:41:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:41:58,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:41:58,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:41:58,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:41:58,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:58,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:41:58,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,517 INFO L185 Difference]: Start difference. First operand has 835 places, 839 transitions, 1889 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:41:58,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 837 places, 837 transitions, 1891 flow [2021-06-10 11:41:58,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 837 transitions, 1883 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:41:58,524 INFO L241 Difference]: Finished difference. Result has 835 places, 837 transitions, 1876 flow [2021-06-10 11:41:58,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=835, PETRI_TRANSITIONS=837} [2021-06-10 11:41:58,524 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -18 predicate places. [2021-06-10 11:41:58,525 INFO L480 AbstractCegarLoop]: Abstraction has has 835 places, 837 transitions, 1876 flow [2021-06-10 11:41:58,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,525 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:58,525 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:58,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1558 [2021-06-10 11:41:58,525 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1707826668, now seen corresponding path program 1 times [2021-06-10 11:41:58,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:58,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8589947] [2021-06-10 11:41:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:58,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:41:58,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:41:58,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8589947] [2021-06-10 11:41:58,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:58,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:58,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85176385] [2021-06-10 11:41:58,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:58,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:58,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:58,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 837 transitions, 1876 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:58,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:58,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:58,865 INFO L129 PetriNetUnfolder]: 84/942 cut-off events. [2021-06-10 11:41:58,866 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:41:58,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 942 events. 84/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3827 event pairs, 0 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1063. Up to 33 conditions per place. [2021-06-10 11:41:58,964 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/835 dead transitions. [2021-06-10 11:41:58,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 835 transitions, 1889 flow [2021-06-10 11:41:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:41:58,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:41:58,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:41:58,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:41:58,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:58,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:41:58,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,969 INFO L185 Difference]: Start difference. First operand has 835 places, 837 transitions, 1876 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:41:58,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 835 places, 835 transitions, 1889 flow [2021-06-10 11:41:58,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 835 transitions, 1888 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:58,975 INFO L241 Difference]: Finished difference. Result has 834 places, 835 transitions, 1872 flow [2021-06-10 11:41:58,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1872, PETRI_PLACES=834, PETRI_TRANSITIONS=835} [2021-06-10 11:41:58,976 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -19 predicate places. [2021-06-10 11:41:58,976 INFO L480 AbstractCegarLoop]: Abstraction has has 834 places, 835 transitions, 1872 flow [2021-06-10 11:41:58,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:58,976 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:58,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1559 [2021-06-10 11:41:58,976 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1407641836, now seen corresponding path program 1 times [2021-06-10 11:41:58,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:58,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031303039] [2021-06-10 11:41:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:58,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:41:58,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:58,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:58,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031303039] [2021-06-10 11:41:58,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:58,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:58,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162071921] [2021-06-10 11:41:58,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:58,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:58,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:41:58,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 835 transitions, 1872 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:58,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:58,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:41:58,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:59,308 INFO L129 PetriNetUnfolder]: 83/950 cut-off events. [2021-06-10 11:41:59,308 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:41:59,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 950 events. 83/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3901 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1075. Up to 33 conditions per place. [2021-06-10 11:41:59,369 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/837 dead transitions. [2021-06-10 11:41:59,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 837 transitions, 1902 flow [2021-06-10 11:41:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:41:59,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:41:59,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:41:59,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:41:59,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:59,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:41:59,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:41:59,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,374 INFO L185 Difference]: Start difference. First operand has 834 places, 835 transitions, 1872 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:41:59,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 836 places, 837 transitions, 1902 flow [2021-06-10 11:41:59,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 835 places, 837 transitions, 1901 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:59,383 INFO L241 Difference]: Finished difference. Result has 837 places, 837 transitions, 1895 flow [2021-06-10 11:41:59,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=833, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=837, PETRI_TRANSITIONS=837} [2021-06-10 11:41:59,383 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -16 predicate places. [2021-06-10 11:41:59,383 INFO L480 AbstractCegarLoop]: Abstraction has has 837 places, 837 transitions, 1895 flow [2021-06-10 11:41:59,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,383 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:59,383 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:59,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1560 [2021-06-10 11:41:59,384 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1407642859, now seen corresponding path program 1 times [2021-06-10 11:41:59,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:59,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198313621] [2021-06-10 11:41:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:59,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:59,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:59,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:59,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198313621] [2021-06-10 11:41:59,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:59,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:59,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582733883] [2021-06-10 11:41:59,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:59,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:59,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:59,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:59,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 837 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:59,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:59,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:41:59,726 INFO L129 PetriNetUnfolder]: 81/951 cut-off events. [2021-06-10 11:41:59,726 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:41:59,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 951 events. 81/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3924 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1075. Up to 33 conditions per place. [2021-06-10 11:41:59,787 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/837 dead transitions. [2021-06-10 11:41:59,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 837 transitions, 1907 flow [2021-06-10 11:41:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:41:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:41:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:41:59,789 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:41:59,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:41:59,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:41:59,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:41:59,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:41:59,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,791 INFO L185 Difference]: Start difference. First operand has 837 places, 837 transitions, 1895 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:41:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 837 transitions, 1907 flow [2021-06-10 11:41:59,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 837 transitions, 1902 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:41:59,799 INFO L241 Difference]: Finished difference. Result has 839 places, 836 transitions, 1891 flow [2021-06-10 11:41:59,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=835, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=839, PETRI_TRANSITIONS=836} [2021-06-10 11:41:59,799 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -14 predicate places. [2021-06-10 11:41:59,799 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 836 transitions, 1891 flow [2021-06-10 11:41:59,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:41:59,800 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:41:59,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1561 [2021-06-10 11:41:59,800 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:41:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:41:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1408595148, now seen corresponding path program 1 times [2021-06-10 11:41:59,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:41:59,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442323493] [2021-06-10 11:41:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:41:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:41:59,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:59,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:41:59,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:41:59,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:41:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:41:59,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442323493] [2021-06-10 11:41:59,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:41:59,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:41:59,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702781019] [2021-06-10 11:41:59,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:41:59,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:41:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:41:59,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:41:59,824 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:41:59,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 836 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:41:59,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:41:59,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:41:59,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:00,133 INFO L129 PetriNetUnfolder]: 81/944 cut-off events. [2021-06-10 11:42:00,134 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:00,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 944 events. 81/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3860 event pairs, 0 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 1069. Up to 33 conditions per place. [2021-06-10 11:42:00,193 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/834 dead transitions. [2021-06-10 11:42:00,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 841 places, 834 transitions, 1894 flow [2021-06-10 11:42:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:00,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:00,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:00,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:00,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:00,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:00,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,197 INFO L185 Difference]: Start difference. First operand has 839 places, 836 transitions, 1891 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:00,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 841 places, 834 transitions, 1894 flow [2021-06-10 11:42:00,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 834 transitions, 1887 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:00,205 INFO L241 Difference]: Finished difference. Result has 839 places, 834 transitions, 1880 flow [2021-06-10 11:42:00,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1880, PETRI_PLACES=839, PETRI_TRANSITIONS=834} [2021-06-10 11:42:00,205 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -14 predicate places. [2021-06-10 11:42:00,205 INFO L480 AbstractCegarLoop]: Abstraction has has 839 places, 834 transitions, 1880 flow [2021-06-10 11:42:00,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:00,205 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:00,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1562 [2021-06-10 11:42:00,206 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1408596171, now seen corresponding path program 1 times [2021-06-10 11:42:00,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:00,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167153620] [2021-06-10 11:42:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:00,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:00,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:00,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:42:00,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167153620] [2021-06-10 11:42:00,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:00,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:00,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466201390] [2021-06-10 11:42:00,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:00,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:00,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:00,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 834 transitions, 1880 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:00,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:00,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:00,528 INFO L129 PetriNetUnfolder]: 81/942 cut-off events. [2021-06-10 11:42:00,528 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:00,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 942 events. 81/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3848 event pairs, 0 based on Foata normal form. 0/829 useless extension candidates. Maximal degree in co-relation 1069. Up to 33 conditions per place. [2021-06-10 11:42:00,587 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/832 dead transitions. [2021-06-10 11:42:00,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 832 transitions, 1893 flow [2021-06-10 11:42:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:00,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:00,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:00,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:00,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:00,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:00,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,591 INFO L185 Difference]: Start difference. First operand has 839 places, 834 transitions, 1880 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:00,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 832 transitions, 1893 flow [2021-06-10 11:42:00,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 832 transitions, 1892 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:00,598 INFO L241 Difference]: Finished difference. Result has 838 places, 832 transitions, 1876 flow [2021-06-10 11:42:00,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=836, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=838, PETRI_TRANSITIONS=832} [2021-06-10 11:42:00,599 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -15 predicate places. [2021-06-10 11:42:00,599 INFO L480 AbstractCegarLoop]: Abstraction has has 838 places, 832 transitions, 1876 flow [2021-06-10 11:42:00,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,599 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:00,599 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:00,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1563 [2021-06-10 11:42:00,599 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:00,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1553355223, now seen corresponding path program 1 times [2021-06-10 11:42:00,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:00,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463496506] [2021-06-10 11:42:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:00,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:00,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:00,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:00,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:00,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463496506] [2021-06-10 11:42:00,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:00,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:00,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629221984] [2021-06-10 11:42:00,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:00,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:00,618 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:00,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 838 places, 832 transitions, 1876 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:00,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:00,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:00,931 INFO L129 PetriNetUnfolder]: 80/950 cut-off events. [2021-06-10 11:42:00,932 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:00,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 950 events. 80/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3917 event pairs, 0 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1081. Up to 33 conditions per place. [2021-06-10 11:42:00,992 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/834 dead transitions. [2021-06-10 11:42:00,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 840 places, 834 transitions, 1906 flow [2021-06-10 11:42:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:00,993 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:00,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:00,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:00,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:00,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:00,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:00,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:00,996 INFO L185 Difference]: Start difference. First operand has 838 places, 832 transitions, 1876 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:00,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 840 places, 834 transitions, 1906 flow [2021-06-10 11:42:01,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 839 places, 834 transitions, 1905 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:01,004 INFO L241 Difference]: Finished difference. Result has 841 places, 834 transitions, 1899 flow [2021-06-10 11:42:01,004 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=841, PETRI_TRANSITIONS=834} [2021-06-10 11:42:01,004 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -12 predicate places. [2021-06-10 11:42:01,004 INFO L480 AbstractCegarLoop]: Abstraction has has 841 places, 834 transitions, 1899 flow [2021-06-10 11:42:01,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:01,005 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:01,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1564 [2021-06-10 11:42:01,005 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1553356246, now seen corresponding path program 1 times [2021-06-10 11:42:01,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:01,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164434803] [2021-06-10 11:42:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:01,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:01,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:01,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164434803] [2021-06-10 11:42:01,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:01,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:01,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948804160] [2021-06-10 11:42:01,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:01,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:01,024 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:01,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 841 places, 834 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:01,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:01,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:01,345 INFO L129 PetriNetUnfolder]: 79/948 cut-off events. [2021-06-10 11:42:01,346 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:01,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 948 events. 79/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3905 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1078. Up to 33 conditions per place. [2021-06-10 11:42:01,406 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/834 dead transitions. [2021-06-10 11:42:01,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 834 transitions, 1911 flow [2021-06-10 11:42:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:01,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:01,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:01,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:01,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:01,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:01,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,410 INFO L185 Difference]: Start difference. First operand has 841 places, 834 transitions, 1899 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:01,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 834 transitions, 1911 flow [2021-06-10 11:42:01,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 834 transitions, 1906 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:01,417 INFO L241 Difference]: Finished difference. Result has 844 places, 834 transitions, 1904 flow [2021-06-10 11:42:01,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=844, PETRI_TRANSITIONS=834} [2021-06-10 11:42:01,418 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -9 predicate places. [2021-06-10 11:42:01,418 INFO L480 AbstractCegarLoop]: Abstraction has has 844 places, 834 transitions, 1904 flow [2021-06-10 11:42:01,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:01,418 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:01,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1565 [2021-06-10 11:42:01,418 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1554308535, now seen corresponding path program 1 times [2021-06-10 11:42:01,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:01,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194549404] [2021-06-10 11:42:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:01,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:01,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:01,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194549404] [2021-06-10 11:42:01,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:01,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:01,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814793356] [2021-06-10 11:42:01,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:01,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:01,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:01,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 844 places, 834 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:01,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:01,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:01,759 INFO L129 PetriNetUnfolder]: 78/944 cut-off events. [2021-06-10 11:42:01,759 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:01,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 944 events. 78/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3881 event pairs, 0 based on Foata normal form. 1/836 useless extension candidates. Maximal degree in co-relation 1075. Up to 33 conditions per place. [2021-06-10 11:42:01,819 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/831 dead transitions. [2021-06-10 11:42:01,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 831 transitions, 1901 flow [2021-06-10 11:42:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:01,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:01,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:01,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:01,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:01,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:01,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,823 INFO L185 Difference]: Start difference. First operand has 844 places, 834 transitions, 1904 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:01,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 831 transitions, 1901 flow [2021-06-10 11:42:01,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 831 transitions, 1894 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:01,831 INFO L241 Difference]: Finished difference. Result has 843 places, 831 transitions, 1884 flow [2021-06-10 11:42:01,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1884, PETRI_PLACES=843, PETRI_TRANSITIONS=831} [2021-06-10 11:42:01,832 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -10 predicate places. [2021-06-10 11:42:01,832 INFO L480 AbstractCegarLoop]: Abstraction has has 843 places, 831 transitions, 1884 flow [2021-06-10 11:42:01,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,832 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:01,832 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:01,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1566 [2021-06-10 11:42:01,832 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1554309558, now seen corresponding path program 1 times [2021-06-10 11:42:01,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:01,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912807570] [2021-06-10 11:42:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:01,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:01,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:01,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:01,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912807570] [2021-06-10 11:42:01,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:01,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:01,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460828386] [2021-06-10 11:42:01,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:01,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:01,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:01,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 831 transitions, 1884 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:01,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:01,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:01,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:02,160 INFO L129 PetriNetUnfolder]: 78/942 cut-off events. [2021-06-10 11:42:02,160 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:02,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 942 events. 78/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3867 event pairs, 0 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1076. Up to 33 conditions per place. [2021-06-10 11:42:02,219 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/829 dead transitions. [2021-06-10 11:42:02,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 829 transitions, 1897 flow [2021-06-10 11:42:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:02,221 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:02,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:02,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:02,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:02,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:02,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,224 INFO L185 Difference]: Start difference. First operand has 843 places, 831 transitions, 1884 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:02,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 829 transitions, 1897 flow [2021-06-10 11:42:02,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 842 places, 829 transitions, 1896 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:02,232 INFO L241 Difference]: Finished difference. Result has 842 places, 829 transitions, 1880 flow [2021-06-10 11:42:02,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=840, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1880, PETRI_PLACES=842, PETRI_TRANSITIONS=829} [2021-06-10 11:42:02,232 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -11 predicate places. [2021-06-10 11:42:02,232 INFO L480 AbstractCegarLoop]: Abstraction has has 842 places, 829 transitions, 1880 flow [2021-06-10 11:42:02,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:02,232 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:02,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1567 [2021-06-10 11:42:02,232 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1861593689, now seen corresponding path program 1 times [2021-06-10 11:42:02,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:02,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456263943] [2021-06-10 11:42:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:02,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:02,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:02,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:02,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456263943] [2021-06-10 11:42:02,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:02,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:02,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286031180] [2021-06-10 11:42:02,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:02,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:02,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:02,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:02,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:02,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 829 transitions, 1880 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:02,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:02,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:02,573 INFO L129 PetriNetUnfolder]: 77/950 cut-off events. [2021-06-10 11:42:02,573 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:02,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 950 events. 77/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3936 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1088. Up to 33 conditions per place. [2021-06-10 11:42:02,634 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/831 dead transitions. [2021-06-10 11:42:02,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 844 places, 831 transitions, 1910 flow [2021-06-10 11:42:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:02,635 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:02,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:02,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:02,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:02,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:02,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:02,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,638 INFO L185 Difference]: Start difference. First operand has 842 places, 829 transitions, 1880 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:02,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 844 places, 831 transitions, 1910 flow [2021-06-10 11:42:02,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 831 transitions, 1909 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:02,646 INFO L241 Difference]: Finished difference. Result has 845 places, 831 transitions, 1903 flow [2021-06-10 11:42:02,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1879, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=845, PETRI_TRANSITIONS=831} [2021-06-10 11:42:02,646 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -8 predicate places. [2021-06-10 11:42:02,646 INFO L480 AbstractCegarLoop]: Abstraction has has 845 places, 831 transitions, 1903 flow [2021-06-10 11:42:02,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:02,646 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:02,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1568 [2021-06-10 11:42:02,646 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1861592666, now seen corresponding path program 1 times [2021-06-10 11:42:02,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:02,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448295316] [2021-06-10 11:42:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:02,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:02,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:02,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:02,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:02,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448295316] [2021-06-10 11:42:02,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:02,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:02,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988827579] [2021-06-10 11:42:02,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:02,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:02,665 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:02,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 831 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:02,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:02,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:02,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:02,986 INFO L129 PetriNetUnfolder]: 75/951 cut-off events. [2021-06-10 11:42:02,986 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:03,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 951 events. 75/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3960 event pairs, 0 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1088. Up to 33 conditions per place. [2021-06-10 11:42:03,046 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/831 dead transitions. [2021-06-10 11:42:03,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 831 transitions, 1915 flow [2021-06-10 11:42:03,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:03,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:03,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:03,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:03,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:03,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:03,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,050 INFO L185 Difference]: Start difference. First operand has 845 places, 831 transitions, 1903 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:03,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 831 transitions, 1915 flow [2021-06-10 11:42:03,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 831 transitions, 1910 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:03,058 INFO L241 Difference]: Finished difference. Result has 847 places, 830 transitions, 1899 flow [2021-06-10 11:42:03,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=847, PETRI_TRANSITIONS=830} [2021-06-10 11:42:03,058 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -6 predicate places. [2021-06-10 11:42:03,058 INFO L480 AbstractCegarLoop]: Abstraction has has 847 places, 830 transitions, 1899 flow [2021-06-10 11:42:03,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:03,058 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:03,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1569 [2021-06-10 11:42:03,059 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1860640377, now seen corresponding path program 1 times [2021-06-10 11:42:03,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:03,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95047635] [2021-06-10 11:42:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:03,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:03,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:03,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95047635] [2021-06-10 11:42:03,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:03,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:03,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985641691] [2021-06-10 11:42:03,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:03,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:03,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:03,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 847 places, 830 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:03,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:03,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:03,382 INFO L129 PetriNetUnfolder]: 75/944 cut-off events. [2021-06-10 11:42:03,383 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:03,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 944 events. 75/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3895 event pairs, 0 based on Foata normal form. 1/839 useless extension candidates. Maximal degree in co-relation 1082. Up to 33 conditions per place. [2021-06-10 11:42:03,434 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/828 dead transitions. [2021-06-10 11:42:03,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 828 transitions, 1902 flow [2021-06-10 11:42:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:03,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:03,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:03,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:03,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:03,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:03,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,447 INFO L185 Difference]: Start difference. First operand has 847 places, 830 transitions, 1899 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:03,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 849 places, 828 transitions, 1902 flow [2021-06-10 11:42:03,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 828 transitions, 1895 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:03,454 INFO L241 Difference]: Finished difference. Result has 847 places, 828 transitions, 1888 flow [2021-06-10 11:42:03,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1888, PETRI_PLACES=847, PETRI_TRANSITIONS=828} [2021-06-10 11:42:03,455 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -6 predicate places. [2021-06-10 11:42:03,455 INFO L480 AbstractCegarLoop]: Abstraction has has 847 places, 828 transitions, 1888 flow [2021-06-10 11:42:03,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:03,455 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:03,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1570 [2021-06-10 11:42:03,455 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1860639354, now seen corresponding path program 1 times [2021-06-10 11:42:03,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:03,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575822958] [2021-06-10 11:42:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:03,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:03,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:03,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575822958] [2021-06-10 11:42:03,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:03,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:03,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802027466] [2021-06-10 11:42:03,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:03,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:03,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:03,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:03,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 847 places, 828 transitions, 1888 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:03,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:03,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:03,788 INFO L129 PetriNetUnfolder]: 75/942 cut-off events. [2021-06-10 11:42:03,789 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:03,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 942 events. 75/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3884 event pairs, 0 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1082. Up to 33 conditions per place. [2021-06-10 11:42:03,852 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/826 dead transitions. [2021-06-10 11:42:03,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 826 transitions, 1901 flow [2021-06-10 11:42:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:03,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:03,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:03,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:03,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:03,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:03,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,856 INFO L185 Difference]: Start difference. First operand has 847 places, 828 transitions, 1888 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:03,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 826 transitions, 1901 flow [2021-06-10 11:42:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 826 transitions, 1900 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:03,864 INFO L241 Difference]: Finished difference. Result has 846 places, 826 transitions, 1884 flow [2021-06-10 11:42:03,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1884, PETRI_PLACES=846, PETRI_TRANSITIONS=826} [2021-06-10 11:42:03,865 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -7 predicate places. [2021-06-10 11:42:03,865 INFO L480 AbstractCegarLoop]: Abstraction has has 846 places, 826 transitions, 1884 flow [2021-06-10 11:42:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:03,865 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:03,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1571 [2021-06-10 11:42:03,865 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 89359997, now seen corresponding path program 1 times [2021-06-10 11:42:03,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:03,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557902539] [2021-06-10 11:42:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:03,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:03,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:03,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:03,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557902539] [2021-06-10 11:42:03,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:03,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:03,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851408584] [2021-06-10 11:42:03,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:03,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:03,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:03,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 826 transitions, 1884 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:03,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:03,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:03,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:04,222 INFO L129 PetriNetUnfolder]: 74/950 cut-off events. [2021-06-10 11:42:04,222 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:04,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 950 events. 74/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3952 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1094. Up to 33 conditions per place. [2021-06-10 11:42:04,281 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/828 dead transitions. [2021-06-10 11:42:04,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 848 places, 828 transitions, 1914 flow [2021-06-10 11:42:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:04,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:04,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:04,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:04,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:04,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:04,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:04,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,285 INFO L185 Difference]: Start difference. First operand has 846 places, 826 transitions, 1884 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:04,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 848 places, 828 transitions, 1914 flow [2021-06-10 11:42:04,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 847 places, 828 transitions, 1913 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:04,292 INFO L241 Difference]: Finished difference. Result has 849 places, 828 transitions, 1907 flow [2021-06-10 11:42:04,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=845, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=849, PETRI_TRANSITIONS=828} [2021-06-10 11:42:04,293 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -4 predicate places. [2021-06-10 11:42:04,293 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 828 transitions, 1907 flow [2021-06-10 11:42:04,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:04,293 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:04,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1572 [2021-06-10 11:42:04,293 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 89358974, now seen corresponding path program 1 times [2021-06-10 11:42:04,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:04,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516901425] [2021-06-10 11:42:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:04,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:04,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:04,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:04,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516901425] [2021-06-10 11:42:04,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:04,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:04,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433129967] [2021-06-10 11:42:04,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:04,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:04,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:04,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:04,314 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:04,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 828 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:04,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:04,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:04,638 INFO L129 PetriNetUnfolder]: 72/951 cut-off events. [2021-06-10 11:42:04,638 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:04,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 951 events. 72/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3978 event pairs, 0 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1094. Up to 33 conditions per place. [2021-06-10 11:42:04,698 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/828 dead transitions. [2021-06-10 11:42:04,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 828 transitions, 1919 flow [2021-06-10 11:42:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:04,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:04,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:04,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:04,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:04,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:04,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,702 INFO L185 Difference]: Start difference. First operand has 849 places, 828 transitions, 1907 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:04,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 828 transitions, 1919 flow [2021-06-10 11:42:04,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 828 transitions, 1914 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:04,710 INFO L241 Difference]: Finished difference. Result has 851 places, 827 transitions, 1903 flow [2021-06-10 11:42:04,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=851, PETRI_TRANSITIONS=827} [2021-06-10 11:42:04,710 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -2 predicate places. [2021-06-10 11:42:04,710 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 827 transitions, 1903 flow [2021-06-10 11:42:04,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:04,710 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:04,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1573 [2021-06-10 11:42:04,710 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash 88406685, now seen corresponding path program 1 times [2021-06-10 11:42:04,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:04,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183715402] [2021-06-10 11:42:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:04,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:04,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:04,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:04,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:04,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183715402] [2021-06-10 11:42:04,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:04,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:04,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136517198] [2021-06-10 11:42:04,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:04,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:04,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:04,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 827 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:04,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:04,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:04,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:05,056 INFO L129 PetriNetUnfolder]: 72/944 cut-off events. [2021-06-10 11:42:05,057 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:05,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 944 events. 72/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3915 event pairs, 0 based on Foata normal form. 1/842 useless extension candidates. Maximal degree in co-relation 1088. Up to 33 conditions per place. [2021-06-10 11:42:05,117 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/825 dead transitions. [2021-06-10 11:42:05,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 825 transitions, 1906 flow [2021-06-10 11:42:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:05,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:05,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:05,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:05,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:05,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:05,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,121 INFO L185 Difference]: Start difference. First operand has 851 places, 827 transitions, 1903 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:05,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 825 transitions, 1906 flow [2021-06-10 11:42:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 825 transitions, 1899 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:05,129 INFO L241 Difference]: Finished difference. Result has 851 places, 825 transitions, 1892 flow [2021-06-10 11:42:05,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1892, PETRI_PLACES=851, PETRI_TRANSITIONS=825} [2021-06-10 11:42:05,129 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -2 predicate places. [2021-06-10 11:42:05,129 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 825 transitions, 1892 flow [2021-06-10 11:42:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:05,129 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:05,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1574 [2021-06-10 11:42:05,130 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:05,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash 88405662, now seen corresponding path program 1 times [2021-06-10 11:42:05,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:05,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45914409] [2021-06-10 11:42:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:05,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:05,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:05,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45914409] [2021-06-10 11:42:05,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:05,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:05,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697881435] [2021-06-10 11:42:05,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:05,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:05,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:05,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 825 transitions, 1892 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:05,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:05,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:05,463 INFO L129 PetriNetUnfolder]: 72/942 cut-off events. [2021-06-10 11:42:05,463 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:05,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 942 events. 72/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3900 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1088. Up to 33 conditions per place. [2021-06-10 11:42:05,511 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/823 dead transitions. [2021-06-10 11:42:05,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 823 transitions, 1905 flow [2021-06-10 11:42:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:05,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:05,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:05,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:05,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:05,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:05,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,515 INFO L185 Difference]: Start difference. First operand has 851 places, 825 transitions, 1892 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:05,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 823 transitions, 1905 flow [2021-06-10 11:42:05,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 823 transitions, 1904 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:05,523 INFO L241 Difference]: Finished difference. Result has 850 places, 823 transitions, 1888 flow [2021-06-10 11:42:05,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1888, PETRI_PLACES=850, PETRI_TRANSITIONS=823} [2021-06-10 11:42:05,523 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, -3 predicate places. [2021-06-10 11:42:05,523 INFO L480 AbstractCegarLoop]: Abstraction has has 850 places, 823 transitions, 1888 flow [2021-06-10 11:42:05,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:05,523 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:05,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1575 [2021-06-10 11:42:05,523 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1860694589, now seen corresponding path program 1 times [2021-06-10 11:42:05,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:05,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535149190] [2021-06-10 11:42:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:05,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:05,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:05,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535149190] [2021-06-10 11:42:05,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:05,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:05,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877882771] [2021-06-10 11:42:05,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:05,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:05,544 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:05,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 823 transitions, 1888 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:05,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:05,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:05,867 INFO L129 PetriNetUnfolder]: 71/950 cut-off events. [2021-06-10 11:42:05,867 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:05,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 950 events. 71/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3969 event pairs, 0 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 1100. Up to 33 conditions per place. [2021-06-10 11:42:05,925 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/825 dead transitions. [2021-06-10 11:42:05,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 825 transitions, 1918 flow [2021-06-10 11:42:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:05,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:05,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:05,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:05,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:05,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:05,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:05,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,930 INFO L185 Difference]: Start difference. First operand has 850 places, 823 transitions, 1888 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:05,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 825 transitions, 1918 flow [2021-06-10 11:42:05,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 851 places, 825 transitions, 1917 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:05,938 INFO L241 Difference]: Finished difference. Result has 853 places, 825 transitions, 1911 flow [2021-06-10 11:42:05,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=849, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=853, PETRI_TRANSITIONS=825} [2021-06-10 11:42:05,938 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 0 predicate places. [2021-06-10 11:42:05,938 INFO L480 AbstractCegarLoop]: Abstraction has has 853 places, 825 transitions, 1911 flow [2021-06-10 11:42:05,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:05,939 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:05,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1576 [2021-06-10 11:42:05,939 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1860693566, now seen corresponding path program 1 times [2021-06-10 11:42:05,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:05,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765371530] [2021-06-10 11:42:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:05,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:05,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:05,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:05,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765371530] [2021-06-10 11:42:05,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:05,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:05,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101526760] [2021-06-10 11:42:05,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:05,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:05,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:05,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 825 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:05,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:05,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:05,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:06,288 INFO L129 PetriNetUnfolder]: 70/948 cut-off events. [2021-06-10 11:42:06,288 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:06,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 948 events. 70/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3958 event pairs, 0 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1097. Up to 33 conditions per place. [2021-06-10 11:42:06,350 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/825 dead transitions. [2021-06-10 11:42:06,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 825 transitions, 1923 flow [2021-06-10 11:42:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:06,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:06,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:06,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:06,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:06,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:06,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,354 INFO L185 Difference]: Start difference. First operand has 853 places, 825 transitions, 1911 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:06,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 825 transitions, 1923 flow [2021-06-10 11:42:06,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 854 places, 825 transitions, 1918 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:06,362 INFO L241 Difference]: Finished difference. Result has 856 places, 825 transitions, 1916 flow [2021-06-10 11:42:06,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=856, PETRI_TRANSITIONS=825} [2021-06-10 11:42:06,363 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 3 predicate places. [2021-06-10 11:42:06,363 INFO L480 AbstractCegarLoop]: Abstraction has has 856 places, 825 transitions, 1916 flow [2021-06-10 11:42:06,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:06,363 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:06,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1577 [2021-06-10 11:42:06,363 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1859741277, now seen corresponding path program 1 times [2021-06-10 11:42:06,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:06,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373082461] [2021-06-10 11:42:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:06,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:06,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:06,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:06,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373082461] [2021-06-10 11:42:06,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:06,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:06,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018669047] [2021-06-10 11:42:06,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:06,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:06,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:06,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:06,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:06,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 825 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:06,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:06,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:06,708 INFO L129 PetriNetUnfolder]: 69/944 cut-off events. [2021-06-10 11:42:06,708 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:06,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 944 events. 69/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3932 event pairs, 0 based on Foata normal form. 1/845 useless extension candidates. Maximal degree in co-relation 1094. Up to 33 conditions per place. [2021-06-10 11:42:06,768 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/822 dead transitions. [2021-06-10 11:42:06,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 822 transitions, 1913 flow [2021-06-10 11:42:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:06,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:06,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:06,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:06,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:06,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:06,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,772 INFO L185 Difference]: Start difference. First operand has 856 places, 825 transitions, 1916 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:06,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 822 transitions, 1913 flow [2021-06-10 11:42:06,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 822 transitions, 1906 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:06,780 INFO L241 Difference]: Finished difference. Result has 855 places, 822 transitions, 1896 flow [2021-06-10 11:42:06,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=853, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1896, PETRI_PLACES=855, PETRI_TRANSITIONS=822} [2021-06-10 11:42:06,780 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 2 predicate places. [2021-06-10 11:42:06,780 INFO L480 AbstractCegarLoop]: Abstraction has has 855 places, 822 transitions, 1896 flow [2021-06-10 11:42:06,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:06,781 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:06,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1578 [2021-06-10 11:42:06,781 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1859740254, now seen corresponding path program 1 times [2021-06-10 11:42:06,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:06,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454791337] [2021-06-10 11:42:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:06,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:06,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:06,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:06,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:06,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454791337] [2021-06-10 11:42:06,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:06,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:06,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350797708] [2021-06-10 11:42:06,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:06,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:06,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:06,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:06,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 855 places, 822 transitions, 1896 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:06,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:06,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:06,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:07,126 INFO L129 PetriNetUnfolder]: 69/942 cut-off events. [2021-06-10 11:42:07,126 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:07,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 942 events. 69/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3915 event pairs, 0 based on Foata normal form. 0/841 useless extension candidates. Maximal degree in co-relation 1095. Up to 33 conditions per place. [2021-06-10 11:42:07,185 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/820 dead transitions. [2021-06-10 11:42:07,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 820 transitions, 1909 flow [2021-06-10 11:42:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:07,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:07,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:07,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:07,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:07,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:07,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,189 INFO L185 Difference]: Start difference. First operand has 855 places, 822 transitions, 1896 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:07,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 820 transitions, 1909 flow [2021-06-10 11:42:07,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 854 places, 820 transitions, 1908 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:07,197 INFO L241 Difference]: Finished difference. Result has 854 places, 820 transitions, 1892 flow [2021-06-10 11:42:07,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=820, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1892, PETRI_PLACES=854, PETRI_TRANSITIONS=820} [2021-06-10 11:42:07,197 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 1 predicate places. [2021-06-10 11:42:07,197 INFO L480 AbstractCegarLoop]: Abstraction has has 854 places, 820 transitions, 1892 flow [2021-06-10 11:42:07,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,198 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:07,198 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:07,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1579 [2021-06-10 11:42:07,198 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:07,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2050049385, now seen corresponding path program 1 times [2021-06-10 11:42:07,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:07,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248465948] [2021-06-10 11:42:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:07,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:07,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:07,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:07,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248465948] [2021-06-10 11:42:07,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:07,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:07,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591167275] [2021-06-10 11:42:07,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:07,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:07,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:07,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 820 transitions, 1892 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:07,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:07,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:07,555 INFO L129 PetriNetUnfolder]: 68/950 cut-off events. [2021-06-10 11:42:07,555 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:07,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 950 events. 68/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3990 event pairs, 0 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1107. Up to 33 conditions per place. [2021-06-10 11:42:07,603 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/822 dead transitions. [2021-06-10 11:42:07,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 822 transitions, 1922 flow [2021-06-10 11:42:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:07,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:07,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:07,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:07,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:07,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:07,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:07,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,607 INFO L185 Difference]: Start difference. First operand has 854 places, 820 transitions, 1892 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:07,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 856 places, 822 transitions, 1922 flow [2021-06-10 11:42:07,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 822 transitions, 1921 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:07,615 INFO L241 Difference]: Finished difference. Result has 857 places, 822 transitions, 1915 flow [2021-06-10 11:42:07,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=853, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=820, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1915, PETRI_PLACES=857, PETRI_TRANSITIONS=822} [2021-06-10 11:42:07,615 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 4 predicate places. [2021-06-10 11:42:07,615 INFO L480 AbstractCegarLoop]: Abstraction has has 857 places, 822 transitions, 1915 flow [2021-06-10 11:42:07,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:07,616 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:07,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1580 [2021-06-10 11:42:07,616 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:07,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:07,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2050050408, now seen corresponding path program 1 times [2021-06-10 11:42:07,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:07,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857024937] [2021-06-10 11:42:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:07,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:07,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:07,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:07,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:07,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857024937] [2021-06-10 11:42:07,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:07,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:07,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756282602] [2021-06-10 11:42:07,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:07,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:07,638 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:07,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 822 transitions, 1915 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:07,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:07,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:07,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:07,978 INFO L129 PetriNetUnfolder]: 67/948 cut-off events. [2021-06-10 11:42:07,978 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:08,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 948 events. 67/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3978 event pairs, 0 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1104. Up to 33 conditions per place. [2021-06-10 11:42:08,037 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/822 dead transitions. [2021-06-10 11:42:08,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 822 transitions, 1927 flow [2021-06-10 11:42:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:08,038 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:08,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:08,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:08,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:08,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:08,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,041 INFO L185 Difference]: Start difference. First operand has 857 places, 822 transitions, 1915 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:08,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 822 transitions, 1927 flow [2021-06-10 11:42:08,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 822 transitions, 1922 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:08,049 INFO L241 Difference]: Finished difference. Result has 860 places, 822 transitions, 1920 flow [2021-06-10 11:42:08,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1920, PETRI_PLACES=860, PETRI_TRANSITIONS=822} [2021-06-10 11:42:08,049 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 7 predicate places. [2021-06-10 11:42:08,049 INFO L480 AbstractCegarLoop]: Abstraction has has 860 places, 822 transitions, 1920 flow [2021-06-10 11:42:08,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,050 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:08,050 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:08,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1581 [2021-06-10 11:42:08,050 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2051002697, now seen corresponding path program 1 times [2021-06-10 11:42:08,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:08,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538826995] [2021-06-10 11:42:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:08,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:08,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:08,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538826995] [2021-06-10 11:42:08,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:08,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:08,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443546301] [2021-06-10 11:42:08,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:08,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:08,071 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:08,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 860 places, 822 transitions, 1920 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:08,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:08,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:08,394 INFO L129 PetriNetUnfolder]: 66/944 cut-off events. [2021-06-10 11:42:08,394 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:08,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 944 events. 66/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3953 event pairs, 0 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 1101. Up to 33 conditions per place. [2021-06-10 11:42:08,452 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/819 dead transitions. [2021-06-10 11:42:08,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 819 transitions, 1917 flow [2021-06-10 11:42:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:08,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:08,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:08,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:08,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:08,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:08,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,457 INFO L185 Difference]: Start difference. First operand has 860 places, 822 transitions, 1920 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:08,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 819 transitions, 1917 flow [2021-06-10 11:42:08,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 819 transitions, 1910 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:08,465 INFO L241 Difference]: Finished difference. Result has 859 places, 819 transitions, 1900 flow [2021-06-10 11:42:08,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1900, PETRI_PLACES=859, PETRI_TRANSITIONS=819} [2021-06-10 11:42:08,465 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 6 predicate places. [2021-06-10 11:42:08,466 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 819 transitions, 1900 flow [2021-06-10 11:42:08,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:08,466 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:08,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1582 [2021-06-10 11:42:08,466 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2051003720, now seen corresponding path program 1 times [2021-06-10 11:42:08,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:08,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781134732] [2021-06-10 11:42:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:08,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:08,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:08,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781134732] [2021-06-10 11:42:08,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:08,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:08,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441223990] [2021-06-10 11:42:08,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:08,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:08,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:08,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 819 transitions, 1900 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:08,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:08,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:08,826 INFO L129 PetriNetUnfolder]: 66/942 cut-off events. [2021-06-10 11:42:08,826 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:08,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 942 events. 66/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3938 event pairs, 0 based on Foata normal form. 0/844 useless extension candidates. Maximal degree in co-relation 1102. Up to 33 conditions per place. [2021-06-10 11:42:08,883 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2021-06-10 11:42:08,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 817 transitions, 1913 flow [2021-06-10 11:42:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:08,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:08,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:08,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:08,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:08,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:08,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,888 INFO L185 Difference]: Start difference. First operand has 859 places, 819 transitions, 1900 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:08,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 817 transitions, 1913 flow [2021-06-10 11:42:08,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 817 transitions, 1912 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:08,895 INFO L241 Difference]: Finished difference. Result has 858 places, 817 transitions, 1896 flow [2021-06-10 11:42:08,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1896, PETRI_PLACES=858, PETRI_TRANSITIONS=817} [2021-06-10 11:42:08,896 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 5 predicate places. [2021-06-10 11:42:08,896 INFO L480 AbstractCegarLoop]: Abstraction has has 858 places, 817 transitions, 1896 flow [2021-06-10 11:42:08,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,896 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:08,896 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:08,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1583 [2021-06-10 11:42:08,896 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1626871792, now seen corresponding path program 1 times [2021-06-10 11:42:08,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:08,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577800054] [2021-06-10 11:42:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:08,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:08,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:08,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:08,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577800054] [2021-06-10 11:42:08,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:08,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:08,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670592100] [2021-06-10 11:42:08,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:08,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:08,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:08,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 817 transitions, 1896 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:08,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:08,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:08,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:09,255 INFO L129 PetriNetUnfolder]: 65/950 cut-off events. [2021-06-10 11:42:09,255 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:09,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 950 events. 65/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4006 event pairs, 0 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1114. Up to 33 conditions per place. [2021-06-10 11:42:09,313 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/819 dead transitions. [2021-06-10 11:42:09,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 860 places, 819 transitions, 1926 flow [2021-06-10 11:42:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:09,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:09,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:09,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:09,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:09,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:09,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:09,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,317 INFO L185 Difference]: Start difference. First operand has 858 places, 817 transitions, 1896 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:09,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 860 places, 819 transitions, 1926 flow [2021-06-10 11:42:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 819 transitions, 1925 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:09,325 INFO L241 Difference]: Finished difference. Result has 861 places, 819 transitions, 1919 flow [2021-06-10 11:42:09,325 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1919, PETRI_PLACES=861, PETRI_TRANSITIONS=819} [2021-06-10 11:42:09,325 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 8 predicate places. [2021-06-10 11:42:09,325 INFO L480 AbstractCegarLoop]: Abstraction has has 861 places, 819 transitions, 1919 flow [2021-06-10 11:42:09,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:09,325 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:09,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1584 [2021-06-10 11:42:09,325 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:09,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1626870769, now seen corresponding path program 1 times [2021-06-10 11:42:09,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:09,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980421170] [2021-06-10 11:42:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:09,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:09,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:09,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:09,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980421170] [2021-06-10 11:42:09,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:09,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:09,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244783574] [2021-06-10 11:42:09,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:09,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:09,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:09,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 819 transitions, 1919 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:09,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:09,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:09,672 INFO L129 PetriNetUnfolder]: 64/948 cut-off events. [2021-06-10 11:42:09,673 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:09,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 948 events. 64/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3994 event pairs, 0 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1111. Up to 33 conditions per place. [2021-06-10 11:42:09,719 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/819 dead transitions. [2021-06-10 11:42:09,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 819 transitions, 1931 flow [2021-06-10 11:42:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:09,721 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:09,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:09,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:09,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:09,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:09,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,723 INFO L185 Difference]: Start difference. First operand has 861 places, 819 transitions, 1919 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:09,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 819 transitions, 1931 flow [2021-06-10 11:42:09,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 862 places, 819 transitions, 1926 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:09,731 INFO L241 Difference]: Finished difference. Result has 864 places, 819 transitions, 1924 flow [2021-06-10 11:42:09,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=864, PETRI_TRANSITIONS=819} [2021-06-10 11:42:09,731 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 11 predicate places. [2021-06-10 11:42:09,731 INFO L480 AbstractCegarLoop]: Abstraction has has 864 places, 819 transitions, 1924 flow [2021-06-10 11:42:09,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:09,732 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:09,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1585 [2021-06-10 11:42:09,732 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1625918480, now seen corresponding path program 1 times [2021-06-10 11:42:09,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:09,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166647304] [2021-06-10 11:42:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:09,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:09,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:09,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:09,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:09,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166647304] [2021-06-10 11:42:09,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:09,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:09,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205032070] [2021-06-10 11:42:09,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:09,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:09,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:09,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 864 places, 819 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:09,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:09,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:09,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:10,076 INFO L129 PetriNetUnfolder]: 63/944 cut-off events. [2021-06-10 11:42:10,076 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:10,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 944 events. 63/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3969 event pairs, 0 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1108. Up to 33 conditions per place. [2021-06-10 11:42:10,132 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/816 dead transitions. [2021-06-10 11:42:10,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 816 transitions, 1921 flow [2021-06-10 11:42:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:10,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:10,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:10,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:10,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:10,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:10,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,137 INFO L185 Difference]: Start difference. First operand has 864 places, 819 transitions, 1924 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:10,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 866 places, 816 transitions, 1921 flow [2021-06-10 11:42:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 863 places, 816 transitions, 1914 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:10,144 INFO L241 Difference]: Finished difference. Result has 863 places, 816 transitions, 1904 flow [2021-06-10 11:42:10,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=861, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=863, PETRI_TRANSITIONS=816} [2021-06-10 11:42:10,145 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 10 predicate places. [2021-06-10 11:42:10,145 INFO L480 AbstractCegarLoop]: Abstraction has has 863 places, 816 transitions, 1904 flow [2021-06-10 11:42:10,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:10,145 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:10,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1586 [2021-06-10 11:42:10,145 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1625917457, now seen corresponding path program 1 times [2021-06-10 11:42:10,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:10,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752430982] [2021-06-10 11:42:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:10,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:10,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:10,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:10,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752430982] [2021-06-10 11:42:10,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:10,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:10,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327636637] [2021-06-10 11:42:10,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:10,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:10,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:10,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 863 places, 816 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:10,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:10,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:10,494 INFO L129 PetriNetUnfolder]: 63/942 cut-off events. [2021-06-10 11:42:10,494 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:10,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 942 events. 63/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3956 event pairs, 0 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1109. Up to 33 conditions per place. [2021-06-10 11:42:10,550 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/814 dead transitions. [2021-06-10 11:42:10,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 814 transitions, 1917 flow [2021-06-10 11:42:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:10,552 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:10,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:10,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:10,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:10,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:10,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,554 INFO L185 Difference]: Start difference. First operand has 863 places, 816 transitions, 1904 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 814 transitions, 1917 flow [2021-06-10 11:42:10,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 862 places, 814 transitions, 1916 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:10,562 INFO L241 Difference]: Finished difference. Result has 862 places, 814 transitions, 1900 flow [2021-06-10 11:42:10,562 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1900, PETRI_PLACES=862, PETRI_TRANSITIONS=814} [2021-06-10 11:42:10,562 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 9 predicate places. [2021-06-10 11:42:10,562 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 814 transitions, 1900 flow [2021-06-10 11:42:10,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:10,562 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:10,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1587 [2021-06-10 11:42:10,563 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash 559710263, now seen corresponding path program 1 times [2021-06-10 11:42:10,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:10,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781933504] [2021-06-10 11:42:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:10,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:10,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:10,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:10,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:42:10,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781933504] [2021-06-10 11:42:10,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:10,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:10,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629363741] [2021-06-10 11:42:10,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:10,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:10,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:10,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:10,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:10,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 814 transitions, 1900 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:10,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:10,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:10,924 INFO L129 PetriNetUnfolder]: 61/947 cut-off events. [2021-06-10 11:42:10,924 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:10,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 947 events. 61/947 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4005 event pairs, 0 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1112. Up to 33 conditions per place. [2021-06-10 11:42:10,983 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/815 dead transitions. [2021-06-10 11:42:10,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 815 transitions, 1916 flow [2021-06-10 11:42:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:10,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:10,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:10,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:10,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:10,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:10,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,987 INFO L185 Difference]: Start difference. First operand has 862 places, 814 transitions, 1900 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:10,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 815 transitions, 1916 flow [2021-06-10 11:42:10,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 863 places, 815 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:10,995 INFO L241 Difference]: Finished difference. Result has 865 places, 815 transitions, 1913 flow [2021-06-10 11:42:10,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=861, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1913, PETRI_PLACES=865, PETRI_TRANSITIONS=815} [2021-06-10 11:42:10,996 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 12 predicate places. [2021-06-10 11:42:10,996 INFO L480 AbstractCegarLoop]: Abstraction has has 865 places, 815 transitions, 1913 flow [2021-06-10 11:42:10,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:10,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:10,996 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:10,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1588 [2021-06-10 11:42:10,996 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 559709240, now seen corresponding path program 1 times [2021-06-10 11:42:10,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:10,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075851984] [2021-06-10 11:42:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:11,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:11,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:42:11,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075851984] [2021-06-10 11:42:11,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:11,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:11,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403989099] [2021-06-10 11:42:11,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:11,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:11,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:11,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 865 places, 815 transitions, 1913 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:11,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:11,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:11,357 INFO L129 PetriNetUnfolder]: 61/948 cut-off events. [2021-06-10 11:42:11,357 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:11,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 948 events. 61/948 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4015 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1120. Up to 33 conditions per place. [2021-06-10 11:42:11,415 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/816 dead transitions. [2021-06-10 11:42:11,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 816 transitions, 1939 flow [2021-06-10 11:42:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:11,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:11,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:11,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:11,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:11,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:11,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,419 INFO L185 Difference]: Start difference. First operand has 865 places, 815 transitions, 1913 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 816 transitions, 1939 flow [2021-06-10 11:42:11,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 816 transitions, 1937 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:11,427 INFO L241 Difference]: Finished difference. Result has 868 places, 816 transitions, 1929 flow [2021-06-10 11:42:11,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1929, PETRI_PLACES=868, PETRI_TRANSITIONS=816} [2021-06-10 11:42:11,428 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 15 predicate places. [2021-06-10 11:42:11,428 INFO L480 AbstractCegarLoop]: Abstraction has has 868 places, 816 transitions, 1929 flow [2021-06-10 11:42:11,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:11,428 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:11,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1589 [2021-06-10 11:42:11,428 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 560663575, now seen corresponding path program 1 times [2021-06-10 11:42:11,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:11,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721567819] [2021-06-10 11:42:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:11,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:11,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:42:11,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721567819] [2021-06-10 11:42:11,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:11,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:11,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765277781] [2021-06-10 11:42:11,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:11,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:11,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:11,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:11,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:11,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 868 places, 816 transitions, 1929 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:11,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:11,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:11,779 INFO L129 PetriNetUnfolder]: 60/945 cut-off events. [2021-06-10 11:42:11,779 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:42:11,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 945 events. 60/945 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3996 event pairs, 0 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 1119. Up to 33 conditions per place. [2021-06-10 11:42:11,827 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 9 selfloop transitions, 1 changer transitions 0/814 dead transitions. [2021-06-10 11:42:11,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 814 transitions, 1937 flow [2021-06-10 11:42:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2532 transitions. [2021-06-10 11:42:11,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920392584514722 [2021-06-10 11:42:11,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2532 transitions. [2021-06-10 11:42:11,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2532 transitions. [2021-06-10 11:42:11,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:11,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2532 transitions. [2021-06-10 11:42:11,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.0) internal successors, (2532), 3 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,831 INFO L185 Difference]: Start difference. First operand has 868 places, 816 transitions, 1929 flow. Second operand 3 states and 2532 transitions. [2021-06-10 11:42:11,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 814 transitions, 1937 flow [2021-06-10 11:42:11,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 869 places, 814 transitions, 1936 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:11,838 INFO L241 Difference]: Finished difference. Result has 869 places, 814 transitions, 1918 flow [2021-06-10 11:42:11,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1918, PETRI_PLACES=869, PETRI_TRANSITIONS=814} [2021-06-10 11:42:11,839 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 16 predicate places. [2021-06-10 11:42:11,839 INFO L480 AbstractCegarLoop]: Abstraction has has 869 places, 814 transitions, 1918 flow [2021-06-10 11:42:11,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:11,839 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:11,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1590 [2021-06-10 11:42:11,839 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash 560662552, now seen corresponding path program 1 times [2021-06-10 11:42:11,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:11,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845533939] [2021-06-10 11:42:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:11,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:11,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:11,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:42:11,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845533939] [2021-06-10 11:42:11,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:11,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:11,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669300263] [2021-06-10 11:42:11,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:11,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:11,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:11,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 869 places, 814 transitions, 1918 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:11,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:11,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:11,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:12,196 INFO L129 PetriNetUnfolder]: 60/942 cut-off events. [2021-06-10 11:42:12,196 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:12,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 942 events. 60/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3970 event pairs, 0 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1113. Up to 33 conditions per place. [2021-06-10 11:42:12,253 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/811 dead transitions. [2021-06-10 11:42:12,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 811 transitions, 1919 flow [2021-06-10 11:42:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:12,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:12,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:12,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:12,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:12,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:12,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,257 INFO L185 Difference]: Start difference. First operand has 869 places, 814 transitions, 1918 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:12,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 811 transitions, 1919 flow [2021-06-10 11:42:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 811 transitions, 1914 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:12,265 INFO L241 Difference]: Finished difference. Result has 866 places, 811 transitions, 1904 flow [2021-06-10 11:42:12,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=866, PETRI_TRANSITIONS=811} [2021-06-10 11:42:12,265 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 13 predicate places. [2021-06-10 11:42:12,265 INFO L480 AbstractCegarLoop]: Abstraction has has 866 places, 811 transitions, 1904 flow [2021-06-10 11:42:12,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:12,266 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:12,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1591 [2021-06-10 11:42:12,266 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash 929804096, now seen corresponding path program 1 times [2021-06-10 11:42:12,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:12,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435475814] [2021-06-10 11:42:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:12,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:12,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:12,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:42:12,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435475814] [2021-06-10 11:42:12,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:12,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:12,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648773905] [2021-06-10 11:42:12,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:12,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:12,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:12,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:12,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 811 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:12,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:12,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:12,632 INFO L129 PetriNetUnfolder]: 59/950 cut-off events. [2021-06-10 11:42:12,632 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:12,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 950 events. 59/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4043 event pairs, 0 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1130. Up to 33 conditions per place. [2021-06-10 11:42:12,691 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/813 dead transitions. [2021-06-10 11:42:12,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 868 places, 813 transitions, 1934 flow [2021-06-10 11:42:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:12,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:12,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:12,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:12,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:12,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:12,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:12,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,695 INFO L185 Difference]: Start difference. First operand has 866 places, 811 transitions, 1904 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:12,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 868 places, 813 transitions, 1934 flow [2021-06-10 11:42:12,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 867 places, 813 transitions, 1933 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:12,704 INFO L241 Difference]: Finished difference. Result has 869 places, 813 transitions, 1927 flow [2021-06-10 11:42:12,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=865, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1927, PETRI_PLACES=869, PETRI_TRANSITIONS=813} [2021-06-10 11:42:12,704 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 16 predicate places. [2021-06-10 11:42:12,704 INFO L480 AbstractCegarLoop]: Abstraction has has 869 places, 813 transitions, 1927 flow [2021-06-10 11:42:12,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:12,704 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:12,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1592 [2021-06-10 11:42:12,704 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash 929803073, now seen corresponding path program 1 times [2021-06-10 11:42:12,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:12,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734988843] [2021-06-10 11:42:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:12,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:12,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:12,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:12,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:42:12,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734988843] [2021-06-10 11:42:12,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:12,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:12,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669806084] [2021-06-10 11:42:12,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:12,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:12,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:12,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 869 places, 813 transitions, 1927 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:12,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:12,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:12,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:13,078 INFO L129 PetriNetUnfolder]: 57/951 cut-off events. [2021-06-10 11:42:13,078 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:13,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 951 events. 57/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4062 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1128. Up to 33 conditions per place. [2021-06-10 11:42:13,140 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/813 dead transitions. [2021-06-10 11:42:13,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 813 transitions, 1939 flow [2021-06-10 11:42:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:13,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:13,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:13,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:13,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:13,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:13,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,144 INFO L185 Difference]: Start difference. First operand has 869 places, 813 transitions, 1927 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 813 transitions, 1939 flow [2021-06-10 11:42:13,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 813 transitions, 1934 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:13,153 INFO L241 Difference]: Finished difference. Result has 871 places, 812 transitions, 1923 flow [2021-06-10 11:42:13,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1923, PETRI_PLACES=871, PETRI_TRANSITIONS=812} [2021-06-10 11:42:13,153 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 18 predicate places. [2021-06-10 11:42:13,153 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 812 transitions, 1923 flow [2021-06-10 11:42:13,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:13,153 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:13,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1593 [2021-06-10 11:42:13,154 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 928850784, now seen corresponding path program 1 times [2021-06-10 11:42:13,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:13,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244753697] [2021-06-10 11:42:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:13,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:13,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:13,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:42:13,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244753697] [2021-06-10 11:42:13,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:13,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:13,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726507269] [2021-06-10 11:42:13,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:13,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:13,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:13,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 812 transitions, 1923 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:13,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:13,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:13,519 INFO L129 PetriNetUnfolder]: 57/944 cut-off events. [2021-06-10 11:42:13,519 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:13,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 944 events. 57/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4002 event pairs, 0 based on Foata normal form. 1/857 useless extension candidates. Maximal degree in co-relation 1122. Up to 33 conditions per place. [2021-06-10 11:42:13,575 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/810 dead transitions. [2021-06-10 11:42:13,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 810 transitions, 1926 flow [2021-06-10 11:42:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:13,576 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:13,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:13,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:13,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:13,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:13,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,579 INFO L185 Difference]: Start difference. First operand has 871 places, 812 transitions, 1923 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:13,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 810 transitions, 1926 flow [2021-06-10 11:42:13,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 810 transitions, 1919 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:13,587 INFO L241 Difference]: Finished difference. Result has 871 places, 810 transitions, 1912 flow [2021-06-10 11:42:13,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=871, PETRI_TRANSITIONS=810} [2021-06-10 11:42:13,587 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 18 predicate places. [2021-06-10 11:42:13,587 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 810 transitions, 1912 flow [2021-06-10 11:42:13,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:13,588 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:13,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1594 [2021-06-10 11:42:13,588 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 928849761, now seen corresponding path program 1 times [2021-06-10 11:42:13,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:13,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694414869] [2021-06-10 11:42:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:13,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:13,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:13,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:13,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:42:13,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694414869] [2021-06-10 11:42:13,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:13,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:13,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840119165] [2021-06-10 11:42:13,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:13,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:13,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:13,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:13,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:13,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 810 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:13,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:13,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:13,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:13,948 INFO L129 PetriNetUnfolder]: 57/942 cut-off events. [2021-06-10 11:42:13,948 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:13,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 942 events. 57/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3987 event pairs, 0 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1122. Up to 33 conditions per place. [2021-06-10 11:42:13,999 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/808 dead transitions. [2021-06-10 11:42:13,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 808 transitions, 1925 flow [2021-06-10 11:42:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:14,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:14,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:14,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:14,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:14,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:14,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,003 INFO L185 Difference]: Start difference. First operand has 871 places, 810 transitions, 1912 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:14,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 808 transitions, 1925 flow [2021-06-10 11:42:14,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 808 transitions, 1924 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:14,011 INFO L241 Difference]: Finished difference. Result has 870 places, 808 transitions, 1908 flow [2021-06-10 11:42:14,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1908, PETRI_PLACES=870, PETRI_TRANSITIONS=808} [2021-06-10 11:42:14,011 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 17 predicate places. [2021-06-10 11:42:14,011 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 808 transitions, 1908 flow [2021-06-10 11:42:14,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:14,011 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:14,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1595 [2021-06-10 11:42:14,011 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 728767466, now seen corresponding path program 1 times [2021-06-10 11:42:14,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:14,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324326340] [2021-06-10 11:42:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:14,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:14,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:42:14,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324326340] [2021-06-10 11:42:14,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:14,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:14,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519032768] [2021-06-10 11:42:14,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:14,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:14,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:14,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 808 transitions, 1908 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:14,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:14,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:14,383 INFO L129 PetriNetUnfolder]: 56/950 cut-off events. [2021-06-10 11:42:14,383 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:14,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 950 events. 56/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4059 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1134. Up to 33 conditions per place. [2021-06-10 11:42:14,440 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/810 dead transitions. [2021-06-10 11:42:14,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 810 transitions, 1938 flow [2021-06-10 11:42:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:14,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:14,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:14,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:14,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:14,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:14,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:14,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,444 INFO L185 Difference]: Start difference. First operand has 870 places, 808 transitions, 1908 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:14,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 872 places, 810 transitions, 1938 flow [2021-06-10 11:42:14,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 810 transitions, 1937 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:14,452 INFO L241 Difference]: Finished difference. Result has 873 places, 810 transitions, 1931 flow [2021-06-10 11:42:14,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1931, PETRI_PLACES=873, PETRI_TRANSITIONS=810} [2021-06-10 11:42:14,452 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 20 predicate places. [2021-06-10 11:42:14,452 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 810 transitions, 1931 flow [2021-06-10 11:42:14,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:14,453 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:14,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1596 [2021-06-10 11:42:14,453 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 728766443, now seen corresponding path program 1 times [2021-06-10 11:42:14,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:14,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748587982] [2021-06-10 11:42:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:14,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:14,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:42:14,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748587982] [2021-06-10 11:42:14,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:14,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:14,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827994007] [2021-06-10 11:42:14,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:14,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:14,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:14,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 810 transitions, 1931 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:14,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:14,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:14,831 INFO L129 PetriNetUnfolder]: 54/951 cut-off events. [2021-06-10 11:42:14,832 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:14,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 951 events. 54/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4081 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1134. Up to 33 conditions per place. [2021-06-10 11:42:14,894 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/810 dead transitions. [2021-06-10 11:42:14,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 810 transitions, 1943 flow [2021-06-10 11:42:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:14,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:14,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:14,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:14,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:14,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,908 INFO L185 Difference]: Start difference. First operand has 873 places, 810 transitions, 1931 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:14,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 810 transitions, 1943 flow [2021-06-10 11:42:14,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 810 transitions, 1938 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:14,917 INFO L241 Difference]: Finished difference. Result has 875 places, 809 transitions, 1927 flow [2021-06-10 11:42:14,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1927, PETRI_PLACES=875, PETRI_TRANSITIONS=809} [2021-06-10 11:42:14,918 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 22 predicate places. [2021-06-10 11:42:14,918 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 809 transitions, 1927 flow [2021-06-10 11:42:14,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:14,918 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:14,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1597 [2021-06-10 11:42:14,918 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 727814154, now seen corresponding path program 1 times [2021-06-10 11:42:14,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:14,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250997155] [2021-06-10 11:42:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:14,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:14,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:14,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:42:14,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250997155] [2021-06-10 11:42:14,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:14,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:14,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405456067] [2021-06-10 11:42:14,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:14,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:14,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:14,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:14,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 809 transitions, 1927 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:14,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:14,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:14,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:15,304 INFO L129 PetriNetUnfolder]: 54/944 cut-off events. [2021-06-10 11:42:15,305 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:15,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 944 events. 54/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4024 event pairs, 0 based on Foata normal form. 1/860 useless extension candidates. Maximal degree in co-relation 1128. Up to 33 conditions per place. [2021-06-10 11:42:15,365 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/807 dead transitions. [2021-06-10 11:42:15,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 807 transitions, 1930 flow [2021-06-10 11:42:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:15,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:15,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:15,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:15,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:15,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:15,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,370 INFO L185 Difference]: Start difference. First operand has 875 places, 809 transitions, 1927 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:15,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 807 transitions, 1930 flow [2021-06-10 11:42:15,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 807 transitions, 1923 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:15,378 INFO L241 Difference]: Finished difference. Result has 875 places, 807 transitions, 1916 flow [2021-06-10 11:42:15,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=875, PETRI_TRANSITIONS=807} [2021-06-10 11:42:15,378 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 22 predicate places. [2021-06-10 11:42:15,378 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 807 transitions, 1916 flow [2021-06-10 11:42:15,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:15,379 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:15,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1598 [2021-06-10 11:42:15,379 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 727813131, now seen corresponding path program 1 times [2021-06-10 11:42:15,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:15,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623572273] [2021-06-10 11:42:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:15,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:15,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:15,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:42:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623572273] [2021-06-10 11:42:15,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:15,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:15,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905149892] [2021-06-10 11:42:15,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:15,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:15,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:15,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:15,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 807 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:15,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:15,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:15,762 INFO L129 PetriNetUnfolder]: 54/942 cut-off events. [2021-06-10 11:42:15,762 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:15,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 942 events. 54/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4006 event pairs, 0 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 1128. Up to 33 conditions per place. [2021-06-10 11:42:15,819 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/805 dead transitions. [2021-06-10 11:42:15,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 805 transitions, 1929 flow [2021-06-10 11:42:15,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:15,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:15,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:15,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:15,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:15,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:15,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,824 INFO L185 Difference]: Start difference. First operand has 875 places, 807 transitions, 1916 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:15,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 805 transitions, 1929 flow [2021-06-10 11:42:15,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 805 transitions, 1928 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:15,832 INFO L241 Difference]: Finished difference. Result has 874 places, 805 transitions, 1912 flow [2021-06-10 11:42:15,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=874, PETRI_TRANSITIONS=805} [2021-06-10 11:42:15,832 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 21 predicate places. [2021-06-10 11:42:15,832 INFO L480 AbstractCegarLoop]: Abstraction has has 874 places, 805 transitions, 1912 flow [2021-06-10 11:42:15,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:15,833 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:15,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1599 [2021-06-10 11:42:15,833 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1626524086, now seen corresponding path program 1 times [2021-06-10 11:42:15,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:15,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422572560] [2021-06-10 11:42:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:15,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:15,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:15,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:15,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:42:15,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422572560] [2021-06-10 11:42:15,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:15,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:15,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67677239] [2021-06-10 11:42:15,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:15,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:15,855 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:15,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 805 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:15,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:15,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:15,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:16,207 INFO L129 PetriNetUnfolder]: 53/950 cut-off events. [2021-06-10 11:42:16,207 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:16,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 950 events. 53/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4076 event pairs, 0 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1140. Up to 33 conditions per place. [2021-06-10 11:42:16,262 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/807 dead transitions. [2021-06-10 11:42:16,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 876 places, 807 transitions, 1942 flow [2021-06-10 11:42:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:16,263 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:16,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:16,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:16,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:16,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:16,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:16,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,266 INFO L185 Difference]: Start difference. First operand has 874 places, 805 transitions, 1912 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:16,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 876 places, 807 transitions, 1942 flow [2021-06-10 11:42:16,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 875 places, 807 transitions, 1941 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:16,274 INFO L241 Difference]: Finished difference. Result has 877 places, 807 transitions, 1935 flow [2021-06-10 11:42:16,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=873, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1935, PETRI_PLACES=877, PETRI_TRANSITIONS=807} [2021-06-10 11:42:16,274 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 24 predicate places. [2021-06-10 11:42:16,274 INFO L480 AbstractCegarLoop]: Abstraction has has 877 places, 807 transitions, 1935 flow [2021-06-10 11:42:16,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,274 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:16,274 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:16,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1600 [2021-06-10 11:42:16,274 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1626525109, now seen corresponding path program 1 times [2021-06-10 11:42:16,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:16,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800046158] [2021-06-10 11:42:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:16,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:16,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:16,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:42:16,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800046158] [2021-06-10 11:42:16,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:16,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:16,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957078126] [2021-06-10 11:42:16,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:16,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:16,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:16,297 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:16,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 807 transitions, 1935 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:16,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:16,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:16,643 INFO L129 PetriNetUnfolder]: 52/948 cut-off events. [2021-06-10 11:42:16,643 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:16,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 948 events. 52/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4065 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1137. Up to 33 conditions per place. [2021-06-10 11:42:16,699 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/807 dead transitions. [2021-06-10 11:42:16,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 807 transitions, 1947 flow [2021-06-10 11:42:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:16,701 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:16,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:16,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:16,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:16,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:16,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,704 INFO L185 Difference]: Start difference. First operand has 877 places, 807 transitions, 1935 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:16,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 807 transitions, 1947 flow [2021-06-10 11:42:16,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 878 places, 807 transitions, 1942 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:16,712 INFO L241 Difference]: Finished difference. Result has 880 places, 807 transitions, 1940 flow [2021-06-10 11:42:16,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=804, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=880, PETRI_TRANSITIONS=807} [2021-06-10 11:42:16,712 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 27 predicate places. [2021-06-10 11:42:16,712 INFO L480 AbstractCegarLoop]: Abstraction has has 880 places, 807 transitions, 1940 flow [2021-06-10 11:42:16,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:16,713 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:16,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1601 [2021-06-10 11:42:16,713 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1627477398, now seen corresponding path program 1 times [2021-06-10 11:42:16,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:16,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932451662] [2021-06-10 11:42:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:16,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:16,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:16,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:16,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:42:16,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932451662] [2021-06-10 11:42:16,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:16,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:16,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043631209] [2021-06-10 11:42:16,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:16,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:16,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:16,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 807 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:16,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:16,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:16,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:17,081 INFO L129 PetriNetUnfolder]: 51/944 cut-off events. [2021-06-10 11:42:17,081 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:17,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 944 events. 51/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4039 event pairs, 0 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 1134. Up to 33 conditions per place. [2021-06-10 11:42:17,137 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/804 dead transitions. [2021-06-10 11:42:17,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 804 transitions, 1937 flow [2021-06-10 11:42:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:17,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:17,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:17,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:17,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:17,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:17,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,141 INFO L185 Difference]: Start difference. First operand has 880 places, 807 transitions, 1940 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:17,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 804 transitions, 1937 flow [2021-06-10 11:42:17,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 804 transitions, 1930 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:17,149 INFO L241 Difference]: Finished difference. Result has 879 places, 804 transitions, 1920 flow [2021-06-10 11:42:17,149 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1920, PETRI_PLACES=879, PETRI_TRANSITIONS=804} [2021-06-10 11:42:17,149 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 26 predicate places. [2021-06-10 11:42:17,149 INFO L480 AbstractCegarLoop]: Abstraction has has 879 places, 804 transitions, 1920 flow [2021-06-10 11:42:17,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:17,150 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:17,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1602 [2021-06-10 11:42:17,150 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1627478421, now seen corresponding path program 1 times [2021-06-10 11:42:17,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:17,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57097253] [2021-06-10 11:42:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:17,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:17,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:17,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:42:17,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57097253] [2021-06-10 11:42:17,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:17,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:17,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168261386] [2021-06-10 11:42:17,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:17,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:17,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:17,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 804 transitions, 1920 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:17,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:17,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:17,522 INFO L129 PetriNetUnfolder]: 51/942 cut-off events. [2021-06-10 11:42:17,522 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:17,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 942 events. 51/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4023 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1135. Up to 33 conditions per place. [2021-06-10 11:42:17,579 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/802 dead transitions. [2021-06-10 11:42:17,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 802 transitions, 1933 flow [2021-06-10 11:42:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:17,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:17,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:17,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:17,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:17,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:17,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,583 INFO L185 Difference]: Start difference. First operand has 879 places, 804 transitions, 1920 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:17,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 802 transitions, 1933 flow [2021-06-10 11:42:17,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 878 places, 802 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:17,591 INFO L241 Difference]: Finished difference. Result has 878 places, 802 transitions, 1916 flow [2021-06-10 11:42:17,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=878, PETRI_TRANSITIONS=802} [2021-06-10 11:42:17,592 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 25 predicate places. [2021-06-10 11:42:17,592 INFO L480 AbstractCegarLoop]: Abstraction has has 878 places, 802 transitions, 1916 flow [2021-06-10 11:42:17,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:17,592 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:17,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1603 [2021-06-10 11:42:17,592 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1877752126, now seen corresponding path program 1 times [2021-06-10 11:42:17,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:17,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927257114] [2021-06-10 11:42:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:17,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:17,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:17,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:17,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:42:17,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927257114] [2021-06-10 11:42:17,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:17,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:17,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421331463] [2021-06-10 11:42:17,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:17,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:17,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:17,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:17,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 802 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:17,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:17,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:17,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:17,971 INFO L129 PetriNetUnfolder]: 50/949 cut-off events. [2021-06-10 11:42:17,972 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:18,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 949 events. 50/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4082 event pairs, 0 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1140. Up to 33 conditions per place. [2021-06-10 11:42:18,029 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/803 dead transitions. [2021-06-10 11:42:18,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 803 transitions, 1932 flow [2021-06-10 11:42:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:18,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:18,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:18,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:18,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:18,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:18,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,081 INFO L185 Difference]: Start difference. First operand has 878 places, 802 transitions, 1916 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:18,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 803 transitions, 1932 flow [2021-06-10 11:42:18,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 803 transitions, 1931 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:18,089 INFO L241 Difference]: Finished difference. Result has 880 places, 802 transitions, 1920 flow [2021-06-10 11:42:18,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1920, PETRI_PLACES=880, PETRI_TRANSITIONS=802} [2021-06-10 11:42:18,089 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 27 predicate places. [2021-06-10 11:42:18,089 INFO L480 AbstractCegarLoop]: Abstraction has has 880 places, 802 transitions, 1920 flow [2021-06-10 11:42:18,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,089 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:18,090 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:18,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1604 [2021-06-10 11:42:18,090 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1877751103, now seen corresponding path program 1 times [2021-06-10 11:42:18,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:18,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498868282] [2021-06-10 11:42:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:18,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:18,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:18,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:42:18,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498868282] [2021-06-10 11:42:18,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:18,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:18,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40646727] [2021-06-10 11:42:18,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:18,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:18,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:18,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 802 transitions, 1920 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:18,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:18,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:18,474 INFO L129 PetriNetUnfolder]: 48/951 cut-off events. [2021-06-10 11:42:18,474 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:18,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 951 events. 48/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4115 event pairs, 0 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1151. Up to 33 conditions per place. [2021-06-10 11:42:18,532 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/803 dead transitions. [2021-06-10 11:42:18,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 803 transitions, 1946 flow [2021-06-10 11:42:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:18,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:18,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:18,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:18,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:18,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:18,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,536 INFO L185 Difference]: Start difference. First operand has 880 places, 802 transitions, 1920 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:18,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 803 transitions, 1946 flow [2021-06-10 11:42:18,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 881 places, 803 transitions, 1945 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:18,544 INFO L241 Difference]: Finished difference. Result has 883 places, 803 transitions, 1937 flow [2021-06-10 11:42:18,545 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=879, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1937, PETRI_PLACES=883, PETRI_TRANSITIONS=803} [2021-06-10 11:42:18,545 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 30 predicate places. [2021-06-10 11:42:18,545 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 803 transitions, 1937 flow [2021-06-10 11:42:18,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:18,545 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:18,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1605 [2021-06-10 11:42:18,545 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1878704415, now seen corresponding path program 1 times [2021-06-10 11:42:18,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:18,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222679096] [2021-06-10 11:42:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:18,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:18,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:18,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:18,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:42:18,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222679096] [2021-06-10 11:42:18,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:18,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:18,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799675979] [2021-06-10 11:42:18,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:18,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:18,568 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:18,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 803 transitions, 1937 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:18,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:18,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:18,916 INFO L129 PetriNetUnfolder]: 48/944 cut-off events. [2021-06-10 11:42:18,916 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:18,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 944 events. 48/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4058 event pairs, 0 based on Foata normal form. 1/866 useless extension candidates. Maximal degree in co-relation 1137. Up to 33 conditions per place. [2021-06-10 11:42:18,973 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/801 dead transitions. [2021-06-10 11:42:18,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 801 transitions, 1939 flow [2021-06-10 11:42:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:18,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:18,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:18,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:18,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:18,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:18,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,977 INFO L185 Difference]: Start difference. First operand has 883 places, 803 transitions, 1937 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:18,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 801 transitions, 1939 flow [2021-06-10 11:42:18,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 801 transitions, 1931 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:18,986 INFO L241 Difference]: Finished difference. Result has 883 places, 801 transitions, 1924 flow [2021-06-10 11:42:18,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=883, PETRI_TRANSITIONS=801} [2021-06-10 11:42:18,986 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 30 predicate places. [2021-06-10 11:42:18,986 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 801 transitions, 1924 flow [2021-06-10 11:42:18,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:18,986 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:18,986 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:18,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1606 [2021-06-10 11:42:18,986 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1878705438, now seen corresponding path program 1 times [2021-06-10 11:42:18,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:18,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828257492] [2021-06-10 11:42:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:19,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:19,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:42:19,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828257492] [2021-06-10 11:42:19,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:19,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:19,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987584085] [2021-06-10 11:42:19,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:19,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:19,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:19,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 801 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:19,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:19,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:19,360 INFO L129 PetriNetUnfolder]: 48/942 cut-off events. [2021-06-10 11:42:19,360 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:19,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 942 events. 48/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4043 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1141. Up to 33 conditions per place. [2021-06-10 11:42:19,415 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/799 dead transitions. [2021-06-10 11:42:19,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 799 transitions, 1937 flow [2021-06-10 11:42:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:19,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:19,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:19,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:19,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:19,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:19,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,419 INFO L185 Difference]: Start difference. First operand has 883 places, 801 transitions, 1924 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:19,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 799 transitions, 1937 flow [2021-06-10 11:42:19,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 799 transitions, 1936 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:19,427 INFO L241 Difference]: Finished difference. Result has 882 places, 799 transitions, 1920 flow [2021-06-10 11:42:19,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1920, PETRI_PLACES=882, PETRI_TRANSITIONS=799} [2021-06-10 11:42:19,427 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 29 predicate places. [2021-06-10 11:42:19,427 INFO L480 AbstractCegarLoop]: Abstraction has has 882 places, 799 transitions, 1920 flow [2021-06-10 11:42:19,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:19,428 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:19,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1607 [2021-06-10 11:42:19,428 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash -893648658, now seen corresponding path program 1 times [2021-06-10 11:42:19,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:19,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772249619] [2021-06-10 11:42:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:19,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:19,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:42:19,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772249619] [2021-06-10 11:42:19,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:19,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:19,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189963707] [2021-06-10 11:42:19,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:19,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:19,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:19,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:19,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:19,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 882 places, 799 transitions, 1920 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:19,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:19,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:19,818 INFO L129 PetriNetUnfolder]: 47/950 cut-off events. [2021-06-10 11:42:19,819 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:19,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 950 events. 47/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4111 event pairs, 0 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1153. Up to 33 conditions per place. [2021-06-10 11:42:19,874 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/801 dead transitions. [2021-06-10 11:42:19,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 801 transitions, 1950 flow [2021-06-10 11:42:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:19,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:19,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:19,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:19,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:19,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:19,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:19,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,878 INFO L185 Difference]: Start difference. First operand has 882 places, 799 transitions, 1920 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:19,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 884 places, 801 transitions, 1950 flow [2021-06-10 11:42:19,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 801 transitions, 1949 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:19,886 INFO L241 Difference]: Finished difference. Result has 885 places, 801 transitions, 1943 flow [2021-06-10 11:42:19,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1943, PETRI_PLACES=885, PETRI_TRANSITIONS=801} [2021-06-10 11:42:19,887 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 32 predicate places. [2021-06-10 11:42:19,887 INFO L480 AbstractCegarLoop]: Abstraction has has 885 places, 801 transitions, 1943 flow [2021-06-10 11:42:19,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,887 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:19,887 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:19,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1608 [2021-06-10 11:42:19,887 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -893649681, now seen corresponding path program 1 times [2021-06-10 11:42:19,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:19,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791514917] [2021-06-10 11:42:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:19,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:19,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:19,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:42:19,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791514917] [2021-06-10 11:42:19,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:19,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:19,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614568647] [2021-06-10 11:42:19,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:19,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:19,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:19,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 801 transitions, 1943 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:19,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:19,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:19,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:20,263 INFO L129 PetriNetUnfolder]: 45/951 cut-off events. [2021-06-10 11:42:20,263 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:20,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 951 events. 45/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4131 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1153. Up to 33 conditions per place. [2021-06-10 11:42:20,306 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/801 dead transitions. [2021-06-10 11:42:20,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 801 transitions, 1955 flow [2021-06-10 11:42:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:20,307 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:20,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:20,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:20,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:20,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,310 INFO L185 Difference]: Start difference. First operand has 885 places, 801 transitions, 1943 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:20,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 801 transitions, 1955 flow [2021-06-10 11:42:20,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 801 transitions, 1950 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:20,318 INFO L241 Difference]: Finished difference. Result has 887 places, 800 transitions, 1939 flow [2021-06-10 11:42:20,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1939, PETRI_PLACES=887, PETRI_TRANSITIONS=800} [2021-06-10 11:42:20,318 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 34 predicate places. [2021-06-10 11:42:20,318 INFO L480 AbstractCegarLoop]: Abstraction has has 887 places, 800 transitions, 1939 flow [2021-06-10 11:42:20,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:20,319 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:20,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1609 [2021-06-10 11:42:20,319 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -894601970, now seen corresponding path program 1 times [2021-06-10 11:42:20,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:20,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304857116] [2021-06-10 11:42:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:20,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:20,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:20,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:42:20,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304857116] [2021-06-10 11:42:20,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:20,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:20,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554001603] [2021-06-10 11:42:20,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:20,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:20,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:20,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 800 transitions, 1939 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:20,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:20,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:20,709 INFO L129 PetriNetUnfolder]: 45/944 cut-off events. [2021-06-10 11:42:20,709 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:20,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 944 events. 45/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4074 event pairs, 0 based on Foata normal form. 1/869 useless extension candidates. Maximal degree in co-relation 1147. Up to 33 conditions per place. [2021-06-10 11:42:20,764 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/798 dead transitions. [2021-06-10 11:42:20,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 798 transitions, 1942 flow [2021-06-10 11:42:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:20,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:20,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:20,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:20,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:20,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:20,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,768 INFO L185 Difference]: Start difference. First operand has 887 places, 800 transitions, 1939 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:20,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 798 transitions, 1942 flow [2021-06-10 11:42:20,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 798 transitions, 1935 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:20,776 INFO L241 Difference]: Finished difference. Result has 887 places, 798 transitions, 1928 flow [2021-06-10 11:42:20,776 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1928, PETRI_PLACES=887, PETRI_TRANSITIONS=798} [2021-06-10 11:42:20,776 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 34 predicate places. [2021-06-10 11:42:20,776 INFO L480 AbstractCegarLoop]: Abstraction has has 887 places, 798 transitions, 1928 flow [2021-06-10 11:42:20,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:20,777 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:20,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1610 [2021-06-10 11:42:20,777 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -894602993, now seen corresponding path program 1 times [2021-06-10 11:42:20,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:20,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685324118] [2021-06-10 11:42:20,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:20,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:20,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:20,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:20,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:42:20,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685324118] [2021-06-10 11:42:20,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:20,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:20,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715431131] [2021-06-10 11:42:20,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:20,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:20,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:20,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:20,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 798 transitions, 1928 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:20,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:20,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:20,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:21,157 INFO L129 PetriNetUnfolder]: 45/942 cut-off events. [2021-06-10 11:42:21,157 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:21,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 942 events. 45/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4061 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1147. Up to 33 conditions per place. [2021-06-10 11:42:21,212 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/796 dead transitions. [2021-06-10 11:42:21,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 796 transitions, 1941 flow [2021-06-10 11:42:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:21,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:21,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:21,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:21,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:21,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:21,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,216 INFO L185 Difference]: Start difference. First operand has 887 places, 798 transitions, 1928 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:21,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 796 transitions, 1941 flow [2021-06-10 11:42:21,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 796 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:21,225 INFO L241 Difference]: Finished difference. Result has 886 places, 796 transitions, 1924 flow [2021-06-10 11:42:21,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=886, PETRI_TRANSITIONS=796} [2021-06-10 11:42:21,225 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 33 predicate places. [2021-06-10 11:42:21,225 INFO L480 AbstractCegarLoop]: Abstraction has has 886 places, 796 transitions, 1924 flow [2021-06-10 11:42:21,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:21,225 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:21,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1611 [2021-06-10 11:42:21,225 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1165183555, now seen corresponding path program 1 times [2021-06-10 11:42:21,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:21,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389912442] [2021-06-10 11:42:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:21,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:21,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:21,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:42:21,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389912442] [2021-06-10 11:42:21,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:21,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:21,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700564262] [2021-06-10 11:42:21,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:21,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:21,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:21,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 796 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:21,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:21,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:21,614 INFO L129 PetriNetUnfolder]: 44/950 cut-off events. [2021-06-10 11:42:21,614 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:21,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 950 events. 44/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4129 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1159. Up to 33 conditions per place. [2021-06-10 11:42:21,671 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/798 dead transitions. [2021-06-10 11:42:21,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 798 transitions, 1954 flow [2021-06-10 11:42:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:21,673 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:21,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:21,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:21,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:21,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:21,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:21,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,676 INFO L185 Difference]: Start difference. First operand has 886 places, 796 transitions, 1924 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:21,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 798 transitions, 1954 flow [2021-06-10 11:42:21,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 798 transitions, 1953 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:21,684 INFO L241 Difference]: Finished difference. Result has 889 places, 798 transitions, 1947 flow [2021-06-10 11:42:21,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=889, PETRI_TRANSITIONS=798} [2021-06-10 11:42:21,684 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 36 predicate places. [2021-06-10 11:42:21,684 INFO L480 AbstractCegarLoop]: Abstraction has has 889 places, 798 transitions, 1947 flow [2021-06-10 11:42:21,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:21,685 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:21,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1612 [2021-06-10 11:42:21,685 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1165182532, now seen corresponding path program 1 times [2021-06-10 11:42:21,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:21,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896705974] [2021-06-10 11:42:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:21,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:21,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:21,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:21,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:42:21,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896705974] [2021-06-10 11:42:21,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:21,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:21,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916431811] [2021-06-10 11:42:21,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:21,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:21,708 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:21,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 889 places, 798 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:21,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:21,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:21,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:22,073 INFO L129 PetriNetUnfolder]: 43/948 cut-off events. [2021-06-10 11:42:22,073 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:22,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 948 events. 43/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4121 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1156. Up to 33 conditions per place. [2021-06-10 11:42:22,131 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/798 dead transitions. [2021-06-10 11:42:22,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 798 transitions, 1959 flow [2021-06-10 11:42:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:22,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:22,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:22,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:22,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:22,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:22,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,135 INFO L185 Difference]: Start difference. First operand has 889 places, 798 transitions, 1947 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:22,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 798 transitions, 1959 flow [2021-06-10 11:42:22,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 798 transitions, 1954 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:22,144 INFO L241 Difference]: Finished difference. Result has 892 places, 798 transitions, 1952 flow [2021-06-10 11:42:22,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=892, PETRI_TRANSITIONS=798} [2021-06-10 11:42:22,144 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 39 predicate places. [2021-06-10 11:42:22,144 INFO L480 AbstractCegarLoop]: Abstraction has has 892 places, 798 transitions, 1952 flow [2021-06-10 11:42:22,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:22,145 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:22,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1613 [2021-06-10 11:42:22,145 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1164230243, now seen corresponding path program 1 times [2021-06-10 11:42:22,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:22,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008304036] [2021-06-10 11:42:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:22,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:22,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:22,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:42:22,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008304036] [2021-06-10 11:42:22,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:22,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:22,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555429266] [2021-06-10 11:42:22,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:22,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:22,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:22,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 892 places, 798 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:22,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:22,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:22,520 INFO L129 PetriNetUnfolder]: 42/944 cut-off events. [2021-06-10 11:42:22,520 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:22,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 944 events. 42/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4090 event pairs, 0 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1153. Up to 33 conditions per place. [2021-06-10 11:42:22,571 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/795 dead transitions. [2021-06-10 11:42:22,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 795 transitions, 1949 flow [2021-06-10 11:42:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:22,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:22,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:22,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:22,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:22,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:22,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,576 INFO L185 Difference]: Start difference. First operand has 892 places, 798 transitions, 1952 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:22,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 795 transitions, 1949 flow [2021-06-10 11:42:22,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 795 transitions, 1942 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:22,584 INFO L241 Difference]: Finished difference. Result has 891 places, 795 transitions, 1932 flow [2021-06-10 11:42:22,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=889, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1932, PETRI_PLACES=891, PETRI_TRANSITIONS=795} [2021-06-10 11:42:22,584 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 38 predicate places. [2021-06-10 11:42:22,584 INFO L480 AbstractCegarLoop]: Abstraction has has 891 places, 795 transitions, 1932 flow [2021-06-10 11:42:22,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:22,584 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:22,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1614 [2021-06-10 11:42:22,584 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1164229220, now seen corresponding path program 1 times [2021-06-10 11:42:22,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:22,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536281195] [2021-06-10 11:42:22,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:22,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:22,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:22,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:22,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:42:22,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536281195] [2021-06-10 11:42:22,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:22,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:22,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328256554] [2021-06-10 11:42:22,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:22,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:22,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:22,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 795 transitions, 1932 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:22,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:22,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:22,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:22,968 INFO L129 PetriNetUnfolder]: 42/942 cut-off events. [2021-06-10 11:42:22,969 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:23,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 942 events. 42/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4075 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1154. Up to 33 conditions per place. [2021-06-10 11:42:23,024 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/793 dead transitions. [2021-06-10 11:42:23,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 793 transitions, 1945 flow [2021-06-10 11:42:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:23,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:23,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:23,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:23,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:23,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:23,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,028 INFO L185 Difference]: Start difference. First operand has 891 places, 795 transitions, 1932 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:23,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 793 transitions, 1945 flow [2021-06-10 11:42:23,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 793 transitions, 1944 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:23,037 INFO L241 Difference]: Finished difference. Result has 890 places, 793 transitions, 1928 flow [2021-06-10 11:42:23,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1928, PETRI_PLACES=890, PETRI_TRANSITIONS=793} [2021-06-10 11:42:23,038 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 37 predicate places. [2021-06-10 11:42:23,038 INFO L480 AbstractCegarLoop]: Abstraction has has 890 places, 793 transitions, 1928 flow [2021-06-10 11:42:23,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:23,038 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:23,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1615 [2021-06-10 11:42:23,038 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1169410709, now seen corresponding path program 1 times [2021-06-10 11:42:23,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:23,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212893683] [2021-06-10 11:42:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:23,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:23,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:42:23,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212893683] [2021-06-10 11:42:23,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:23,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:23,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183826321] [2021-06-10 11:42:23,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:23,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:23,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:23,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:23,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:23,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 890 places, 793 transitions, 1928 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:23,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:23,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:23,431 INFO L129 PetriNetUnfolder]: 40/947 cut-off events. [2021-06-10 11:42:23,432 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:23,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 947 events. 40/947 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4128 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1157. Up to 33 conditions per place. [2021-06-10 11:42:23,487 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/794 dead transitions. [2021-06-10 11:42:23,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 892 places, 794 transitions, 1944 flow [2021-06-10 11:42:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:23,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:23,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:23,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:23,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:23,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:23,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,491 INFO L185 Difference]: Start difference. First operand has 890 places, 793 transitions, 1928 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:23,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 892 places, 794 transitions, 1944 flow [2021-06-10 11:42:23,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 794 transitions, 1943 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:23,499 INFO L241 Difference]: Finished difference. Result has 893 places, 794 transitions, 1941 flow [2021-06-10 11:42:23,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=889, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1941, PETRI_PLACES=893, PETRI_TRANSITIONS=794} [2021-06-10 11:42:23,500 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 40 predicate places. [2021-06-10 11:42:23,500 INFO L480 AbstractCegarLoop]: Abstraction has has 893 places, 794 transitions, 1941 flow [2021-06-10 11:42:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:23,500 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:23,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1616 [2021-06-10 11:42:23,500 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1169411732, now seen corresponding path program 1 times [2021-06-10 11:42:23,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:23,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812965474] [2021-06-10 11:42:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:23,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:23,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:42:23,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812965474] [2021-06-10 11:42:23,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:23,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:23,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034593606] [2021-06-10 11:42:23,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:23,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:23,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:23,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 893 places, 794 transitions, 1941 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:23,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:23,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:23,902 INFO L129 PetriNetUnfolder]: 40/948 cut-off events. [2021-06-10 11:42:23,903 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:23,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 948 events. 40/948 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4134 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1165. Up to 33 conditions per place. [2021-06-10 11:42:23,962 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/795 dead transitions. [2021-06-10 11:42:23,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 795 transitions, 1967 flow [2021-06-10 11:42:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:23,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:23,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:23,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:23,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:23,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:23,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,966 INFO L185 Difference]: Start difference. First operand has 893 places, 794 transitions, 1941 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:23,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 895 places, 795 transitions, 1967 flow [2021-06-10 11:42:23,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 795 transitions, 1965 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:23,975 INFO L241 Difference]: Finished difference. Result has 896 places, 795 transitions, 1957 flow [2021-06-10 11:42:23,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1957, PETRI_PLACES=896, PETRI_TRANSITIONS=795} [2021-06-10 11:42:23,975 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 43 predicate places. [2021-06-10 11:42:23,975 INFO L480 AbstractCegarLoop]: Abstraction has has 896 places, 795 transitions, 1957 flow [2021-06-10 11:42:23,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:23,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:23,976 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:23,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1617 [2021-06-10 11:42:23,976 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1168457397, now seen corresponding path program 1 times [2021-06-10 11:42:23,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:23,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074514474] [2021-06-10 11:42:23,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:23,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:23,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:23,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:42:23,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074514474] [2021-06-10 11:42:23,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:24,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:24,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382619066] [2021-06-10 11:42:24,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:24,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:24,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:24,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 795 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:24,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:24,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:24,375 INFO L129 PetriNetUnfolder]: 39/945 cut-off events. [2021-06-10 11:42:24,375 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:42:24,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 945 events. 39/945 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4118 event pairs, 0 based on Foata normal form. 2/876 useless extension candidates. Maximal degree in co-relation 1164. Up to 33 conditions per place. [2021-06-10 11:42:24,462 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 9 selfloop transitions, 1 changer transitions 0/793 dead transitions. [2021-06-10 11:42:24,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 898 places, 793 transitions, 1965 flow [2021-06-10 11:42:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2532 transitions. [2021-06-10 11:42:24,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920392584514722 [2021-06-10 11:42:24,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2532 transitions. [2021-06-10 11:42:24,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2532 transitions. [2021-06-10 11:42:24,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:24,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2532 transitions. [2021-06-10 11:42:24,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.0) internal successors, (2532), 3 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,466 INFO L185 Difference]: Start difference. First operand has 896 places, 795 transitions, 1957 flow. Second operand 3 states and 2532 transitions. [2021-06-10 11:42:24,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 898 places, 793 transitions, 1965 flow [2021-06-10 11:42:24,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 897 places, 793 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:24,473 INFO L241 Difference]: Finished difference. Result has 897 places, 793 transitions, 1946 flow [2021-06-10 11:42:24,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=895, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=897, PETRI_TRANSITIONS=793} [2021-06-10 11:42:24,474 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 44 predicate places. [2021-06-10 11:42:24,474 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 793 transitions, 1946 flow [2021-06-10 11:42:24,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:24,474 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:24,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1618 [2021-06-10 11:42:24,474 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1168458420, now seen corresponding path program 1 times [2021-06-10 11:42:24,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:24,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902857173] [2021-06-10 11:42:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:24,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:24,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:24,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:42:24,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902857173] [2021-06-10 11:42:24,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:24,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:24,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832994115] [2021-06-10 11:42:24,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:24,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:24,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:24,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 793 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:24,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:24,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:24,852 INFO L129 PetriNetUnfolder]: 39/942 cut-off events. [2021-06-10 11:42:24,852 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:24,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 942 events. 39/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4096 event pairs, 0 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 1158. Up to 33 conditions per place. [2021-06-10 11:42:24,908 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/790 dead transitions. [2021-06-10 11:42:24,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 790 transitions, 1947 flow [2021-06-10 11:42:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:24,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:24,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:24,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:24,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:24,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:24,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,912 INFO L185 Difference]: Start difference. First operand has 897 places, 793 transitions, 1946 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:24,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 897 places, 790 transitions, 1947 flow [2021-06-10 11:42:24,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 790 transitions, 1942 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:24,920 INFO L241 Difference]: Finished difference. Result has 894 places, 790 transitions, 1932 flow [2021-06-10 11:42:24,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1932, PETRI_PLACES=894, PETRI_TRANSITIONS=790} [2021-06-10 11:42:24,920 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 41 predicate places. [2021-06-10 11:42:24,920 INFO L480 AbstractCegarLoop]: Abstraction has has 894 places, 790 transitions, 1932 flow [2021-06-10 11:42:24,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:24,921 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:24,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1619 [2021-06-10 11:42:24,921 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1112396699, now seen corresponding path program 1 times [2021-06-10 11:42:24,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:24,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034550728] [2021-06-10 11:42:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:24,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:24,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:24,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:24,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:42:24,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034550728] [2021-06-10 11:42:24,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:24,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:24,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449575803] [2021-06-10 11:42:24,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:24,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:24,945 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:24,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 790 transitions, 1932 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:24,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:24,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:24,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:25,310 INFO L129 PetriNetUnfolder]: 37/947 cut-off events. [2021-06-10 11:42:25,310 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:25,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 947 events. 37/947 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4148 event pairs, 0 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1166. Up to 33 conditions per place. [2021-06-10 11:42:25,365 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/791 dead transitions. [2021-06-10 11:42:25,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 791 transitions, 1948 flow [2021-06-10 11:42:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:25,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:25,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:25,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:25,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:25,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:25,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,370 INFO L185 Difference]: Start difference. First operand has 894 places, 790 transitions, 1932 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:25,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 791 transitions, 1948 flow [2021-06-10 11:42:25,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 791 transitions, 1947 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:25,378 INFO L241 Difference]: Finished difference. Result has 897 places, 791 transitions, 1945 flow [2021-06-10 11:42:25,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1945, PETRI_PLACES=897, PETRI_TRANSITIONS=791} [2021-06-10 11:42:25,378 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 44 predicate places. [2021-06-10 11:42:25,378 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 791 transitions, 1945 flow [2021-06-10 11:42:25,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:25,379 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:25,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1620 [2021-06-10 11:42:25,379 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1112395676, now seen corresponding path program 1 times [2021-06-10 11:42:25,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:25,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492885633] [2021-06-10 11:42:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:25,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:25,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:25,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:42:25,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492885633] [2021-06-10 11:42:25,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:25,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:25,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309395668] [2021-06-10 11:42:25,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:25,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:25,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:25,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 791 transitions, 1945 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:25,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:25,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:25,780 INFO L129 PetriNetUnfolder]: 37/948 cut-off events. [2021-06-10 11:42:25,780 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:25,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 948 events. 37/948 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4155 event pairs, 0 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1172. Up to 33 conditions per place. [2021-06-10 11:42:25,839 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/792 dead transitions. [2021-06-10 11:42:25,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 792 transitions, 1971 flow [2021-06-10 11:42:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:25,841 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:25,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:25,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:25,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:25,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:25,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,844 INFO L185 Difference]: Start difference. First operand has 897 places, 791 transitions, 1945 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:25,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 792 transitions, 1971 flow [2021-06-10 11:42:25,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 792 transitions, 1969 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:25,852 INFO L241 Difference]: Finished difference. Result has 900 places, 792 transitions, 1961 flow [2021-06-10 11:42:25,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1961, PETRI_PLACES=900, PETRI_TRANSITIONS=792} [2021-06-10 11:42:25,852 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 47 predicate places. [2021-06-10 11:42:25,852 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 792 transitions, 1961 flow [2021-06-10 11:42:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:25,853 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:25,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1621 [2021-06-10 11:42:25,853 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1113350011, now seen corresponding path program 1 times [2021-06-10 11:42:25,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:25,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131630691] [2021-06-10 11:42:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:25,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:25,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:25,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:25,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:42:25,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131630691] [2021-06-10 11:42:25,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:25,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:25,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595593624] [2021-06-10 11:42:25,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:25,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:25,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:25,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 792 transitions, 1961 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:25,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:25,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:25,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:26,246 INFO L129 PetriNetUnfolder]: 36/945 cut-off events. [2021-06-10 11:42:26,247 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:42:26,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 945 events. 36/945 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4136 event pairs, 0 based on Foata normal form. 2/879 useless extension candidates. Maximal degree in co-relation 1171. Up to 33 conditions per place. [2021-06-10 11:42:26,301 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 9 selfloop transitions, 1 changer transitions 0/790 dead transitions. [2021-06-10 11:42:26,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 790 transitions, 1969 flow [2021-06-10 11:42:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2532 transitions. [2021-06-10 11:42:26,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920392584514722 [2021-06-10 11:42:26,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2532 transitions. [2021-06-10 11:42:26,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2532 transitions. [2021-06-10 11:42:26,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:26,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2532 transitions. [2021-06-10 11:42:26,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.0) internal successors, (2532), 3 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,305 INFO L185 Difference]: Start difference. First operand has 900 places, 792 transitions, 1961 flow. Second operand 3 states and 2532 transitions. [2021-06-10 11:42:26,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 790 transitions, 1969 flow [2021-06-10 11:42:26,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 790 transitions, 1968 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:26,314 INFO L241 Difference]: Finished difference. Result has 901 places, 790 transitions, 1950 flow [2021-06-10 11:42:26,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1950, PETRI_PLACES=901, PETRI_TRANSITIONS=790} [2021-06-10 11:42:26,314 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 48 predicate places. [2021-06-10 11:42:26,314 INFO L480 AbstractCegarLoop]: Abstraction has has 901 places, 790 transitions, 1950 flow [2021-06-10 11:42:26,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:26,315 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:26,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1622 [2021-06-10 11:42:26,315 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1113348988, now seen corresponding path program 1 times [2021-06-10 11:42:26,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:26,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384658440] [2021-06-10 11:42:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:26,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:26,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:26,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:42:26,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384658440] [2021-06-10 11:42:26,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:26,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:26,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838392224] [2021-06-10 11:42:26,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:26,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:26,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:26,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:26,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 790 transitions, 1950 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:26,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:26,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:26,686 INFO L129 PetriNetUnfolder]: 36/942 cut-off events. [2021-06-10 11:42:26,686 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:26,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 942 events. 36/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4115 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1165. Up to 33 conditions per place. [2021-06-10 11:42:26,730 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/787 dead transitions. [2021-06-10 11:42:26,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 787 transitions, 1951 flow [2021-06-10 11:42:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:26,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:26,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:26,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:26,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:26,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:26,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,734 INFO L185 Difference]: Start difference. First operand has 901 places, 790 transitions, 1950 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 787 transitions, 1951 flow [2021-06-10 11:42:26,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 787 transitions, 1946 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:26,742 INFO L241 Difference]: Finished difference. Result has 898 places, 787 transitions, 1936 flow [2021-06-10 11:42:26,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1936, PETRI_PLACES=898, PETRI_TRANSITIONS=787} [2021-06-10 11:42:26,742 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 45 predicate places. [2021-06-10 11:42:26,742 INFO L480 AbstractCegarLoop]: Abstraction has has 898 places, 787 transitions, 1936 flow [2021-06-10 11:42:26,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,743 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:26,743 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:26,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1623 [2021-06-10 11:42:26,743 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash -707709523, now seen corresponding path program 1 times [2021-06-10 11:42:26,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:26,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869712916] [2021-06-10 11:42:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:26,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:26,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:26,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:26,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:42:26,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869712916] [2021-06-10 11:42:26,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:26,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:26,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229145048] [2021-06-10 11:42:26,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:26,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:26,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:26,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 787 transitions, 1936 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:26,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:26,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:26,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:27,130 INFO L129 PetriNetUnfolder]: 35/949 cut-off events. [2021-06-10 11:42:27,130 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:27,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 949 events. 35/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4172 event pairs, 0 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1175. Up to 33 conditions per place. [2021-06-10 11:42:27,185 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/788 dead transitions. [2021-06-10 11:42:27,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 788 transitions, 1952 flow [2021-06-10 11:42:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:27,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:27,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:27,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:27,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:27,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:27,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,189 INFO L185 Difference]: Start difference. First operand has 898 places, 787 transitions, 1936 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:27,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 788 transitions, 1952 flow [2021-06-10 11:42:27,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 788 transitions, 1951 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:27,198 INFO L241 Difference]: Finished difference. Result has 900 places, 787 transitions, 1940 flow [2021-06-10 11:42:27,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=900, PETRI_TRANSITIONS=787} [2021-06-10 11:42:27,198 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 47 predicate places. [2021-06-10 11:42:27,198 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 787 transitions, 1940 flow [2021-06-10 11:42:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,198 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:27,198 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:27,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1624 [2021-06-10 11:42:27,198 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -707708500, now seen corresponding path program 1 times [2021-06-10 11:42:27,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:27,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369879026] [2021-06-10 11:42:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:27,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:27,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:27,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:42:27,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369879026] [2021-06-10 11:42:27,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:27,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:27,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981940560] [2021-06-10 11:42:27,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:27,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:27,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:27,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 787 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:27,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:27,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:27,599 INFO L129 PetriNetUnfolder]: 33/951 cut-off events. [2021-06-10 11:42:27,599 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:27,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 951 events. 33/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4209 event pairs, 0 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1184. Up to 33 conditions per place. [2021-06-10 11:42:27,653 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/788 dead transitions. [2021-06-10 11:42:27,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 788 transitions, 1966 flow [2021-06-10 11:42:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:27,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:27,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:27,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:27,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:27,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:27,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,658 INFO L185 Difference]: Start difference. First operand has 900 places, 787 transitions, 1940 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:27,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 788 transitions, 1966 flow [2021-06-10 11:42:27,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 788 transitions, 1965 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:27,666 INFO L241 Difference]: Finished difference. Result has 903 places, 788 transitions, 1957 flow [2021-06-10 11:42:27,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1957, PETRI_PLACES=903, PETRI_TRANSITIONS=788} [2021-06-10 11:42:27,666 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 50 predicate places. [2021-06-10 11:42:27,666 INFO L480 AbstractCegarLoop]: Abstraction has has 903 places, 788 transitions, 1957 flow [2021-06-10 11:42:27,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:27,667 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:27,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1625 [2021-06-10 11:42:27,667 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash -708661812, now seen corresponding path program 1 times [2021-06-10 11:42:27,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:27,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982019081] [2021-06-10 11:42:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:27,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:27,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:27,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:27,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:42:27,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982019081] [2021-06-10 11:42:27,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:27,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:27,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437708084] [2021-06-10 11:42:27,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:27,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:27,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:27,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 788 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:27,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:27,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:27,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:28,049 INFO L129 PetriNetUnfolder]: 33/944 cut-off events. [2021-06-10 11:42:28,050 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:28,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 944 events. 33/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4143 event pairs, 0 based on Foata normal form. 1/881 useless extension candidates. Maximal degree in co-relation 1170. Up to 33 conditions per place. [2021-06-10 11:42:28,104 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/786 dead transitions. [2021-06-10 11:42:28,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 786 transitions, 1959 flow [2021-06-10 11:42:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:28,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:28,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:28,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:28,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:28,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:28,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,108 INFO L185 Difference]: Start difference. First operand has 903 places, 788 transitions, 1957 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:28,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 786 transitions, 1959 flow [2021-06-10 11:42:28,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 902 places, 786 transitions, 1951 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:28,116 INFO L241 Difference]: Finished difference. Result has 903 places, 786 transitions, 1944 flow [2021-06-10 11:42:28,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=900, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1944, PETRI_PLACES=903, PETRI_TRANSITIONS=786} [2021-06-10 11:42:28,117 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 50 predicate places. [2021-06-10 11:42:28,117 INFO L480 AbstractCegarLoop]: Abstraction has has 903 places, 786 transitions, 1944 flow [2021-06-10 11:42:28,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:28,117 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:28,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1626 [2021-06-10 11:42:28,117 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:28,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash -708662835, now seen corresponding path program 1 times [2021-06-10 11:42:28,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:28,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670567198] [2021-06-10 11:42:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:28,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:28,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:28,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:42:28,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670567198] [2021-06-10 11:42:28,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:28,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:28,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499834469] [2021-06-10 11:42:28,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:28,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:28,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:28,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 786 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:28,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:28,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:28,510 INFO L129 PetriNetUnfolder]: 33/942 cut-off events. [2021-06-10 11:42:28,510 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:28,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 942 events. 33/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4127 event pairs, 0 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1174. Up to 33 conditions per place. [2021-06-10 11:42:28,564 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/784 dead transitions. [2021-06-10 11:42:28,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 784 transitions, 1957 flow [2021-06-10 11:42:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:28,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:28,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:28,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:28,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:28,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:28,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,568 INFO L185 Difference]: Start difference. First operand has 903 places, 786 transitions, 1944 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:28,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 784 transitions, 1957 flow [2021-06-10 11:42:28,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 902 places, 784 transitions, 1956 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:28,577 INFO L241 Difference]: Finished difference. Result has 902 places, 784 transitions, 1940 flow [2021-06-10 11:42:28,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=900, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=902, PETRI_TRANSITIONS=784} [2021-06-10 11:42:28,578 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 49 predicate places. [2021-06-10 11:42:28,578 INFO L480 AbstractCegarLoop]: Abstraction has has 902 places, 784 transitions, 1940 flow [2021-06-10 11:42:28,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:28,578 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:28,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1627 [2021-06-10 11:42:28,578 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash -388823457, now seen corresponding path program 1 times [2021-06-10 11:42:28,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:28,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937517918] [2021-06-10 11:42:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:28,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:28,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:28,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:28,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:42:28,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937517918] [2021-06-10 11:42:28,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:28,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:28,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349082067] [2021-06-10 11:42:28,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:28,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:28,612 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:28,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 784 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:28,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:28,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:28,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:28,974 INFO L129 PetriNetUnfolder]: 32/949 cut-off events. [2021-06-10 11:42:28,974 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:29,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 949 events. 32/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4191 event pairs, 0 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1179. Up to 33 conditions per place. [2021-06-10 11:42:29,028 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/785 dead transitions. [2021-06-10 11:42:29,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 785 transitions, 1956 flow [2021-06-10 11:42:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:29,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:29,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:29,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:29,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:29,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:29,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,033 INFO L185 Difference]: Start difference. First operand has 902 places, 784 transitions, 1940 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:29,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 785 transitions, 1956 flow [2021-06-10 11:42:29,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 785 transitions, 1955 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:29,041 INFO L241 Difference]: Finished difference. Result has 904 places, 784 transitions, 1944 flow [2021-06-10 11:42:29,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1944, PETRI_PLACES=904, PETRI_TRANSITIONS=784} [2021-06-10 11:42:29,041 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 51 predicate places. [2021-06-10 11:42:29,041 INFO L480 AbstractCegarLoop]: Abstraction has has 904 places, 784 transitions, 1944 flow [2021-06-10 11:42:29,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:29,042 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:29,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1628 [2021-06-10 11:42:29,042 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash -388822434, now seen corresponding path program 1 times [2021-06-10 11:42:29,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:29,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314767514] [2021-06-10 11:42:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:29,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:29,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:42:29,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314767514] [2021-06-10 11:42:29,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:29,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:29,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623007433] [2021-06-10 11:42:29,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:29,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:29,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:29,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 904 places, 784 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:29,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:29,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:29,440 INFO L129 PetriNetUnfolder]: 30/951 cut-off events. [2021-06-10 11:42:29,440 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:29,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 951 events. 30/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4224 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1190. Up to 33 conditions per place. [2021-06-10 11:42:29,495 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/785 dead transitions. [2021-06-10 11:42:29,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 906 places, 785 transitions, 1970 flow [2021-06-10 11:42:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:29,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:29,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:29,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:29,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:29,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:29,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,499 INFO L185 Difference]: Start difference. First operand has 904 places, 784 transitions, 1944 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:29,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 906 places, 785 transitions, 1970 flow [2021-06-10 11:42:29,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 785 transitions, 1969 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:29,507 INFO L241 Difference]: Finished difference. Result has 907 places, 785 transitions, 1961 flow [2021-06-10 11:42:29,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1961, PETRI_PLACES=907, PETRI_TRANSITIONS=785} [2021-06-10 11:42:29,508 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 54 predicate places. [2021-06-10 11:42:29,508 INFO L480 AbstractCegarLoop]: Abstraction has has 907 places, 785 transitions, 1961 flow [2021-06-10 11:42:29,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:29,508 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:29,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1629 [2021-06-10 11:42:29,508 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -389775746, now seen corresponding path program 1 times [2021-06-10 11:42:29,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:29,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863684294] [2021-06-10 11:42:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:29,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:29,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:42:29,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863684294] [2021-06-10 11:42:29,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:29,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:29,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046961217] [2021-06-10 11:42:29,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:29,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:29,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:29,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 785 transitions, 1961 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:29,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:29,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:29,894 INFO L129 PetriNetUnfolder]: 30/944 cut-off events. [2021-06-10 11:42:29,894 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:29,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 944 events. 30/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4164 event pairs, 0 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 1176. Up to 33 conditions per place. [2021-06-10 11:42:29,949 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/783 dead transitions. [2021-06-10 11:42:29,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 783 transitions, 1963 flow [2021-06-10 11:42:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:29,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:29,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:29,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:29,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:29,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:29,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,953 INFO L185 Difference]: Start difference. First operand has 907 places, 785 transitions, 1961 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 783 transitions, 1963 flow [2021-06-10 11:42:29,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 783 transitions, 1955 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:29,962 INFO L241 Difference]: Finished difference. Result has 907 places, 783 transitions, 1948 flow [2021-06-10 11:42:29,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=907, PETRI_TRANSITIONS=783} [2021-06-10 11:42:29,962 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 54 predicate places. [2021-06-10 11:42:29,962 INFO L480 AbstractCegarLoop]: Abstraction has has 907 places, 783 transitions, 1948 flow [2021-06-10 11:42:29,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:29,962 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:29,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1630 [2021-06-10 11:42:29,963 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash -389776769, now seen corresponding path program 1 times [2021-06-10 11:42:29,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:29,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576768891] [2021-06-10 11:42:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:29,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:29,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:29,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:42:29,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576768891] [2021-06-10 11:42:29,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:29,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:29,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249377944] [2021-06-10 11:42:29,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:29,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:29,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:29,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 783 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:29,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:29,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:29,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:30,354 INFO L129 PetriNetUnfolder]: 30/942 cut-off events. [2021-06-10 11:42:30,354 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:30,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 942 events. 30/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4149 event pairs, 0 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1180. Up to 33 conditions per place. [2021-06-10 11:42:30,407 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/781 dead transitions. [2021-06-10 11:42:30,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 781 transitions, 1961 flow [2021-06-10 11:42:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:30,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:30,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:30,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:30,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:30,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:30,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,411 INFO L185 Difference]: Start difference. First operand has 907 places, 783 transitions, 1948 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 781 transitions, 1961 flow [2021-06-10 11:42:30,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 781 transitions, 1960 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:30,420 INFO L241 Difference]: Finished difference. Result has 906 places, 781 transitions, 1944 flow [2021-06-10 11:42:30,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1944, PETRI_PLACES=906, PETRI_TRANSITIONS=781} [2021-06-10 11:42:30,420 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 53 predicate places. [2021-06-10 11:42:30,420 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 781 transitions, 1944 flow [2021-06-10 11:42:30,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:30,420 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:30,421 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1631 [2021-06-10 11:42:30,421 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 970936338, now seen corresponding path program 1 times [2021-06-10 11:42:30,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:30,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320286506] [2021-06-10 11:42:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:30,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:30,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:30,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:42:30,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320286506] [2021-06-10 11:42:30,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:30,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:30,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36158335] [2021-06-10 11:42:30,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:30,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:30,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:30,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:30,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 781 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:30,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:30,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:30,804 INFO L129 PetriNetUnfolder]: 29/949 cut-off events. [2021-06-10 11:42:30,804 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:30,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 949 events. 29/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4205 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1185. Up to 33 conditions per place. [2021-06-10 11:42:30,844 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/782 dead transitions. [2021-06-10 11:42:30,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 782 transitions, 1960 flow [2021-06-10 11:42:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:30,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:30,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:30,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:30,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:30,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:30,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,848 INFO L185 Difference]: Start difference. First operand has 906 places, 781 transitions, 1944 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:30,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 782 transitions, 1960 flow [2021-06-10 11:42:30,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 782 transitions, 1959 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:30,856 INFO L241 Difference]: Finished difference. Result has 908 places, 781 transitions, 1948 flow [2021-06-10 11:42:30,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=908, PETRI_TRANSITIONS=781} [2021-06-10 11:42:30,856 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 55 predicate places. [2021-06-10 11:42:30,856 INFO L480 AbstractCegarLoop]: Abstraction has has 908 places, 781 transitions, 1948 flow [2021-06-10 11:42:30,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,856 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:30,856 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:30,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1632 [2021-06-10 11:42:30,857 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 970937361, now seen corresponding path program 1 times [2021-06-10 11:42:30,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:30,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614472879] [2021-06-10 11:42:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:30,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:30,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:30,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:30,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:42:30,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614472879] [2021-06-10 11:42:30,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:30,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:30,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7543453] [2021-06-10 11:42:30,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:30,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:30,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:30,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 781 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:30,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:30,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:30,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:31,260 INFO L129 PetriNetUnfolder]: 27/951 cut-off events. [2021-06-10 11:42:31,260 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:31,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 951 events. 27/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4243 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1196. Up to 33 conditions per place. [2021-06-10 11:42:31,314 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/782 dead transitions. [2021-06-10 11:42:31,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 782 transitions, 1974 flow [2021-06-10 11:42:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:31,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:31,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:31,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:31,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:31,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:31,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,319 INFO L185 Difference]: Start difference. First operand has 908 places, 781 transitions, 1948 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:31,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 782 transitions, 1974 flow [2021-06-10 11:42:31,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 909 places, 782 transitions, 1973 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:31,327 INFO L241 Difference]: Finished difference. Result has 911 places, 782 transitions, 1965 flow [2021-06-10 11:42:31,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=907, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1965, PETRI_PLACES=911, PETRI_TRANSITIONS=782} [2021-06-10 11:42:31,327 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 58 predicate places. [2021-06-10 11:42:31,327 INFO L480 AbstractCegarLoop]: Abstraction has has 911 places, 782 transitions, 1965 flow [2021-06-10 11:42:31,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:31,328 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:31,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1633 [2021-06-10 11:42:31,328 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 969984049, now seen corresponding path program 1 times [2021-06-10 11:42:31,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:31,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51826913] [2021-06-10 11:42:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:31,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:31,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:31,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:42:31,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51826913] [2021-06-10 11:42:31,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:31,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:31,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089972377] [2021-06-10 11:42:31,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:31,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:31,353 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:31,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 782 transitions, 1965 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:31,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:31,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:31,720 INFO L129 PetriNetUnfolder]: 27/944 cut-off events. [2021-06-10 11:42:31,720 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:31,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 944 events. 27/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4177 event pairs, 0 based on Foata normal form. 1/887 useless extension candidates. Maximal degree in co-relation 1182. Up to 33 conditions per place. [2021-06-10 11:42:31,774 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/780 dead transitions. [2021-06-10 11:42:31,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 780 transitions, 1967 flow [2021-06-10 11:42:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:31,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:31,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:31,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:31,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:31,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:31,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,778 INFO L185 Difference]: Start difference. First operand has 911 places, 782 transitions, 1965 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 780 transitions, 1967 flow [2021-06-10 11:42:31,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 780 transitions, 1959 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:31,787 INFO L241 Difference]: Finished difference. Result has 911 places, 780 transitions, 1952 flow [2021-06-10 11:42:31,787 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=911, PETRI_TRANSITIONS=780} [2021-06-10 11:42:31,787 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 58 predicate places. [2021-06-10 11:42:31,787 INFO L480 AbstractCegarLoop]: Abstraction has has 911 places, 780 transitions, 1952 flow [2021-06-10 11:42:31,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:31,787 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:31,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1634 [2021-06-10 11:42:31,787 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash 969983026, now seen corresponding path program 1 times [2021-06-10 11:42:31,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:31,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401595103] [2021-06-10 11:42:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:31,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:31,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:31,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:31,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:42:31,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401595103] [2021-06-10 11:42:31,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:31,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:31,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782542639] [2021-06-10 11:42:31,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:31,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:31,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:31,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 780 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:31,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:31,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:31,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:32,184 INFO L129 PetriNetUnfolder]: 27/942 cut-off events. [2021-06-10 11:42:32,184 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:32,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 942 events. 27/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4167 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1186. Up to 33 conditions per place. [2021-06-10 11:42:32,239 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/778 dead transitions. [2021-06-10 11:42:32,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 778 transitions, 1965 flow [2021-06-10 11:42:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:32,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:32,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:32,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:32,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:32,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:32,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,243 INFO L185 Difference]: Start difference. First operand has 911 places, 780 transitions, 1952 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:32,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 778 transitions, 1965 flow [2021-06-10 11:42:32,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 778 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:32,252 INFO L241 Difference]: Finished difference. Result has 910 places, 778 transitions, 1948 flow [2021-06-10 11:42:32,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=910, PETRI_TRANSITIONS=778} [2021-06-10 11:42:32,252 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 57 predicate places. [2021-06-10 11:42:32,252 INFO L480 AbstractCegarLoop]: Abstraction has has 910 places, 778 transitions, 1948 flow [2021-06-10 11:42:32,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:32,252 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:32,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1635 [2021-06-10 11:42:32,253 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1428230074, now seen corresponding path program 1 times [2021-06-10 11:42:32,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:32,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289351857] [2021-06-10 11:42:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:32,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:32,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:32,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:42:32,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289351857] [2021-06-10 11:42:32,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:32,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:32,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722337231] [2021-06-10 11:42:32,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:32,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:32,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:32,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 910 places, 778 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:32,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:32,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:32,661 INFO L129 PetriNetUnfolder]: 26/949 cut-off events. [2021-06-10 11:42:32,661 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:32,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 949 events. 26/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4227 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1191. Up to 33 conditions per place. [2021-06-10 11:42:32,714 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/779 dead transitions. [2021-06-10 11:42:32,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 779 transitions, 1964 flow [2021-06-10 11:42:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:32,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:32,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:32,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:32,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:32,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:32,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,718 INFO L185 Difference]: Start difference. First operand has 910 places, 778 transitions, 1948 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:32,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 779 transitions, 1964 flow [2021-06-10 11:42:32,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 779 transitions, 1963 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:32,727 INFO L241 Difference]: Finished difference. Result has 912 places, 778 transitions, 1952 flow [2021-06-10 11:42:32,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=912, PETRI_TRANSITIONS=778} [2021-06-10 11:42:32,727 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 59 predicate places. [2021-06-10 11:42:32,727 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 778 transitions, 1952 flow [2021-06-10 11:42:32,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:32,728 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:32,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1636 [2021-06-10 11:42:32,728 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1428229051, now seen corresponding path program 1 times [2021-06-10 11:42:32,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:32,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114278627] [2021-06-10 11:42:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:32,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:32,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:32,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:32,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:42:32,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114278627] [2021-06-10 11:42:32,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:32,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:32,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790409515] [2021-06-10 11:42:32,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:32,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:32,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:32,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 778 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:32,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:32,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:32,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:33,147 INFO L129 PetriNetUnfolder]: 24/951 cut-off events. [2021-06-10 11:42:33,147 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:33,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 951 events. 24/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4258 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1202. Up to 33 conditions per place. [2021-06-10 11:42:33,201 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/779 dead transitions. [2021-06-10 11:42:33,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 779 transitions, 1978 flow [2021-06-10 11:42:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:33,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:33,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:33,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:33,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:33,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:33,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,205 INFO L185 Difference]: Start difference. First operand has 912 places, 778 transitions, 1952 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 779 transitions, 1978 flow [2021-06-10 11:42:33,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 779 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:33,213 INFO L241 Difference]: Finished difference. Result has 915 places, 779 transitions, 1969 flow [2021-06-10 11:42:33,213 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1969, PETRI_PLACES=915, PETRI_TRANSITIONS=779} [2021-06-10 11:42:33,214 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 62 predicate places. [2021-06-10 11:42:33,214 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 779 transitions, 1969 flow [2021-06-10 11:42:33,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:33,214 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:33,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1637 [2021-06-10 11:42:33,214 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1429182363, now seen corresponding path program 1 times [2021-06-10 11:42:33,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:33,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101754449] [2021-06-10 11:42:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:33,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:33,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:33,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:42:33,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101754449] [2021-06-10 11:42:33,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:33,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:33,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617669042] [2021-06-10 11:42:33,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:33,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:33,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:33,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 779 transitions, 1969 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:33,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:33,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:33,608 INFO L129 PetriNetUnfolder]: 24/944 cut-off events. [2021-06-10 11:42:33,608 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:33,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 944 events. 24/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4200 event pairs, 0 based on Foata normal form. 1/890 useless extension candidates. Maximal degree in co-relation 1188. Up to 33 conditions per place. [2021-06-10 11:42:33,660 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/777 dead transitions. [2021-06-10 11:42:33,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 777 transitions, 1971 flow [2021-06-10 11:42:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:33,662 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:33,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:33,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:33,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:33,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:33,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,664 INFO L185 Difference]: Start difference. First operand has 915 places, 779 transitions, 1969 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:33,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 777 transitions, 1971 flow [2021-06-10 11:42:33,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 777 transitions, 1963 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:33,673 INFO L241 Difference]: Finished difference. Result has 915 places, 777 transitions, 1956 flow [2021-06-10 11:42:33,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=912, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1956, PETRI_PLACES=915, PETRI_TRANSITIONS=777} [2021-06-10 11:42:33,673 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 62 predicate places. [2021-06-10 11:42:33,673 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 777 transitions, 1956 flow [2021-06-10 11:42:33,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:33,674 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:33,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1638 [2021-06-10 11:42:33,674 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1429183386, now seen corresponding path program 1 times [2021-06-10 11:42:33,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:33,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720805216] [2021-06-10 11:42:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:33,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:33,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:33,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:33,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:42:33,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720805216] [2021-06-10 11:42:33,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:33,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:33,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197602035] [2021-06-10 11:42:33,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:33,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:33,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:33,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:33,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:33,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 777 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:33,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:33,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:33,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:34,071 INFO L129 PetriNetUnfolder]: 24/942 cut-off events. [2021-06-10 11:42:34,071 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:34,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 942 events. 24/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4182 event pairs, 0 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1192. Up to 33 conditions per place. [2021-06-10 11:42:34,123 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/775 dead transitions. [2021-06-10 11:42:34,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 775 transitions, 1969 flow [2021-06-10 11:42:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:34,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:34,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:34,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:34,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:34,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:34,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,127 INFO L185 Difference]: Start difference. First operand has 915 places, 777 transitions, 1956 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:34,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 775 transitions, 1969 flow [2021-06-10 11:42:34,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 775 transitions, 1968 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:34,136 INFO L241 Difference]: Finished difference. Result has 914 places, 775 transitions, 1952 flow [2021-06-10 11:42:34,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=912, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=914, PETRI_TRANSITIONS=775} [2021-06-10 11:42:34,136 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 61 predicate places. [2021-06-10 11:42:34,136 INFO L480 AbstractCegarLoop]: Abstraction has has 914 places, 775 transitions, 1952 flow [2021-06-10 11:42:34,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:34,137 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:34,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1639 [2021-06-10 11:42:34,137 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 951509114, now seen corresponding path program 1 times [2021-06-10 11:42:34,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:34,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789727799] [2021-06-10 11:42:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:34,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:34,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:34,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:42:34,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789727799] [2021-06-10 11:42:34,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:34,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:34,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13407571] [2021-06-10 11:42:34,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:34,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:34,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:34,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:34,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:34,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 775 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:34,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:34,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:34,548 INFO L129 PetriNetUnfolder]: 23/950 cut-off events. [2021-06-10 11:42:34,548 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:34,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 950 events. 23/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4253 event pairs, 0 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 1204. Up to 33 conditions per place. [2021-06-10 11:42:34,601 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/777 dead transitions. [2021-06-10 11:42:34,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 777 transitions, 1982 flow [2021-06-10 11:42:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:34,603 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:34,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:34,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:34,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:34,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:34,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:34,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,605 INFO L185 Difference]: Start difference. First operand has 914 places, 775 transitions, 1952 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:34,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 777 transitions, 1982 flow [2021-06-10 11:42:34,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 777 transitions, 1981 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:34,614 INFO L241 Difference]: Finished difference. Result has 917 places, 777 transitions, 1975 flow [2021-06-10 11:42:34,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1975, PETRI_PLACES=917, PETRI_TRANSITIONS=777} [2021-06-10 11:42:34,614 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 64 predicate places. [2021-06-10 11:42:34,614 INFO L480 AbstractCegarLoop]: Abstraction has has 917 places, 777 transitions, 1975 flow [2021-06-10 11:42:34,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:34,615 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:34,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1640 [2021-06-10 11:42:34,615 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash 951508091, now seen corresponding path program 1 times [2021-06-10 11:42:34,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:34,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776944855] [2021-06-10 11:42:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:34,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:34,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:34,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:34,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:42:34,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776944855] [2021-06-10 11:42:34,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:34,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:34,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687353877] [2021-06-10 11:42:34,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:34,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:34,640 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:34,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 777 transitions, 1975 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:34,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:34,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:34,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:35,004 INFO L129 PetriNetUnfolder]: 21/951 cut-off events. [2021-06-10 11:42:35,004 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:35,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 951 events. 21/951 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4274 event pairs, 0 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1204. Up to 33 conditions per place. [2021-06-10 11:42:35,046 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/777 dead transitions. [2021-06-10 11:42:35,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 777 transitions, 1987 flow [2021-06-10 11:42:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:35,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:35,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:35,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:35,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:35,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:35,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,050 INFO L185 Difference]: Start difference. First operand has 917 places, 777 transitions, 1975 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 777 transitions, 1987 flow [2021-06-10 11:42:35,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 777 transitions, 1982 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:35,058 INFO L241 Difference]: Finished difference. Result has 919 places, 776 transitions, 1971 flow [2021-06-10 11:42:35,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1971, PETRI_PLACES=919, PETRI_TRANSITIONS=776} [2021-06-10 11:42:35,058 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 66 predicate places. [2021-06-10 11:42:35,058 INFO L480 AbstractCegarLoop]: Abstraction has has 919 places, 776 transitions, 1971 flow [2021-06-10 11:42:35,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,059 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:35,059 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:35,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1641 [2021-06-10 11:42:35,059 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 950555802, now seen corresponding path program 1 times [2021-06-10 11:42:35,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:35,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282465240] [2021-06-10 11:42:35,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:35,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:35,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:35,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:42:35,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282465240] [2021-06-10 11:42:35,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:35,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:35,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23578603] [2021-06-10 11:42:35,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:35,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:35,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:35,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 776 transitions, 1971 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:35,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:35,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:35,454 INFO L129 PetriNetUnfolder]: 21/944 cut-off events. [2021-06-10 11:42:35,454 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:35,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 944 events. 21/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4214 event pairs, 0 based on Foata normal form. 1/893 useless extension candidates. Maximal degree in co-relation 1198. Up to 33 conditions per place. [2021-06-10 11:42:35,508 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/774 dead transitions. [2021-06-10 11:42:35,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 774 transitions, 1974 flow [2021-06-10 11:42:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:35,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:35,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:35,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:35,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:35,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:35,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,512 INFO L185 Difference]: Start difference. First operand has 919 places, 776 transitions, 1971 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:35,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 774 transitions, 1974 flow [2021-06-10 11:42:35,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 774 transitions, 1967 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:35,520 INFO L241 Difference]: Finished difference. Result has 919 places, 774 transitions, 1960 flow [2021-06-10 11:42:35,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=919, PETRI_TRANSITIONS=774} [2021-06-10 11:42:35,521 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 66 predicate places. [2021-06-10 11:42:35,521 INFO L480 AbstractCegarLoop]: Abstraction has has 919 places, 774 transitions, 1960 flow [2021-06-10 11:42:35,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:35,521 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:35,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1642 [2021-06-10 11:42:35,521 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash 950554779, now seen corresponding path program 1 times [2021-06-10 11:42:35,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:35,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439647955] [2021-06-10 11:42:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:35,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:35,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:35,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:35,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:42:35,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439647955] [2021-06-10 11:42:35,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:35,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:35,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072770976] [2021-06-10 11:42:35,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:35,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:35,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:35,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 774 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:35,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:35,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:35,924 INFO L129 PetriNetUnfolder]: 21/942 cut-off events. [2021-06-10 11:42:35,924 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:35,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 942 events. 21/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4197 event pairs, 0 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 1198. Up to 33 conditions per place. [2021-06-10 11:42:35,976 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/772 dead transitions. [2021-06-10 11:42:35,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 772 transitions, 1973 flow [2021-06-10 11:42:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:35,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:35,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:35,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:35,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:35,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:35,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,981 INFO L185 Difference]: Start difference. First operand has 919 places, 774 transitions, 1960 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:35,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 772 transitions, 1973 flow [2021-06-10 11:42:35,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 772 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:35,989 INFO L241 Difference]: Finished difference. Result has 918 places, 772 transitions, 1956 flow [2021-06-10 11:42:35,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1956, PETRI_PLACES=918, PETRI_TRANSITIONS=772} [2021-06-10 11:42:35,989 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 65 predicate places. [2021-06-10 11:42:35,989 INFO L480 AbstractCegarLoop]: Abstraction has has 918 places, 772 transitions, 1956 flow [2021-06-10 11:42:35,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:35,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:35,990 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:35,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1643 [2021-06-10 11:42:35,990 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -336929743, now seen corresponding path program 1 times [2021-06-10 11:42:35,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:35,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967445184] [2021-06-10 11:42:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:36,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:36,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:42:36,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967445184] [2021-06-10 11:42:36,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:36,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:36,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416130303] [2021-06-10 11:42:36,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:36,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:36,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:36,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 772 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:36,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:36,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:36,407 INFO L129 PetriNetUnfolder]: 20/949 cut-off events. [2021-06-10 11:42:36,407 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:36,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 949 events. 20/949 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4257 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1203. Up to 33 conditions per place. [2021-06-10 11:42:36,460 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 6 selfloop transitions, 1 changer transitions 0/773 dead transitions. [2021-06-10 11:42:36,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 773 transitions, 1972 flow [2021-06-10 11:42:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:36,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:36,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:36,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:36,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:36,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:36,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,464 INFO L185 Difference]: Start difference. First operand has 918 places, 772 transitions, 1956 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:36,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 773 transitions, 1972 flow [2021-06-10 11:42:36,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 773 transitions, 1971 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:36,473 INFO L241 Difference]: Finished difference. Result has 920 places, 772 transitions, 1960 flow [2021-06-10 11:42:36,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=771, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=920, PETRI_TRANSITIONS=772} [2021-06-10 11:42:36,474 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 67 predicate places. [2021-06-10 11:42:36,474 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 772 transitions, 1960 flow [2021-06-10 11:42:36,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:36,474 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:36,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1644 [2021-06-10 11:42:36,474 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:36,474 INFO L82 PathProgramCache]: Analyzing trace with hash -336928720, now seen corresponding path program 1 times [2021-06-10 11:42:36,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:36,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533128249] [2021-06-10 11:42:36,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:36,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:36,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:42:36,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533128249] [2021-06-10 11:42:36,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:36,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:36,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611602138] [2021-06-10 11:42:36,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:36,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:36,500 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:36,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 772 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:36,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:36,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:36,924 INFO L129 PetriNetUnfolder]: 18/951 cut-off events. [2021-06-10 11:42:36,924 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:36,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 951 events. 18/951 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4291 event pairs, 0 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1214. Up to 33 conditions per place. [2021-06-10 11:42:36,955 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/773 dead transitions. [2021-06-10 11:42:36,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 773 transitions, 1986 flow [2021-06-10 11:42:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:36,957 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:36,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:36,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:36,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:36,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:36,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,959 INFO L185 Difference]: Start difference. First operand has 920 places, 772 transitions, 1960 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 773 transitions, 1986 flow [2021-06-10 11:42:36,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 773 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:36,967 INFO L241 Difference]: Finished difference. Result has 923 places, 773 transitions, 1977 flow [2021-06-10 11:42:36,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1977, PETRI_PLACES=923, PETRI_TRANSITIONS=773} [2021-06-10 11:42:36,967 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 70 predicate places. [2021-06-10 11:42:36,967 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 773 transitions, 1977 flow [2021-06-10 11:42:36,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:36,967 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:36,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1645 [2021-06-10 11:42:36,968 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash -337882032, now seen corresponding path program 1 times [2021-06-10 11:42:36,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:36,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535590775] [2021-06-10 11:42:36,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:36,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:36,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:36,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:42:36,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535590775] [2021-06-10 11:42:36,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:36,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:36,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952406687] [2021-06-10 11:42:36,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:36,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:36,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:36,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 773 transitions, 1977 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:36,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:36,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:36,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:37,365 INFO L129 PetriNetUnfolder]: 18/944 cut-off events. [2021-06-10 11:42:37,365 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:37,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 944 events. 18/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4234 event pairs, 0 based on Foata normal form. 1/896 useless extension candidates. Maximal degree in co-relation 1200. Up to 33 conditions per place. [2021-06-10 11:42:37,416 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/771 dead transitions. [2021-06-10 11:42:37,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 771 transitions, 1979 flow [2021-06-10 11:42:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:37,418 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:37,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:37,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:37,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:37,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:37,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,421 INFO L185 Difference]: Start difference. First operand has 923 places, 773 transitions, 1977 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:37,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 771 transitions, 1979 flow [2021-06-10 11:42:37,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 771 transitions, 1971 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:37,429 INFO L241 Difference]: Finished difference. Result has 923 places, 771 transitions, 1964 flow [2021-06-10 11:42:37,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=923, PETRI_TRANSITIONS=771} [2021-06-10 11:42:37,429 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 70 predicate places. [2021-06-10 11:42:37,429 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 771 transitions, 1964 flow [2021-06-10 11:42:37,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:37,430 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:37,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1646 [2021-06-10 11:42:37,430 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash -337883055, now seen corresponding path program 1 times [2021-06-10 11:42:37,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:37,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518672559] [2021-06-10 11:42:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:37,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:37,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:37,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:42:37,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518672559] [2021-06-10 11:42:37,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:37,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:37,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102245769] [2021-06-10 11:42:37,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:37,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:37,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:37,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 771 transitions, 1964 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:37,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:37,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:37,827 INFO L129 PetriNetUnfolder]: 18/942 cut-off events. [2021-06-10 11:42:37,827 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:37,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 942 events. 18/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4216 event pairs, 0 based on Foata normal form. 0/892 useless extension candidates. Maximal degree in co-relation 1204. Up to 33 conditions per place. [2021-06-10 11:42:37,878 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/769 dead transitions. [2021-06-10 11:42:37,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 769 transitions, 1977 flow [2021-06-10 11:42:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:37,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:37,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:37,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:37,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:37,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:37,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,882 INFO L185 Difference]: Start difference. First operand has 923 places, 771 transitions, 1964 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:37,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 769 transitions, 1977 flow [2021-06-10 11:42:37,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 769 transitions, 1976 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:37,890 INFO L241 Difference]: Finished difference. Result has 922 places, 769 transitions, 1960 flow [2021-06-10 11:42:37,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=922, PETRI_TRANSITIONS=769} [2021-06-10 11:42:37,891 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 69 predicate places. [2021-06-10 11:42:37,891 INFO L480 AbstractCegarLoop]: Abstraction has has 922 places, 769 transitions, 1960 flow [2021-06-10 11:42:37,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,891 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:37,891 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:37,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1647 [2021-06-10 11:42:37,891 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1510242808, now seen corresponding path program 1 times [2021-06-10 11:42:37,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:37,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069165302] [2021-06-10 11:42:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:37,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:37,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:37,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:37,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:42:37,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069165302] [2021-06-10 11:42:37,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:37,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:37,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915863348] [2021-06-10 11:42:37,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:37,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:37,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:37,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:37,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:37,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 769 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:37,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:37,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:37,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:38,299 INFO L129 PetriNetUnfolder]: 17/950 cut-off events. [2021-06-10 11:42:38,299 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:38,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 950 events. 17/950 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4285 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1216. Up to 33 conditions per place. [2021-06-10 11:42:38,351 INFO L132 encePairwiseOnDemand]: 912/917 looper letters, 10 selfloop transitions, 3 changer transitions 0/771 dead transitions. [2021-06-10 11:42:38,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 771 transitions, 1990 flow [2021-06-10 11:42:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2535 transitions. [2021-06-10 11:42:38,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214830970556162 [2021-06-10 11:42:38,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2535 transitions. [2021-06-10 11:42:38,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2535 transitions. [2021-06-10 11:42:38,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:38,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2535 transitions. [2021-06-10 11:42:38,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 845.0) internal successors, (2535), 3 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-06-10 11:42:38,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,355 INFO L185 Difference]: Start difference. First operand has 922 places, 769 transitions, 1960 flow. Second operand 3 states and 2535 transitions. [2021-06-10 11:42:38,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 771 transitions, 1990 flow [2021-06-10 11:42:38,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 771 transitions, 1989 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:38,363 INFO L241 Difference]: Finished difference. Result has 925 places, 771 transitions, 1983 flow [2021-06-10 11:42:38,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1983, PETRI_PLACES=925, PETRI_TRANSITIONS=771} [2021-06-10 11:42:38,364 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 72 predicate places. [2021-06-10 11:42:38,364 INFO L480 AbstractCegarLoop]: Abstraction has has 925 places, 771 transitions, 1983 flow [2021-06-10 11:42:38,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:38,364 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:38,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1648 [2021-06-10 11:42:38,364 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1510241785, now seen corresponding path program 1 times [2021-06-10 11:42:38,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:38,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66281324] [2021-06-10 11:42:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:38,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:38,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:38,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:42:38,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66281324] [2021-06-10 11:42:38,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:38,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:38,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953667239] [2021-06-10 11:42:38,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:38,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:38,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:38,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:38,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 771 transitions, 1983 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:38,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:38,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:38,767 INFO L129 PetriNetUnfolder]: 16/948 cut-off events. [2021-06-10 11:42:38,767 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:38,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 948 events. 16/948 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4276 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1213. Up to 33 conditions per place. [2021-06-10 11:42:38,821 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/771 dead transitions. [2021-06-10 11:42:38,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 771 transitions, 1995 flow [2021-06-10 11:42:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:38,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:38,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:38,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:38,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:38,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:38,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,825 INFO L185 Difference]: Start difference. First operand has 925 places, 771 transitions, 1983 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:38,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 771 transitions, 1995 flow [2021-06-10 11:42:38,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 771 transitions, 1990 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:38,834 INFO L241 Difference]: Finished difference. Result has 928 places, 771 transitions, 1988 flow [2021-06-10 11:42:38,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1988, PETRI_PLACES=928, PETRI_TRANSITIONS=771} [2021-06-10 11:42:38,835 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 75 predicate places. [2021-06-10 11:42:38,835 INFO L480 AbstractCegarLoop]: Abstraction has has 928 places, 771 transitions, 1988 flow [2021-06-10 11:42:38,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:38,835 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:38,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1649 [2021-06-10 11:42:38,835 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1509289496, now seen corresponding path program 1 times [2021-06-10 11:42:38,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:38,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683667983] [2021-06-10 11:42:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:38,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:38,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:38,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:38,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:42:38,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683667983] [2021-06-10 11:42:38,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:38,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:38,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144000863] [2021-06-10 11:42:38,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:38,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:38,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:38,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 771 transitions, 1988 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:38,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:38,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:38,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:39,234 INFO L129 PetriNetUnfolder]: 15/944 cut-off events. [2021-06-10 11:42:39,234 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:39,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 944 events. 15/944 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4248 event pairs, 0 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 1210. Up to 33 conditions per place. [2021-06-10 11:42:39,282 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/768 dead transitions. [2021-06-10 11:42:39,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 768 transitions, 1985 flow [2021-06-10 11:42:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:39,283 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:39,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:39,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:39,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:39,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:39,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,286 INFO L185 Difference]: Start difference. First operand has 928 places, 771 transitions, 1988 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:39,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 768 transitions, 1985 flow [2021-06-10 11:42:39,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 768 transitions, 1978 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:39,294 INFO L241 Difference]: Finished difference. Result has 927 places, 768 transitions, 1968 flow [2021-06-10 11:42:39,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=768, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=927, PETRI_TRANSITIONS=768} [2021-06-10 11:42:39,294 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 74 predicate places. [2021-06-10 11:42:39,294 INFO L480 AbstractCegarLoop]: Abstraction has has 927 places, 768 transitions, 1968 flow [2021-06-10 11:42:39,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:39,294 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:39,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1650 [2021-06-10 11:42:39,294 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1509288473, now seen corresponding path program 1 times [2021-06-10 11:42:39,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:39,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519773940] [2021-06-10 11:42:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:39,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:39,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:39,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:42:39,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519773940] [2021-06-10 11:42:39,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:39,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:39,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166829109] [2021-06-10 11:42:39,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:39,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:39,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:39,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 768 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:39,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:39,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:39,698 INFO L129 PetriNetUnfolder]: 15/942 cut-off events. [2021-06-10 11:42:39,699 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:39,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 942 events. 15/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4232 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1211. Up to 33 conditions per place. [2021-06-10 11:42:39,750 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/766 dead transitions. [2021-06-10 11:42:39,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 766 transitions, 1981 flow [2021-06-10 11:42:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:39,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:39,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:39,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:39,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:39,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:39,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,754 INFO L185 Difference]: Start difference. First operand has 927 places, 768 transitions, 1968 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:39,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 766 transitions, 1981 flow [2021-06-10 11:42:39,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 766 transitions, 1980 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:39,762 INFO L241 Difference]: Finished difference. Result has 926 places, 766 transitions, 1964 flow [2021-06-10 11:42:39,762 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=926, PETRI_TRANSITIONS=766} [2021-06-10 11:42:39,762 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 73 predicate places. [2021-06-10 11:42:39,762 INFO L480 AbstractCegarLoop]: Abstraction has has 926 places, 766 transitions, 1964 flow [2021-06-10 11:42:39,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:39,763 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:39,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1651 [2021-06-10 11:42:39,763 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash -682277057, now seen corresponding path program 1 times [2021-06-10 11:42:39,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:39,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493720925] [2021-06-10 11:42:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:39,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:39,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:39,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:39,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:42:39,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493720925] [2021-06-10 11:42:39,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:39,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:39,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900847212] [2021-06-10 11:42:39,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:39,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:39,788 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:39,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 766 transitions, 1964 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:39,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:39,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:39,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:40,164 INFO L129 PetriNetUnfolder]: 13/947 cut-off events. [2021-06-10 11:42:40,164 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:40,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 947 events. 13/947 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4285 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1214. Up to 33 conditions per place. [2021-06-10 11:42:40,215 INFO L132 encePairwiseOnDemand]: 914/917 looper letters, 5 selfloop transitions, 2 changer transitions 0/767 dead transitions. [2021-06-10 11:42:40,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 767 transitions, 1980 flow [2021-06-10 11:42:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2543 transitions. [2021-06-10 11:42:40,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9243911304980007 [2021-06-10 11:42:40,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2543 transitions. [2021-06-10 11:42:40,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2543 transitions. [2021-06-10 11:42:40,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:40,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2543 transitions. [2021-06-10 11:42:40,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.6666666666666) internal successors, (2543), 3 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,219 INFO L185 Difference]: Start difference. First operand has 926 places, 766 transitions, 1964 flow. Second operand 3 states and 2543 transitions. [2021-06-10 11:42:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 767 transitions, 1980 flow [2021-06-10 11:42:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 767 transitions, 1979 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:40,227 INFO L241 Difference]: Finished difference. Result has 929 places, 767 transitions, 1977 flow [2021-06-10 11:42:40,227 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1977, PETRI_PLACES=929, PETRI_TRANSITIONS=767} [2021-06-10 11:42:40,227 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 76 predicate places. [2021-06-10 11:42:40,227 INFO L480 AbstractCegarLoop]: Abstraction has has 929 places, 767 transitions, 1977 flow [2021-06-10 11:42:40,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,227 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:40,228 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:40,228 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1652 [2021-06-10 11:42:40,228 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -682278080, now seen corresponding path program 1 times [2021-06-10 11:42:40,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:40,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938128619] [2021-06-10 11:42:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:40,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:40,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:40,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:42:40,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938128619] [2021-06-10 11:42:40,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:40,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:40,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315989188] [2021-06-10 11:42:40,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:40,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:40,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:40,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:40,253 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:40,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 767 transitions, 1977 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:40,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:40,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:40,640 INFO L129 PetriNetUnfolder]: 13/948 cut-off events. [2021-06-10 11:42:40,641 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:40,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 948 events. 13/948 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4293 event pairs, 0 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1222. Up to 33 conditions per place. [2021-06-10 11:42:40,692 INFO L132 encePairwiseOnDemand]: 913/917 looper letters, 9 selfloop transitions, 3 changer transitions 0/768 dead transitions. [2021-06-10 11:42:40,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 768 transitions, 2003 flow [2021-06-10 11:42:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2533 transitions. [2021-06-10 11:42:40,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.92075608869502 [2021-06-10 11:42:40,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2533 transitions. [2021-06-10 11:42:40,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2533 transitions. [2021-06-10 11:42:40,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:40,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2533 transitions. [2021-06-10 11:42:40,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 844.3333333333334) internal successors, (2533), 3 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,696 INFO L185 Difference]: Start difference. First operand has 929 places, 767 transitions, 1977 flow. Second operand 3 states and 2533 transitions. [2021-06-10 11:42:40,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 768 transitions, 2003 flow [2021-06-10 11:42:40,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 768 transitions, 2001 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:40,704 INFO L241 Difference]: Finished difference. Result has 932 places, 768 transitions, 1993 flow [2021-06-10 11:42:40,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1993, PETRI_PLACES=932, PETRI_TRANSITIONS=768} [2021-06-10 11:42:40,704 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 79 predicate places. [2021-06-10 11:42:40,704 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 768 transitions, 1993 flow [2021-06-10 11:42:40,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:40,705 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:40,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1653 [2021-06-10 11:42:40,705 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash -681324768, now seen corresponding path program 1 times [2021-06-10 11:42:40,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:40,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183396422] [2021-06-10 11:42:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:40,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:40,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:40,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:40,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:42:40,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183396422] [2021-06-10 11:42:40,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:40,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:40,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300833936] [2021-06-10 11:42:40,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:40,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:40,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:40,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 845 out of 917 [2021-06-10 11:42:40,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 768 transitions, 1993 flow. Second operand has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:40,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:40,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 845 of 917 [2021-06-10 11:42:40,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:41,094 INFO L129 PetriNetUnfolder]: 12/944 cut-off events. [2021-06-10 11:42:41,094 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:41,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 944 events. 12/944 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4269 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1215. Up to 33 conditions per place. [2021-06-10 11:42:41,134 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 5 selfloop transitions, 1 changer transitions 0/765 dead transitions. [2021-06-10 11:42:41,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 765 transitions, 1990 flow [2021-06-10 11:42:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2542 transitions. [2021-06-10 11:42:41,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9240276263177026 [2021-06-10 11:42:41,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2542 transitions. [2021-06-10 11:42:41,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2542 transitions. [2021-06-10 11:42:41,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:41,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2542 transitions. [2021-06-10 11:42:41,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 847.3333333333334) internal successors, (2542), 3 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,138 INFO L185 Difference]: Start difference. First operand has 932 places, 768 transitions, 1993 flow. Second operand 3 states and 2542 transitions. [2021-06-10 11:42:41,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 765 transitions, 1990 flow [2021-06-10 11:42:41,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 765 transitions, 1982 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:41,146 INFO L241 Difference]: Finished difference. Result has 931 places, 765 transitions, 1972 flow [2021-06-10 11:42:41,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1972, PETRI_PLACES=931, PETRI_TRANSITIONS=765} [2021-06-10 11:42:41,146 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 78 predicate places. [2021-06-10 11:42:41,146 INFO L480 AbstractCegarLoop]: Abstraction has has 931 places, 765 transitions, 1972 flow [2021-06-10 11:42:41,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 846.3333333333334) internal successors, (2539), 3 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:41,146 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:41,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1654 [2021-06-10 11:42:41,147 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -681323745, now seen corresponding path program 1 times [2021-06-10 11:42:41,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:41,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317565425] [2021-06-10 11:42:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:41,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:41,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:41,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:41,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:41,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:41,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:42:41,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317565425] [2021-06-10 11:42:41,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:41,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:41,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716021560] [2021-06-10 11:42:41,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:41,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:41,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:41,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:41,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 840 out of 917 [2021-06-10 11:42:41,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 765 transitions, 1972 flow. Second operand has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:41,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 840 of 917 [2021-06-10 11:42:41,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:41,567 INFO L129 PetriNetUnfolder]: 12/942 cut-off events. [2021-06-10 11:42:41,567 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-06-10 11:42:41,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 942 events. 12/942 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4254 event pairs, 0 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1218. Up to 33 conditions per place. [2021-06-10 11:42:41,618 INFO L132 encePairwiseOnDemand]: 915/917 looper letters, 8 selfloop transitions, 1 changer transitions 0/763 dead transitions. [2021-06-10 11:42:41,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 763 transitions, 1985 flow [2021-06-10 11:42:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2530 transitions. [2021-06-10 11:42:41,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9196655761541258 [2021-06-10 11:42:41,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2530 transitions. [2021-06-10 11:42:41,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2530 transitions. [2021-06-10 11:42:41,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:41,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2530 transitions. [2021-06-10 11:42:41,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 843.3333333333334) internal successors, (2530), 3 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 917.0) internal successors, (3668), 4 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,623 INFO L185 Difference]: Start difference. First operand has 931 places, 765 transitions, 1972 flow. Second operand 3 states and 2530 transitions. [2021-06-10 11:42:41,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 763 transitions, 1985 flow [2021-06-10 11:42:41,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 763 transitions, 1984 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:41,631 INFO L241 Difference]: Finished difference. Result has 930 places, 763 transitions, 1968 flow [2021-06-10 11:42:41,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=917, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=930, PETRI_TRANSITIONS=763} [2021-06-10 11:42:41,631 INFO L343 CegarLoopForPetriNet]: 853 programPoint places, 77 predicate places. [2021-06-10 11:42:41,631 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 763 transitions, 1968 flow [2021-06-10 11:42:41,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 842.3333333333334) internal successors, (2527), 3 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:41,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:41,632 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:41,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1655 [2021-06-10 11:42:41,632 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1542081018, now seen corresponding path program 1 times [2021-06-10 11:42:41,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:41,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757077191] [2021-06-10 11:42:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:42:41,649 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:42:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:42:41,655 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:42:41,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:42:41,673 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:42:41,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1656 [2021-06-10 11:42:41,673 WARN L342 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:42:41,673 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,802 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,805 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,809 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,810 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,811 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,812 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,813 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,833 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,834 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,835 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,836 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,837 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,838 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,839 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of33ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,840 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of33ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:42:41,841 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:42:41,841 INFO L253 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2021-06-10 11:42:41,841 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:42:41,841 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:42:41,841 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:42:41,841 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:42:41,841 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:42:41,841 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:42:41,841 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:42:41,841 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:42:41,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 879 places, 945 transitions, 3111 flow [2021-06-10 11:42:42,245 INFO L129 PetriNetUnfolder]: 166/1241 cut-off events. [2021-06-10 11:42:42,245 INFO L130 PetriNetUnfolder]: For 6512/6512 co-relation queries the response was YES. [2021-06-10 11:42:42,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1241 events. 166/1241 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5330 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1819. Up to 68 conditions per place. [2021-06-10 11:42:42,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 879 places, 945 transitions, 3111 flow [2021-06-10 11:42:42,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 879 places, 945 transitions, 3111 flow [2021-06-10 11:42:42,356 INFO L129 PetriNetUnfolder]: 8/98 cut-off events. [2021-06-10 11:42:42,357 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:42:42,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:42,357 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-06-10 11:42:42,357 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash -51922255, now seen corresponding path program 1 times [2021-06-10 11:42:42,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:42,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654311233] [2021-06-10 11:42:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:42,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:42,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:42,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:42:42,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654311233] [2021-06-10 11:42:42,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:42,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:42,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151185032] [2021-06-10 11:42:42,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:42,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:42,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:42,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:42,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:42,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 945 transitions, 3111 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:42,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:42,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:42,718 INFO L129 PetriNetUnfolder]: 97/976 cut-off events. [2021-06-10 11:42:42,718 INFO L130 PetriNetUnfolder]: For 6513/6513 co-relation queries the response was YES. [2021-06-10 11:42:42,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 976 events. 97/976 cut-off events. For 6513/6513 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3933 event pairs, 0 based on Foata normal form. 134/978 useless extension candidates. Maximal degree in co-relation 1566. Up to 34 conditions per place. [2021-06-10 11:42:42,791 INFO L132 encePairwiseOnDemand]: 907/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/874 dead transitions. [2021-06-10 11:42:42,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 874 transitions, 2983 flow [2021-06-10 11:42:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:42:42,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9492063492063492 [2021-06-10 11:42:42,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:42:42,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:42:42,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:42,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:42:42,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,796 INFO L185 Difference]: Start difference. First operand has 879 places, 945 transitions, 3111 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:42:42,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 843 places, 874 transitions, 2983 flow [2021-06-10 11:42:42,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 874 transitions, 1927 flow, removed 528 selfloop flow, removed 0 redundant places. [2021-06-10 11:42:42,810 INFO L241 Difference]: Finished difference. Result has 845 places, 874 transitions, 1925 flow [2021-06-10 11:42:42,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=845, PETRI_TRANSITIONS=874} [2021-06-10 11:42:42,810 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -34 predicate places. [2021-06-10 11:42:42,810 INFO L480 AbstractCegarLoop]: Abstraction has has 845 places, 874 transitions, 1925 flow [2021-06-10 11:42:42,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:42,810 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-06-10 11:42:42,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1657 [2021-06-10 11:42:42,810 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -51923278, now seen corresponding path program 1 times [2021-06-10 11:42:42,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:42,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230091923] [2021-06-10 11:42:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:42,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:42,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:42,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:42,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:42:42,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230091923] [2021-06-10 11:42:42,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:42,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:42,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787254904] [2021-06-10 11:42:42,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:42,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:42,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:42,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 874 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:42,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:42,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:42,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:43,151 INFO L129 PetriNetUnfolder]: 97/977 cut-off events. [2021-06-10 11:42:43,151 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:43,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 977 events. 97/977 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3943 event pairs, 0 based on Foata normal form. 0/846 useless extension candidates. Maximal degree in co-relation 1076. Up to 34 conditions per place. [2021-06-10 11:42:43,200 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/875 dead transitions. [2021-06-10 11:42:43,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 875 transitions, 1951 flow [2021-06-10 11:42:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:42:43,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:42:43,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:42:43,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:42:43,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:43,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:42:43,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,205 INFO L185 Difference]: Start difference. First operand has 845 places, 874 transitions, 1925 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:42:43,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 875 transitions, 1951 flow [2021-06-10 11:42:43,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 875 transitions, 1949 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:43,212 INFO L241 Difference]: Finished difference. Result has 848 places, 875 transitions, 1941 flow [2021-06-10 11:42:43,212 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1941, PETRI_PLACES=848, PETRI_TRANSITIONS=875} [2021-06-10 11:42:43,212 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -31 predicate places. [2021-06-10 11:42:43,212 INFO L480 AbstractCegarLoop]: Abstraction has has 848 places, 875 transitions, 1941 flow [2021-06-10 11:42:43,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,213 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:43,213 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-06-10 11:42:43,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1658 [2021-06-10 11:42:43,213 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -50968943, now seen corresponding path program 1 times [2021-06-10 11:42:43,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:43,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015704360] [2021-06-10 11:42:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:43,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:43,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:43,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:42:43,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015704360] [2021-06-10 11:42:43,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:43,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:43,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230388277] [2021-06-10 11:42:43,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:43,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:43,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:43,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 875 transitions, 1941 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:43,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:43,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:43,544 INFO L129 PetriNetUnfolder]: 96/974 cut-off events. [2021-06-10 11:42:43,544 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:42:43,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 974 events. 96/974 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3925 event pairs, 0 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1078. Up to 34 conditions per place. [2021-06-10 11:42:43,609 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 9 selfloop transitions, 1 changer transitions 0/873 dead transitions. [2021-06-10 11:42:43,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 873 transitions, 1949 flow [2021-06-10 11:42:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2610 transitions. [2021-06-10 11:42:43,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:42:43,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2610 transitions. [2021-06-10 11:42:43,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2610 transitions. [2021-06-10 11:42:43,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:43,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2610 transitions. [2021-06-10 11:42:43,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,613 INFO L185 Difference]: Start difference. First operand has 848 places, 875 transitions, 1941 flow. Second operand 3 states and 2610 transitions. [2021-06-10 11:42:43,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 873 transitions, 1949 flow [2021-06-10 11:42:43,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 873 transitions, 1948 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:43,621 INFO L241 Difference]: Finished difference. Result has 849 places, 873 transitions, 1930 flow [2021-06-10 11:42:43,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=847, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1930, PETRI_PLACES=849, PETRI_TRANSITIONS=873} [2021-06-10 11:42:43,621 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -30 predicate places. [2021-06-10 11:42:43,621 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 873 transitions, 1930 flow [2021-06-10 11:42:43,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:43,621 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-06-10 11:42:43,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1659 [2021-06-10 11:42:43,622 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -50969966, now seen corresponding path program 1 times [2021-06-10 11:42:43,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:43,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492633538] [2021-06-10 11:42:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:43,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:43,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:43,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:43,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:42:43,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492633538] [2021-06-10 11:42:43,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:43,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:43,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189137844] [2021-06-10 11:42:43,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:43,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:43,641 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:43,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 873 transitions, 1930 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:43,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:43,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:43,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:43,949 INFO L129 PetriNetUnfolder]: 96/971 cut-off events. [2021-06-10 11:42:43,949 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:43,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 971 events. 96/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3903 event pairs, 0 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1073. Up to 34 conditions per place. [2021-06-10 11:42:44,016 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/870 dead transitions. [2021-06-10 11:42:44,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 849 places, 870 transitions, 1931 flow [2021-06-10 11:42:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:44,017 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:44,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:44,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:44,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:44,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:44,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,020 INFO L185 Difference]: Start difference. First operand has 849 places, 873 transitions, 1930 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:44,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 849 places, 870 transitions, 1931 flow [2021-06-10 11:42:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 846 places, 870 transitions, 1926 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:44,028 INFO L241 Difference]: Finished difference. Result has 846 places, 870 transitions, 1916 flow [2021-06-10 11:42:44,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=844, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1916, PETRI_PLACES=846, PETRI_TRANSITIONS=870} [2021-06-10 11:42:44,028 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -33 predicate places. [2021-06-10 11:42:44,029 INFO L480 AbstractCegarLoop]: Abstraction has has 846 places, 870 transitions, 1916 flow [2021-06-10 11:42:44,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:44,029 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:44,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1660 [2021-06-10 11:42:44,029 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1180492042, now seen corresponding path program 1 times [2021-06-10 11:42:44,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:44,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838750579] [2021-06-10 11:42:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:44,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:44,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:42:44,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838750579] [2021-06-10 11:42:44,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:44,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:44,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300981490] [2021-06-10 11:42:44,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:44,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:44,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:44,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 870 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:44,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:44,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:44,371 INFO L129 PetriNetUnfolder]: 95/979 cut-off events. [2021-06-10 11:42:44,371 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:44,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 979 events. 95/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3977 event pairs, 0 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1090. Up to 34 conditions per place. [2021-06-10 11:42:44,436 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/872 dead transitions. [2021-06-10 11:42:44,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 848 places, 872 transitions, 1946 flow [2021-06-10 11:42:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:44,438 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:44,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:44,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:44,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:44,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:44,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,441 INFO L185 Difference]: Start difference. First operand has 846 places, 870 transitions, 1916 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 848 places, 872 transitions, 1946 flow [2021-06-10 11:42:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 847 places, 872 transitions, 1945 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:44,449 INFO L241 Difference]: Finished difference. Result has 849 places, 872 transitions, 1939 flow [2021-06-10 11:42:44,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=845, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1939, PETRI_PLACES=849, PETRI_TRANSITIONS=872} [2021-06-10 11:42:44,449 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -30 predicate places. [2021-06-10 11:42:44,449 INFO L480 AbstractCegarLoop]: Abstraction has has 849 places, 872 transitions, 1939 flow [2021-06-10 11:42:44,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,449 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:44,449 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:44,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1661 [2021-06-10 11:42:44,450 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1180491019, now seen corresponding path program 1 times [2021-06-10 11:42:44,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:44,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659273196] [2021-06-10 11:42:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:44,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:44,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:42:44,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659273196] [2021-06-10 11:42:44,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:44,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:44,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533966011] [2021-06-10 11:42:44,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:44,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:44,470 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:44,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 872 transitions, 1939 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:44,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:44,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:44,794 INFO L129 PetriNetUnfolder]: 93/980 cut-off events. [2021-06-10 11:42:44,794 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:44,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 980 events. 93/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3998 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1087. Up to 34 conditions per place. [2021-06-10 11:42:44,860 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/872 dead transitions. [2021-06-10 11:42:44,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 872 transitions, 1951 flow [2021-06-10 11:42:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:44,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:44,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:44,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:44,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:44,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:44,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,864 INFO L185 Difference]: Start difference. First operand has 849 places, 872 transitions, 1939 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 872 transitions, 1951 flow [2021-06-10 11:42:44,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 872 transitions, 1946 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:44,872 INFO L241 Difference]: Finished difference. Result has 851 places, 871 transitions, 1935 flow [2021-06-10 11:42:44,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1935, PETRI_PLACES=851, PETRI_TRANSITIONS=871} [2021-06-10 11:42:44,872 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -28 predicate places. [2021-06-10 11:42:44,873 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 871 transitions, 1935 flow [2021-06-10 11:42:44,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,873 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:44,873 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:44,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1662 [2021-06-10 11:42:44,873 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:44,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1179538730, now seen corresponding path program 1 times [2021-06-10 11:42:44,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:44,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583664059] [2021-06-10 11:42:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:44,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:44,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:44,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:42:44,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583664059] [2021-06-10 11:42:44,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:44,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:44,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730808206] [2021-06-10 11:42:44,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:44,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:44,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:44,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 871 transitions, 1935 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:44,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:44,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:44,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:45,206 INFO L129 PetriNetUnfolder]: 93/973 cut-off events. [2021-06-10 11:42:45,207 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:45,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 973 events. 93/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3936 event pairs, 0 based on Foata normal form. 1/849 useless extension candidates. Maximal degree in co-relation 1082. Up to 34 conditions per place. [2021-06-10 11:42:45,251 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/869 dead transitions. [2021-06-10 11:42:45,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 869 transitions, 1938 flow [2021-06-10 11:42:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:45,252 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:45,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:45,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:45,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:45,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:45,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,255 INFO L185 Difference]: Start difference. First operand has 851 places, 871 transitions, 1935 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:45,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 869 transitions, 1938 flow [2021-06-10 11:42:45,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 869 transitions, 1931 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:45,262 INFO L241 Difference]: Finished difference. Result has 851 places, 869 transitions, 1924 flow [2021-06-10 11:42:45,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=851, PETRI_TRANSITIONS=869} [2021-06-10 11:42:45,262 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -28 predicate places. [2021-06-10 11:42:45,262 INFO L480 AbstractCegarLoop]: Abstraction has has 851 places, 869 transitions, 1924 flow [2021-06-10 11:42:45,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:45,263 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:45,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1663 [2021-06-10 11:42:45,263 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1179537707, now seen corresponding path program 1 times [2021-06-10 11:42:45,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:45,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324926353] [2021-06-10 11:42:45,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:45,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:45,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:45,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:42:45,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324926353] [2021-06-10 11:42:45,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:45,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:45,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009782897] [2021-06-10 11:42:45,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:45,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:45,283 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:45,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 851 places, 869 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:45,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:45,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:45,592 INFO L129 PetriNetUnfolder]: 93/971 cut-off events. [2021-06-10 11:42:45,592 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:45,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 971 events. 93/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3921 event pairs, 0 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1082. Up to 34 conditions per place. [2021-06-10 11:42:45,655 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/867 dead transitions. [2021-06-10 11:42:45,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 867 transitions, 1937 flow [2021-06-10 11:42:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:45,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:45,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:45,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:45,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:45,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:45,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,660 INFO L185 Difference]: Start difference. First operand has 851 places, 869 transitions, 1924 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 867 transitions, 1937 flow [2021-06-10 11:42:45,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 850 places, 867 transitions, 1936 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:45,668 INFO L241 Difference]: Finished difference. Result has 850 places, 867 transitions, 1920 flow [2021-06-10 11:42:45,668 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1920, PETRI_PLACES=850, PETRI_TRANSITIONS=867} [2021-06-10 11:42:45,668 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -29 predicate places. [2021-06-10 11:42:45,668 INFO L480 AbstractCegarLoop]: Abstraction has has 850 places, 867 transitions, 1920 flow [2021-06-10 11:42:45,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:45,668 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:45,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1664 [2021-06-10 11:42:45,668 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1005394908, now seen corresponding path program 1 times [2021-06-10 11:42:45,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:45,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073062072] [2021-06-10 11:42:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:45,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:45,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:45,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:45,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:42:45,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073062072] [2021-06-10 11:42:45,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:45,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:45,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000263480] [2021-06-10 11:42:45,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:45,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:45,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:45,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 867 transitions, 1920 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:45,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:45,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:45,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:46,004 INFO L129 PetriNetUnfolder]: 91/976 cut-off events. [2021-06-10 11:42:46,004 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:46,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 976 events. 91/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3973 event pairs, 0 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1085. Up to 34 conditions per place. [2021-06-10 11:42:46,072 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/868 dead transitions. [2021-06-10 11:42:46,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 868 transitions, 1936 flow [2021-06-10 11:42:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:46,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:46,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:46,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:46,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:46,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:46,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,076 INFO L185 Difference]: Start difference. First operand has 850 places, 867 transitions, 1920 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 868 transitions, 1936 flow [2021-06-10 11:42:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 851 places, 868 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:46,084 INFO L241 Difference]: Finished difference. Result has 853 places, 868 transitions, 1933 flow [2021-06-10 11:42:46,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=849, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=853, PETRI_TRANSITIONS=868} [2021-06-10 11:42:46,084 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -26 predicate places. [2021-06-10 11:42:46,084 INFO L480 AbstractCegarLoop]: Abstraction has has 853 places, 868 transitions, 1933 flow [2021-06-10 11:42:46,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:46,085 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:46,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1665 [2021-06-10 11:42:46,085 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1005395931, now seen corresponding path program 1 times [2021-06-10 11:42:46,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:46,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974870263] [2021-06-10 11:42:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:46,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:46,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:42:46,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974870263] [2021-06-10 11:42:46,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:46,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:46,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075755509] [2021-06-10 11:42:46,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:46,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:46,104 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:46,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 868 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:46,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:46,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:46,431 INFO L129 PetriNetUnfolder]: 91/977 cut-off events. [2021-06-10 11:42:46,431 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:46,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 977 events. 91/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3981 event pairs, 0 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 1093. Up to 34 conditions per place. [2021-06-10 11:42:46,498 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/869 dead transitions. [2021-06-10 11:42:46,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 869 transitions, 1959 flow [2021-06-10 11:42:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:42:46,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:42:46,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:42:46,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:42:46,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:46,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:42:46,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,502 INFO L185 Difference]: Start difference. First operand has 853 places, 868 transitions, 1933 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:42:46,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 869 transitions, 1959 flow [2021-06-10 11:42:46,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 854 places, 869 transitions, 1957 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:46,510 INFO L241 Difference]: Finished difference. Result has 856 places, 869 transitions, 1949 flow [2021-06-10 11:42:46,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1949, PETRI_PLACES=856, PETRI_TRANSITIONS=869} [2021-06-10 11:42:46,510 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -23 predicate places. [2021-06-10 11:42:46,510 INFO L480 AbstractCegarLoop]: Abstraction has has 856 places, 869 transitions, 1949 flow [2021-06-10 11:42:46,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:46,511 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:46,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666 [2021-06-10 11:42:46,511 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1004442619, now seen corresponding path program 1 times [2021-06-10 11:42:46,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:46,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641512489] [2021-06-10 11:42:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:46,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:46,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:42:46,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641512489] [2021-06-10 11:42:46,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:46,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:46,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597281832] [2021-06-10 11:42:46,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:46,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:46,531 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:46,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 869 transitions, 1949 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:46,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:46,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:46,868 INFO L129 PetriNetUnfolder]: 90/973 cut-off events. [2021-06-10 11:42:46,868 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:46,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 973 events. 90/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3957 event pairs, 0 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1086. Up to 34 conditions per place. [2021-06-10 11:42:46,937 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/866 dead transitions. [2021-06-10 11:42:46,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 858 places, 866 transitions, 1946 flow [2021-06-10 11:42:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:46,939 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:46,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:46,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:46,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:46,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:46,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,942 INFO L185 Difference]: Start difference. First operand has 856 places, 869 transitions, 1949 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:46,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 858 places, 866 transitions, 1946 flow [2021-06-10 11:42:46,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 866 transitions, 1938 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:46,950 INFO L241 Difference]: Finished difference. Result has 855 places, 866 transitions, 1928 flow [2021-06-10 11:42:46,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=853, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1928, PETRI_PLACES=855, PETRI_TRANSITIONS=866} [2021-06-10 11:42:46,950 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -24 predicate places. [2021-06-10 11:42:46,950 INFO L480 AbstractCegarLoop]: Abstraction has has 855 places, 866 transitions, 1928 flow [2021-06-10 11:42:46,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:46,951 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:46,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1667 [2021-06-10 11:42:46,951 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1004441596, now seen corresponding path program 1 times [2021-06-10 11:42:46,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:46,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774032547] [2021-06-10 11:42:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:46,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:46,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:46,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:42:46,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774032547] [2021-06-10 11:42:46,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:46,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:46,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629781357] [2021-06-10 11:42:46,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:46,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:46,972 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:46,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 855 places, 866 transitions, 1928 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:46,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:46,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:46,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:47,308 INFO L129 PetriNetUnfolder]: 90/971 cut-off events. [2021-06-10 11:42:47,308 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:47,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 971 events. 90/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3939 event pairs, 0 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 1089. Up to 34 conditions per place. [2021-06-10 11:42:47,352 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/864 dead transitions. [2021-06-10 11:42:47,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 864 transitions, 1941 flow [2021-06-10 11:42:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:47,354 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:47,354 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:47,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:47,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:47,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:47,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,357 INFO L185 Difference]: Start difference. First operand has 855 places, 866 transitions, 1928 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:47,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 864 transitions, 1941 flow [2021-06-10 11:42:47,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 854 places, 864 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:47,364 INFO L241 Difference]: Finished difference. Result has 854 places, 864 transitions, 1924 flow [2021-06-10 11:42:47,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1924, PETRI_PLACES=854, PETRI_TRANSITIONS=864} [2021-06-10 11:42:47,364 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -25 predicate places. [2021-06-10 11:42:47,365 INFO L480 AbstractCegarLoop]: Abstraction has has 854 places, 864 transitions, 1924 flow [2021-06-10 11:42:47,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,365 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:47,365 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:47,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1668 [2021-06-10 11:42:47,365 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1876896993, now seen corresponding path program 1 times [2021-06-10 11:42:47,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:47,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740001529] [2021-06-10 11:42:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:47,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:47,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:47,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:42:47,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740001529] [2021-06-10 11:42:47,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:47,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:47,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550601204] [2021-06-10 11:42:47,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:47,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:47,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:47,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 864 transitions, 1924 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:47,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:47,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:47,700 INFO L129 PetriNetUnfolder]: 88/976 cut-off events. [2021-06-10 11:42:47,701 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:47,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 976 events. 88/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3991 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1092. Up to 34 conditions per place. [2021-06-10 11:42:47,763 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/865 dead transitions. [2021-06-10 11:42:47,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 865 transitions, 1940 flow [2021-06-10 11:42:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:47,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:47,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:47,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:47,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:47,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:47,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,768 INFO L185 Difference]: Start difference. First operand has 854 places, 864 transitions, 1924 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:47,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 856 places, 865 transitions, 1940 flow [2021-06-10 11:42:47,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 865 transitions, 1939 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:47,776 INFO L241 Difference]: Finished difference. Result has 857 places, 865 transitions, 1937 flow [2021-06-10 11:42:47,776 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=853, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1937, PETRI_PLACES=857, PETRI_TRANSITIONS=865} [2021-06-10 11:42:47,776 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -22 predicate places. [2021-06-10 11:42:47,776 INFO L480 AbstractCegarLoop]: Abstraction has has 857 places, 865 transitions, 1937 flow [2021-06-10 11:42:47,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:47,776 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:47,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1669 [2021-06-10 11:42:47,777 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:47,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1876898016, now seen corresponding path program 1 times [2021-06-10 11:42:47,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:47,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340268741] [2021-06-10 11:42:47,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:47,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:47,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:47,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:47,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:42:47,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340268741] [2021-06-10 11:42:47,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:47,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:47,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817844976] [2021-06-10 11:42:47,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:47,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:47,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:47,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:47,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:47,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 865 transitions, 1937 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:47,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:47,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:47,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:48,137 INFO L129 PetriNetUnfolder]: 88/977 cut-off events. [2021-06-10 11:42:48,137 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:42:48,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 977 events. 88/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3999 event pairs, 0 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 1100. Up to 34 conditions per place. [2021-06-10 11:42:48,203 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/866 dead transitions. [2021-06-10 11:42:48,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 866 transitions, 1963 flow [2021-06-10 11:42:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:42:48,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:42:48,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:42:48,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:42:48,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:48,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:42:48,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,207 INFO L185 Difference]: Start difference. First operand has 857 places, 865 transitions, 1937 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:42:48,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 866 transitions, 1963 flow [2021-06-10 11:42:48,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 866 transitions, 1961 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:48,216 INFO L241 Difference]: Finished difference. Result has 860 places, 866 transitions, 1953 flow [2021-06-10 11:42:48,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1953, PETRI_PLACES=860, PETRI_TRANSITIONS=866} [2021-06-10 11:42:48,216 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -19 predicate places. [2021-06-10 11:42:48,216 INFO L480 AbstractCegarLoop]: Abstraction has has 860 places, 866 transitions, 1953 flow [2021-06-10 11:42:48,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:48,216 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:48,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1670 [2021-06-10 11:42:48,217 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:48,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1875944704, now seen corresponding path program 1 times [2021-06-10 11:42:48,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:48,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418788190] [2021-06-10 11:42:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:48,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:48,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:48,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:42:48,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418788190] [2021-06-10 11:42:48,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:48,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:48,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795125123] [2021-06-10 11:42:48,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:48,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:48,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:48,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 860 places, 866 transitions, 1953 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:48,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:48,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:48,562 INFO L129 PetriNetUnfolder]: 87/973 cut-off events. [2021-06-10 11:42:48,562 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:48,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 973 events. 87/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3975 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1093. Up to 34 conditions per place. [2021-06-10 11:42:48,625 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/863 dead transitions. [2021-06-10 11:42:48,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 863 transitions, 1950 flow [2021-06-10 11:42:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:48,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:48,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:48,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:48,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:48,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:48,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,629 INFO L185 Difference]: Start difference. First operand has 860 places, 866 transitions, 1953 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:48,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 863 transitions, 1950 flow [2021-06-10 11:42:48,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 863 transitions, 1942 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:48,637 INFO L241 Difference]: Finished difference. Result has 859 places, 863 transitions, 1932 flow [2021-06-10 11:42:48,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1932, PETRI_PLACES=859, PETRI_TRANSITIONS=863} [2021-06-10 11:42:48,637 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -20 predicate places. [2021-06-10 11:42:48,637 INFO L480 AbstractCegarLoop]: Abstraction has has 859 places, 863 transitions, 1932 flow [2021-06-10 11:42:48,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:48,638 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:48,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1671 [2021-06-10 11:42:48,638 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943681, now seen corresponding path program 1 times [2021-06-10 11:42:48,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:48,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902661913] [2021-06-10 11:42:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:48,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:48,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:48,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:48,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:42:48,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902661913] [2021-06-10 11:42:48,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:48,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:48,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129059146] [2021-06-10 11:42:48,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:48,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:48,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:48,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 859 places, 863 transitions, 1932 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:48,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:48,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:48,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:48,973 INFO L129 PetriNetUnfolder]: 87/971 cut-off events. [2021-06-10 11:42:48,973 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:49,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 971 events. 87/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3957 event pairs, 0 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1096. Up to 34 conditions per place. [2021-06-10 11:42:49,035 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/861 dead transitions. [2021-06-10 11:42:49,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 861 transitions, 1945 flow [2021-06-10 11:42:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:49,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:49,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:49,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:49,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:49,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:49,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,040 INFO L185 Difference]: Start difference. First operand has 859 places, 863 transitions, 1932 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:49,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 861 transitions, 1945 flow [2021-06-10 11:42:49,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 858 places, 861 transitions, 1944 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:49,047 INFO L241 Difference]: Finished difference. Result has 858 places, 861 transitions, 1928 flow [2021-06-10 11:42:49,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=856, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1928, PETRI_PLACES=858, PETRI_TRANSITIONS=861} [2021-06-10 11:42:49,048 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -21 predicate places. [2021-06-10 11:42:49,048 INFO L480 AbstractCegarLoop]: Abstraction has has 858 places, 861 transitions, 1928 flow [2021-06-10 11:42:49,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:49,048 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:49,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1672 [2021-06-10 11:42:49,048 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 149198748, now seen corresponding path program 1 times [2021-06-10 11:42:49,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:49,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744612401] [2021-06-10 11:42:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:49,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:49,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:42:49,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744612401] [2021-06-10 11:42:49,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:49,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:49,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270094388] [2021-06-10 11:42:49,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:49,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:49,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:49,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 861 transitions, 1928 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:49,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:49,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:49,400 INFO L129 PetriNetUnfolder]: 86/979 cut-off events. [2021-06-10 11:42:49,400 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:49,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 979 events. 86/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4028 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 1108. Up to 34 conditions per place. [2021-06-10 11:42:49,444 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/863 dead transitions. [2021-06-10 11:42:49,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 860 places, 863 transitions, 1958 flow [2021-06-10 11:42:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:49,445 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:49,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:49,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:49,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:49,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:49,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,448 INFO L185 Difference]: Start difference. First operand has 858 places, 861 transitions, 1928 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:49,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 860 places, 863 transitions, 1958 flow [2021-06-10 11:42:49,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 863 transitions, 1957 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:49,455 INFO L241 Difference]: Finished difference. Result has 861 places, 863 transitions, 1951 flow [2021-06-10 11:42:49,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1951, PETRI_PLACES=861, PETRI_TRANSITIONS=863} [2021-06-10 11:42:49,455 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -18 predicate places. [2021-06-10 11:42:49,455 INFO L480 AbstractCegarLoop]: Abstraction has has 861 places, 863 transitions, 1951 flow [2021-06-10 11:42:49,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:49,456 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:49,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1673 [2021-06-10 11:42:49,456 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:49,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 149199771, now seen corresponding path program 1 times [2021-06-10 11:42:49,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:49,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719350204] [2021-06-10 11:42:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:49,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:49,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:42:49,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719350204] [2021-06-10 11:42:49,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:49,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:49,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186902547] [2021-06-10 11:42:49,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:49,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:49,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:49,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 863 transitions, 1951 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:49,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:49,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:49,804 INFO L129 PetriNetUnfolder]: 85/977 cut-off events. [2021-06-10 11:42:49,804 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:49,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 977 events. 85/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4017 event pairs, 0 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1105. Up to 34 conditions per place. [2021-06-10 11:42:49,867 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/863 dead transitions. [2021-06-10 11:42:49,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 863 transitions, 1963 flow [2021-06-10 11:42:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:49,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:49,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:49,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:49,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:49,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:49,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,871 INFO L185 Difference]: Start difference. First operand has 861 places, 863 transitions, 1951 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:49,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 863 transitions, 1963 flow [2021-06-10 11:42:49,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 862 places, 863 transitions, 1958 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:49,879 INFO L241 Difference]: Finished difference. Result has 864 places, 863 transitions, 1956 flow [2021-06-10 11:42:49,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1956, PETRI_PLACES=864, PETRI_TRANSITIONS=863} [2021-06-10 11:42:49,879 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -15 predicate places. [2021-06-10 11:42:49,880 INFO L480 AbstractCegarLoop]: Abstraction has has 864 places, 863 transitions, 1956 flow [2021-06-10 11:42:49,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:49,880 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:49,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1674 [2021-06-10 11:42:49,880 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 150152060, now seen corresponding path program 1 times [2021-06-10 11:42:49,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:49,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845245431] [2021-06-10 11:42:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:49,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:49,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:49,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:42:49,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845245431] [2021-06-10 11:42:49,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:49,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:49,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110449900] [2021-06-10 11:42:49,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:49,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:49,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:49,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:49,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 864 places, 863 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:49,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:49,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:49,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:50,232 INFO L129 PetriNetUnfolder]: 84/973 cut-off events. [2021-06-10 11:42:50,233 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:42:50,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 973 events. 84/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3993 event pairs, 0 based on Foata normal form. 1/858 useless extension candidates. Maximal degree in co-relation 1102. Up to 34 conditions per place. [2021-06-10 11:42:50,295 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/860 dead transitions. [2021-06-10 11:42:50,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 866 places, 860 transitions, 1953 flow [2021-06-10 11:42:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:50,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:50,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:50,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:50,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:50,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:50,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,299 INFO L185 Difference]: Start difference. First operand has 864 places, 863 transitions, 1956 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:50,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 866 places, 860 transitions, 1953 flow [2021-06-10 11:42:50,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 863 places, 860 transitions, 1946 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:50,307 INFO L241 Difference]: Finished difference. Result has 863 places, 860 transitions, 1936 flow [2021-06-10 11:42:50,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=861, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1936, PETRI_PLACES=863, PETRI_TRANSITIONS=860} [2021-06-10 11:42:50,307 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -16 predicate places. [2021-06-10 11:42:50,307 INFO L480 AbstractCegarLoop]: Abstraction has has 863 places, 860 transitions, 1936 flow [2021-06-10 11:42:50,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:50,307 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:50,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1675 [2021-06-10 11:42:50,307 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 150153083, now seen corresponding path program 1 times [2021-06-10 11:42:50,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:50,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387344310] [2021-06-10 11:42:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:50,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:50,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:50,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:42:50,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387344310] [2021-06-10 11:42:50,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:50,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:50,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072680064] [2021-06-10 11:42:50,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:50,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:50,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:50,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 863 places, 860 transitions, 1936 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:50,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:50,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:50,651 INFO L129 PetriNetUnfolder]: 84/971 cut-off events. [2021-06-10 11:42:50,651 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:50,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 971 events. 84/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3975 event pairs, 0 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1103. Up to 34 conditions per place. [2021-06-10 11:42:50,713 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/858 dead transitions. [2021-06-10 11:42:50,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 863 places, 858 transitions, 1949 flow [2021-06-10 11:42:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:50,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:50,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:50,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:50,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:50,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:50,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,717 INFO L185 Difference]: Start difference. First operand has 863 places, 860 transitions, 1936 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:50,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 863 places, 858 transitions, 1949 flow [2021-06-10 11:42:50,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 862 places, 858 transitions, 1948 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:50,725 INFO L241 Difference]: Finished difference. Result has 862 places, 858 transitions, 1932 flow [2021-06-10 11:42:50,725 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1932, PETRI_PLACES=862, PETRI_TRANSITIONS=858} [2021-06-10 11:42:50,725 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -17 predicate places. [2021-06-10 11:42:50,725 INFO L480 AbstractCegarLoop]: Abstraction has has 862 places, 858 transitions, 1932 flow [2021-06-10 11:42:50,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:50,726 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:50,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1676 [2021-06-10 11:42:50,726 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -136787943, now seen corresponding path program 1 times [2021-06-10 11:42:50,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:50,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975843650] [2021-06-10 11:42:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:50,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:50,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:50,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:50,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:50,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975843650] [2021-06-10 11:42:50,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:50,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:50,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218477381] [2021-06-10 11:42:50,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:50,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:50,746 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:50,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 858 transitions, 1932 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:50,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:50,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:50,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:51,077 INFO L129 PetriNetUnfolder]: 83/979 cut-off events. [2021-06-10 11:42:51,077 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:51,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 979 events. 83/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4046 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1115. Up to 34 conditions per place. [2021-06-10 11:42:51,142 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/860 dead transitions. [2021-06-10 11:42:51,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 860 transitions, 1962 flow [2021-06-10 11:42:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:51,143 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:51,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:51,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:51,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:51,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:51,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,146 INFO L185 Difference]: Start difference. First operand has 862 places, 858 transitions, 1932 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:51,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 860 transitions, 1962 flow [2021-06-10 11:42:51,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 863 places, 860 transitions, 1961 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:51,154 INFO L241 Difference]: Finished difference. Result has 865 places, 860 transitions, 1955 flow [2021-06-10 11:42:51,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=861, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=865, PETRI_TRANSITIONS=860} [2021-06-10 11:42:51,154 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -14 predicate places. [2021-06-10 11:42:51,154 INFO L480 AbstractCegarLoop]: Abstraction has has 865 places, 860 transitions, 1955 flow [2021-06-10 11:42:51,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,155 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:51,155 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:51,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1677 [2021-06-10 11:42:51,155 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -136786920, now seen corresponding path program 1 times [2021-06-10 11:42:51,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:51,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142731174] [2021-06-10 11:42:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:51,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:51,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:51,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:51,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142731174] [2021-06-10 11:42:51,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:51,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:51,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759233118] [2021-06-10 11:42:51,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:51,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:51,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:51,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 865 places, 860 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:51,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:51,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:51,509 INFO L129 PetriNetUnfolder]: 82/977 cut-off events. [2021-06-10 11:42:51,510 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:51,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 977 events. 82/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4037 event pairs, 0 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1112. Up to 34 conditions per place. [2021-06-10 11:42:51,557 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/860 dead transitions. [2021-06-10 11:42:51,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 860 transitions, 1967 flow [2021-06-10 11:42:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:51,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:51,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:51,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:51,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:51,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:51,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,562 INFO L185 Difference]: Start difference. First operand has 865 places, 860 transitions, 1955 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:51,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 860 transitions, 1967 flow [2021-06-10 11:42:51,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 860 transitions, 1962 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:51,569 INFO L241 Difference]: Finished difference. Result has 868 places, 860 transitions, 1960 flow [2021-06-10 11:42:51,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=868, PETRI_TRANSITIONS=860} [2021-06-10 11:42:51,570 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -11 predicate places. [2021-06-10 11:42:51,570 INFO L480 AbstractCegarLoop]: Abstraction has has 868 places, 860 transitions, 1960 flow [2021-06-10 11:42:51,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:51,570 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:51,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1678 [2021-06-10 11:42:51,570 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -135834631, now seen corresponding path program 1 times [2021-06-10 11:42:51,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:51,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754422735] [2021-06-10 11:42:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:51,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:51,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:51,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:51,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:51,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754422735] [2021-06-10 11:42:51,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:51,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:51,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743530516] [2021-06-10 11:42:51,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:51,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:51,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:51,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 868 places, 860 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:51,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:51,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:51,915 INFO L129 PetriNetUnfolder]: 81/973 cut-off events. [2021-06-10 11:42:51,915 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:42:51,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 973 events. 81/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4009 event pairs, 0 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 1109. Up to 34 conditions per place. [2021-06-10 11:42:51,979 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2021-06-10 11:42:51,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 870 places, 857 transitions, 1957 flow [2021-06-10 11:42:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:51,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:51,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:51,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:51,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:51,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:51,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,983 INFO L185 Difference]: Start difference. First operand has 868 places, 860 transitions, 1960 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:51,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 870 places, 857 transitions, 1957 flow [2021-06-10 11:42:51,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 867 places, 857 transitions, 1950 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:51,991 INFO L241 Difference]: Finished difference. Result has 867 places, 857 transitions, 1940 flow [2021-06-10 11:42:51,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=865, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=867, PETRI_TRANSITIONS=857} [2021-06-10 11:42:51,991 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -12 predicate places. [2021-06-10 11:42:51,991 INFO L480 AbstractCegarLoop]: Abstraction has has 867 places, 857 transitions, 1940 flow [2021-06-10 11:42:51,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:51,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:51,992 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:51,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1679 [2021-06-10 11:42:51,992 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash -135833608, now seen corresponding path program 1 times [2021-06-10 11:42:51,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:51,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010803174] [2021-06-10 11:42:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:52,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:52,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:42:52,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010803174] [2021-06-10 11:42:52,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:52,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:52,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432068702] [2021-06-10 11:42:52,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:52,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:52,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:52,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 867 places, 857 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:52,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:52,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:52,338 INFO L129 PetriNetUnfolder]: 81/971 cut-off events. [2021-06-10 11:42:52,338 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:52,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 971 events. 81/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3993 event pairs, 0 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1110. Up to 34 conditions per place. [2021-06-10 11:42:52,401 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/855 dead transitions. [2021-06-10 11:42:52,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 855 transitions, 1953 flow [2021-06-10 11:42:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:52,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:52,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:52,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:52,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:52,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:52,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,405 INFO L185 Difference]: Start difference. First operand has 867 places, 857 transitions, 1940 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:52,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 855 transitions, 1953 flow [2021-06-10 11:42:52,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 866 places, 855 transitions, 1952 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:52,413 INFO L241 Difference]: Finished difference. Result has 866 places, 855 transitions, 1936 flow [2021-06-10 11:42:52,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=864, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1936, PETRI_PLACES=866, PETRI_TRANSITIONS=855} [2021-06-10 11:42:52,413 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -13 predicate places. [2021-06-10 11:42:52,413 INFO L480 AbstractCegarLoop]: Abstraction has has 866 places, 855 transitions, 1936 flow [2021-06-10 11:42:52,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:52,413 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:52,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1680 [2021-06-10 11:42:52,413 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:52,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:52,414 INFO L82 PathProgramCache]: Analyzing trace with hash -79086569, now seen corresponding path program 1 times [2021-06-10 11:42:52,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:52,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018655437] [2021-06-10 11:42:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:52,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:52,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:52,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018655437] [2021-06-10 11:42:52,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:52,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:52,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128075275] [2021-06-10 11:42:52,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:52,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:52,435 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:52,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 866 places, 855 transitions, 1936 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:52,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:52,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:52,769 INFO L129 PetriNetUnfolder]: 80/979 cut-off events. [2021-06-10 11:42:52,769 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:52,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 979 events. 80/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4063 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1122. Up to 34 conditions per place. [2021-06-10 11:42:52,834 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/857 dead transitions. [2021-06-10 11:42:52,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 868 places, 857 transitions, 1966 flow [2021-06-10 11:42:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:52,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:52,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:52,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:52,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:52,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:52,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,838 INFO L185 Difference]: Start difference. First operand has 866 places, 855 transitions, 1936 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:52,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 868 places, 857 transitions, 1966 flow [2021-06-10 11:42:52,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 867 places, 857 transitions, 1965 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:52,846 INFO L241 Difference]: Finished difference. Result has 869 places, 857 transitions, 1959 flow [2021-06-10 11:42:52,847 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=865, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1959, PETRI_PLACES=869, PETRI_TRANSITIONS=857} [2021-06-10 11:42:52,847 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -10 predicate places. [2021-06-10 11:42:52,847 INFO L480 AbstractCegarLoop]: Abstraction has has 869 places, 857 transitions, 1959 flow [2021-06-10 11:42:52,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:52,847 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:52,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1681 [2021-06-10 11:42:52,847 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash -79085546, now seen corresponding path program 1 times [2021-06-10 11:42:52,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:52,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029075837] [2021-06-10 11:42:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:52,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:52,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:52,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:52,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029075837] [2021-06-10 11:42:52,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:52,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:52,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045685699] [2021-06-10 11:42:52,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:52,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:52,868 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:52,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 869 places, 857 transitions, 1959 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:52,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:52,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:52,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:53,199 INFO L129 PetriNetUnfolder]: 79/977 cut-off events. [2021-06-10 11:42:53,200 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:53,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 977 events. 79/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4052 event pairs, 0 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1119. Up to 34 conditions per place. [2021-06-10 11:42:53,262 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/857 dead transitions. [2021-06-10 11:42:53,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 857 transitions, 1971 flow [2021-06-10 11:42:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:53,264 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:53,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:53,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:53,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:53,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:53,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,266 INFO L185 Difference]: Start difference. First operand has 869 places, 857 transitions, 1959 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:53,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 857 transitions, 1971 flow [2021-06-10 11:42:53,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 857 transitions, 1966 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:53,274 INFO L241 Difference]: Finished difference. Result has 872 places, 857 transitions, 1964 flow [2021-06-10 11:42:53,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=872, PETRI_TRANSITIONS=857} [2021-06-10 11:42:53,275 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -7 predicate places. [2021-06-10 11:42:53,275 INFO L480 AbstractCegarLoop]: Abstraction has has 872 places, 857 transitions, 1964 flow [2021-06-10 11:42:53,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:53,275 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:53,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1682 [2021-06-10 11:42:53,275 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash -78133257, now seen corresponding path program 1 times [2021-06-10 11:42:53,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:53,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041595214] [2021-06-10 11:42:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:53,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:53,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:53,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:53,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041595214] [2021-06-10 11:42:53,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:53,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:53,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562139712] [2021-06-10 11:42:53,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:53,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:53,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:53,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:53,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 872 places, 857 transitions, 1964 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:53,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:53,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:53,616 INFO L129 PetriNetUnfolder]: 78/973 cut-off events. [2021-06-10 11:42:53,616 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:42:53,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 973 events. 78/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4028 event pairs, 0 based on Foata normal form. 1/864 useless extension candidates. Maximal degree in co-relation 1116. Up to 34 conditions per place. [2021-06-10 11:42:53,668 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/854 dead transitions. [2021-06-10 11:42:53,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 874 places, 854 transitions, 1961 flow [2021-06-10 11:42:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:53,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:53,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:53,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:53,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:53,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:53,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,672 INFO L185 Difference]: Start difference. First operand has 872 places, 857 transitions, 1964 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:53,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 874 places, 854 transitions, 1961 flow [2021-06-10 11:42:53,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 854 transitions, 1954 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:53,679 INFO L241 Difference]: Finished difference. Result has 871 places, 854 transitions, 1944 flow [2021-06-10 11:42:53,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=853, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1944, PETRI_PLACES=871, PETRI_TRANSITIONS=854} [2021-06-10 11:42:53,680 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -8 predicate places. [2021-06-10 11:42:53,680 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 854 transitions, 1944 flow [2021-06-10 11:42:53,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:53,680 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:53,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1683 [2021-06-10 11:42:53,680 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -78132234, now seen corresponding path program 1 times [2021-06-10 11:42:53,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:53,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256515131] [2021-06-10 11:42:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:53,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:53,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:53,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:53,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:42:53,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256515131] [2021-06-10 11:42:53,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:53,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:53,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170193709] [2021-06-10 11:42:53,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:53,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:53,702 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:53,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 854 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:53,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:53,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:53,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:54,032 INFO L129 PetriNetUnfolder]: 78/971 cut-off events. [2021-06-10 11:42:54,032 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:54,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 971 events. 78/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4010 event pairs, 0 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1117. Up to 34 conditions per place. [2021-06-10 11:42:54,096 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/852 dead transitions. [2021-06-10 11:42:54,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 871 places, 852 transitions, 1957 flow [2021-06-10 11:42:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:54,097 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:54,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:54,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:54,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:54,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:54,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,100 INFO L185 Difference]: Start difference. First operand has 871 places, 854 transitions, 1944 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:54,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 871 places, 852 transitions, 1957 flow [2021-06-10 11:42:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 852 transitions, 1956 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:54,108 INFO L241 Difference]: Finished difference. Result has 870 places, 852 transitions, 1940 flow [2021-06-10 11:42:54,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=868, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=870, PETRI_TRANSITIONS=852} [2021-06-10 11:42:54,108 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -9 predicate places. [2021-06-10 11:42:54,108 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 852 transitions, 1940 flow [2021-06-10 11:42:54,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,109 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:54,109 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:54,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1684 [2021-06-10 11:42:54,109 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:54,109 INFO L82 PathProgramCache]: Analyzing trace with hash 347396630, now seen corresponding path program 1 times [2021-06-10 11:42:54,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:54,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514184802] [2021-06-10 11:42:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:54,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:54,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:54,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514184802] [2021-06-10 11:42:54,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:54,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:54,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948007495] [2021-06-10 11:42:54,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:54,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:54,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:54,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:54,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 852 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:54,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:54,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:54,472 INFO L129 PetriNetUnfolder]: 77/979 cut-off events. [2021-06-10 11:42:54,472 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:54,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 979 events. 77/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4081 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1129. Up to 34 conditions per place. [2021-06-10 11:42:54,535 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/854 dead transitions. [2021-06-10 11:42:54,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 854 transitions, 1970 flow [2021-06-10 11:42:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:54,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:54,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:54,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:54,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:54,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:54,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,539 INFO L185 Difference]: Start difference. First operand has 870 places, 852 transitions, 1940 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:54,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 872 places, 854 transitions, 1970 flow [2021-06-10 11:42:54,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 854 transitions, 1969 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:54,547 INFO L241 Difference]: Finished difference. Result has 873 places, 854 transitions, 1963 flow [2021-06-10 11:42:54,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1963, PETRI_PLACES=873, PETRI_TRANSITIONS=854} [2021-06-10 11:42:54,547 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -6 predicate places. [2021-06-10 11:42:54,547 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 854 transitions, 1963 flow [2021-06-10 11:42:54,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:54,548 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:54,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1685 [2021-06-10 11:42:54,548 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash 347397653, now seen corresponding path program 1 times [2021-06-10 11:42:54,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:54,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258631387] [2021-06-10 11:42:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:54,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:54,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:54,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258631387] [2021-06-10 11:42:54,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:54,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:54,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90962981] [2021-06-10 11:42:54,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:54,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:54,568 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:54,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 854 transitions, 1963 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:54,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:54,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:54,902 INFO L129 PetriNetUnfolder]: 76/977 cut-off events. [2021-06-10 11:42:54,902 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:54,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 977 events. 76/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4072 event pairs, 0 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1126. Up to 34 conditions per place. [2021-06-10 11:42:54,964 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/854 dead transitions. [2021-06-10 11:42:54,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 854 transitions, 1975 flow [2021-06-10 11:42:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:54,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:54,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:54,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:54,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:54,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:54,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,968 INFO L185 Difference]: Start difference. First operand has 873 places, 854 transitions, 1963 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:54,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 854 transitions, 1975 flow [2021-06-10 11:42:54,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 854 transitions, 1970 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:54,976 INFO L241 Difference]: Finished difference. Result has 876 places, 854 transitions, 1968 flow [2021-06-10 11:42:54,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=876, PETRI_TRANSITIONS=854} [2021-06-10 11:42:54,977 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -3 predicate places. [2021-06-10 11:42:54,977 INFO L480 AbstractCegarLoop]: Abstraction has has 876 places, 854 transitions, 1968 flow [2021-06-10 11:42:54,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:54,977 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:54,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1686 [2021-06-10 11:42:54,977 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash 348349942, now seen corresponding path program 1 times [2021-06-10 11:42:54,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:54,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069269868] [2021-06-10 11:42:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:54,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:54,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:54,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:54,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069269868] [2021-06-10 11:42:54,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:54,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:54,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315906978] [2021-06-10 11:42:54,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:54,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:54,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:54,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 876 places, 854 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:54,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:54,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:54,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:55,327 INFO L129 PetriNetUnfolder]: 75/973 cut-off events. [2021-06-10 11:42:55,327 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:42:55,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 973 events. 75/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4044 event pairs, 0 based on Foata normal form. 1/867 useless extension candidates. Maximal degree in co-relation 1123. Up to 34 conditions per place. [2021-06-10 11:42:55,389 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/851 dead transitions. [2021-06-10 11:42:55,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 878 places, 851 transitions, 1965 flow [2021-06-10 11:42:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:55,390 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:55,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:55,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:55,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:55,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:55,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,393 INFO L185 Difference]: Start difference. First operand has 876 places, 854 transitions, 1968 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:55,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 878 places, 851 transitions, 1965 flow [2021-06-10 11:42:55,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 875 places, 851 transitions, 1958 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:55,401 INFO L241 Difference]: Finished difference. Result has 875 places, 851 transitions, 1948 flow [2021-06-10 11:42:55,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=873, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=875, PETRI_TRANSITIONS=851} [2021-06-10 11:42:55,402 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -4 predicate places. [2021-06-10 11:42:55,402 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 851 transitions, 1948 flow [2021-06-10 11:42:55,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:55,402 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:55,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1687 [2021-06-10 11:42:55,402 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 348350965, now seen corresponding path program 1 times [2021-06-10 11:42:55,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:55,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737054628] [2021-06-10 11:42:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:55,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:55,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:55,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:42:55,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737054628] [2021-06-10 11:42:55,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:55,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:55,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284662574] [2021-06-10 11:42:55,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:55,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:55,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:55,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 851 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:55,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:55,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:55,756 INFO L129 PetriNetUnfolder]: 75/971 cut-off events. [2021-06-10 11:42:55,756 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:55,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 971 events. 75/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4028 event pairs, 0 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1124. Up to 34 conditions per place. [2021-06-10 11:42:55,811 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/849 dead transitions. [2021-06-10 11:42:55,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 849 transitions, 1961 flow [2021-06-10 11:42:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:55,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:55,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:55,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:55,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:55,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:55,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,815 INFO L185 Difference]: Start difference. First operand has 875 places, 851 transitions, 1948 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:55,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 849 transitions, 1961 flow [2021-06-10 11:42:55,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 849 transitions, 1960 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:55,822 INFO L241 Difference]: Finished difference. Result has 874 places, 849 transitions, 1944 flow [2021-06-10 11:42:55,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1944, PETRI_PLACES=874, PETRI_TRANSITIONS=849} [2021-06-10 11:42:55,822 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -5 predicate places. [2021-06-10 11:42:55,822 INFO L480 AbstractCegarLoop]: Abstraction has has 874 places, 849 transitions, 1944 flow [2021-06-10 11:42:55,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:55,823 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:55,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1688 [2021-06-10 11:42:55,823 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2035434634, now seen corresponding path program 1 times [2021-06-10 11:42:55,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:55,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055302200] [2021-06-10 11:42:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:55,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:55,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:55,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:55,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:55,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055302200] [2021-06-10 11:42:55,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:55,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:55,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849122409] [2021-06-10 11:42:55,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:55,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:55,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:55,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:55,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 849 transitions, 1944 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:55,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:55,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:55,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:56,180 INFO L129 PetriNetUnfolder]: 74/978 cut-off events. [2021-06-10 11:42:56,180 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:56,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 978 events. 74/978 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4090 event pairs, 0 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1129. Up to 34 conditions per place. [2021-06-10 11:42:56,243 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/850 dead transitions. [2021-06-10 11:42:56,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 876 places, 850 transitions, 1960 flow [2021-06-10 11:42:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:56,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:56,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:56,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:56,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:56,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:56,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,247 INFO L185 Difference]: Start difference. First operand has 874 places, 849 transitions, 1944 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:56,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 876 places, 850 transitions, 1960 flow [2021-06-10 11:42:56,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 875 places, 850 transitions, 1959 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:56,255 INFO L241 Difference]: Finished difference. Result has 876 places, 849 transitions, 1948 flow [2021-06-10 11:42:56,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=873, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=876, PETRI_TRANSITIONS=849} [2021-06-10 11:42:56,256 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -3 predicate places. [2021-06-10 11:42:56,256 INFO L480 AbstractCegarLoop]: Abstraction has has 876 places, 849 transitions, 1948 flow [2021-06-10 11:42:56,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:56,256 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:56,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1689 [2021-06-10 11:42:56,256 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2035433611, now seen corresponding path program 1 times [2021-06-10 11:42:56,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:56,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883567989] [2021-06-10 11:42:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:56,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:56,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:56,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:56,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883567989] [2021-06-10 11:42:56,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:56,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:56,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642427586] [2021-06-10 11:42:56,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:56,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:56,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:56,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 876 places, 849 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:56,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:56,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:56,621 INFO L129 PetriNetUnfolder]: 72/980 cut-off events. [2021-06-10 11:42:56,621 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:56,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 980 events. 72/980 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4119 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1140. Up to 34 conditions per place. [2021-06-10 11:42:56,683 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/850 dead transitions. [2021-06-10 11:42:56,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 878 places, 850 transitions, 1974 flow [2021-06-10 11:42:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:42:56,684 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:42:56,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:42:56,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:42:56,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:56,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:42:56,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,687 INFO L185 Difference]: Start difference. First operand has 876 places, 849 transitions, 1948 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:42:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 878 places, 850 transitions, 1974 flow [2021-06-10 11:42:56,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 877 places, 850 transitions, 1973 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:56,695 INFO L241 Difference]: Finished difference. Result has 879 places, 850 transitions, 1965 flow [2021-06-10 11:42:56,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=875, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1965, PETRI_PLACES=879, PETRI_TRANSITIONS=850} [2021-06-10 11:42:56,695 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 0 predicate places. [2021-06-10 11:42:56,695 INFO L480 AbstractCegarLoop]: Abstraction has has 879 places, 850 transitions, 1965 flow [2021-06-10 11:42:56,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:56,696 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:56,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1690 [2021-06-10 11:42:56,696 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2036386923, now seen corresponding path program 1 times [2021-06-10 11:42:56,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:56,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270268713] [2021-06-10 11:42:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:56,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:56,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:56,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:56,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:56,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270268713] [2021-06-10 11:42:56,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:56,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:56,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071643018] [2021-06-10 11:42:56,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:56,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:56,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:56,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 850 transitions, 1965 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:56,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:56,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:56,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:57,061 INFO L129 PetriNetUnfolder]: 72/973 cut-off events. [2021-06-10 11:42:57,062 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:57,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 973 events. 72/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4063 event pairs, 0 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 1126. Up to 34 conditions per place. [2021-06-10 11:42:57,123 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/848 dead transitions. [2021-06-10 11:42:57,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 848 transitions, 1967 flow [2021-06-10 11:42:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:57,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:57,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:57,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:57,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:57,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:57,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,128 INFO L185 Difference]: Start difference. First operand has 879 places, 850 transitions, 1965 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 881 places, 848 transitions, 1967 flow [2021-06-10 11:42:57,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 878 places, 848 transitions, 1959 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:57,136 INFO L241 Difference]: Finished difference. Result has 879 places, 848 transitions, 1952 flow [2021-06-10 11:42:57,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=847, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=879, PETRI_TRANSITIONS=848} [2021-06-10 11:42:57,136 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 0 predicate places. [2021-06-10 11:42:57,136 INFO L480 AbstractCegarLoop]: Abstraction has has 879 places, 848 transitions, 1952 flow [2021-06-10 11:42:57,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:57,137 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:57,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1691 [2021-06-10 11:42:57,137 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2036387946, now seen corresponding path program 1 times [2021-06-10 11:42:57,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:57,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762288190] [2021-06-10 11:42:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:57,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:57,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:57,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:42:57,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762288190] [2021-06-10 11:42:57,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:57,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:57,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442991903] [2021-06-10 11:42:57,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:57,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:57,158 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:57,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 848 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:57,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:57,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:57,495 INFO L129 PetriNetUnfolder]: 72/971 cut-off events. [2021-06-10 11:42:57,495 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:57,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 971 events. 72/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4045 event pairs, 0 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1130. Up to 34 conditions per place. [2021-06-10 11:42:57,556 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/846 dead transitions. [2021-06-10 11:42:57,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 846 transitions, 1965 flow [2021-06-10 11:42:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:57,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:57,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:57,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:57,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:57,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:57,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,560 INFO L185 Difference]: Start difference. First operand has 879 places, 848 transitions, 1952 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:57,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 846 transitions, 1965 flow [2021-06-10 11:42:57,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 878 places, 846 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:57,568 INFO L241 Difference]: Finished difference. Result has 878 places, 846 transitions, 1948 flow [2021-06-10 11:42:57,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=876, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1948, PETRI_PLACES=878, PETRI_TRANSITIONS=846} [2021-06-10 11:42:57,569 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, -1 predicate places. [2021-06-10 11:42:57,569 INFO L480 AbstractCegarLoop]: Abstraction has has 878 places, 846 transitions, 1948 flow [2021-06-10 11:42:57,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,569 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:57,569 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:57,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1692 [2021-06-10 11:42:57,569 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1787651318, now seen corresponding path program 1 times [2021-06-10 11:42:57,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:57,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390682631] [2021-06-10 11:42:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:57,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:57,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:57,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:57,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:57,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390682631] [2021-06-10 11:42:57,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:57,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:57,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848952778] [2021-06-10 11:42:57,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:57,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:57,591 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:57,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 846 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:57,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:57,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:57,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:57,944 INFO L129 PetriNetUnfolder]: 71/979 cut-off events. [2021-06-10 11:42:57,944 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:57,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 979 events. 71/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4115 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1142. Up to 34 conditions per place. [2021-06-10 11:42:58,003 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/848 dead transitions. [2021-06-10 11:42:58,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 848 transitions, 1978 flow [2021-06-10 11:42:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:58,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:58,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:58,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:58,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:58,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,008 INFO L185 Difference]: Start difference. First operand has 878 places, 846 transitions, 1948 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:58,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 848 transitions, 1978 flow [2021-06-10 11:42:58,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 848 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:58,015 INFO L241 Difference]: Finished difference. Result has 881 places, 848 transitions, 1971 flow [2021-06-10 11:42:58,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1971, PETRI_PLACES=881, PETRI_TRANSITIONS=848} [2021-06-10 11:42:58,016 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 2 predicate places. [2021-06-10 11:42:58,016 INFO L480 AbstractCegarLoop]: Abstraction has has 881 places, 848 transitions, 1971 flow [2021-06-10 11:42:58,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:58,016 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:58,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1693 [2021-06-10 11:42:58,016 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1787650295, now seen corresponding path program 1 times [2021-06-10 11:42:58,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:58,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940649803] [2021-06-10 11:42:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:58,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:58,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:58,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940649803] [2021-06-10 11:42:58,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:58,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:58,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238344706] [2021-06-10 11:42:58,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:58,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:58,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:58,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 881 places, 848 transitions, 1971 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:58,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:58,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:58,385 INFO L129 PetriNetUnfolder]: 69/980 cut-off events. [2021-06-10 11:42:58,385 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:58,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 980 events. 69/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4136 event pairs, 0 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1142. Up to 34 conditions per place. [2021-06-10 11:42:58,448 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/848 dead transitions. [2021-06-10 11:42:58,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 848 transitions, 1983 flow [2021-06-10 11:42:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:42:58,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:42:58,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:42:58,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:42:58,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:58,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:42:58,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,453 INFO L185 Difference]: Start difference. First operand has 881 places, 848 transitions, 1971 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:42:58,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 848 transitions, 1983 flow [2021-06-10 11:42:58,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 848 transitions, 1978 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:58,461 INFO L241 Difference]: Finished difference. Result has 883 places, 847 transitions, 1967 flow [2021-06-10 11:42:58,461 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1967, PETRI_PLACES=883, PETRI_TRANSITIONS=847} [2021-06-10 11:42:58,462 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 4 predicate places. [2021-06-10 11:42:58,462 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 847 transitions, 1967 flow [2021-06-10 11:42:58,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:58,462 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:58,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1694 [2021-06-10 11:42:58,462 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1786698006, now seen corresponding path program 1 times [2021-06-10 11:42:58,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:58,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556789169] [2021-06-10 11:42:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:58,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:58,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:58,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556789169] [2021-06-10 11:42:58,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:58,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:58,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381237679] [2021-06-10 11:42:58,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:58,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:58,485 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:58,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 847 transitions, 1967 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:58,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:58,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:58,823 INFO L129 PetriNetUnfolder]: 69/973 cut-off events. [2021-06-10 11:42:58,824 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:42:58,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 973 events. 69/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4078 event pairs, 0 based on Foata normal form. 1/873 useless extension candidates. Maximal degree in co-relation 1136. Up to 34 conditions per place. [2021-06-10 11:42:58,883 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/845 dead transitions. [2021-06-10 11:42:58,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 845 transitions, 1970 flow [2021-06-10 11:42:58,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:42:58,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:42:58,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:42:58,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:42:58,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:58,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:42:58,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,888 INFO L185 Difference]: Start difference. First operand has 883 places, 847 transitions, 1967 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:42:58,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 845 transitions, 1970 flow [2021-06-10 11:42:58,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 845 transitions, 1963 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:42:58,896 INFO L241 Difference]: Finished difference. Result has 883 places, 845 transitions, 1956 flow [2021-06-10 11:42:58,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1956, PETRI_PLACES=883, PETRI_TRANSITIONS=845} [2021-06-10 11:42:58,896 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 4 predicate places. [2021-06-10 11:42:58,896 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 845 transitions, 1956 flow [2021-06-10 11:42:58,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,896 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:58,896 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:58,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1695 [2021-06-10 11:42:58,896 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1786696983, now seen corresponding path program 1 times [2021-06-10 11:42:58,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:58,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904236518] [2021-06-10 11:42:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:58,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:42:58,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:58,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:42:58,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904236518] [2021-06-10 11:42:58,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:58,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:58,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982987370] [2021-06-10 11:42:58,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:58,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:58,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:58,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 845 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:58,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:58,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:58,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:59,256 INFO L129 PetriNetUnfolder]: 69/971 cut-off events. [2021-06-10 11:42:59,257 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:42:59,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 971 events. 69/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4062 event pairs, 0 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1136. Up to 34 conditions per place. [2021-06-10 11:42:59,315 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/843 dead transitions. [2021-06-10 11:42:59,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 843 transitions, 1969 flow [2021-06-10 11:42:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:42:59,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:42:59,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:42:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:42:59,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:59,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:42:59,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,320 INFO L185 Difference]: Start difference. First operand has 883 places, 845 transitions, 1956 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:42:59,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 843 transitions, 1969 flow [2021-06-10 11:42:59,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 843 transitions, 1968 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:59,327 INFO L241 Difference]: Finished difference. Result has 882 places, 843 transitions, 1952 flow [2021-06-10 11:42:59,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=880, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1952, PETRI_PLACES=882, PETRI_TRANSITIONS=843} [2021-06-10 11:42:59,328 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 3 predicate places. [2021-06-10 11:42:59,328 INFO L480 AbstractCegarLoop]: Abstraction has has 882 places, 843 transitions, 1952 flow [2021-06-10 11:42:59,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:59,328 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:59,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1696 [2021-06-10 11:42:59,328 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1814236664, now seen corresponding path program 1 times [2021-06-10 11:42:59,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:59,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747834815] [2021-06-10 11:42:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:59,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:59,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:42:59,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:59,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747834815] [2021-06-10 11:42:59,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:59,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:59,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541896524] [2021-06-10 11:42:59,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:59,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:59,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:59,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:59,349 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:42:59,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 882 places, 843 transitions, 1952 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:59,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:42:59,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:42:59,742 INFO L129 PetriNetUnfolder]: 68/979 cut-off events. [2021-06-10 11:42:59,743 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:42:59,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 979 events. 68/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4133 event pairs, 0 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1148. Up to 34 conditions per place. [2021-06-10 11:42:59,778 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/845 dead transitions. [2021-06-10 11:42:59,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 845 transitions, 1982 flow [2021-06-10 11:42:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:42:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:42:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:42:59,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:42:59,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:42:59,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:42:59,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:42:59,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:42:59,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,782 INFO L185 Difference]: Start difference. First operand has 882 places, 843 transitions, 1952 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:42:59,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 884 places, 845 transitions, 1982 flow [2021-06-10 11:42:59,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 845 transitions, 1981 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:42:59,790 INFO L241 Difference]: Finished difference. Result has 885 places, 845 transitions, 1975 flow [2021-06-10 11:42:59,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1975, PETRI_PLACES=885, PETRI_TRANSITIONS=845} [2021-06-10 11:42:59,790 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 6 predicate places. [2021-06-10 11:42:59,790 INFO L480 AbstractCegarLoop]: Abstraction has has 885 places, 845 transitions, 1975 flow [2021-06-10 11:42:59,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:42:59,790 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:42:59,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1697 [2021-06-10 11:42:59,791 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:42:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:42:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1814235641, now seen corresponding path program 1 times [2021-06-10 11:42:59,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:42:59,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449414729] [2021-06-10 11:42:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:42:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:42:59,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:59,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:42:59,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:42:59,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:42:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:42:59,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449414729] [2021-06-10 11:42:59,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:42:59,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:42:59,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559423044] [2021-06-10 11:42:59,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:42:59,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:42:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:42:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:42:59,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:42:59,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 845 transitions, 1975 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:42:59,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:42:59,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:42:59,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:00,172 INFO L129 PetriNetUnfolder]: 66/980 cut-off events. [2021-06-10 11:43:00,172 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:00,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 980 events. 66/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4157 event pairs, 0 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1148. Up to 34 conditions per place. [2021-06-10 11:43:00,233 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/845 dead transitions. [2021-06-10 11:43:00,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 845 transitions, 1987 flow [2021-06-10 11:43:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:00,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:00,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:00,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:00,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:00,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:00,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,237 INFO L185 Difference]: Start difference. First operand has 885 places, 845 transitions, 1975 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:00,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 845 transitions, 1987 flow [2021-06-10 11:43:00,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 845 transitions, 1982 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:00,245 INFO L241 Difference]: Finished difference. Result has 887 places, 844 transitions, 1971 flow [2021-06-10 11:43:00,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1971, PETRI_PLACES=887, PETRI_TRANSITIONS=844} [2021-06-10 11:43:00,245 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 8 predicate places. [2021-06-10 11:43:00,245 INFO L480 AbstractCegarLoop]: Abstraction has has 887 places, 844 transitions, 1971 flow [2021-06-10 11:43:00,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:00,246 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:00,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1698 [2021-06-10 11:43:00,246 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:00,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1813283352, now seen corresponding path program 1 times [2021-06-10 11:43:00,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:00,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314586285] [2021-06-10 11:43:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:00,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:00,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:00,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:00,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314586285] [2021-06-10 11:43:00,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:00,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:00,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354461654] [2021-06-10 11:43:00,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:00,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:00,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:00,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:00,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:00,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 844 transitions, 1971 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:00,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:00,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:00,604 INFO L129 PetriNetUnfolder]: 66/973 cut-off events. [2021-06-10 11:43:00,604 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:00,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 973 events. 66/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4100 event pairs, 0 based on Foata normal form. 1/876 useless extension candidates. Maximal degree in co-relation 1142. Up to 34 conditions per place. [2021-06-10 11:43:00,663 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/842 dead transitions. [2021-06-10 11:43:00,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 842 transitions, 1974 flow [2021-06-10 11:43:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:00,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:00,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:00,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:00,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:00,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:00,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,667 INFO L185 Difference]: Start difference. First operand has 887 places, 844 transitions, 1971 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:00,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 842 transitions, 1974 flow [2021-06-10 11:43:00,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 842 transitions, 1967 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:00,675 INFO L241 Difference]: Finished difference. Result has 887 places, 842 transitions, 1960 flow [2021-06-10 11:43:00,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=887, PETRI_TRANSITIONS=842} [2021-06-10 11:43:00,675 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 8 predicate places. [2021-06-10 11:43:00,675 INFO L480 AbstractCegarLoop]: Abstraction has has 887 places, 842 transitions, 1960 flow [2021-06-10 11:43:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:00,676 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:00,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1699 [2021-06-10 11:43:00,676 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1813282329, now seen corresponding path program 1 times [2021-06-10 11:43:00,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:00,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716810665] [2021-06-10 11:43:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:00,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:00,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:00,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:00,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:00,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716810665] [2021-06-10 11:43:00,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:00,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:00,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775750752] [2021-06-10 11:43:00,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:00,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:00,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:00,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 842 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:00,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:00,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:00,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:01,036 INFO L129 PetriNetUnfolder]: 66/971 cut-off events. [2021-06-10 11:43:01,036 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:01,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 971 events. 66/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4085 event pairs, 0 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 1142. Up to 34 conditions per place. [2021-06-10 11:43:01,095 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/840 dead transitions. [2021-06-10 11:43:01,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 840 transitions, 1973 flow [2021-06-10 11:43:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:01,097 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:01,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:01,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:01,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:01,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:01,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,100 INFO L185 Difference]: Start difference. First operand has 887 places, 842 transitions, 1960 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:01,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 840 transitions, 1973 flow [2021-06-10 11:43:01,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 840 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:01,108 INFO L241 Difference]: Finished difference. Result has 886 places, 840 transitions, 1956 flow [2021-06-10 11:43:01,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=884, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1956, PETRI_PLACES=886, PETRI_TRANSITIONS=840} [2021-06-10 11:43:01,108 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 7 predicate places. [2021-06-10 11:43:01,108 INFO L480 AbstractCegarLoop]: Abstraction has has 886 places, 840 transitions, 1956 flow [2021-06-10 11:43:01,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:01,108 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:01,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1700 [2021-06-10 11:43:01,108 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash -926811397, now seen corresponding path program 1 times [2021-06-10 11:43:01,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:01,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71498631] [2021-06-10 11:43:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:01,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:01,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:01,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:01,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71498631] [2021-06-10 11:43:01,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:01,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:01,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098595271] [2021-06-10 11:43:01,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:01,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:01,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:01,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 840 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:01,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:01,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:01,499 INFO L129 PetriNetUnfolder]: 65/979 cut-off events. [2021-06-10 11:43:01,499 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:01,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 979 events. 65/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4153 event pairs, 0 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1154. Up to 34 conditions per place. [2021-06-10 11:43:01,562 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/842 dead transitions. [2021-06-10 11:43:01,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 842 transitions, 1986 flow [2021-06-10 11:43:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:01,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:01,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:01,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:01,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:01,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:01,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,566 INFO L185 Difference]: Start difference. First operand has 886 places, 840 transitions, 1956 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:01,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 842 transitions, 1986 flow [2021-06-10 11:43:01,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 842 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:01,575 INFO L241 Difference]: Finished difference. Result has 889 places, 842 transitions, 1979 flow [2021-06-10 11:43:01,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1955, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1979, PETRI_PLACES=889, PETRI_TRANSITIONS=842} [2021-06-10 11:43:01,575 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 10 predicate places. [2021-06-10 11:43:01,575 INFO L480 AbstractCegarLoop]: Abstraction has has 889 places, 842 transitions, 1979 flow [2021-06-10 11:43:01,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,575 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:01,575 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:01,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1701 [2021-06-10 11:43:01,575 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash -926812420, now seen corresponding path program 1 times [2021-06-10 11:43:01,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:01,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037357620] [2021-06-10 11:43:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:01,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:01,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:01,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:01,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:01,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037357620] [2021-06-10 11:43:01,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:01,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:01,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772846756] [2021-06-10 11:43:01,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:01,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:01,598 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:01,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 889 places, 842 transitions, 1979 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:01,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:01,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:01,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:01,952 INFO L129 PetriNetUnfolder]: 63/980 cut-off events. [2021-06-10 11:43:01,952 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:01,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 980 events. 63/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4171 event pairs, 0 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1154. Up to 34 conditions per place. [2021-06-10 11:43:02,002 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/842 dead transitions. [2021-06-10 11:43:02,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 842 transitions, 1991 flow [2021-06-10 11:43:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:02,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:02,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:02,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:02,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:02,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:02,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,006 INFO L185 Difference]: Start difference. First operand has 889 places, 842 transitions, 1979 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 842 transitions, 1991 flow [2021-06-10 11:43:02,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 842 transitions, 1986 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:02,014 INFO L241 Difference]: Finished difference. Result has 891 places, 841 transitions, 1975 flow [2021-06-10 11:43:02,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1975, PETRI_PLACES=891, PETRI_TRANSITIONS=841} [2021-06-10 11:43:02,014 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 12 predicate places. [2021-06-10 11:43:02,014 INFO L480 AbstractCegarLoop]: Abstraction has has 891 places, 841 transitions, 1975 flow [2021-06-10 11:43:02,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:02,014 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:02,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1702 [2021-06-10 11:43:02,014 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash -927764709, now seen corresponding path program 1 times [2021-06-10 11:43:02,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:02,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222873544] [2021-06-10 11:43:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:02,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:02,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:02,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222873544] [2021-06-10 11:43:02,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:02,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:02,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437976921] [2021-06-10 11:43:02,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:02,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:02,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:02,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:02,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 841 transitions, 1975 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:02,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:02,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:02,375 INFO L129 PetriNetUnfolder]: 63/973 cut-off events. [2021-06-10 11:43:02,375 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:02,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 973 events. 63/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4114 event pairs, 0 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1148. Up to 34 conditions per place. [2021-06-10 11:43:02,435 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/839 dead transitions. [2021-06-10 11:43:02,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 839 transitions, 1978 flow [2021-06-10 11:43:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:02,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:02,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:02,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:02,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:02,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:02,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,439 INFO L185 Difference]: Start difference. First operand has 891 places, 841 transitions, 1975 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:02,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 839 transitions, 1978 flow [2021-06-10 11:43:02,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 839 transitions, 1971 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:02,447 INFO L241 Difference]: Finished difference. Result has 891 places, 839 transitions, 1964 flow [2021-06-10 11:43:02,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=891, PETRI_TRANSITIONS=839} [2021-06-10 11:43:02,447 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 12 predicate places. [2021-06-10 11:43:02,447 INFO L480 AbstractCegarLoop]: Abstraction has has 891 places, 839 transitions, 1964 flow [2021-06-10 11:43:02,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:02,448 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:02,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1703 [2021-06-10 11:43:02,448 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -927765732, now seen corresponding path program 1 times [2021-06-10 11:43:02,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:02,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911361522] [2021-06-10 11:43:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:02,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:02,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911361522] [2021-06-10 11:43:02,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:02,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:02,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014203707] [2021-06-10 11:43:02,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:02,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:02,469 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:02,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 839 transitions, 1964 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:02,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:02,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:02,814 INFO L129 PetriNetUnfolder]: 63/971 cut-off events. [2021-06-10 11:43:02,814 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:02,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 971 events. 63/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4097 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1148. Up to 34 conditions per place. [2021-06-10 11:43:02,875 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/837 dead transitions. [2021-06-10 11:43:02,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 837 transitions, 1977 flow [2021-06-10 11:43:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:02,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:02,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:02,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:02,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:02,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:02,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,879 INFO L185 Difference]: Start difference. First operand has 891 places, 839 transitions, 1964 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:02,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 837 transitions, 1977 flow [2021-06-10 11:43:02,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 837 transitions, 1976 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:02,887 INFO L241 Difference]: Finished difference. Result has 890 places, 837 transitions, 1960 flow [2021-06-10 11:43:02,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1960, PETRI_PLACES=890, PETRI_TRANSITIONS=837} [2021-06-10 11:43:02,887 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 11 predicate places. [2021-06-10 11:43:02,887 INFO L480 AbstractCegarLoop]: Abstraction has has 890 places, 837 transitions, 1960 flow [2021-06-10 11:43:02,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:02,888 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:02,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1704 [2021-06-10 11:43:02,888 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:02,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1395188863, now seen corresponding path program 1 times [2021-06-10 11:43:02,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:02,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499864594] [2021-06-10 11:43:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:02,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:02,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:02,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:02,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499864594] [2021-06-10 11:43:02,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:02,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:02,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3532762] [2021-06-10 11:43:02,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:02,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:02,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:02,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 890 places, 837 transitions, 1960 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:02,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:02,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:02,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:03,283 INFO L129 PetriNetUnfolder]: 62/979 cut-off events. [2021-06-10 11:43:03,283 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:03,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 979 events. 62/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4171 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1160. Up to 34 conditions per place. [2021-06-10 11:43:03,347 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/839 dead transitions. [2021-06-10 11:43:03,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 892 places, 839 transitions, 1990 flow [2021-06-10 11:43:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:03,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:03,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:03,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:03,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:03,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:03,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,351 INFO L185 Difference]: Start difference. First operand has 890 places, 837 transitions, 1960 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:03,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 892 places, 839 transitions, 1990 flow [2021-06-10 11:43:03,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 839 transitions, 1989 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:03,360 INFO L241 Difference]: Finished difference. Result has 893 places, 839 transitions, 1983 flow [2021-06-10 11:43:03,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=889, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1983, PETRI_PLACES=893, PETRI_TRANSITIONS=839} [2021-06-10 11:43:03,360 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 14 predicate places. [2021-06-10 11:43:03,360 INFO L480 AbstractCegarLoop]: Abstraction has has 893 places, 839 transitions, 1983 flow [2021-06-10 11:43:03,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:03,361 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:03,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1705 [2021-06-10 11:43:03,361 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1395187840, now seen corresponding path program 1 times [2021-06-10 11:43:03,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:03,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960183452] [2021-06-10 11:43:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:03,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:03,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:03,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:03,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960183452] [2021-06-10 11:43:03,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:03,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:03,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859244557] [2021-06-10 11:43:03,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:03,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:03,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:03,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:03,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 893 places, 839 transitions, 1983 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:03,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:03,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:03,750 INFO L129 PetriNetUnfolder]: 60/980 cut-off events. [2021-06-10 11:43:03,750 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:03,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 980 events. 60/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4191 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1160. Up to 34 conditions per place. [2021-06-10 11:43:03,810 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/839 dead transitions. [2021-06-10 11:43:03,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 839 transitions, 1995 flow [2021-06-10 11:43:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:03,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:03,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:03,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:03,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:03,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:03,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,815 INFO L185 Difference]: Start difference. First operand has 893 places, 839 transitions, 1983 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:03,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 895 places, 839 transitions, 1995 flow [2021-06-10 11:43:03,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 839 transitions, 1990 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:03,823 INFO L241 Difference]: Finished difference. Result has 895 places, 838 transitions, 1979 flow [2021-06-10 11:43:03,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1979, PETRI_PLACES=895, PETRI_TRANSITIONS=838} [2021-06-10 11:43:03,823 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 16 predicate places. [2021-06-10 11:43:03,823 INFO L480 AbstractCegarLoop]: Abstraction has has 895 places, 838 transitions, 1979 flow [2021-06-10 11:43:03,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:03,823 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:03,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1706 [2021-06-10 11:43:03,824 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1394235551, now seen corresponding path program 1 times [2021-06-10 11:43:03,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:03,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847977073] [2021-06-10 11:43:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:03,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:03,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:03,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:03,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:03,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847977073] [2021-06-10 11:43:03,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:03,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:03,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493041659] [2021-06-10 11:43:03,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:03,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:03,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:03,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 838 transitions, 1979 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:03,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:03,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:03,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:04,218 INFO L129 PetriNetUnfolder]: 60/973 cut-off events. [2021-06-10 11:43:04,218 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:04,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 973 events. 60/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4134 event pairs, 0 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 1154. Up to 34 conditions per place. [2021-06-10 11:43:04,277 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/836 dead transitions. [2021-06-10 11:43:04,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 836 transitions, 1982 flow [2021-06-10 11:43:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:04,278 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:04,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:04,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:04,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:04,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:04,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,281 INFO L185 Difference]: Start difference. First operand has 895 places, 838 transitions, 1979 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:04,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 897 places, 836 transitions, 1982 flow [2021-06-10 11:43:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 836 transitions, 1975 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:04,289 INFO L241 Difference]: Finished difference. Result has 895 places, 836 transitions, 1968 flow [2021-06-10 11:43:04,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=835, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=895, PETRI_TRANSITIONS=836} [2021-06-10 11:43:04,289 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 16 predicate places. [2021-06-10 11:43:04,289 INFO L480 AbstractCegarLoop]: Abstraction has has 895 places, 836 transitions, 1968 flow [2021-06-10 11:43:04,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:04,290 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:04,290 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1707 [2021-06-10 11:43:04,290 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:04,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1394234528, now seen corresponding path program 1 times [2021-06-10 11:43:04,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:04,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810961690] [2021-06-10 11:43:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:04,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:04,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:04,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:04,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810961690] [2021-06-10 11:43:04,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:04,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:04,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410133699] [2021-06-10 11:43:04,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:04,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:04,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:04,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 836 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:04,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:04,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:04,666 INFO L129 PetriNetUnfolder]: 60/971 cut-off events. [2021-06-10 11:43:04,667 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:04,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 971 events. 60/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4119 event pairs, 0 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1154. Up to 34 conditions per place. [2021-06-10 11:43:04,727 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/834 dead transitions. [2021-06-10 11:43:04,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 834 transitions, 1981 flow [2021-06-10 11:43:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:04,728 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:04,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:04,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:04,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:04,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:04,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,731 INFO L185 Difference]: Start difference. First operand has 895 places, 836 transitions, 1968 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:04,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 895 places, 834 transitions, 1981 flow [2021-06-10 11:43:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 834 transitions, 1980 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:04,740 INFO L241 Difference]: Finished difference. Result has 894 places, 834 transitions, 1964 flow [2021-06-10 11:43:04,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=894, PETRI_TRANSITIONS=834} [2021-06-10 11:43:04,740 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 15 predicate places. [2021-06-10 11:43:04,740 INFO L480 AbstractCegarLoop]: Abstraction has has 894 places, 834 transitions, 1964 flow [2021-06-10 11:43:04,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:04,740 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:04,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708 [2021-06-10 11:43:04,740 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:04,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1757625092, now seen corresponding path program 1 times [2021-06-10 11:43:04,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:04,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301760719] [2021-06-10 11:43:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:04,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:04,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:04,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:04,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:43:04,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301760719] [2021-06-10 11:43:04,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:04,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:04,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109024334] [2021-06-10 11:43:04,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:04,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:04,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:04,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 834 transitions, 1964 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:04,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:04,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:04,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:05,150 INFO L129 PetriNetUnfolder]: 59/979 cut-off events. [2021-06-10 11:43:05,150 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:05,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 979 events. 59/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4185 event pairs, 0 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1166. Up to 34 conditions per place. [2021-06-10 11:43:05,210 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/836 dead transitions. [2021-06-10 11:43:05,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 836 transitions, 1994 flow [2021-06-10 11:43:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:05,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:05,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:05,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:05,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:05,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:05,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,215 INFO L185 Difference]: Start difference. First operand has 894 places, 834 transitions, 1964 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:05,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 836 transitions, 1994 flow [2021-06-10 11:43:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 836 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:05,223 INFO L241 Difference]: Finished difference. Result has 897 places, 836 transitions, 1987 flow [2021-06-10 11:43:05,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1987, PETRI_PLACES=897, PETRI_TRANSITIONS=836} [2021-06-10 11:43:05,223 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 18 predicate places. [2021-06-10 11:43:05,223 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 836 transitions, 1987 flow [2021-06-10 11:43:05,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:05,224 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:05,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1709 [2021-06-10 11:43:05,224 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1757624069, now seen corresponding path program 1 times [2021-06-10 11:43:05,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:05,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124576732] [2021-06-10 11:43:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:05,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:05,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:05,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:43:05,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124576732] [2021-06-10 11:43:05,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:05,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:05,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190959600] [2021-06-10 11:43:05,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:05,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:05,246 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:05,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 836 transitions, 1987 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:05,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:05,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:05,625 INFO L129 PetriNetUnfolder]: 57/980 cut-off events. [2021-06-10 11:43:05,625 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:05,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 980 events. 57/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4209 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1166. Up to 34 conditions per place. [2021-06-10 11:43:05,687 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/836 dead transitions. [2021-06-10 11:43:05,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 836 transitions, 1999 flow [2021-06-10 11:43:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:05,688 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:05,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:05,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:05,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:05,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:05,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,691 INFO L185 Difference]: Start difference. First operand has 897 places, 836 transitions, 1987 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:05,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 836 transitions, 1999 flow [2021-06-10 11:43:05,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 836 transitions, 1994 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:05,700 INFO L241 Difference]: Finished difference. Result has 899 places, 835 transitions, 1983 flow [2021-06-10 11:43:05,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1983, PETRI_PLACES=899, PETRI_TRANSITIONS=835} [2021-06-10 11:43:05,700 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 20 predicate places. [2021-06-10 11:43:05,700 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 835 transitions, 1983 flow [2021-06-10 11:43:05,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:05,700 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:05,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1710 [2021-06-10 11:43:05,700 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1756671780, now seen corresponding path program 1 times [2021-06-10 11:43:05,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:05,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122608366] [2021-06-10 11:43:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:05,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:05,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:05,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:05,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:43:05,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122608366] [2021-06-10 11:43:05,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:05,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:05,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680370507] [2021-06-10 11:43:05,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:05,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:05,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:05,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 835 transitions, 1983 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:05,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:05,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:05,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:06,085 INFO L129 PetriNetUnfolder]: 57/973 cut-off events. [2021-06-10 11:43:06,085 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:06,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 973 events. 57/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4148 event pairs, 0 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 1160. Up to 34 conditions per place. [2021-06-10 11:43:06,125 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/833 dead transitions. [2021-06-10 11:43:06,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 833 transitions, 1986 flow [2021-06-10 11:43:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:06,127 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:06,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:06,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:06,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:06,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:06,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,129 INFO L185 Difference]: Start difference. First operand has 899 places, 835 transitions, 1983 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:06,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 833 transitions, 1986 flow [2021-06-10 11:43:06,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 833 transitions, 1979 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:06,137 INFO L241 Difference]: Finished difference. Result has 899 places, 833 transitions, 1972 flow [2021-06-10 11:43:06,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1972, PETRI_PLACES=899, PETRI_TRANSITIONS=833} [2021-06-10 11:43:06,137 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 20 predicate places. [2021-06-10 11:43:06,137 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 833 transitions, 1972 flow [2021-06-10 11:43:06,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:06,138 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:06,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1711 [2021-06-10 11:43:06,138 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1756670757, now seen corresponding path program 1 times [2021-06-10 11:43:06,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:06,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082418430] [2021-06-10 11:43:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:06,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:06,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:06,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:43:06,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082418430] [2021-06-10 11:43:06,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:06,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:06,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869017945] [2021-06-10 11:43:06,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:06,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:06,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:06,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:06,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 833 transitions, 1972 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:06,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:06,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:06,518 INFO L129 PetriNetUnfolder]: 57/971 cut-off events. [2021-06-10 11:43:06,519 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:06,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 971 events. 57/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4135 event pairs, 0 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1160. Up to 34 conditions per place. [2021-06-10 11:43:06,581 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/831 dead transitions. [2021-06-10 11:43:06,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 831 transitions, 1985 flow [2021-06-10 11:43:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:06,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:06,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:06,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:06,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:06,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:06,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,585 INFO L185 Difference]: Start difference. First operand has 899 places, 833 transitions, 1972 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 831 transitions, 1985 flow [2021-06-10 11:43:06,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 831 transitions, 1984 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:06,593 INFO L241 Difference]: Finished difference. Result has 898 places, 831 transitions, 1968 flow [2021-06-10 11:43:06,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=898, PETRI_TRANSITIONS=831} [2021-06-10 11:43:06,594 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 19 predicate places. [2021-06-10 11:43:06,594 INFO L480 AbstractCegarLoop]: Abstraction has has 898 places, 831 transitions, 1968 flow [2021-06-10 11:43:06,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:06,594 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:06,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1712 [2021-06-10 11:43:06,594 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash 795621162, now seen corresponding path program 1 times [2021-06-10 11:43:06,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:06,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460399143] [2021-06-10 11:43:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:06,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:06,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:06,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:06,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:43:06,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460399143] [2021-06-10 11:43:06,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:06,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:06,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977485873] [2021-06-10 11:43:06,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:06,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:06,616 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:06,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 831 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:06,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:06,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:06,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:06,997 INFO L129 PetriNetUnfolder]: 55/976 cut-off events. [2021-06-10 11:43:06,997 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:07,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 976 events. 55/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4186 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1163. Up to 34 conditions per place. [2021-06-10 11:43:07,057 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/832 dead transitions. [2021-06-10 11:43:07,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 832 transitions, 1984 flow [2021-06-10 11:43:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:07,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:07,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:07,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:07,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:07,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:07,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,062 INFO L185 Difference]: Start difference. First operand has 898 places, 831 transitions, 1968 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:07,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 832 transitions, 1984 flow [2021-06-10 11:43:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 832 transitions, 1983 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:07,070 INFO L241 Difference]: Finished difference. Result has 901 places, 832 transitions, 1981 flow [2021-06-10 11:43:07,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1981, PETRI_PLACES=901, PETRI_TRANSITIONS=832} [2021-06-10 11:43:07,070 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 22 predicate places. [2021-06-10 11:43:07,070 INFO L480 AbstractCegarLoop]: Abstraction has has 901 places, 832 transitions, 1981 flow [2021-06-10 11:43:07,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:07,071 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:07,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1713 [2021-06-10 11:43:07,071 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash 795620139, now seen corresponding path program 1 times [2021-06-10 11:43:07,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:07,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315603982] [2021-06-10 11:43:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:07,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:07,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:07,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:43:07,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315603982] [2021-06-10 11:43:07,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:07,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:07,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423820597] [2021-06-10 11:43:07,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:07,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:07,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:07,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:07,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 832 transitions, 1981 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:07,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:07,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:07,467 INFO L129 PetriNetUnfolder]: 55/977 cut-off events. [2021-06-10 11:43:07,468 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:07,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 977 events. 55/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4193 event pairs, 0 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1171. Up to 34 conditions per place. [2021-06-10 11:43:07,528 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/833 dead transitions. [2021-06-10 11:43:07,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 833 transitions, 2007 flow [2021-06-10 11:43:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:07,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:07,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:07,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:07,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:07,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:07,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,533 INFO L185 Difference]: Start difference. First operand has 901 places, 832 transitions, 1981 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:07,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 833 transitions, 2007 flow [2021-06-10 11:43:07,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 902 places, 833 transitions, 2005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:07,541 INFO L241 Difference]: Finished difference. Result has 904 places, 833 transitions, 1997 flow [2021-06-10 11:43:07,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=900, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1997, PETRI_PLACES=904, PETRI_TRANSITIONS=833} [2021-06-10 11:43:07,541 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 25 predicate places. [2021-06-10 11:43:07,542 INFO L480 AbstractCegarLoop]: Abstraction has has 904 places, 833 transitions, 1997 flow [2021-06-10 11:43:07,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:07,542 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:07,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1714 [2021-06-10 11:43:07,542 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 796574474, now seen corresponding path program 1 times [2021-06-10 11:43:07,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:07,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628489751] [2021-06-10 11:43:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:07,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:07,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:07,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:07,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:43:07,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628489751] [2021-06-10 11:43:07,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:07,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:07,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501790125] [2021-06-10 11:43:07,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:07,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:07,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:07,564 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:07,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 904 places, 833 transitions, 1997 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:07,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:07,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:07,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:07,950 INFO L129 PetriNetUnfolder]: 54/974 cut-off events. [2021-06-10 11:43:07,950 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-10 11:43:08,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 974 events. 54/974 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4178 event pairs, 0 based on Foata normal form. 2/889 useless extension candidates. Maximal degree in co-relation 1170. Up to 34 conditions per place. [2021-06-10 11:43:08,009 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 9 selfloop transitions, 1 changer transitions 0/831 dead transitions. [2021-06-10 11:43:08,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 906 places, 831 transitions, 2005 flow [2021-06-10 11:43:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2610 transitions. [2021-06-10 11:43:08,010 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:43:08,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2610 transitions. [2021-06-10 11:43:08,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2610 transitions. [2021-06-10 11:43:08,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:08,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2610 transitions. [2021-06-10 11:43:08,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,013 INFO L185 Difference]: Start difference. First operand has 904 places, 833 transitions, 1997 flow. Second operand 3 states and 2610 transitions. [2021-06-10 11:43:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 906 places, 831 transitions, 2005 flow [2021-06-10 11:43:08,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 831 transitions, 2004 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:08,022 INFO L241 Difference]: Finished difference. Result has 905 places, 831 transitions, 1986 flow [2021-06-10 11:43:08,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1986, PETRI_PLACES=905, PETRI_TRANSITIONS=831} [2021-06-10 11:43:08,022 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 26 predicate places. [2021-06-10 11:43:08,022 INFO L480 AbstractCegarLoop]: Abstraction has has 905 places, 831 transitions, 1986 flow [2021-06-10 11:43:08,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,022 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:08,022 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:08,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1715 [2021-06-10 11:43:08,022 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 796573451, now seen corresponding path program 1 times [2021-06-10 11:43:08,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:08,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056398672] [2021-06-10 11:43:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:08,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:08,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:43:08,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056398672] [2021-06-10 11:43:08,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:08,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:08,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498297327] [2021-06-10 11:43:08,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:08,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:08,044 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:08,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 831 transitions, 1986 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:08,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:08,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:08,396 INFO L129 PetriNetUnfolder]: 54/971 cut-off events. [2021-06-10 11:43:08,396 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:08,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 971 events. 54/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4154 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1164. Up to 34 conditions per place. [2021-06-10 11:43:08,450 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/828 dead transitions. [2021-06-10 11:43:08,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 828 transitions, 1987 flow [2021-06-10 11:43:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:08,452 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:08,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:08,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:08,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:08,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:08,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,454 INFO L185 Difference]: Start difference. First operand has 905 places, 831 transitions, 1986 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:08,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 828 transitions, 1987 flow [2021-06-10 11:43:08,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 902 places, 828 transitions, 1982 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:08,462 INFO L241 Difference]: Finished difference. Result has 902 places, 828 transitions, 1972 flow [2021-06-10 11:43:08,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=900, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1972, PETRI_PLACES=902, PETRI_TRANSITIONS=828} [2021-06-10 11:43:08,462 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 23 predicate places. [2021-06-10 11:43:08,462 INFO L480 AbstractCegarLoop]: Abstraction has has 902 places, 828 transitions, 1972 flow [2021-06-10 11:43:08,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:08,463 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:08,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1716 [2021-06-10 11:43:08,463 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash -978509775, now seen corresponding path program 1 times [2021-06-10 11:43:08,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:08,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589615733] [2021-06-10 11:43:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:08,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:08,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:43:08,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589615733] [2021-06-10 11:43:08,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:08,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:08,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547309035] [2021-06-10 11:43:08,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:08,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:08,485 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:08,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 828 transitions, 1972 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:08,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:08,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:08,852 INFO L129 PetriNetUnfolder]: 52/976 cut-off events. [2021-06-10 11:43:08,852 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:08,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 976 events. 52/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4203 event pairs, 0 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 1172. Up to 34 conditions per place. [2021-06-10 11:43:08,911 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/829 dead transitions. [2021-06-10 11:43:08,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 829 transitions, 1988 flow [2021-06-10 11:43:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:08,912 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:08,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:08,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:08,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:08,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:08,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,915 INFO L185 Difference]: Start difference. First operand has 902 places, 828 transitions, 1972 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:08,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 829 transitions, 1988 flow [2021-06-10 11:43:08,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 829 transitions, 1987 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:08,923 INFO L241 Difference]: Finished difference. Result has 905 places, 829 transitions, 1985 flow [2021-06-10 11:43:08,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1985, PETRI_PLACES=905, PETRI_TRANSITIONS=829} [2021-06-10 11:43:08,924 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 26 predicate places. [2021-06-10 11:43:08,924 INFO L480 AbstractCegarLoop]: Abstraction has has 905 places, 829 transitions, 1985 flow [2021-06-10 11:43:08,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:08,924 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:08,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1717 [2021-06-10 11:43:08,924 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -978510798, now seen corresponding path program 1 times [2021-06-10 11:43:08,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:08,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984031558] [2021-06-10 11:43:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:08,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:08,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:08,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:43:08,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984031558] [2021-06-10 11:43:08,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:08,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:08,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597131606] [2021-06-10 11:43:08,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:08,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:08,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:08,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 829 transitions, 1985 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:08,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:08,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:08,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:09,320 INFO L129 PetriNetUnfolder]: 52/977 cut-off events. [2021-06-10 11:43:09,321 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:09,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 977 events. 52/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4210 event pairs, 0 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1178. Up to 34 conditions per place. [2021-06-10 11:43:09,380 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/830 dead transitions. [2021-06-10 11:43:09,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 830 transitions, 2011 flow [2021-06-10 11:43:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:09,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:09,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:09,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:09,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:09,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:09,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,384 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,384 INFO L185 Difference]: Start difference. First operand has 905 places, 829 transitions, 1985 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 830 transitions, 2011 flow [2021-06-10 11:43:09,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 830 transitions, 2009 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:09,393 INFO L241 Difference]: Finished difference. Result has 908 places, 830 transitions, 2001 flow [2021-06-10 11:43:09,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=908, PETRI_TRANSITIONS=830} [2021-06-10 11:43:09,393 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 29 predicate places. [2021-06-10 11:43:09,393 INFO L480 AbstractCegarLoop]: Abstraction has has 908 places, 830 transitions, 2001 flow [2021-06-10 11:43:09,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:09,394 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:09,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1718 [2021-06-10 11:43:09,394 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash -977557486, now seen corresponding path program 1 times [2021-06-10 11:43:09,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:09,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469469882] [2021-06-10 11:43:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:09,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:09,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:09,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:43:09,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469469882] [2021-06-10 11:43:09,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:09,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:09,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657285681] [2021-06-10 11:43:09,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:09,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:09,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:09,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 830 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:09,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:09,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:09,778 INFO L129 PetriNetUnfolder]: 51/973 cut-off events. [2021-06-10 11:43:09,778 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:09,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 973 events. 51/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4183 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1171. Up to 34 conditions per place. [2021-06-10 11:43:09,836 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/827 dead transitions. [2021-06-10 11:43:09,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 827 transitions, 1998 flow [2021-06-10 11:43:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:09,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:09,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:09,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:09,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:09,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:09,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,840 INFO L185 Difference]: Start difference. First operand has 908 places, 830 transitions, 2001 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 827 transitions, 1998 flow [2021-06-10 11:43:09,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 827 transitions, 1990 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:09,849 INFO L241 Difference]: Finished difference. Result has 907 places, 827 transitions, 1980 flow [2021-06-10 11:43:09,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1980, PETRI_PLACES=907, PETRI_TRANSITIONS=827} [2021-06-10 11:43:09,849 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 28 predicate places. [2021-06-10 11:43:09,849 INFO L480 AbstractCegarLoop]: Abstraction has has 907 places, 827 transitions, 1980 flow [2021-06-10 11:43:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,849 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:09,850 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:09,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1719 [2021-06-10 11:43:09,850 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -977556463, now seen corresponding path program 1 times [2021-06-10 11:43:09,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:09,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514365521] [2021-06-10 11:43:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:09,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:09,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:09,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:09,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:43:09,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514365521] [2021-06-10 11:43:09,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:09,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:09,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282286177] [2021-06-10 11:43:09,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:09,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:09,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:09,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:09,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 827 transitions, 1980 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:09,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:09,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:09,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:10,253 INFO L129 PetriNetUnfolder]: 51/971 cut-off events. [2021-06-10 11:43:10,253 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:10,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 971 events. 51/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4166 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1174. Up to 34 conditions per place. [2021-06-10 11:43:10,291 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/825 dead transitions. [2021-06-10 11:43:10,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 825 transitions, 1993 flow [2021-06-10 11:43:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:10,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:10,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:10,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:10,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:10,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:10,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,295 INFO L185 Difference]: Start difference. First operand has 907 places, 827 transitions, 1980 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:10,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 825 transitions, 1993 flow [2021-06-10 11:43:10,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 825 transitions, 1992 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:10,302 INFO L241 Difference]: Finished difference. Result has 906 places, 825 transitions, 1976 flow [2021-06-10 11:43:10,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1976, PETRI_PLACES=906, PETRI_TRANSITIONS=825} [2021-06-10 11:43:10,303 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 27 predicate places. [2021-06-10 11:43:10,303 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 825 transitions, 1976 flow [2021-06-10 11:43:10,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:10,303 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:10,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1720 [2021-06-10 11:43:10,303 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -81427782, now seen corresponding path program 1 times [2021-06-10 11:43:10,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:10,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868883342] [2021-06-10 11:43:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:10,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:10,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:10,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:43:10,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868883342] [2021-06-10 11:43:10,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:10,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:10,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215741732] [2021-06-10 11:43:10,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:10,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:10,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:10,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 825 transitions, 1976 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:10,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:10,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:10,700 INFO L129 PetriNetUnfolder]: 50/979 cut-off events. [2021-06-10 11:43:10,700 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:10,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 979 events. 50/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4241 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1186. Up to 34 conditions per place. [2021-06-10 11:43:10,760 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/827 dead transitions. [2021-06-10 11:43:10,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 827 transitions, 2006 flow [2021-06-10 11:43:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:10,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:10,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:10,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:10,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:10,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:10,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,764 INFO L185 Difference]: Start difference. First operand has 906 places, 825 transitions, 1976 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:10,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 827 transitions, 2006 flow [2021-06-10 11:43:10,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 827 transitions, 2005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:10,773 INFO L241 Difference]: Finished difference. Result has 909 places, 827 transitions, 1999 flow [2021-06-10 11:43:10,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1999, PETRI_PLACES=909, PETRI_TRANSITIONS=827} [2021-06-10 11:43:10,773 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 30 predicate places. [2021-06-10 11:43:10,773 INFO L480 AbstractCegarLoop]: Abstraction has has 909 places, 827 transitions, 1999 flow [2021-06-10 11:43:10,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:10,773 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:10,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1721 [2021-06-10 11:43:10,774 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash -81426759, now seen corresponding path program 1 times [2021-06-10 11:43:10,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:10,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249351775] [2021-06-10 11:43:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:10,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:10,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:10,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:10,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:43:10,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249351775] [2021-06-10 11:43:10,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:10,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:10,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346970435] [2021-06-10 11:43:10,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:10,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:10,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:10,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 827 transitions, 1999 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:10,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:10,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:10,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:11,158 INFO L129 PetriNetUnfolder]: 49/977 cut-off events. [2021-06-10 11:43:11,158 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:11,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 977 events. 49/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4229 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1183. Up to 34 conditions per place. [2021-06-10 11:43:11,217 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/827 dead transitions. [2021-06-10 11:43:11,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 827 transitions, 2011 flow [2021-06-10 11:43:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:11,219 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:11,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:11,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:11,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:11,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:11,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,222 INFO L185 Difference]: Start difference. First operand has 909 places, 827 transitions, 1999 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:11,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 827 transitions, 2011 flow [2021-06-10 11:43:11,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 827 transitions, 2006 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:11,231 INFO L241 Difference]: Finished difference. Result has 912 places, 827 transitions, 2004 flow [2021-06-10 11:43:11,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2004, PETRI_PLACES=912, PETRI_TRANSITIONS=827} [2021-06-10 11:43:11,231 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 33 predicate places. [2021-06-10 11:43:11,231 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 827 transitions, 2004 flow [2021-06-10 11:43:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:11,232 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:11,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1722 [2021-06-10 11:43:11,232 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -80474470, now seen corresponding path program 1 times [2021-06-10 11:43:11,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:11,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821655631] [2021-06-10 11:43:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:11,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:11,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:11,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:43:11,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821655631] [2021-06-10 11:43:11,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:11,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:11,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418640186] [2021-06-10 11:43:11,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:11,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:11,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:11,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 827 transitions, 2004 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:11,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:11,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:11,623 INFO L129 PetriNetUnfolder]: 48/973 cut-off events. [2021-06-10 11:43:11,623 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:11,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 973 events. 48/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4204 event pairs, 0 based on Foata normal form. 1/894 useless extension candidates. Maximal degree in co-relation 1180. Up to 34 conditions per place. [2021-06-10 11:43:11,683 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/824 dead transitions. [2021-06-10 11:43:11,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 824 transitions, 2001 flow [2021-06-10 11:43:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:11,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:11,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:11,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:11,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:11,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:11,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,688 INFO L185 Difference]: Start difference. First operand has 912 places, 827 transitions, 2004 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:11,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 824 transitions, 2001 flow [2021-06-10 11:43:11,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 824 transitions, 1994 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:11,696 INFO L241 Difference]: Finished difference. Result has 911 places, 824 transitions, 1984 flow [2021-06-10 11:43:11,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1984, PETRI_PLACES=911, PETRI_TRANSITIONS=824} [2021-06-10 11:43:11,696 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 32 predicate places. [2021-06-10 11:43:11,696 INFO L480 AbstractCegarLoop]: Abstraction has has 911 places, 824 transitions, 1984 flow [2021-06-10 11:43:11,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:11,696 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:11,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1723 [2021-06-10 11:43:11,697 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -80473447, now seen corresponding path program 1 times [2021-06-10 11:43:11,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:11,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34014464] [2021-06-10 11:43:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:11,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:11,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:11,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:11,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:43:11,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34014464] [2021-06-10 11:43:11,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:11,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:11,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851244501] [2021-06-10 11:43:11,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:11,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:11,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:11,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 824 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:11,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:11,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:11,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:12,082 INFO L129 PetriNetUnfolder]: 48/971 cut-off events. [2021-06-10 11:43:12,083 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:12,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 971 events. 48/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4189 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1181. Up to 34 conditions per place. [2021-06-10 11:43:12,140 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/822 dead transitions. [2021-06-10 11:43:12,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 822 transitions, 1997 flow [2021-06-10 11:43:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:12,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:12,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:12,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:12,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:12,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:12,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,144 INFO L185 Difference]: Start difference. First operand has 911 places, 824 transitions, 1984 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:12,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 822 transitions, 1997 flow [2021-06-10 11:43:12,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 822 transitions, 1996 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:12,153 INFO L241 Difference]: Finished difference. Result has 910 places, 822 transitions, 1980 flow [2021-06-10 11:43:12,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1980, PETRI_PLACES=910, PETRI_TRANSITIONS=822} [2021-06-10 11:43:12,153 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 31 predicate places. [2021-06-10 11:43:12,153 INFO L480 AbstractCegarLoop]: Abstraction has has 910 places, 822 transitions, 1980 flow [2021-06-10 11:43:12,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:12,153 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:12,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1724 [2021-06-10 11:43:12,153 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2006664925, now seen corresponding path program 1 times [2021-06-10 11:43:12,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:12,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858817826] [2021-06-10 11:43:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:12,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:12,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:12,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:43:12,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858817826] [2021-06-10 11:43:12,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:12,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:12,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922309970] [2021-06-10 11:43:12,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:12,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:12,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:12,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 910 places, 822 transitions, 1980 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:12,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:12,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:12,549 INFO L129 PetriNetUnfolder]: 47/978 cut-off events. [2021-06-10 11:43:12,549 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:12,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 978 events. 47/978 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4243 event pairs, 0 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1186. Up to 34 conditions per place. [2021-06-10 11:43:12,607 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/823 dead transitions. [2021-06-10 11:43:12,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 823 transitions, 1996 flow [2021-06-10 11:43:12,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:12,608 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:12,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:12,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:12,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:12,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:12,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,611 INFO L185 Difference]: Start difference. First operand has 910 places, 822 transitions, 1980 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:12,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 823 transitions, 1996 flow [2021-06-10 11:43:12,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 823 transitions, 1995 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:12,619 INFO L241 Difference]: Finished difference. Result has 912 places, 822 transitions, 1984 flow [2021-06-10 11:43:12,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1984, PETRI_PLACES=912, PETRI_TRANSITIONS=822} [2021-06-10 11:43:12,620 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 33 predicate places. [2021-06-10 11:43:12,620 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 822 transitions, 1984 flow [2021-06-10 11:43:12,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:12,620 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:12,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1725 [2021-06-10 11:43:12,620 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2006663902, now seen corresponding path program 1 times [2021-06-10 11:43:12,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:12,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064423690] [2021-06-10 11:43:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:12,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:12,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:12,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:12,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:43:12,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064423690] [2021-06-10 11:43:12,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:12,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:12,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316338618] [2021-06-10 11:43:12,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:12,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:12,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:12,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 822 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:12,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:12,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:12,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:13,023 INFO L129 PetriNetUnfolder]: 45/980 cut-off events. [2021-06-10 11:43:13,024 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:13,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 980 events. 45/980 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4276 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1197. Up to 34 conditions per place. [2021-06-10 11:43:13,083 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/823 dead transitions. [2021-06-10 11:43:13,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 823 transitions, 2010 flow [2021-06-10 11:43:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:13,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:13,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:13,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:13,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:13,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:13,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,087 INFO L185 Difference]: Start difference. First operand has 912 places, 822 transitions, 1984 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:13,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 823 transitions, 2010 flow [2021-06-10 11:43:13,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 823 transitions, 2009 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:13,096 INFO L241 Difference]: Finished difference. Result has 915 places, 823 transitions, 2001 flow [2021-06-10 11:43:13,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=915, PETRI_TRANSITIONS=823} [2021-06-10 11:43:13,096 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 36 predicate places. [2021-06-10 11:43:13,096 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 823 transitions, 2001 flow [2021-06-10 11:43:13,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,096 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:13,096 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:13,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1726 [2021-06-10 11:43:13,096 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2007617214, now seen corresponding path program 1 times [2021-06-10 11:43:13,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:13,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861279317] [2021-06-10 11:43:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:13,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:13,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:13,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:43:13,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861279317] [2021-06-10 11:43:13,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:13,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:13,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851612222] [2021-06-10 11:43:13,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:13,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:13,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:13,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 823 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:13,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:13,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:13,491 INFO L129 PetriNetUnfolder]: 45/973 cut-off events. [2021-06-10 11:43:13,491 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:13,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 973 events. 45/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4218 event pairs, 0 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 1183. Up to 34 conditions per place. [2021-06-10 11:43:13,549 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/821 dead transitions. [2021-06-10 11:43:13,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 821 transitions, 2003 flow [2021-06-10 11:43:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:13,551 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:13,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:13,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:13,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:13,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:13,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,554 INFO L185 Difference]: Start difference. First operand has 915 places, 823 transitions, 2001 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 821 transitions, 2003 flow [2021-06-10 11:43:13,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 821 transitions, 1995 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:13,562 INFO L241 Difference]: Finished difference. Result has 915 places, 821 transitions, 1988 flow [2021-06-10 11:43:13,562 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=912, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1988, PETRI_PLACES=915, PETRI_TRANSITIONS=821} [2021-06-10 11:43:13,562 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 36 predicate places. [2021-06-10 11:43:13,562 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 821 transitions, 1988 flow [2021-06-10 11:43:13,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,563 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:13,563 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:13,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1727 [2021-06-10 11:43:13,563 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:13,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2007618237, now seen corresponding path program 1 times [2021-06-10 11:43:13,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:13,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803395279] [2021-06-10 11:43:13,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:13,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:13,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:13,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:13,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:43:13,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803395279] [2021-06-10 11:43:13,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:13,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:13,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945695800] [2021-06-10 11:43:13,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:13,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:13,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:13,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 821 transitions, 1988 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:13,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:13,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:13,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:13,954 INFO L129 PetriNetUnfolder]: 45/971 cut-off events. [2021-06-10 11:43:13,954 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:14,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 971 events. 45/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4202 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1187. Up to 34 conditions per place. [2021-06-10 11:43:14,012 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/819 dead transitions. [2021-06-10 11:43:14,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 819 transitions, 2001 flow [2021-06-10 11:43:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:14,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:14,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:14,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:14,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:14,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:14,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,016 INFO L185 Difference]: Start difference. First operand has 915 places, 821 transitions, 1988 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:14,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 819 transitions, 2001 flow [2021-06-10 11:43:14,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 819 transitions, 2000 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:14,025 INFO L241 Difference]: Finished difference. Result has 914 places, 819 transitions, 1984 flow [2021-06-10 11:43:14,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=912, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1984, PETRI_PLACES=914, PETRI_TRANSITIONS=819} [2021-06-10 11:43:14,025 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 35 predicate places. [2021-06-10 11:43:14,025 INFO L480 AbstractCegarLoop]: Abstraction has has 914 places, 819 transitions, 1984 flow [2021-06-10 11:43:14,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:14,025 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:14,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1728 [2021-06-10 11:43:14,025 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1637011533, now seen corresponding path program 1 times [2021-06-10 11:43:14,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:14,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986982109] [2021-06-10 11:43:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:14,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:14,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:43:14,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986982109] [2021-06-10 11:43:14,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:14,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:14,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28705643] [2021-06-10 11:43:14,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:14,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:14,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:14,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 819 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:14,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:14,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:14,423 INFO L129 PetriNetUnfolder]: 44/979 cut-off events. [2021-06-10 11:43:14,424 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:14,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 979 events. 44/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4277 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1199. Up to 34 conditions per place. [2021-06-10 11:43:14,469 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/821 dead transitions. [2021-06-10 11:43:14,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 821 transitions, 2014 flow [2021-06-10 11:43:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:14,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:14,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:14,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:14,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:14,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:14,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,473 INFO L185 Difference]: Start difference. First operand has 914 places, 819 transitions, 1984 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:14,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 821 transitions, 2014 flow [2021-06-10 11:43:14,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 821 transitions, 2013 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:14,481 INFO L241 Difference]: Finished difference. Result has 917 places, 821 transitions, 2007 flow [2021-06-10 11:43:14,481 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2007, PETRI_PLACES=917, PETRI_TRANSITIONS=821} [2021-06-10 11:43:14,481 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 38 predicate places. [2021-06-10 11:43:14,481 INFO L480 AbstractCegarLoop]: Abstraction has has 917 places, 821 transitions, 2007 flow [2021-06-10 11:43:14,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:14,482 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:14,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1729 [2021-06-10 11:43:14,482 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1637012556, now seen corresponding path program 1 times [2021-06-10 11:43:14,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:14,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116089950] [2021-06-10 11:43:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:14,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:14,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:43:14,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116089950] [2021-06-10 11:43:14,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:14,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:14,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630743885] [2021-06-10 11:43:14,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:14,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:14,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:14,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 821 transitions, 2007 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:14,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:14,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:14,892 INFO L129 PetriNetUnfolder]: 43/977 cut-off events. [2021-06-10 11:43:14,892 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:14,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 977 events. 43/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4265 event pairs, 0 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1196. Up to 34 conditions per place. [2021-06-10 11:43:14,951 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/821 dead transitions. [2021-06-10 11:43:14,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 821 transitions, 2019 flow [2021-06-10 11:43:14,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:14,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:14,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:14,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:14,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:14,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:14,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,955 INFO L185 Difference]: Start difference. First operand has 917 places, 821 transitions, 2007 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:14,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 821 transitions, 2019 flow [2021-06-10 11:43:14,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 821 transitions, 2014 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:14,963 INFO L241 Difference]: Finished difference. Result has 920 places, 821 transitions, 2012 flow [2021-06-10 11:43:14,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=820, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2012, PETRI_PLACES=920, PETRI_TRANSITIONS=821} [2021-06-10 11:43:14,964 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 41 predicate places. [2021-06-10 11:43:14,964 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 821 transitions, 2012 flow [2021-06-10 11:43:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,964 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:14,964 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:14,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1730 [2021-06-10 11:43:14,964 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1637964845, now seen corresponding path program 1 times [2021-06-10 11:43:14,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:14,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670284983] [2021-06-10 11:43:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:14,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:14,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:14,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:43:14,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670284983] [2021-06-10 11:43:14,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:14,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:14,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337459980] [2021-06-10 11:43:14,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:14,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:14,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:14,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 821 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:14,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:14,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:14,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:15,350 INFO L129 PetriNetUnfolder]: 42/973 cut-off events. [2021-06-10 11:43:15,351 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:15,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 973 events. 42/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4240 event pairs, 0 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 1193. Up to 34 conditions per place. [2021-06-10 11:43:15,408 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/818 dead transitions. [2021-06-10 11:43:15,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 818 transitions, 2009 flow [2021-06-10 11:43:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:15,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:15,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:15,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:15,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:15,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:15,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,412 INFO L185 Difference]: Start difference. First operand has 920 places, 821 transitions, 2012 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:15,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 818 transitions, 2009 flow [2021-06-10 11:43:15,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 818 transitions, 2002 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:15,420 INFO L241 Difference]: Finished difference. Result has 919 places, 818 transitions, 1992 flow [2021-06-10 11:43:15,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1992, PETRI_PLACES=919, PETRI_TRANSITIONS=818} [2021-06-10 11:43:15,421 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 40 predicate places. [2021-06-10 11:43:15,421 INFO L480 AbstractCegarLoop]: Abstraction has has 919 places, 818 transitions, 1992 flow [2021-06-10 11:43:15,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,421 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:15,421 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:15,421 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1731 [2021-06-10 11:43:15,421 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1637965868, now seen corresponding path program 1 times [2021-06-10 11:43:15,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:15,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3840000] [2021-06-10 11:43:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:15,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:15,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:15,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:43:15,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3840000] [2021-06-10 11:43:15,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:15,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:15,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595615079] [2021-06-10 11:43:15,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:15,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:15,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:15,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 818 transitions, 1992 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:15,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:15,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:15,822 INFO L129 PetriNetUnfolder]: 42/971 cut-off events. [2021-06-10 11:43:15,823 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:15,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 971 events. 42/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4225 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1194. Up to 34 conditions per place. [2021-06-10 11:43:15,880 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/816 dead transitions. [2021-06-10 11:43:15,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 816 transitions, 2005 flow [2021-06-10 11:43:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:15,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:15,881 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:15,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:15,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:15,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:15,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,884 INFO L185 Difference]: Start difference. First operand has 919 places, 818 transitions, 1992 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:15,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 816 transitions, 2005 flow [2021-06-10 11:43:15,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 816 transitions, 2004 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:15,892 INFO L241 Difference]: Finished difference. Result has 918 places, 816 transitions, 1988 flow [2021-06-10 11:43:15,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1988, PETRI_PLACES=918, PETRI_TRANSITIONS=816} [2021-06-10 11:43:15,892 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 39 predicate places. [2021-06-10 11:43:15,892 INFO L480 AbstractCegarLoop]: Abstraction has has 918 places, 816 transitions, 1988 flow [2021-06-10 11:43:15,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:15,893 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:15,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1732 [2021-06-10 11:43:15,893 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1578183256, now seen corresponding path program 1 times [2021-06-10 11:43:15,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:15,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694592525] [2021-06-10 11:43:15,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:15,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:15,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:15,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:15,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:43:15,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694592525] [2021-06-10 11:43:15,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:15,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:15,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558744149] [2021-06-10 11:43:15,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:15,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:15,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:15,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 816 transitions, 1988 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:15,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:15,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:15,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:16,296 INFO L129 PetriNetUnfolder]: 41/979 cut-off events. [2021-06-10 11:43:16,296 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:16,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 979 events. 41/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4294 event pairs, 0 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1206. Up to 34 conditions per place. [2021-06-10 11:43:16,355 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/818 dead transitions. [2021-06-10 11:43:16,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 818 transitions, 2018 flow [2021-06-10 11:43:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:16,357 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:16,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:16,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:16,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:16,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:16,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,403 INFO L185 Difference]: Start difference. First operand has 918 places, 816 transitions, 1988 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:16,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 818 transitions, 2018 flow [2021-06-10 11:43:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 818 transitions, 2017 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:16,411 INFO L241 Difference]: Finished difference. Result has 921 places, 818 transitions, 2011 flow [2021-06-10 11:43:16,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2011, PETRI_PLACES=921, PETRI_TRANSITIONS=818} [2021-06-10 11:43:16,411 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 42 predicate places. [2021-06-10 11:43:16,411 INFO L480 AbstractCegarLoop]: Abstraction has has 921 places, 818 transitions, 2011 flow [2021-06-10 11:43:16,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,411 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:16,411 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:16,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1733 [2021-06-10 11:43:16,412 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1578184279, now seen corresponding path program 1 times [2021-06-10 11:43:16,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:16,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594697984] [2021-06-10 11:43:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:16,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:16,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:16,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:43:16,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594697984] [2021-06-10 11:43:16,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:16,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:16,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481398276] [2021-06-10 11:43:16,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:16,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:16,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:16,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:16,435 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:16,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 818 transitions, 2011 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:16,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:16,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:16,820 INFO L129 PetriNetUnfolder]: 40/977 cut-off events. [2021-06-10 11:43:16,821 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:16,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 977 events. 40/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4280 event pairs, 0 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1203. Up to 34 conditions per place. [2021-06-10 11:43:16,880 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/818 dead transitions. [2021-06-10 11:43:16,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 818 transitions, 2023 flow [2021-06-10 11:43:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:16,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:16,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:16,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:16,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:16,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:16,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,884 INFO L185 Difference]: Start difference. First operand has 921 places, 818 transitions, 2011 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:16,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 818 transitions, 2023 flow [2021-06-10 11:43:16,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 818 transitions, 2018 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:16,893 INFO L241 Difference]: Finished difference. Result has 924 places, 818 transitions, 2016 flow [2021-06-10 11:43:16,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2016, PETRI_PLACES=924, PETRI_TRANSITIONS=818} [2021-06-10 11:43:16,894 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 45 predicate places. [2021-06-10 11:43:16,894 INFO L480 AbstractCegarLoop]: Abstraction has has 924 places, 818 transitions, 2016 flow [2021-06-10 11:43:16,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:16,894 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:16,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1734 [2021-06-10 11:43:16,894 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1579136568, now seen corresponding path program 1 times [2021-06-10 11:43:16,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:16,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003065710] [2021-06-10 11:43:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:16,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:16,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:16,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:16,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:43:16,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003065710] [2021-06-10 11:43:16,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:16,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:16,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137141452] [2021-06-10 11:43:16,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:16,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:16,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:16,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 818 transitions, 2016 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:16,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:16,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:16,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:17,296 INFO L129 PetriNetUnfolder]: 39/973 cut-off events. [2021-06-10 11:43:17,297 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:17,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 973 events. 39/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4255 event pairs, 0 based on Foata normal form. 1/903 useless extension candidates. Maximal degree in co-relation 1200. Up to 34 conditions per place. [2021-06-10 11:43:17,354 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/815 dead transitions. [2021-06-10 11:43:17,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 815 transitions, 2013 flow [2021-06-10 11:43:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:17,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:17,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:17,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:17,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:17,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:17,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,359 INFO L185 Difference]: Start difference. First operand has 924 places, 818 transitions, 2016 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:17,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 815 transitions, 2013 flow [2021-06-10 11:43:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 815 transitions, 2006 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:17,367 INFO L241 Difference]: Finished difference. Result has 923 places, 815 transitions, 1996 flow [2021-06-10 11:43:17,367 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1996, PETRI_PLACES=923, PETRI_TRANSITIONS=815} [2021-06-10 11:43:17,367 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 44 predicate places. [2021-06-10 11:43:17,367 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 815 transitions, 1996 flow [2021-06-10 11:43:17,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:17,368 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:17,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1735 [2021-06-10 11:43:17,368 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1579137591, now seen corresponding path program 1 times [2021-06-10 11:43:17,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:17,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120034008] [2021-06-10 11:43:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:17,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:17,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:17,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:43:17,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120034008] [2021-06-10 11:43:17,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:17,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:17,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841005836] [2021-06-10 11:43:17,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:17,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:17,391 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:17,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 815 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:17,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:17,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:17,769 INFO L129 PetriNetUnfolder]: 39/971 cut-off events. [2021-06-10 11:43:17,769 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:17,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 971 events. 39/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4238 event pairs, 0 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1201. Up to 34 conditions per place. [2021-06-10 11:43:17,826 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/813 dead transitions. [2021-06-10 11:43:17,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 813 transitions, 2009 flow [2021-06-10 11:43:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:17,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:17,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:17,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:17,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:17,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:17,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,831 INFO L185 Difference]: Start difference. First operand has 923 places, 815 transitions, 1996 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:17,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 813 transitions, 2009 flow [2021-06-10 11:43:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 813 transitions, 2008 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:17,839 INFO L241 Difference]: Finished difference. Result has 922 places, 813 transitions, 1992 flow [2021-06-10 11:43:17,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1992, PETRI_PLACES=922, PETRI_TRANSITIONS=813} [2021-06-10 11:43:17,839 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 43 predicate places. [2021-06-10 11:43:17,839 INFO L480 AbstractCegarLoop]: Abstraction has has 922 places, 813 transitions, 1992 flow [2021-06-10 11:43:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:17,840 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:17,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1736 [2021-06-10 11:43:17,840 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1183681053, now seen corresponding path program 1 times [2021-06-10 11:43:17,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:17,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365142201] [2021-06-10 11:43:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:17,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:17,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:17,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:17,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:43:17,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365142201] [2021-06-10 11:43:17,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:17,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:17,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22610262] [2021-06-10 11:43:17,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:17,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:17,863 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:17,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 813 transitions, 1992 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:17,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:17,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:17,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:18,236 INFO L129 PetriNetUnfolder]: 37/976 cut-off events. [2021-06-10 11:43:18,237 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:18,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 976 events. 37/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4292 event pairs, 0 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1204. Up to 34 conditions per place. [2021-06-10 11:43:18,294 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/814 dead transitions. [2021-06-10 11:43:18,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 814 transitions, 2008 flow [2021-06-10 11:43:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:18,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:18,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:18,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:18,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:18,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:18,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,299 INFO L185 Difference]: Start difference. First operand has 922 places, 813 transitions, 1992 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:18,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 814 transitions, 2008 flow [2021-06-10 11:43:18,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 814 transitions, 2007 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:18,307 INFO L241 Difference]: Finished difference. Result has 925 places, 814 transitions, 2005 flow [2021-06-10 11:43:18,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2005, PETRI_PLACES=925, PETRI_TRANSITIONS=814} [2021-06-10 11:43:18,307 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 46 predicate places. [2021-06-10 11:43:18,307 INFO L480 AbstractCegarLoop]: Abstraction has has 925 places, 814 transitions, 2005 flow [2021-06-10 11:43:18,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:18,308 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:18,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1737 [2021-06-10 11:43:18,308 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1183682076, now seen corresponding path program 1 times [2021-06-10 11:43:18,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:18,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318658267] [2021-06-10 11:43:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:18,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:18,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:18,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:43:18,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318658267] [2021-06-10 11:43:18,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:18,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:18,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409750925] [2021-06-10 11:43:18,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:18,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:18,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:18,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 814 transitions, 2005 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:18,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:18,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:18,706 INFO L129 PetriNetUnfolder]: 37/977 cut-off events. [2021-06-10 11:43:18,706 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:18,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 977 events. 37/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4300 event pairs, 0 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1212. Up to 34 conditions per place. [2021-06-10 11:43:18,759 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/815 dead transitions. [2021-06-10 11:43:18,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 815 transitions, 2031 flow [2021-06-10 11:43:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:18,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:18,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:18,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:18,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:18,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:18,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,763 INFO L185 Difference]: Start difference. First operand has 925 places, 814 transitions, 2005 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:18,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 815 transitions, 2031 flow [2021-06-10 11:43:18,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 815 transitions, 2029 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:18,772 INFO L241 Difference]: Finished difference. Result has 928 places, 815 transitions, 2021 flow [2021-06-10 11:43:18,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2021, PETRI_PLACES=928, PETRI_TRANSITIONS=815} [2021-06-10 11:43:18,772 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 49 predicate places. [2021-06-10 11:43:18,772 INFO L480 AbstractCegarLoop]: Abstraction has has 928 places, 815 transitions, 2021 flow [2021-06-10 11:43:18,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,772 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:18,773 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:18,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1738 [2021-06-10 11:43:18,773 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1182728764, now seen corresponding path program 1 times [2021-06-10 11:43:18,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:18,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704677479] [2021-06-10 11:43:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:18,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:18,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:18,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:18,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:43:18,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704677479] [2021-06-10 11:43:18,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:18,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:18,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788266577] [2021-06-10 11:43:18,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:18,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:18,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:18,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 815 transitions, 2021 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:18,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:18,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:18,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:19,174 INFO L129 PetriNetUnfolder]: 36/973 cut-off events. [2021-06-10 11:43:19,174 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:19,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 973 events. 36/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4273 event pairs, 0 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1205. Up to 34 conditions per place. [2021-06-10 11:43:19,230 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/812 dead transitions. [2021-06-10 11:43:19,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 812 transitions, 2018 flow [2021-06-10 11:43:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:19,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:19,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:19,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:19,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:19,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,234 INFO L185 Difference]: Start difference. First operand has 928 places, 815 transitions, 2021 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:19,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 812 transitions, 2018 flow [2021-06-10 11:43:19,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 812 transitions, 2010 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:19,243 INFO L241 Difference]: Finished difference. Result has 927 places, 812 transitions, 2000 flow [2021-06-10 11:43:19,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2000, PETRI_PLACES=927, PETRI_TRANSITIONS=812} [2021-06-10 11:43:19,243 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 48 predicate places. [2021-06-10 11:43:19,243 INFO L480 AbstractCegarLoop]: Abstraction has has 927 places, 812 transitions, 2000 flow [2021-06-10 11:43:19,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:19,243 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:19,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1739 [2021-06-10 11:43:19,243 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1182727741, now seen corresponding path program 1 times [2021-06-10 11:43:19,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:19,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216609828] [2021-06-10 11:43:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:19,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:19,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:19,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:43:19,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216609828] [2021-06-10 11:43:19,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:19,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:19,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868843311] [2021-06-10 11:43:19,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:19,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:19,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:19,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 812 transitions, 2000 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:19,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:19,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:19,641 INFO L129 PetriNetUnfolder]: 36/971 cut-off events. [2021-06-10 11:43:19,641 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:19,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 971 events. 36/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4260 event pairs, 0 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1208. Up to 34 conditions per place. [2021-06-10 11:43:19,698 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/810 dead transitions. [2021-06-10 11:43:19,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 810 transitions, 2013 flow [2021-06-10 11:43:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:19,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:19,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:19,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:19,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:19,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:19,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,702 INFO L185 Difference]: Start difference. First operand has 927 places, 812 transitions, 2000 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:19,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 810 transitions, 2013 flow [2021-06-10 11:43:19,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 810 transitions, 2012 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:19,710 INFO L241 Difference]: Finished difference. Result has 926 places, 810 transitions, 1996 flow [2021-06-10 11:43:19,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1996, PETRI_PLACES=926, PETRI_TRANSITIONS=810} [2021-06-10 11:43:19,711 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 47 predicate places. [2021-06-10 11:43:19,711 INFO L480 AbstractCegarLoop]: Abstraction has has 926 places, 810 transitions, 1996 flow [2021-06-10 11:43:19,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:19,711 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:19,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1740 [2021-06-10 11:43:19,711 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1970671504, now seen corresponding path program 1 times [2021-06-10 11:43:19,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:19,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643085132] [2021-06-10 11:43:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:19,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:19,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:19,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:19,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:43:19,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643085132] [2021-06-10 11:43:19,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:19,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:19,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371950864] [2021-06-10 11:43:19,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:19,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:19,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:19,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 810 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:19,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:19,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:19,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:20,113 INFO L129 PetriNetUnfolder]: 34/976 cut-off events. [2021-06-10 11:43:20,113 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:20,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 976 events. 34/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4308 event pairs, 0 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1211. Up to 34 conditions per place. [2021-06-10 11:43:20,169 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/811 dead transitions. [2021-06-10 11:43:20,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 811 transitions, 2012 flow [2021-06-10 11:43:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:20,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:20,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:20,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:20,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:20,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:20,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,174 INFO L185 Difference]: Start difference. First operand has 926 places, 810 transitions, 1996 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:20,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 811 transitions, 2012 flow [2021-06-10 11:43:20,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 811 transitions, 2011 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:20,182 INFO L241 Difference]: Finished difference. Result has 929 places, 811 transitions, 2009 flow [2021-06-10 11:43:20,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2009, PETRI_PLACES=929, PETRI_TRANSITIONS=811} [2021-06-10 11:43:20,182 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 50 predicate places. [2021-06-10 11:43:20,182 INFO L480 AbstractCegarLoop]: Abstraction has has 929 places, 811 transitions, 2009 flow [2021-06-10 11:43:20,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:20,182 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:20,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1741 [2021-06-10 11:43:20,183 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1970672527, now seen corresponding path program 1 times [2021-06-10 11:43:20,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:20,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813953519] [2021-06-10 11:43:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:20,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:20,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:20,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:43:20,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813953519] [2021-06-10 11:43:20,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:20,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:20,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539801015] [2021-06-10 11:43:20,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:20,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:20,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:20,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 811 transitions, 2009 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:20,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:20,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:20,583 INFO L129 PetriNetUnfolder]: 34/977 cut-off events. [2021-06-10 11:43:20,583 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:20,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 977 events. 34/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4313 event pairs, 0 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1219. Up to 34 conditions per place. [2021-06-10 11:43:20,625 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/812 dead transitions. [2021-06-10 11:43:20,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 812 transitions, 2035 flow [2021-06-10 11:43:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:20,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:20,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:20,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:20,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:20,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:20,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,629 INFO L185 Difference]: Start difference. First operand has 929 places, 811 transitions, 2009 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:20,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 812 transitions, 2035 flow [2021-06-10 11:43:20,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 812 transitions, 2033 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:20,637 INFO L241 Difference]: Finished difference. Result has 932 places, 812 transitions, 2025 flow [2021-06-10 11:43:20,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2025, PETRI_PLACES=932, PETRI_TRANSITIONS=812} [2021-06-10 11:43:20,637 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 53 predicate places. [2021-06-10 11:43:20,637 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 812 transitions, 2025 flow [2021-06-10 11:43:20,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,637 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:20,637 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:20,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1742 [2021-06-10 11:43:20,638 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1969718192, now seen corresponding path program 1 times [2021-06-10 11:43:20,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:20,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196240346] [2021-06-10 11:43:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:20,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:20,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:20,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:20,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:43:20,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196240346] [2021-06-10 11:43:20,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:20,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:20,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292774672] [2021-06-10 11:43:20,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:20,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:20,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:20,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:20,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:20,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 812 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:20,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:20,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:20,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:21,056 INFO L129 PetriNetUnfolder]: 33/974 cut-off events. [2021-06-10 11:43:21,056 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-10 11:43:21,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 974 events. 33/974 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4298 event pairs, 0 based on Foata normal form. 2/910 useless extension candidates. Maximal degree in co-relation 1218. Up to 34 conditions per place. [2021-06-10 11:43:21,115 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 9 selfloop transitions, 1 changer transitions 0/810 dead transitions. [2021-06-10 11:43:21,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 810 transitions, 2033 flow [2021-06-10 11:43:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2610 transitions. [2021-06-10 11:43:21,116 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:43:21,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2610 transitions. [2021-06-10 11:43:21,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2610 transitions. [2021-06-10 11:43:21,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:21,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2610 transitions. [2021-06-10 11:43:21,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,119 INFO L185 Difference]: Start difference. First operand has 932 places, 812 transitions, 2025 flow. Second operand 3 states and 2610 transitions. [2021-06-10 11:43:21,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 810 transitions, 2033 flow [2021-06-10 11:43:21,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 810 transitions, 2032 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:21,128 INFO L241 Difference]: Finished difference. Result has 933 places, 810 transitions, 2014 flow [2021-06-10 11:43:21,128 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2014, PETRI_PLACES=933, PETRI_TRANSITIONS=810} [2021-06-10 11:43:21,128 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 54 predicate places. [2021-06-10 11:43:21,128 INFO L480 AbstractCegarLoop]: Abstraction has has 933 places, 810 transitions, 2014 flow [2021-06-10 11:43:21,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:21,129 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:21,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1743 [2021-06-10 11:43:21,129 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:21,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1969719215, now seen corresponding path program 1 times [2021-06-10 11:43:21,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:21,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184279177] [2021-06-10 11:43:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:21,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:21,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:21,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:43:21,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184279177] [2021-06-10 11:43:21,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:21,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:21,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677986807] [2021-06-10 11:43:21,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:21,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:21,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:21,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 810 transitions, 2014 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:21,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:21,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:21,536 INFO L129 PetriNetUnfolder]: 33/971 cut-off events. [2021-06-10 11:43:21,537 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:21,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 971 events. 33/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4273 event pairs, 0 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1212. Up to 34 conditions per place. [2021-06-10 11:43:21,593 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/807 dead transitions. [2021-06-10 11:43:21,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 807 transitions, 2015 flow [2021-06-10 11:43:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:21,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:21,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:21,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:21,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:21,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:21,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,598 INFO L185 Difference]: Start difference. First operand has 933 places, 810 transitions, 2014 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:21,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 807 transitions, 2015 flow [2021-06-10 11:43:21,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 807 transitions, 2010 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:21,606 INFO L241 Difference]: Finished difference. Result has 930 places, 807 transitions, 2000 flow [2021-06-10 11:43:21,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2000, PETRI_PLACES=930, PETRI_TRANSITIONS=807} [2021-06-10 11:43:21,606 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 51 predicate places. [2021-06-10 11:43:21,607 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 807 transitions, 2000 flow [2021-06-10 11:43:21,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:21,607 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:21,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1744 [2021-06-10 11:43:21,607 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash 936673406, now seen corresponding path program 1 times [2021-06-10 11:43:21,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:21,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330105041] [2021-06-10 11:43:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:21,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:21,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:21,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:21,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:43:21,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330105041] [2021-06-10 11:43:21,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:21,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:21,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714861268] [2021-06-10 11:43:21,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:21,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:21,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:21,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:21,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:21,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 807 transitions, 2000 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:21,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:21,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:21,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:22,031 INFO L129 PetriNetUnfolder]: 31/976 cut-off events. [2021-06-10 11:43:22,031 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:22,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 976 events. 31/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4326 event pairs, 0 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1220. Up to 34 conditions per place. [2021-06-10 11:43:22,088 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2021-06-10 11:43:22,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 808 transitions, 2016 flow [2021-06-10 11:43:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:22,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:22,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:22,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:22,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:22,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:22,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,093 INFO L185 Difference]: Start difference. First operand has 930 places, 807 transitions, 2000 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:22,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 808 transitions, 2016 flow [2021-06-10 11:43:22,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 808 transitions, 2015 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:22,102 INFO L241 Difference]: Finished difference. Result has 933 places, 808 transitions, 2013 flow [2021-06-10 11:43:22,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2013, PETRI_PLACES=933, PETRI_TRANSITIONS=808} [2021-06-10 11:43:22,102 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 54 predicate places. [2021-06-10 11:43:22,102 INFO L480 AbstractCegarLoop]: Abstraction has has 933 places, 808 transitions, 2013 flow [2021-06-10 11:43:22,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:22,102 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:22,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1745 [2021-06-10 11:43:22,103 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 936672383, now seen corresponding path program 1 times [2021-06-10 11:43:22,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:22,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454176669] [2021-06-10 11:43:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:22,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:22,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:22,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:43:22,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454176669] [2021-06-10 11:43:22,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:22,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:22,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091970635] [2021-06-10 11:43:22,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:22,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:22,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:22,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 808 transitions, 2013 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:22,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:22,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:22,569 INFO L129 PetriNetUnfolder]: 31/977 cut-off events. [2021-06-10 11:43:22,569 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:22,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 977 events. 31/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4335 event pairs, 0 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1226. Up to 34 conditions per place. [2021-06-10 11:43:22,604 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/809 dead transitions. [2021-06-10 11:43:22,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 809 transitions, 2039 flow [2021-06-10 11:43:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:22,606 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:22,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:22,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:22,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:22,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:22,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,608 INFO L185 Difference]: Start difference. First operand has 933 places, 808 transitions, 2013 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 809 transitions, 2039 flow [2021-06-10 11:43:22,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 809 transitions, 2037 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:22,616 INFO L241 Difference]: Finished difference. Result has 936 places, 809 transitions, 2029 flow [2021-06-10 11:43:22,617 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2029, PETRI_PLACES=936, PETRI_TRANSITIONS=809} [2021-06-10 11:43:22,617 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 57 predicate places. [2021-06-10 11:43:22,617 INFO L480 AbstractCegarLoop]: Abstraction has has 936 places, 809 transitions, 2029 flow [2021-06-10 11:43:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:22,617 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:22,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1746 [2021-06-10 11:43:22,617 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:22,617 INFO L82 PathProgramCache]: Analyzing trace with hash 937626718, now seen corresponding path program 1 times [2021-06-10 11:43:22,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:22,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925331097] [2021-06-10 11:43:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:22,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:22,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:22,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:22,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:43:22,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925331097] [2021-06-10 11:43:22,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:22,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:22,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774106479] [2021-06-10 11:43:22,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:22,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:22,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:22,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 809 transitions, 2029 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:22,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:22,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:22,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:23,030 INFO L129 PetriNetUnfolder]: 30/974 cut-off events. [2021-06-10 11:43:23,031 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-10 11:43:23,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 974 events. 30/974 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4316 event pairs, 0 based on Foata normal form. 2/913 useless extension candidates. Maximal degree in co-relation 1225. Up to 34 conditions per place. [2021-06-10 11:43:23,089 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 9 selfloop transitions, 1 changer transitions 0/807 dead transitions. [2021-06-10 11:43:23,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 807 transitions, 2037 flow [2021-06-10 11:43:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2610 transitions. [2021-06-10 11:43:23,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:43:23,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2610 transitions. [2021-06-10 11:43:23,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2610 transitions. [2021-06-10 11:43:23,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:23,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2610 transitions. [2021-06-10 11:43:23,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,093 INFO L185 Difference]: Start difference. First operand has 936 places, 809 transitions, 2029 flow. Second operand 3 states and 2610 transitions. [2021-06-10 11:43:23,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 807 transitions, 2037 flow [2021-06-10 11:43:23,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 807 transitions, 2036 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:23,102 INFO L241 Difference]: Finished difference. Result has 937 places, 807 transitions, 2018 flow [2021-06-10 11:43:23,103 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2018, PETRI_PLACES=937, PETRI_TRANSITIONS=807} [2021-06-10 11:43:23,103 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 58 predicate places. [2021-06-10 11:43:23,103 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 807 transitions, 2018 flow [2021-06-10 11:43:23,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:23,103 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:23,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1747 [2021-06-10 11:43:23,103 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 937625695, now seen corresponding path program 1 times [2021-06-10 11:43:23,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:23,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420943491] [2021-06-10 11:43:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:23,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:23,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:23,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:43:23,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420943491] [2021-06-10 11:43:23,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:23,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:23,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968480700] [2021-06-10 11:43:23,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:23,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:23,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:23,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:23,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:23,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 807 transitions, 2018 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:23,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:23,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:23,520 INFO L129 PetriNetUnfolder]: 30/971 cut-off events. [2021-06-10 11:43:23,520 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:23,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 971 events. 30/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4291 event pairs, 0 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 1219. Up to 34 conditions per place. [2021-06-10 11:43:23,576 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/804 dead transitions. [2021-06-10 11:43:23,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 804 transitions, 2019 flow [2021-06-10 11:43:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:23,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:23,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:23,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:23,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:23,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:23,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,581 INFO L185 Difference]: Start difference. First operand has 937 places, 807 transitions, 2018 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:23,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 804 transitions, 2019 flow [2021-06-10 11:43:23,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 804 transitions, 2014 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:23,589 INFO L241 Difference]: Finished difference. Result has 934 places, 804 transitions, 2004 flow [2021-06-10 11:43:23,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=803, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2004, PETRI_PLACES=934, PETRI_TRANSITIONS=804} [2021-06-10 11:43:23,589 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 55 predicate places. [2021-06-10 11:43:23,590 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 804 transitions, 2004 flow [2021-06-10 11:43:23,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:23,590 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:23,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1748 [2021-06-10 11:43:23,590 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1752297869, now seen corresponding path program 1 times [2021-06-10 11:43:23,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:23,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611300999] [2021-06-10 11:43:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:23,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:23,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:23,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:23,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:43:23,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611300999] [2021-06-10 11:43:23,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:23,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:23,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025654242] [2021-06-10 11:43:23,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:23,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:23,614 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:23,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 804 transitions, 2004 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:23,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:23,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:23,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:23,997 INFO L129 PetriNetUnfolder]: 28/976 cut-off events. [2021-06-10 11:43:23,997 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:24,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 976 events. 28/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4339 event pairs, 0 based on Foata normal form. 0/913 useless extension candidates. Maximal degree in co-relation 1227. Up to 34 conditions per place. [2021-06-10 11:43:24,054 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/805 dead transitions. [2021-06-10 11:43:24,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 805 transitions, 2020 flow [2021-06-10 11:43:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:24,056 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:24,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:24,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:24,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:24,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:24,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,059 INFO L185 Difference]: Start difference. First operand has 934 places, 804 transitions, 2004 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:24,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 805 transitions, 2020 flow [2021-06-10 11:43:24,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 805 transitions, 2019 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:24,067 INFO L241 Difference]: Finished difference. Result has 937 places, 805 transitions, 2017 flow [2021-06-10 11:43:24,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2017, PETRI_PLACES=937, PETRI_TRANSITIONS=805} [2021-06-10 11:43:24,068 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 58 predicate places. [2021-06-10 11:43:24,068 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 805 transitions, 2017 flow [2021-06-10 11:43:24,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:24,068 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:24,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1749 [2021-06-10 11:43:24,068 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1752296846, now seen corresponding path program 1 times [2021-06-10 11:43:24,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:24,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873534582] [2021-06-10 11:43:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:24,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:24,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:24,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:43:24,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873534582] [2021-06-10 11:43:24,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:24,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:24,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962422500] [2021-06-10 11:43:24,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:24,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:24,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:24,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 805 transitions, 2017 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:24,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:24,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:24,485 INFO L129 PetriNetUnfolder]: 28/977 cut-off events. [2021-06-10 11:43:24,485 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:24,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 977 events. 28/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4349 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1233. Up to 34 conditions per place. [2021-06-10 11:43:24,541 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/806 dead transitions. [2021-06-10 11:43:24,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 806 transitions, 2043 flow [2021-06-10 11:43:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:24,543 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:24,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:24,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:24,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:24,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:24,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,546 INFO L185 Difference]: Start difference. First operand has 937 places, 805 transitions, 2017 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:24,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 806 transitions, 2043 flow [2021-06-10 11:43:24,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 806 transitions, 2041 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:24,554 INFO L241 Difference]: Finished difference. Result has 940 places, 806 transitions, 2033 flow [2021-06-10 11:43:24,555 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2033, PETRI_PLACES=940, PETRI_TRANSITIONS=806} [2021-06-10 11:43:24,555 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 61 predicate places. [2021-06-10 11:43:24,555 INFO L480 AbstractCegarLoop]: Abstraction has has 940 places, 806 transitions, 2033 flow [2021-06-10 11:43:24,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,555 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:24,555 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:24,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1750 [2021-06-10 11:43:24,555 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1753250158, now seen corresponding path program 1 times [2021-06-10 11:43:24,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:24,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101424487] [2021-06-10 11:43:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:24,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:24,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:24,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:24,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:43:24,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101424487] [2021-06-10 11:43:24,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:24,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:24,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182064536] [2021-06-10 11:43:24,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:24,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:24,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:24,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:24,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:24,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 806 transitions, 2033 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:24,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:24,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:24,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:24,965 INFO L129 PetriNetUnfolder]: 27/973 cut-off events. [2021-06-10 11:43:24,965 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:25,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 973 events. 27/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4324 event pairs, 0 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1226. Up to 34 conditions per place. [2021-06-10 11:43:25,021 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/803 dead transitions. [2021-06-10 11:43:25,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 803 transitions, 2030 flow [2021-06-10 11:43:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:25,023 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:25,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:25,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:25,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:25,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:25,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,025 INFO L185 Difference]: Start difference. First operand has 940 places, 806 transitions, 2033 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:25,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 803 transitions, 2030 flow [2021-06-10 11:43:25,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 803 transitions, 2022 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:25,034 INFO L241 Difference]: Finished difference. Result has 939 places, 803 transitions, 2012 flow [2021-06-10 11:43:25,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2012, PETRI_PLACES=939, PETRI_TRANSITIONS=803} [2021-06-10 11:43:25,034 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 60 predicate places. [2021-06-10 11:43:25,034 INFO L480 AbstractCegarLoop]: Abstraction has has 939 places, 803 transitions, 2012 flow [2021-06-10 11:43:25,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:25,035 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:25,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1751 [2021-06-10 11:43:25,035 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:25,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1753251181, now seen corresponding path program 1 times [2021-06-10 11:43:25,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:25,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786166269] [2021-06-10 11:43:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:25,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:25,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:25,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:43:25,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786166269] [2021-06-10 11:43:25,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:25,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:25,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886085715] [2021-06-10 11:43:25,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:25,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:25,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:25,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 803 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:25,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:25,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:25,456 INFO L129 PetriNetUnfolder]: 27/971 cut-off events. [2021-06-10 11:43:25,456 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:25,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 971 events. 27/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4307 event pairs, 0 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1229. Up to 34 conditions per place. [2021-06-10 11:43:25,514 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/801 dead transitions. [2021-06-10 11:43:25,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 801 transitions, 2025 flow [2021-06-10 11:43:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:25,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:25,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:25,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:25,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:25,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:25,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,518 INFO L185 Difference]: Start difference. First operand has 939 places, 803 transitions, 2012 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 801 transitions, 2025 flow [2021-06-10 11:43:25,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 801 transitions, 2024 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:25,527 INFO L241 Difference]: Finished difference. Result has 938 places, 801 transitions, 2008 flow [2021-06-10 11:43:25,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2008, PETRI_PLACES=938, PETRI_TRANSITIONS=801} [2021-06-10 11:43:25,527 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 59 predicate places. [2021-06-10 11:43:25,528 INFO L480 AbstractCegarLoop]: Abstraction has has 938 places, 801 transitions, 2008 flow [2021-06-10 11:43:25,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:25,528 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:25,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1752 [2021-06-10 11:43:25,528 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash -337591267, now seen corresponding path program 1 times [2021-06-10 11:43:25,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:25,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956248758] [2021-06-10 11:43:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:25,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:25,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:25,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:25,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:43:25,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956248758] [2021-06-10 11:43:25,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:25,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:25,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552708696] [2021-06-10 11:43:25,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:25,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:25,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:25,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 801 transitions, 2008 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:25,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:25,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:25,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:25,944 INFO L129 PetriNetUnfolder]: 25/976 cut-off events. [2021-06-10 11:43:25,945 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:25,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 976 events. 25/976 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4360 event pairs, 0 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1232. Up to 34 conditions per place. [2021-06-10 11:43:26,002 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/802 dead transitions. [2021-06-10 11:43:26,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 802 transitions, 2024 flow [2021-06-10 11:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:26,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:26,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:26,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:26,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:26,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:26,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,006 INFO L185 Difference]: Start difference. First operand has 938 places, 801 transitions, 2008 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:26,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 802 transitions, 2024 flow [2021-06-10 11:43:26,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 802 transitions, 2023 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:26,015 INFO L241 Difference]: Finished difference. Result has 941 places, 802 transitions, 2021 flow [2021-06-10 11:43:26,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2021, PETRI_PLACES=941, PETRI_TRANSITIONS=802} [2021-06-10 11:43:26,015 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 62 predicate places. [2021-06-10 11:43:26,015 INFO L480 AbstractCegarLoop]: Abstraction has has 941 places, 802 transitions, 2021 flow [2021-06-10 11:43:26,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:26,016 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:26,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1753 [2021-06-10 11:43:26,016 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash -337592290, now seen corresponding path program 1 times [2021-06-10 11:43:26,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:26,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236499927] [2021-06-10 11:43:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:26,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:26,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:26,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:43:26,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236499927] [2021-06-10 11:43:26,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:26,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:26,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224046000] [2021-06-10 11:43:26,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:26,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:26,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:26,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:26,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 802 transitions, 2021 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:26,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:26,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:26,451 INFO L129 PetriNetUnfolder]: 25/977 cut-off events. [2021-06-10 11:43:26,452 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:26,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 977 events. 25/977 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4367 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1240. Up to 34 conditions per place. [2021-06-10 11:43:26,509 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/803 dead transitions. [2021-06-10 11:43:26,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 803 transitions, 2047 flow [2021-06-10 11:43:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:26,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:26,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:26,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:26,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:26,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:26,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,513 INFO L185 Difference]: Start difference. First operand has 941 places, 802 transitions, 2021 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:26,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 803 transitions, 2047 flow [2021-06-10 11:43:26,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 803 transitions, 2045 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:26,522 INFO L241 Difference]: Finished difference. Result has 944 places, 803 transitions, 2037 flow [2021-06-10 11:43:26,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2037, PETRI_PLACES=944, PETRI_TRANSITIONS=803} [2021-06-10 11:43:26,522 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 65 predicate places. [2021-06-10 11:43:26,522 INFO L480 AbstractCegarLoop]: Abstraction has has 944 places, 803 transitions, 2037 flow [2021-06-10 11:43:26,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:26,522 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:26,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1754 [2021-06-10 11:43:26,522 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash -336637955, now seen corresponding path program 1 times [2021-06-10 11:43:26,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:26,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968487528] [2021-06-10 11:43:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:26,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:26,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:26,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:26,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:43:26,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968487528] [2021-06-10 11:43:26,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:26,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:26,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539103139] [2021-06-10 11:43:26,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:26,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:26,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:26,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:26,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:26,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 803 transitions, 2037 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:26,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:26,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:26,924 INFO L129 PetriNetUnfolder]: 24/974 cut-off events. [2021-06-10 11:43:26,924 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-10 11:43:26,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 974 events. 24/974 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4352 event pairs, 0 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 1239. Up to 34 conditions per place. [2021-06-10 11:43:26,973 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 9 selfloop transitions, 1 changer transitions 0/801 dead transitions. [2021-06-10 11:43:26,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 801 transitions, 2045 flow [2021-06-10 11:43:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2610 transitions. [2021-06-10 11:43:26,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:43:26,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2610 transitions. [2021-06-10 11:43:26,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2610 transitions. [2021-06-10 11:43:26,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:26,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2610 transitions. [2021-06-10 11:43:26,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,977 INFO L185 Difference]: Start difference. First operand has 944 places, 803 transitions, 2037 flow. Second operand 3 states and 2610 transitions. [2021-06-10 11:43:26,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 801 transitions, 2045 flow [2021-06-10 11:43:26,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 801 transitions, 2044 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:26,985 INFO L241 Difference]: Finished difference. Result has 945 places, 801 transitions, 2026 flow [2021-06-10 11:43:26,986 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2026, PETRI_PLACES=945, PETRI_TRANSITIONS=801} [2021-06-10 11:43:26,986 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 66 predicate places. [2021-06-10 11:43:26,986 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 801 transitions, 2026 flow [2021-06-10 11:43:26,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:26,986 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:26,986 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:26,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1755 [2021-06-10 11:43:26,986 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -336638978, now seen corresponding path program 1 times [2021-06-10 11:43:26,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:26,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893193157] [2021-06-10 11:43:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:27,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:27,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:43:27,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893193157] [2021-06-10 11:43:27,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:27,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:27,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286712477] [2021-06-10 11:43:27,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:27,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:27,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:27,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 801 transitions, 2026 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:27,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:27,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:27,392 INFO L129 PetriNetUnfolder]: 24/971 cut-off events. [2021-06-10 11:43:27,393 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:27,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 971 events. 24/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4329 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1233. Up to 34 conditions per place. [2021-06-10 11:43:27,448 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/798 dead transitions. [2021-06-10 11:43:27,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 798 transitions, 2027 flow [2021-06-10 11:43:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:27,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:27,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:27,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:27,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:27,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:27,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,452 INFO L185 Difference]: Start difference. First operand has 945 places, 801 transitions, 2026 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:27,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 798 transitions, 2027 flow [2021-06-10 11:43:27,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 798 transitions, 2022 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:27,461 INFO L241 Difference]: Finished difference. Result has 942 places, 798 transitions, 2012 flow [2021-06-10 11:43:27,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2012, PETRI_PLACES=942, PETRI_TRANSITIONS=798} [2021-06-10 11:43:27,462 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 63 predicate places. [2021-06-10 11:43:27,462 INFO L480 AbstractCegarLoop]: Abstraction has has 942 places, 798 transitions, 2012 flow [2021-06-10 11:43:27,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:27,462 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:27,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1756 [2021-06-10 11:43:27,462 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1085719182, now seen corresponding path program 1 times [2021-06-10 11:43:27,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:27,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380263891] [2021-06-10 11:43:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:27,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:27,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:43:27,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380263891] [2021-06-10 11:43:27,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:27,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:27,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819947417] [2021-06-10 11:43:27,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:27,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:27,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:27,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 798 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:27,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:27,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:27,896 INFO L129 PetriNetUnfolder]: 23/979 cut-off events. [2021-06-10 11:43:27,896 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:27,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 979 events. 23/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4398 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1250. Up to 34 conditions per place. [2021-06-10 11:43:27,953 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/800 dead transitions. [2021-06-10 11:43:27,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 800 transitions, 2042 flow [2021-06-10 11:43:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:27,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:27,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:27,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:27,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:27,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:27,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,957 INFO L185 Difference]: Start difference. First operand has 942 places, 798 transitions, 2012 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:27,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 800 transitions, 2042 flow [2021-06-10 11:43:27,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 800 transitions, 2041 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:27,966 INFO L241 Difference]: Finished difference. Result has 945 places, 800 transitions, 2035 flow [2021-06-10 11:43:27,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2035, PETRI_PLACES=945, PETRI_TRANSITIONS=800} [2021-06-10 11:43:27,966 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 66 predicate places. [2021-06-10 11:43:27,966 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 800 transitions, 2035 flow [2021-06-10 11:43:27,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:27,966 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:27,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1757 [2021-06-10 11:43:27,966 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1085718159, now seen corresponding path program 1 times [2021-06-10 11:43:27,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:27,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400647566] [2021-06-10 11:43:27,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:27,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:27,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:27,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:43:27,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400647566] [2021-06-10 11:43:27,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:27,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:27,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107259585] [2021-06-10 11:43:27,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:27,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:27,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:27,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 800 transitions, 2035 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:27,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:27,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:27,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:28,388 INFO L129 PetriNetUnfolder]: 21/980 cut-off events. [2021-06-10 11:43:28,388 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:28,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 980 events. 21/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4416 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1248. Up to 34 conditions per place. [2021-06-10 11:43:28,446 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/800 dead transitions. [2021-06-10 11:43:28,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 800 transitions, 2047 flow [2021-06-10 11:43:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:28,447 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:28,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:28,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:28,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:28,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:28,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,450 INFO L185 Difference]: Start difference. First operand has 945 places, 800 transitions, 2035 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:28,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 800 transitions, 2047 flow [2021-06-10 11:43:28,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 800 transitions, 2042 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:28,459 INFO L241 Difference]: Finished difference. Result has 947 places, 799 transitions, 2031 flow [2021-06-10 11:43:28,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2031, PETRI_PLACES=947, PETRI_TRANSITIONS=799} [2021-06-10 11:43:28,459 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 68 predicate places. [2021-06-10 11:43:28,459 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 799 transitions, 2031 flow [2021-06-10 11:43:28,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,460 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:28,460 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:28,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1758 [2021-06-10 11:43:28,460 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1084765870, now seen corresponding path program 1 times [2021-06-10 11:43:28,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:28,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614490908] [2021-06-10 11:43:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:28,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:28,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:28,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:43:28,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614490908] [2021-06-10 11:43:28,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:28,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:28,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167556497] [2021-06-10 11:43:28,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:28,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:28,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:28,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 799 transitions, 2031 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:28,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:28,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:28,861 INFO L129 PetriNetUnfolder]: 21/973 cut-off events. [2021-06-10 11:43:28,861 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:28,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 973 events. 21/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4358 event pairs, 0 based on Foata normal form. 1/921 useless extension candidates. Maximal degree in co-relation 1242. Up to 34 conditions per place. [2021-06-10 11:43:28,902 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/797 dead transitions. [2021-06-10 11:43:28,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 797 transitions, 2034 flow [2021-06-10 11:43:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:28,903 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:28,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:28,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:28,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:28,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:28,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,906 INFO L185 Difference]: Start difference. First operand has 947 places, 799 transitions, 2031 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:28,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 797 transitions, 2034 flow [2021-06-10 11:43:28,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 797 transitions, 2027 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:28,914 INFO L241 Difference]: Finished difference. Result has 947 places, 797 transitions, 2020 flow [2021-06-10 11:43:28,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2020, PETRI_PLACES=947, PETRI_TRANSITIONS=797} [2021-06-10 11:43:28,915 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 68 predicate places. [2021-06-10 11:43:28,915 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 797 transitions, 2020 flow [2021-06-10 11:43:28,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,915 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:28,915 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:28,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1759 [2021-06-10 11:43:28,915 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1084764847, now seen corresponding path program 1 times [2021-06-10 11:43:28,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:28,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596455302] [2021-06-10 11:43:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:28,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:28,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:28,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:28,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:43:28,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596455302] [2021-06-10 11:43:28,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:28,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:28,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615991329] [2021-06-10 11:43:28,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:28,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:28,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:28,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 797 transitions, 2020 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:28,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:28,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:28,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:29,339 INFO L129 PetriNetUnfolder]: 21/971 cut-off events. [2021-06-10 11:43:29,339 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:29,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 971 events. 21/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4342 event pairs, 0 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1242. Up to 34 conditions per place. [2021-06-10 11:43:29,394 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/795 dead transitions. [2021-06-10 11:43:29,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 795 transitions, 2033 flow [2021-06-10 11:43:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:29,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:29,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:29,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:29,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:29,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:29,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,398 INFO L185 Difference]: Start difference. First operand has 947 places, 797 transitions, 2020 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:29,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 795 transitions, 2033 flow [2021-06-10 11:43:29,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 795 transitions, 2032 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:29,407 INFO L241 Difference]: Finished difference. Result has 946 places, 795 transitions, 2016 flow [2021-06-10 11:43:29,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2016, PETRI_PLACES=946, PETRI_TRANSITIONS=795} [2021-06-10 11:43:29,407 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 67 predicate places. [2021-06-10 11:43:29,407 INFO L480 AbstractCegarLoop]: Abstraction has has 946 places, 795 transitions, 2016 flow [2021-06-10 11:43:29,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:29,407 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:29,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1760 [2021-06-10 11:43:29,408 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash -316255328, now seen corresponding path program 1 times [2021-06-10 11:43:29,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:29,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270984652] [2021-06-10 11:43:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:29,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:29,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:29,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:43:29,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270984652] [2021-06-10 11:43:29,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:29,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:29,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441703385] [2021-06-10 11:43:29,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:29,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:29,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:29,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 795 transitions, 2016 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:29,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:29,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:29,833 INFO L129 PetriNetUnfolder]: 20/979 cut-off events. [2021-06-10 11:43:29,834 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:29,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 979 events. 20/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4414 event pairs, 0 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1254. Up to 34 conditions per place. [2021-06-10 11:43:29,889 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/797 dead transitions. [2021-06-10 11:43:29,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 797 transitions, 2046 flow [2021-06-10 11:43:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:29,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:29,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:29,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:29,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:29,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:29,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,894 INFO L185 Difference]: Start difference. First operand has 946 places, 795 transitions, 2016 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:29,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 797 transitions, 2046 flow [2021-06-10 11:43:29,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 797 transitions, 2045 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:29,902 INFO L241 Difference]: Finished difference. Result has 949 places, 797 transitions, 2039 flow [2021-06-10 11:43:29,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2039, PETRI_PLACES=949, PETRI_TRANSITIONS=797} [2021-06-10 11:43:29,903 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 70 predicate places. [2021-06-10 11:43:29,903 INFO L480 AbstractCegarLoop]: Abstraction has has 949 places, 797 transitions, 2039 flow [2021-06-10 11:43:29,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:29,903 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:29,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1761 [2021-06-10 11:43:29,903 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash -316256351, now seen corresponding path program 1 times [2021-06-10 11:43:29,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:29,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947019255] [2021-06-10 11:43:29,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:29,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:29,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:29,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:29,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:43:29,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947019255] [2021-06-10 11:43:29,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:29,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:29,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493935774] [2021-06-10 11:43:29,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:29,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:29,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:29,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 797 transitions, 2039 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:29,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:29,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:29,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:30,340 INFO L129 PetriNetUnfolder]: 18/980 cut-off events. [2021-06-10 11:43:30,340 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:30,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 980 events. 18/980 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4435 event pairs, 0 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1254. Up to 34 conditions per place. [2021-06-10 11:43:30,397 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/797 dead transitions. [2021-06-10 11:43:30,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 797 transitions, 2051 flow [2021-06-10 11:43:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:30,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:30,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:30,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:30,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:30,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:30,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,401 INFO L185 Difference]: Start difference. First operand has 949 places, 797 transitions, 2039 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:30,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 797 transitions, 2051 flow [2021-06-10 11:43:30,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 797 transitions, 2046 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:30,410 INFO L241 Difference]: Finished difference. Result has 951 places, 796 transitions, 2035 flow [2021-06-10 11:43:30,410 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2035, PETRI_PLACES=951, PETRI_TRANSITIONS=796} [2021-06-10 11:43:30,410 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 72 predicate places. [2021-06-10 11:43:30,410 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 796 transitions, 2035 flow [2021-06-10 11:43:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,410 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:30,410 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:30,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1762 [2021-06-10 11:43:30,410 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -317208640, now seen corresponding path program 1 times [2021-06-10 11:43:30,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:30,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111697182] [2021-06-10 11:43:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:30,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:30,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:30,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:43:30,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111697182] [2021-06-10 11:43:30,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:30,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:30,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945767309] [2021-06-10 11:43:30,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:30,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:30,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:30,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 796 transitions, 2035 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:30,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:30,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:30,838 INFO L129 PetriNetUnfolder]: 18/973 cut-off events. [2021-06-10 11:43:30,839 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:30,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 973 events. 18/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4375 event pairs, 0 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 1248. Up to 34 conditions per place. [2021-06-10 11:43:30,876 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/794 dead transitions. [2021-06-10 11:43:30,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 794 transitions, 2038 flow [2021-06-10 11:43:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:30,877 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:30,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:30,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:30,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:30,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:30,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,880 INFO L185 Difference]: Start difference. First operand has 951 places, 796 transitions, 2035 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:30,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 794 transitions, 2038 flow [2021-06-10 11:43:30,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 794 transitions, 2031 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:30,888 INFO L241 Difference]: Finished difference. Result has 951 places, 794 transitions, 2024 flow [2021-06-10 11:43:30,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2024, PETRI_PLACES=951, PETRI_TRANSITIONS=794} [2021-06-10 11:43:30,888 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 72 predicate places. [2021-06-10 11:43:30,888 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 794 transitions, 2024 flow [2021-06-10 11:43:30,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,889 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:30,889 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:30,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1763 [2021-06-10 11:43:30,889 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash -317209663, now seen corresponding path program 1 times [2021-06-10 11:43:30,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:30,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577698343] [2021-06-10 11:43:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:30,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:30,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:30,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:30,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:43:30,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577698343] [2021-06-10 11:43:30,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:30,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:30,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456398629] [2021-06-10 11:43:30,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:30,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:30,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:30,915 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:30,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 794 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:30,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:30,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:30,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:31,313 INFO L129 PetriNetUnfolder]: 18/971 cut-off events. [2021-06-10 11:43:31,313 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:31,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 971 events. 18/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4359 event pairs, 0 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1248. Up to 34 conditions per place. [2021-06-10 11:43:31,369 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/792 dead transitions. [2021-06-10 11:43:31,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 792 transitions, 2037 flow [2021-06-10 11:43:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:31,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:31,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:31,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:31,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:31,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:31,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,373 INFO L185 Difference]: Start difference. First operand has 951 places, 794 transitions, 2024 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 792 transitions, 2037 flow [2021-06-10 11:43:31,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 792 transitions, 2036 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:31,382 INFO L241 Difference]: Finished difference. Result has 950 places, 792 transitions, 2020 flow [2021-06-10 11:43:31,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2020, PETRI_PLACES=950, PETRI_TRANSITIONS=792} [2021-06-10 11:43:31,382 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 71 predicate places. [2021-06-10 11:43:31,382 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 792 transitions, 2020 flow [2021-06-10 11:43:31,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:31,382 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:31,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1764 [2021-06-10 11:43:31,383 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash -311465292, now seen corresponding path program 1 times [2021-06-10 11:43:31,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:31,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521374136] [2021-06-10 11:43:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:31,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:31,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:31,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:43:31,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521374136] [2021-06-10 11:43:31,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:31,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:31,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949886686] [2021-06-10 11:43:31,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:31,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:31,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:31,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:31,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:31,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 792 transitions, 2020 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:31,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:31,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:31,811 INFO L129 PetriNetUnfolder]: 17/978 cut-off events. [2021-06-10 11:43:31,811 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:31,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 978 events. 17/978 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4421 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1253. Up to 34 conditions per place. [2021-06-10 11:43:31,867 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 6 selfloop transitions, 1 changer transitions 0/793 dead transitions. [2021-06-10 11:43:31,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 793 transitions, 2036 flow [2021-06-10 11:43:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:31,869 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:31,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:31,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:31,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:31,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:31,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,871 INFO L185 Difference]: Start difference. First operand has 950 places, 792 transitions, 2020 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:31,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 793 transitions, 2036 flow [2021-06-10 11:43:31,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 793 transitions, 2035 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:31,880 INFO L241 Difference]: Finished difference. Result has 952 places, 792 transitions, 2024 flow [2021-06-10 11:43:31,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2024, PETRI_PLACES=952, PETRI_TRANSITIONS=792} [2021-06-10 11:43:31,880 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 73 predicate places. [2021-06-10 11:43:31,880 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 792 transitions, 2024 flow [2021-06-10 11:43:31,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:31,881 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:31,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1765 [2021-06-10 11:43:31,881 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -311464269, now seen corresponding path program 1 times [2021-06-10 11:43:31,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:31,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745344733] [2021-06-10 11:43:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:31,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:31,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:31,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:31,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:43:31,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745344733] [2021-06-10 11:43:31,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:31,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:31,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792838912] [2021-06-10 11:43:31,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:31,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:31,907 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:31,908 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 792 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:31,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:31,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:31,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:32,327 INFO L129 PetriNetUnfolder]: 15/980 cut-off events. [2021-06-10 11:43:32,327 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:32,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 980 events. 15/980 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4451 event pairs, 0 based on Foata normal form. 0/930 useless extension candidates. Maximal degree in co-relation 1264. Up to 34 conditions per place. [2021-06-10 11:43:32,383 INFO L132 encePairwiseOnDemand]: 941/945 looper letters, 9 selfloop transitions, 3 changer transitions 0/793 dead transitions. [2021-06-10 11:43:32,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 793 transitions, 2050 flow [2021-06-10 11:43:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2611 transitions. [2021-06-10 11:43:32,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9209876543209876 [2021-06-10 11:43:32,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2611 transitions. [2021-06-10 11:43:32,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2611 transitions. [2021-06-10 11:43:32,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:32,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2611 transitions. [2021-06-10 11:43:32,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,388 INFO L185 Difference]: Start difference. First operand has 952 places, 792 transitions, 2024 flow. Second operand 3 states and 2611 transitions. [2021-06-10 11:43:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 793 transitions, 2050 flow [2021-06-10 11:43:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 793 transitions, 2049 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:32,396 INFO L241 Difference]: Finished difference. Result has 955 places, 793 transitions, 2041 flow [2021-06-10 11:43:32,397 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=955, PETRI_TRANSITIONS=793} [2021-06-10 11:43:32,397 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 76 predicate places. [2021-06-10 11:43:32,397 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 793 transitions, 2041 flow [2021-06-10 11:43:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,397 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:32,397 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:32,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1766 [2021-06-10 11:43:32,397 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -312417581, now seen corresponding path program 1 times [2021-06-10 11:43:32,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:32,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889253370] [2021-06-10 11:43:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:32,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:32,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:32,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:43:32,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889253370] [2021-06-10 11:43:32,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:32,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:32,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871330467] [2021-06-10 11:43:32,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:32,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:32,431 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:32,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 793 transitions, 2041 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:32,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:32,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:32,858 INFO L129 PetriNetUnfolder]: 15/973 cut-off events. [2021-06-10 11:43:32,858 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:32,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 973 events. 15/973 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4393 event pairs, 0 based on Foata normal form. 1/927 useless extension candidates. Maximal degree in co-relation 1250. Up to 34 conditions per place. [2021-06-10 11:43:32,895 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/791 dead transitions. [2021-06-10 11:43:32,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 791 transitions, 2043 flow [2021-06-10 11:43:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:32,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:32,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:32,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:32,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:32,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:32,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,899 INFO L185 Difference]: Start difference. First operand has 955 places, 793 transitions, 2041 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:32,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 791 transitions, 2043 flow [2021-06-10 11:43:32,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 791 transitions, 2035 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:32,908 INFO L241 Difference]: Finished difference. Result has 955 places, 791 transitions, 2028 flow [2021-06-10 11:43:32,908 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2028, PETRI_PLACES=955, PETRI_TRANSITIONS=791} [2021-06-10 11:43:32,908 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 76 predicate places. [2021-06-10 11:43:32,908 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 791 transitions, 2028 flow [2021-06-10 11:43:32,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,908 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:32,908 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:32,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1767 [2021-06-10 11:43:32,909 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -312418604, now seen corresponding path program 1 times [2021-06-10 11:43:32,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:32,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453332578] [2021-06-10 11:43:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:32,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:32,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:32,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:32,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:43:32,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453332578] [2021-06-10 11:43:32,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:32,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:32,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681058115] [2021-06-10 11:43:32,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:32,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:32,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:32,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:32,936 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:32,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 791 transitions, 2028 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:32,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:32,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:32,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:33,352 INFO L129 PetriNetUnfolder]: 15/971 cut-off events. [2021-06-10 11:43:33,352 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:33,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 971 events. 15/971 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4377 event pairs, 0 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1254. Up to 34 conditions per place. [2021-06-10 11:43:33,408 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/789 dead transitions. [2021-06-10 11:43:33,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 789 transitions, 2041 flow [2021-06-10 11:43:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:33,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:33,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:33,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:33,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:33,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:33,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,412 INFO L185 Difference]: Start difference. First operand has 955 places, 791 transitions, 2028 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:33,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 789 transitions, 2041 flow [2021-06-10 11:43:33,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 789 transitions, 2040 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:33,421 INFO L241 Difference]: Finished difference. Result has 954 places, 789 transitions, 2024 flow [2021-06-10 11:43:33,422 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2024, PETRI_PLACES=954, PETRI_TRANSITIONS=789} [2021-06-10 11:43:33,422 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 75 predicate places. [2021-06-10 11:43:33,422 INFO L480 AbstractCegarLoop]: Abstraction has has 954 places, 789 transitions, 2024 flow [2021-06-10 11:43:33,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:33,422 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:33,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1768 [2021-06-10 11:43:33,422 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1897010072, now seen corresponding path program 1 times [2021-06-10 11:43:33,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:33,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696747631] [2021-06-10 11:43:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:33,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:33,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:33,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:43:33,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696747631] [2021-06-10 11:43:33,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:33,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:33,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64895417] [2021-06-10 11:43:33,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:33,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:33,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:33,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 789 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:33,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:33,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:33,866 INFO L129 PetriNetUnfolder]: 14/979 cut-off events. [2021-06-10 11:43:33,866 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:33,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 979 events. 14/979 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4447 event pairs, 0 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1266. Up to 34 conditions per place. [2021-06-10 11:43:33,922 INFO L132 encePairwiseOnDemand]: 940/945 looper letters, 10 selfloop transitions, 3 changer transitions 0/791 dead transitions. [2021-06-10 11:43:33,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 791 transitions, 2054 flow [2021-06-10 11:43:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2613 transitions. [2021-06-10 11:43:33,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216931216931217 [2021-06-10 11:43:33,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2613 transitions. [2021-06-10 11:43:33,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2613 transitions. [2021-06-10 11:43:33,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:33,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2613 transitions. [2021-06-10 11:43:33,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 871.0) internal successors, (2613), 3 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,927 INFO L185 Difference]: Start difference. First operand has 954 places, 789 transitions, 2024 flow. Second operand 3 states and 2613 transitions. [2021-06-10 11:43:33,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 791 transitions, 2054 flow [2021-06-10 11:43:33,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 791 transitions, 2053 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:33,936 INFO L241 Difference]: Finished difference. Result has 957 places, 791 transitions, 2047 flow [2021-06-10 11:43:33,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2047, PETRI_PLACES=957, PETRI_TRANSITIONS=791} [2021-06-10 11:43:33,936 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 78 predicate places. [2021-06-10 11:43:33,936 INFO L480 AbstractCegarLoop]: Abstraction has has 957 places, 791 transitions, 2047 flow [2021-06-10 11:43:33,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:33,936 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:33,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1769 [2021-06-10 11:43:33,936 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1897009049, now seen corresponding path program 1 times [2021-06-10 11:43:33,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:33,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397326158] [2021-06-10 11:43:33,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:33,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:33,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:33,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:33,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:43:33,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397326158] [2021-06-10 11:43:33,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:33,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:33,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803235219] [2021-06-10 11:43:33,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:33,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:33,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:33,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 791 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:33,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:33,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:33,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:34,371 INFO L129 PetriNetUnfolder]: 13/977 cut-off events. [2021-06-10 11:43:34,371 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:34,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 977 events. 13/977 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4437 event pairs, 0 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1263. Up to 34 conditions per place. [2021-06-10 11:43:34,427 INFO L132 encePairwiseOnDemand]: 942/945 looper letters, 5 selfloop transitions, 2 changer transitions 0/791 dead transitions. [2021-06-10 11:43:34,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 791 transitions, 2059 flow [2021-06-10 11:43:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2621 transitions. [2021-06-10 11:43:34,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245149911816578 [2021-06-10 11:43:34,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2621 transitions. [2021-06-10 11:43:34,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2621 transitions. [2021-06-10 11:43:34,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:34,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2621 transitions. [2021-06-10 11:43:34,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.6666666666666) internal successors, (2621), 3 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,432 INFO L185 Difference]: Start difference. First operand has 957 places, 791 transitions, 2047 flow. Second operand 3 states and 2621 transitions. [2021-06-10 11:43:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 791 transitions, 2059 flow [2021-06-10 11:43:34,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 791 transitions, 2054 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:34,440 INFO L241 Difference]: Finished difference. Result has 960 places, 791 transitions, 2052 flow [2021-06-10 11:43:34,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2052, PETRI_PLACES=960, PETRI_TRANSITIONS=791} [2021-06-10 11:43:34,441 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 81 predicate places. [2021-06-10 11:43:34,441 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 791 transitions, 2052 flow [2021-06-10 11:43:34,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:34,441 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:34,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1770 [2021-06-10 11:43:34,441 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:34,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1896056760, now seen corresponding path program 1 times [2021-06-10 11:43:34,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:34,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203035829] [2021-06-10 11:43:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:34,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:34,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:34,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:43:34,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203035829] [2021-06-10 11:43:34,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:34,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:34,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838712220] [2021-06-10 11:43:34,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:34,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:34,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 871 out of 945 [2021-06-10 11:43:34,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 791 transitions, 2052 flow. Second operand has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:34,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 871 of 945 [2021-06-10 11:43:34,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:34,920 INFO L129 PetriNetUnfolder]: 12/973 cut-off events. [2021-06-10 11:43:34,920 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:34,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 973 events. 12/973 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4414 event pairs, 0 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 1260. Up to 34 conditions per place. [2021-06-10 11:43:34,955 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 5 selfloop transitions, 1 changer transitions 0/788 dead transitions. [2021-06-10 11:43:34,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 788 transitions, 2049 flow [2021-06-10 11:43:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2620 transitions. [2021-06-10 11:43:34,957 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9241622574955908 [2021-06-10 11:43:34,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2620 transitions. [2021-06-10 11:43:34,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2620 transitions. [2021-06-10 11:43:34,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:34,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2620 transitions. [2021-06-10 11:43:34,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 873.3333333333334) internal successors, (2620), 3 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,959 INFO L185 Difference]: Start difference. First operand has 960 places, 791 transitions, 2052 flow. Second operand 3 states and 2620 transitions. [2021-06-10 11:43:34,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 788 transitions, 2049 flow [2021-06-10 11:43:34,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 788 transitions, 2042 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:34,967 INFO L241 Difference]: Finished difference. Result has 959 places, 788 transitions, 2032 flow [2021-06-10 11:43:34,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2032, PETRI_PLACES=959, PETRI_TRANSITIONS=788} [2021-06-10 11:43:34,968 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 80 predicate places. [2021-06-10 11:43:34,968 INFO L480 AbstractCegarLoop]: Abstraction has has 959 places, 788 transitions, 2032 flow [2021-06-10 11:43:34,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 872.3333333333334) internal successors, (2617), 3 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:34,968 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:34,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1771 [2021-06-10 11:43:34,968 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1896055737, now seen corresponding path program 1 times [2021-06-10 11:43:34,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:34,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146418942] [2021-06-10 11:43:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:34,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:34,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:34,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:34,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:43:34,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146418942] [2021-06-10 11:43:34,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:34,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:34,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128893651] [2021-06-10 11:43:34,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:34,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:34,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:34,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:34,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 866 out of 945 [2021-06-10 11:43:34,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 788 transitions, 2032 flow. Second operand has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:34,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:34,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 866 of 945 [2021-06-10 11:43:34,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:35,414 INFO L129 PetriNetUnfolder]: 12/971 cut-off events. [2021-06-10 11:43:35,414 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-06-10 11:43:35,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 971 events. 12/971 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4399 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1261. Up to 34 conditions per place. [2021-06-10 11:43:35,470 INFO L132 encePairwiseOnDemand]: 943/945 looper letters, 8 selfloop transitions, 1 changer transitions 0/786 dead transitions. [2021-06-10 11:43:35,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 786 transitions, 2045 flow [2021-06-10 11:43:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2608 transitions. [2021-06-10 11:43:35,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9199294532627866 [2021-06-10 11:43:35,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2608 transitions. [2021-06-10 11:43:35,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2608 transitions. [2021-06-10 11:43:35,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:35,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2608 transitions. [2021-06-10 11:43:35,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:35,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:35,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 945.0) internal successors, (3780), 4 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:35,474 INFO L185 Difference]: Start difference. First operand has 959 places, 788 transitions, 2032 flow. Second operand 3 states and 2608 transitions. [2021-06-10 11:43:35,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 786 transitions, 2045 flow [2021-06-10 11:43:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 786 transitions, 2044 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:35,483 INFO L241 Difference]: Finished difference. Result has 958 places, 786 transitions, 2028 flow [2021-06-10 11:43:35,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=945, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2028, PETRI_PLACES=958, PETRI_TRANSITIONS=786} [2021-06-10 11:43:35,483 INFO L343 CegarLoopForPetriNet]: 879 programPoint places, 79 predicate places. [2021-06-10 11:43:35,483 INFO L480 AbstractCegarLoop]: Abstraction has has 958 places, 786 transitions, 2028 flow [2021-06-10 11:43:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 868.3333333333334) internal successors, (2605), 3 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:35,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:35,484 INFO L263 CegarLoopForPetriNet]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:35,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1772 [2021-06-10 11:43:35,484 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1573635603, now seen corresponding path program 1 times [2021-06-10 11:43:35,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:35,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044050251] [2021-06-10 11:43:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:43:35,503 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:43:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:43:35,509 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:43:35,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:43:35,528 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:43:35,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1773 [2021-06-10 11:43:35,528 WARN L342 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:43:35,528 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2021-06-10 11:43:35,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,687 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of34ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of34ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:43:35,699 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:43:35,699 INFO L253 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2021-06-10 11:43:35,699 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:43:35,699 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:43:35,699 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:43:35,699 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:43:35,699 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:43:35,699 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:43:35,699 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:43:35,699 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:43:35,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 905 places, 973 transitions, 3238 flow [2021-06-10 11:43:36,142 INFO L129 PetriNetUnfolder]: 171/1278 cut-off events. [2021-06-10 11:43:36,142 INFO L130 PetriNetUnfolder]: For 7106/7106 co-relation queries the response was YES. [2021-06-10 11:43:36,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 1278 events. 171/1278 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5510 event pairs, 0 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1892. Up to 70 conditions per place. [2021-06-10 11:43:36,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 905 places, 973 transitions, 3238 flow [2021-06-10 11:43:36,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 905 places, 973 transitions, 3238 flow [2021-06-10 11:43:36,263 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:43:36,264 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:43:36,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:36,264 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-06-10 11:43:36,264 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -809102548, now seen corresponding path program 1 times [2021-06-10 11:43:36,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:36,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291063679] [2021-06-10 11:43:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:36,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:36,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:36,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:43:36,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291063679] [2021-06-10 11:43:36,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:36,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:36,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393926627] [2021-06-10 11:43:36,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:36,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:36,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:36,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:36,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 973 transitions, 3238 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:36,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:36,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:36,668 INFO L129 PetriNetUnfolder]: 100/1005 cut-off events. [2021-06-10 11:43:36,668 INFO L130 PetriNetUnfolder]: For 7107/7107 co-relation queries the response was YES. [2021-06-10 11:43:36,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1005 events. 100/1005 cut-off events. For 7107/7107 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4052 event pairs, 0 based on Foata normal form. 138/1007 useless extension candidates. Maximal degree in co-relation 1631. Up to 35 conditions per place. [2021-06-10 11:43:36,750 INFO L132 encePairwiseOnDemand]: 934/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/900 dead transitions. [2021-06-10 11:43:36,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 868 places, 900 transitions, 3106 flow [2021-06-10 11:43:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2771 transitions. [2021-06-10 11:43:36,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9492977046933881 [2021-06-10 11:43:36,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2771 transitions. [2021-06-10 11:43:36,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2771 transitions. [2021-06-10 11:43:36,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:36,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2771 transitions. [2021-06-10 11:43:36,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.6666666666666) internal successors, (2771), 3 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,755 INFO L185 Difference]: Start difference. First operand has 905 places, 973 transitions, 3238 flow. Second operand 3 states and 2771 transitions. [2021-06-10 11:43:36,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 868 places, 900 transitions, 3106 flow [2021-06-10 11:43:36,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 900 transitions, 1984 flow, removed 561 selfloop flow, removed 0 redundant places. [2021-06-10 11:43:36,772 INFO L241 Difference]: Finished difference. Result has 870 places, 900 transitions, 1982 flow [2021-06-10 11:43:36,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=866, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1982, PETRI_PLACES=870, PETRI_TRANSITIONS=900} [2021-06-10 11:43:36,772 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -35 predicate places. [2021-06-10 11:43:36,772 INFO L480 AbstractCegarLoop]: Abstraction has has 870 places, 900 transitions, 1982 flow [2021-06-10 11:43:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:36,773 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-06-10 11:43:36,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1774 [2021-06-10 11:43:36,773 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -809103571, now seen corresponding path program 1 times [2021-06-10 11:43:36,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:36,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698760447] [2021-06-10 11:43:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:36,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:36,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:36,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:36,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:43:36,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698760447] [2021-06-10 11:43:36,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:36,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:36,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576413846] [2021-06-10 11:43:36,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:36,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:36,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:36,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 900 transitions, 1982 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:36,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:36,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:36,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:37,156 INFO L129 PetriNetUnfolder]: 100/1006 cut-off events. [2021-06-10 11:43:37,156 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:37,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 1006 events. 100/1006 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4061 event pairs, 0 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 1108. Up to 35 conditions per place. [2021-06-10 11:43:37,209 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/901 dead transitions. [2021-06-10 11:43:37,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 901 transitions, 2008 flow [2021-06-10 11:43:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:37,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:37,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:37,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:37,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:37,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:37,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,213 INFO L185 Difference]: Start difference. First operand has 870 places, 900 transitions, 1982 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:37,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 872 places, 901 transitions, 2008 flow [2021-06-10 11:43:37,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 901 transitions, 2006 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:37,221 INFO L241 Difference]: Finished difference. Result has 873 places, 901 transitions, 1998 flow [2021-06-10 11:43:37,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1998, PETRI_PLACES=873, PETRI_TRANSITIONS=901} [2021-06-10 11:43:37,221 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -32 predicate places. [2021-06-10 11:43:37,221 INFO L480 AbstractCegarLoop]: Abstraction has has 873 places, 901 transitions, 1998 flow [2021-06-10 11:43:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:37,222 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-06-10 11:43:37,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1775 [2021-06-10 11:43:37,222 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -808149236, now seen corresponding path program 1 times [2021-06-10 11:43:37,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:37,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840734543] [2021-06-10 11:43:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:37,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:37,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:37,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:43:37,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840734543] [2021-06-10 11:43:37,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:37,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:37,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286214646] [2021-06-10 11:43:37,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:37,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:37,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:37,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:37,243 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:37,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 873 places, 901 transitions, 1998 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:37,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:37,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:37,581 INFO L129 PetriNetUnfolder]: 99/1003 cut-off events. [2021-06-10 11:43:37,582 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-10 11:43:37,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 1003 events. 99/1003 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4041 event pairs, 0 based on Foata normal form. 2/872 useless extension candidates. Maximal degree in co-relation 1110. Up to 35 conditions per place. [2021-06-10 11:43:37,653 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 9 selfloop transitions, 1 changer transitions 0/899 dead transitions. [2021-06-10 11:43:37,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 899 transitions, 2006 flow [2021-06-10 11:43:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2688 transitions. [2021-06-10 11:43:37,654 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2021-06-10 11:43:37,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2688 transitions. [2021-06-10 11:43:37,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2688 transitions. [2021-06-10 11:43:37,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:37,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2688 transitions. [2021-06-10 11:43:37,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.0) internal successors, (2688), 3 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,657 INFO L185 Difference]: Start difference. First operand has 873 places, 901 transitions, 1998 flow. Second operand 3 states and 2688 transitions. [2021-06-10 11:43:37,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 899 transitions, 2006 flow [2021-06-10 11:43:37,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 874 places, 899 transitions, 2005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:37,666 INFO L241 Difference]: Finished difference. Result has 874 places, 899 transitions, 1987 flow [2021-06-10 11:43:37,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1987, PETRI_PLACES=874, PETRI_TRANSITIONS=899} [2021-06-10 11:43:37,666 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -31 predicate places. [2021-06-10 11:43:37,666 INFO L480 AbstractCegarLoop]: Abstraction has has 874 places, 899 transitions, 1987 flow [2021-06-10 11:43:37,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:37,666 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-06-10 11:43:37,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1776 [2021-06-10 11:43:37,666 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -808150259, now seen corresponding path program 1 times [2021-06-10 11:43:37,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:37,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580079157] [2021-06-10 11:43:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:37,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:37,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:37,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:37,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:43:37,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580079157] [2021-06-10 11:43:37,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:37,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:37,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016070386] [2021-06-10 11:43:37,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:37,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:37,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:37,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:37,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 899 transitions, 1987 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:37,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:37,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:37,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:38,026 INFO L129 PetriNetUnfolder]: 99/1000 cut-off events. [2021-06-10 11:43:38,026 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:38,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1000 events. 99/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4026 event pairs, 0 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1105. Up to 35 conditions per place. [2021-06-10 11:43:38,097 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2021-06-10 11:43:38,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 874 places, 896 transitions, 1988 flow [2021-06-10 11:43:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:38,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:38,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:38,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:38,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:38,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:38,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,101 INFO L185 Difference]: Start difference. First operand has 874 places, 899 transitions, 1987 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:38,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 874 places, 896 transitions, 1988 flow [2021-06-10 11:43:38,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 871 places, 896 transitions, 1983 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:38,109 INFO L241 Difference]: Finished difference. Result has 871 places, 896 transitions, 1973 flow [2021-06-10 11:43:38,109 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1973, PETRI_PLACES=871, PETRI_TRANSITIONS=896} [2021-06-10 11:43:38,109 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -34 predicate places. [2021-06-10 11:43:38,109 INFO L480 AbstractCegarLoop]: Abstraction has has 871 places, 896 transitions, 1973 flow [2021-06-10 11:43:38,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,110 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:38,110 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:38,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1777 [2021-06-10 11:43:38,110 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 606366081, now seen corresponding path program 1 times [2021-06-10 11:43:38,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:38,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754734317] [2021-06-10 11:43:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:38,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:38,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:38,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:43:38,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754734317] [2021-06-10 11:43:38,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:38,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:38,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296025137] [2021-06-10 11:43:38,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:38,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:38,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:38,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 896 transitions, 1973 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:38,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:38,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:38,473 INFO L129 PetriNetUnfolder]: 98/1008 cut-off events. [2021-06-10 11:43:38,474 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:38,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1008 events. 98/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4094 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1122. Up to 35 conditions per place. [2021-06-10 11:43:38,544 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/898 dead transitions. [2021-06-10 11:43:38,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 873 places, 898 transitions, 2003 flow [2021-06-10 11:43:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:43:38,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:43:38,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:43:38,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:43:38,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:38,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:43:38,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,548 INFO L185 Difference]: Start difference. First operand has 871 places, 896 transitions, 1973 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:43:38,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 873 places, 898 transitions, 2003 flow [2021-06-10 11:43:38,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 872 places, 898 transitions, 2002 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:38,556 INFO L241 Difference]: Finished difference. Result has 874 places, 898 transitions, 1996 flow [2021-06-10 11:43:38,556 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1972, PETRI_DIFFERENCE_MINUEND_PLACES=870, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1996, PETRI_PLACES=874, PETRI_TRANSITIONS=898} [2021-06-10 11:43:38,556 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -31 predicate places. [2021-06-10 11:43:38,556 INFO L480 AbstractCegarLoop]: Abstraction has has 874 places, 898 transitions, 1996 flow [2021-06-10 11:43:38,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:38,557 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:38,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1778 [2021-06-10 11:43:38,557 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 606367104, now seen corresponding path program 1 times [2021-06-10 11:43:38,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:38,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342447147] [2021-06-10 11:43:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:38,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:38,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:38,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:38,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:43:38,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342447147] [2021-06-10 11:43:38,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:38,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:38,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174218503] [2021-06-10 11:43:38,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:38,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:38,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:38,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:38,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 898 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:38,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:38,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:38,917 INFO L129 PetriNetUnfolder]: 97/1006 cut-off events. [2021-06-10 11:43:38,917 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:38,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 1006 events. 97/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4083 event pairs, 0 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1116. Up to 35 conditions per place. [2021-06-10 11:43:38,987 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/898 dead transitions. [2021-06-10 11:43:38,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 876 places, 898 transitions, 2008 flow [2021-06-10 11:43:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:38,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:38,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:38,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:38,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:38,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:38,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:38,991 INFO L185 Difference]: Start difference. First operand has 874 places, 898 transitions, 1996 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:38,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 876 places, 898 transitions, 2008 flow [2021-06-10 11:43:38,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 875 places, 898 transitions, 2003 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:38,999 INFO L241 Difference]: Finished difference. Result has 877 places, 898 transitions, 2001 flow [2021-06-10 11:43:38,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=873, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=877, PETRI_TRANSITIONS=898} [2021-06-10 11:43:39,000 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -28 predicate places. [2021-06-10 11:43:39,000 INFO L480 AbstractCegarLoop]: Abstraction has has 877 places, 898 transitions, 2001 flow [2021-06-10 11:43:39,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,000 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:39,000 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:39,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1779 [2021-06-10 11:43:39,000 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 607319393, now seen corresponding path program 1 times [2021-06-10 11:43:39,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:39,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302360486] [2021-06-10 11:43:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:39,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:39,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:43:39,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302360486] [2021-06-10 11:43:39,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:39,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:39,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329693114] [2021-06-10 11:43:39,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:39,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:39,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:39,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 877 places, 898 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:39,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:39,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:39,346 INFO L129 PetriNetUnfolder]: 96/1002 cut-off events. [2021-06-10 11:43:39,346 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:43:39,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 1002 events. 96/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4057 event pairs, 0 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 1114. Up to 35 conditions per place. [2021-06-10 11:43:39,403 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/895 dead transitions. [2021-06-10 11:43:39,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 879 places, 895 transitions, 1998 flow [2021-06-10 11:43:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:39,405 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:39,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:39,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:39,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:39,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:39,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,407 INFO L185 Difference]: Start difference. First operand has 877 places, 898 transitions, 2001 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:39,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 879 places, 895 transitions, 1998 flow [2021-06-10 11:43:39,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 876 places, 895 transitions, 1991 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:39,415 INFO L241 Difference]: Finished difference. Result has 876 places, 895 transitions, 1981 flow [2021-06-10 11:43:39,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=874, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1981, PETRI_PLACES=876, PETRI_TRANSITIONS=895} [2021-06-10 11:43:39,415 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -29 predicate places. [2021-06-10 11:43:39,415 INFO L480 AbstractCegarLoop]: Abstraction has has 876 places, 895 transitions, 1981 flow [2021-06-10 11:43:39,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,415 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:39,416 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:39,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1780 [2021-06-10 11:43:39,416 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 607320416, now seen corresponding path program 1 times [2021-06-10 11:43:39,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:39,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113171560] [2021-06-10 11:43:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:39,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:39,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:43:39,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113171560] [2021-06-10 11:43:39,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:39,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:39,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106095161] [2021-06-10 11:43:39,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:39,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:39,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:39,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 876 places, 895 transitions, 1981 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:39,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:39,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:39,771 INFO L129 PetriNetUnfolder]: 96/1000 cut-off events. [2021-06-10 11:43:39,771 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:39,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 1000 events. 96/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4045 event pairs, 0 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1115. Up to 35 conditions per place. [2021-06-10 11:43:39,840 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/893 dead transitions. [2021-06-10 11:43:39,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 876 places, 893 transitions, 1994 flow [2021-06-10 11:43:39,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:39,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:39,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:39,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:39,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:39,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:39,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,845 INFO L185 Difference]: Start difference. First operand has 876 places, 895 transitions, 1981 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:39,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 876 places, 893 transitions, 1994 flow [2021-06-10 11:43:39,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 875 places, 893 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:39,853 INFO L241 Difference]: Finished difference. Result has 875 places, 893 transitions, 1977 flow [2021-06-10 11:43:39,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=873, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1977, PETRI_PLACES=875, PETRI_TRANSITIONS=893} [2021-06-10 11:43:39,853 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -30 predicate places. [2021-06-10 11:43:39,853 INFO L480 AbstractCegarLoop]: Abstraction has has 875 places, 893 transitions, 1977 flow [2021-06-10 11:43:39,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:39,854 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:39,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1781 [2021-06-10 11:43:39,854 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -885498443, now seen corresponding path program 1 times [2021-06-10 11:43:39,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:39,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219370709] [2021-06-10 11:43:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:39,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:39,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:39,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:43:39,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219370709] [2021-06-10 11:43:39,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:39,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:39,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19148408] [2021-06-10 11:43:39,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:39,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:39,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:39,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:39,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 893 transitions, 1977 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:39,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:39,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:39,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:40,223 INFO L129 PetriNetUnfolder]: 95/1008 cut-off events. [2021-06-10 11:43:40,224 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:40,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 1008 events. 95/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4115 event pairs, 0 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1127. Up to 35 conditions per place. [2021-06-10 11:43:40,292 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/895 dead transitions. [2021-06-10 11:43:40,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 877 places, 895 transitions, 2007 flow [2021-06-10 11:43:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:43:40,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:43:40,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:43:40,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:43:40,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:40,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:43:40,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,297 INFO L185 Difference]: Start difference. First operand has 875 places, 893 transitions, 1977 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:43:40,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 877 places, 895 transitions, 2007 flow [2021-06-10 11:43:40,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 876 places, 895 transitions, 2006 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:40,305 INFO L241 Difference]: Finished difference. Result has 878 places, 895 transitions, 2000 flow [2021-06-10 11:43:40,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=874, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2000, PETRI_PLACES=878, PETRI_TRANSITIONS=895} [2021-06-10 11:43:40,305 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -27 predicate places. [2021-06-10 11:43:40,306 INFO L480 AbstractCegarLoop]: Abstraction has has 878 places, 895 transitions, 2000 flow [2021-06-10 11:43:40,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,306 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:40,306 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:40,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1782 [2021-06-10 11:43:40,306 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash -885499466, now seen corresponding path program 1 times [2021-06-10 11:43:40,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:40,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311648943] [2021-06-10 11:43:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:40,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:40,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:40,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:43:40,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311648943] [2021-06-10 11:43:40,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:40,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:40,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761264666] [2021-06-10 11:43:40,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:40,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:40,326 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:40,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 878 places, 895 transitions, 2000 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:40,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:40,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:40,668 INFO L129 PetriNetUnfolder]: 93/1009 cut-off events. [2021-06-10 11:43:40,669 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:40,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1009 events. 93/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4136 event pairs, 0 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1126. Up to 35 conditions per place. [2021-06-10 11:43:40,737 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/895 dead transitions. [2021-06-10 11:43:40,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 895 transitions, 2012 flow [2021-06-10 11:43:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:40,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:40,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:40,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:40,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:40,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:40,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,742 INFO L185 Difference]: Start difference. First operand has 878 places, 895 transitions, 2000 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:40,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 895 transitions, 2012 flow [2021-06-10 11:43:40,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 895 transitions, 2007 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:40,750 INFO L241 Difference]: Finished difference. Result has 880 places, 894 transitions, 1996 flow [2021-06-10 11:43:40,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1996, PETRI_PLACES=880, PETRI_TRANSITIONS=894} [2021-06-10 11:43:40,750 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -25 predicate places. [2021-06-10 11:43:40,750 INFO L480 AbstractCegarLoop]: Abstraction has has 880 places, 894 transitions, 1996 flow [2021-06-10 11:43:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:40,750 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:40,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1783 [2021-06-10 11:43:40,750 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash -886451755, now seen corresponding path program 1 times [2021-06-10 11:43:40,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:40,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229514166] [2021-06-10 11:43:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:40,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:40,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:40,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:40,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:43:40,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229514166] [2021-06-10 11:43:40,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:40,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:40,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245061182] [2021-06-10 11:43:40,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:40,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:40,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:40,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:40,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 894 transitions, 1996 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:40,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:40,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:40,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:41,109 INFO L129 PetriNetUnfolder]: 93/1002 cut-off events. [2021-06-10 11:43:41,110 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:41,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 1002 events. 93/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4076 event pairs, 0 based on Foata normal form. 1/877 useless extension candidates. Maximal degree in co-relation 1121. Up to 35 conditions per place. [2021-06-10 11:43:41,178 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/892 dead transitions. [2021-06-10 11:43:41,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 892 transitions, 1999 flow [2021-06-10 11:43:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:41,179 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:41,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:41,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:41,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:41,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:41,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,182 INFO L185 Difference]: Start difference. First operand has 880 places, 894 transitions, 1996 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 892 transitions, 1999 flow [2021-06-10 11:43:41,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 892 transitions, 1992 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:41,190 INFO L241 Difference]: Finished difference. Result has 880 places, 892 transitions, 1985 flow [2021-06-10 11:43:41,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1985, PETRI_PLACES=880, PETRI_TRANSITIONS=892} [2021-06-10 11:43:41,191 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -25 predicate places. [2021-06-10 11:43:41,191 INFO L480 AbstractCegarLoop]: Abstraction has has 880 places, 892 transitions, 1985 flow [2021-06-10 11:43:41,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:41,191 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:41,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1784 [2021-06-10 11:43:41,191 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -886452778, now seen corresponding path program 1 times [2021-06-10 11:43:41,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:41,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741401338] [2021-06-10 11:43:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:41,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:41,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:41,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:43:41,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741401338] [2021-06-10 11:43:41,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:41,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:41,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066540129] [2021-06-10 11:43:41,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:41,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:41,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:41,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 892 transitions, 1985 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:41,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:41,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:41,550 INFO L129 PetriNetUnfolder]: 93/1000 cut-off events. [2021-06-10 11:43:41,551 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:41,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 1000 events. 93/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4063 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1121. Up to 35 conditions per place. [2021-06-10 11:43:41,614 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/890 dead transitions. [2021-06-10 11:43:41,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 890 transitions, 1998 flow [2021-06-10 11:43:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:41,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:41,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:41,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:41,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:41,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:41,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,619 INFO L185 Difference]: Start difference. First operand has 880 places, 892 transitions, 1985 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:41,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 890 transitions, 1998 flow [2021-06-10 11:43:41,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 890 transitions, 1997 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:41,626 INFO L241 Difference]: Finished difference. Result has 879 places, 890 transitions, 1981 flow [2021-06-10 11:43:41,626 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1981, PETRI_PLACES=879, PETRI_TRANSITIONS=890} [2021-06-10 11:43:41,627 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -26 predicate places. [2021-06-10 11:43:41,627 INFO L480 AbstractCegarLoop]: Abstraction has has 879 places, 890 transitions, 1981 flow [2021-06-10 11:43:41,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:41,627 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:41,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1785 [2021-06-10 11:43:41,627 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1896375892, now seen corresponding path program 1 times [2021-06-10 11:43:41,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:41,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228735418] [2021-06-10 11:43:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:41,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:41,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:41,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:41,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:43:41,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228735418] [2021-06-10 11:43:41,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:41,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:41,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463958240] [2021-06-10 11:43:41,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:41,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:41,647 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:41,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 890 transitions, 1981 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:41,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:41,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:41,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:41,993 INFO L129 PetriNetUnfolder]: 92/1008 cut-off events. [2021-06-10 11:43:41,993 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:42,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 1008 events. 92/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4131 event pairs, 0 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1133. Up to 35 conditions per place. [2021-06-10 11:43:42,062 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/892 dead transitions. [2021-06-10 11:43:42,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 881 places, 892 transitions, 2011 flow [2021-06-10 11:43:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:43:42,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:43:42,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:43:42,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:43:42,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:42,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:43:42,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,066 INFO L185 Difference]: Start difference. First operand has 879 places, 890 transitions, 1981 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:43:42,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 881 places, 892 transitions, 2011 flow [2021-06-10 11:43:42,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 880 places, 892 transitions, 2010 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:42,074 INFO L241 Difference]: Finished difference. Result has 882 places, 892 transitions, 2004 flow [2021-06-10 11:43:42,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=878, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2004, PETRI_PLACES=882, PETRI_TRANSITIONS=892} [2021-06-10 11:43:42,075 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -23 predicate places. [2021-06-10 11:43:42,075 INFO L480 AbstractCegarLoop]: Abstraction has has 882 places, 892 transitions, 2004 flow [2021-06-10 11:43:42,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:42,075 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:42,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1786 [2021-06-10 11:43:42,075 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1896374869, now seen corresponding path program 1 times [2021-06-10 11:43:42,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:42,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822420801] [2021-06-10 11:43:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:42,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:42,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:43:42,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822420801] [2021-06-10 11:43:42,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:42,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:42,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261725549] [2021-06-10 11:43:42,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:42,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:42,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:42,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 882 places, 892 transitions, 2004 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:42,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:42,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:42,452 INFO L129 PetriNetUnfolder]: 91/1006 cut-off events. [2021-06-10 11:43:42,453 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:42,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1006 events. 91/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4122 event pairs, 0 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1130. Up to 35 conditions per place. [2021-06-10 11:43:42,522 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/892 dead transitions. [2021-06-10 11:43:42,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 892 transitions, 2016 flow [2021-06-10 11:43:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:42,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:42,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:42,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:42,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:42,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:42,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,527 INFO L185 Difference]: Start difference. First operand has 882 places, 892 transitions, 2004 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:42,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 884 places, 892 transitions, 2016 flow [2021-06-10 11:43:42,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 892 transitions, 2011 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:42,535 INFO L241 Difference]: Finished difference. Result has 885 places, 892 transitions, 2009 flow [2021-06-10 11:43:42,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2009, PETRI_PLACES=885, PETRI_TRANSITIONS=892} [2021-06-10 11:43:42,536 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -20 predicate places. [2021-06-10 11:43:42,536 INFO L480 AbstractCegarLoop]: Abstraction has has 885 places, 892 transitions, 2009 flow [2021-06-10 11:43:42,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,536 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:42,536 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:42,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1787 [2021-06-10 11:43:42,536 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1895422580, now seen corresponding path program 1 times [2021-06-10 11:43:42,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:42,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716711314] [2021-06-10 11:43:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:42,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:42,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:43:42,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716711314] [2021-06-10 11:43:42,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:42,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:42,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156405089] [2021-06-10 11:43:42,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:42,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:42,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:42,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 892 transitions, 2009 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:42,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:42,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:42,897 INFO L129 PetriNetUnfolder]: 90/1002 cut-off events. [2021-06-10 11:43:42,897 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:43:42,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 1002 events. 90/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4094 event pairs, 0 based on Foata normal form. 1/880 useless extension candidates. Maximal degree in co-relation 1127. Up to 35 conditions per place. [2021-06-10 11:43:42,964 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/889 dead transitions. [2021-06-10 11:43:42,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 889 transitions, 2006 flow [2021-06-10 11:43:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:42,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:42,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:42,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:42,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:42,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:42,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,968 INFO L185 Difference]: Start difference. First operand has 885 places, 892 transitions, 2009 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 889 transitions, 2006 flow [2021-06-10 11:43:42,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 889 transitions, 1999 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:42,976 INFO L241 Difference]: Finished difference. Result has 884 places, 889 transitions, 1989 flow [2021-06-10 11:43:42,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1989, PETRI_PLACES=884, PETRI_TRANSITIONS=889} [2021-06-10 11:43:42,976 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -21 predicate places. [2021-06-10 11:43:42,976 INFO L480 AbstractCegarLoop]: Abstraction has has 884 places, 889 transitions, 1989 flow [2021-06-10 11:43:42,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:42,977 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:42,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1788 [2021-06-10 11:43:42,977 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1895421557, now seen corresponding path program 1 times [2021-06-10 11:43:42,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:42,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799372405] [2021-06-10 11:43:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:42,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:42,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:42,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:43:42,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799372405] [2021-06-10 11:43:42,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:42,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:42,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304927617] [2021-06-10 11:43:42,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:42,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:42,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:42,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:42,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 884 places, 889 transitions, 1989 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:42,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:42,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:42,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:43,340 INFO L129 PetriNetUnfolder]: 90/1000 cut-off events. [2021-06-10 11:43:43,340 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:43,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 1000 events. 90/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4077 event pairs, 0 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1128. Up to 35 conditions per place. [2021-06-10 11:43:43,458 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/887 dead transitions. [2021-06-10 11:43:43,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 887 transitions, 2002 flow [2021-06-10 11:43:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:43,460 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:43,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:43,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:43,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:43,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:43,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,463 INFO L185 Difference]: Start difference. First operand has 884 places, 889 transitions, 1989 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 884 places, 887 transitions, 2002 flow [2021-06-10 11:43:43,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 887 transitions, 2001 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:43,470 INFO L241 Difference]: Finished difference. Result has 883 places, 887 transitions, 1985 flow [2021-06-10 11:43:43,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1985, PETRI_PLACES=883, PETRI_TRANSITIONS=887} [2021-06-10 11:43:43,470 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -22 predicate places. [2021-06-10 11:43:43,470 INFO L480 AbstractCegarLoop]: Abstraction has has 883 places, 887 transitions, 1985 flow [2021-06-10 11:43:43,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:43,471 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:43,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1789 [2021-06-10 11:43:43,471 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 606286211, now seen corresponding path program 1 times [2021-06-10 11:43:43,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:43,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267467951] [2021-06-10 11:43:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:43,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:43,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:43,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:43:43,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267467951] [2021-06-10 11:43:43,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:43,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:43,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572466779] [2021-06-10 11:43:43,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:43,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:43,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:43,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 887 transitions, 1985 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:43,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:43,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:43,841 INFO L129 PetriNetUnfolder]: 89/1008 cut-off events. [2021-06-10 11:43:43,841 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:43,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1008 events. 89/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4152 event pairs, 0 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1140. Up to 35 conditions per place. [2021-06-10 11:43:43,913 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/889 dead transitions. [2021-06-10 11:43:43,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 889 transitions, 2015 flow [2021-06-10 11:43:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:43:43,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:43:43,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:43:43,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:43:43,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:43,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:43:43,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,917 INFO L185 Difference]: Start difference. First operand has 883 places, 887 transitions, 1985 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:43:43,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 889 transitions, 2015 flow [2021-06-10 11:43:43,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 889 transitions, 2014 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:43,925 INFO L241 Difference]: Finished difference. Result has 886 places, 889 transitions, 2008 flow [2021-06-10 11:43:43,926 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2008, PETRI_PLACES=886, PETRI_TRANSITIONS=889} [2021-06-10 11:43:43,926 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -19 predicate places. [2021-06-10 11:43:43,926 INFO L480 AbstractCegarLoop]: Abstraction has has 886 places, 889 transitions, 2008 flow [2021-06-10 11:43:43,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:43,926 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:43,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1790 [2021-06-10 11:43:43,926 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash 606287234, now seen corresponding path program 1 times [2021-06-10 11:43:43,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:43,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585795751] [2021-06-10 11:43:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:43,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:43,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:43,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:43,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:43:43,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585795751] [2021-06-10 11:43:43,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:43,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:43,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243431191] [2021-06-10 11:43:43,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:43,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:43,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:43,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 889 transitions, 2008 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:43,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:43,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:43,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:44,293 INFO L129 PetriNetUnfolder]: 88/1006 cut-off events. [2021-06-10 11:43:44,293 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:44,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 1006 events. 88/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4139 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1137. Up to 35 conditions per place. [2021-06-10 11:43:44,361 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/889 dead transitions. [2021-06-10 11:43:44,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 889 transitions, 2020 flow [2021-06-10 11:43:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:44,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:44,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:44,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:44,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:44,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:44,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,365 INFO L185 Difference]: Start difference. First operand has 886 places, 889 transitions, 2008 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:44,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 889 transitions, 2020 flow [2021-06-10 11:43:44,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 889 transitions, 2015 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:44,373 INFO L241 Difference]: Finished difference. Result has 889 places, 889 transitions, 2013 flow [2021-06-10 11:43:44,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2013, PETRI_PLACES=889, PETRI_TRANSITIONS=889} [2021-06-10 11:43:44,374 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -16 predicate places. [2021-06-10 11:43:44,374 INFO L480 AbstractCegarLoop]: Abstraction has has 889 places, 889 transitions, 2013 flow [2021-06-10 11:43:44,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:44,374 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:44,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1791 [2021-06-10 11:43:44,374 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 607239523, now seen corresponding path program 1 times [2021-06-10 11:43:44,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:44,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169363013] [2021-06-10 11:43:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:44,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:44,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:44,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:43:44,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169363013] [2021-06-10 11:43:44,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:44,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:44,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705409617] [2021-06-10 11:43:44,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:44,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:44,395 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:44,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 889 places, 889 transitions, 2013 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:44,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:44,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:44,738 INFO L129 PetriNetUnfolder]: 87/1002 cut-off events. [2021-06-10 11:43:44,738 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:43:44,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 1002 events. 87/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4113 event pairs, 0 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1134. Up to 35 conditions per place. [2021-06-10 11:43:44,807 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/886 dead transitions. [2021-06-10 11:43:44,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 886 transitions, 2010 flow [2021-06-10 11:43:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:44,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:44,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:44,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:44,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:44,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:44,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,812 INFO L185 Difference]: Start difference. First operand has 889 places, 889 transitions, 2013 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:44,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 891 places, 886 transitions, 2010 flow [2021-06-10 11:43:44,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 888 places, 886 transitions, 2003 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:44,820 INFO L241 Difference]: Finished difference. Result has 888 places, 886 transitions, 1993 flow [2021-06-10 11:43:44,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=886, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1993, PETRI_PLACES=888, PETRI_TRANSITIONS=886} [2021-06-10 11:43:44,821 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -17 predicate places. [2021-06-10 11:43:44,821 INFO L480 AbstractCegarLoop]: Abstraction has has 888 places, 886 transitions, 1993 flow [2021-06-10 11:43:44,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:44,821 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:44,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1792 [2021-06-10 11:43:44,821 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:44,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 607240546, now seen corresponding path program 1 times [2021-06-10 11:43:44,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:44,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867903328] [2021-06-10 11:43:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:44,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:44,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:44,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:44,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:43:44,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867903328] [2021-06-10 11:43:44,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:44,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:44,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634547121] [2021-06-10 11:43:44,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:44,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:44,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:44,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 888 places, 886 transitions, 1993 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:44,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:44,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:44,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:45,200 INFO L129 PetriNetUnfolder]: 87/1000 cut-off events. [2021-06-10 11:43:45,200 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:45,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1000 events. 87/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4099 event pairs, 0 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 1135. Up to 35 conditions per place. [2021-06-10 11:43:45,267 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/884 dead transitions. [2021-06-10 11:43:45,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 888 places, 884 transitions, 2006 flow [2021-06-10 11:43:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:45,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:45,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:45,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:45,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:45,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:45,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,271 INFO L185 Difference]: Start difference. First operand has 888 places, 886 transitions, 1993 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:45,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 888 places, 884 transitions, 2006 flow [2021-06-10 11:43:45,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 884 transitions, 2005 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:45,279 INFO L241 Difference]: Finished difference. Result has 887 places, 884 transitions, 1989 flow [2021-06-10 11:43:45,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1989, PETRI_PLACES=887, PETRI_TRANSITIONS=884} [2021-06-10 11:43:45,280 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -18 predicate places. [2021-06-10 11:43:45,280 INFO L480 AbstractCegarLoop]: Abstraction has has 887 places, 884 transitions, 1989 flow [2021-06-10 11:43:45,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:45,280 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:45,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1793 [2021-06-10 11:43:45,280 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1265008422, now seen corresponding path program 1 times [2021-06-10 11:43:45,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:45,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257744381] [2021-06-10 11:43:45,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:45,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:45,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:45,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:43:45,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257744381] [2021-06-10 11:43:45,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:45,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:45,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940357400] [2021-06-10 11:43:45,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:45,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:45,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:45,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:45,301 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:45,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 884 transitions, 1989 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:45,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:45,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:45,646 INFO L129 PetriNetUnfolder]: 85/1005 cut-off events. [2021-06-10 11:43:45,646 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:45,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 1005 events. 85/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4149 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1138. Up to 35 conditions per place. [2021-06-10 11:43:45,696 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/885 dead transitions. [2021-06-10 11:43:45,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 885 transitions, 2005 flow [2021-06-10 11:43:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:45,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:45,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:45,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:45,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:45,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:45,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,700 INFO L185 Difference]: Start difference. First operand has 887 places, 884 transitions, 1989 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:45,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 885 transitions, 2005 flow [2021-06-10 11:43:45,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 888 places, 885 transitions, 2004 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:45,708 INFO L241 Difference]: Finished difference. Result has 890 places, 885 transitions, 2002 flow [2021-06-10 11:43:45,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=886, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2002, PETRI_PLACES=890, PETRI_TRANSITIONS=885} [2021-06-10 11:43:45,708 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -15 predicate places. [2021-06-10 11:43:45,708 INFO L480 AbstractCegarLoop]: Abstraction has has 890 places, 885 transitions, 2002 flow [2021-06-10 11:43:45,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:45,708 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:45,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1794 [2021-06-10 11:43:45,708 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1265009445, now seen corresponding path program 1 times [2021-06-10 11:43:45,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:45,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566256] [2021-06-10 11:43:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:45,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:45,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:45,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:45,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:43:45,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566256] [2021-06-10 11:43:45,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:45,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:45,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545210240] [2021-06-10 11:43:45,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:45,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:45,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:45,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 890 places, 885 transitions, 2002 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:45,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:45,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:45,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:46,087 INFO L129 PetriNetUnfolder]: 85/1006 cut-off events. [2021-06-10 11:43:46,087 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:46,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1006 events. 85/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4157 event pairs, 0 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1146. Up to 35 conditions per place. [2021-06-10 11:43:46,154 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/886 dead transitions. [2021-06-10 11:43:46,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 892 places, 886 transitions, 2028 flow [2021-06-10 11:43:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:46,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:46,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:46,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:46,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:46,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:46,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,159 INFO L185 Difference]: Start difference. First operand has 890 places, 885 transitions, 2002 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:46,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 892 places, 886 transitions, 2028 flow [2021-06-10 11:43:46,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 886 transitions, 2026 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:46,167 INFO L241 Difference]: Finished difference. Result has 893 places, 886 transitions, 2018 flow [2021-06-10 11:43:46,167 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=889, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2018, PETRI_PLACES=893, PETRI_TRANSITIONS=886} [2021-06-10 11:43:46,167 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -12 predicate places. [2021-06-10 11:43:46,167 INFO L480 AbstractCegarLoop]: Abstraction has has 893 places, 886 transitions, 2018 flow [2021-06-10 11:43:46,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:46,168 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:46,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1795 [2021-06-10 11:43:46,168 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1264055110, now seen corresponding path program 1 times [2021-06-10 11:43:46,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:46,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443017517] [2021-06-10 11:43:46,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:46,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:46,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:46,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:43:46,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443017517] [2021-06-10 11:43:46,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:46,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:46,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614453935] [2021-06-10 11:43:46,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:46,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:46,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:46,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 893 places, 886 transitions, 2018 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:46,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:46,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:46,542 INFO L129 PetriNetUnfolder]: 84/1003 cut-off events. [2021-06-10 11:43:46,542 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-06-10 11:43:46,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1003 events. 84/1003 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4137 event pairs, 0 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 1145. Up to 35 conditions per place. [2021-06-10 11:43:46,609 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 9 selfloop transitions, 1 changer transitions 0/884 dead transitions. [2021-06-10 11:43:46,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 884 transitions, 2026 flow [2021-06-10 11:43:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2688 transitions. [2021-06-10 11:43:46,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2021-06-10 11:43:46,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2688 transitions. [2021-06-10 11:43:46,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2688 transitions. [2021-06-10 11:43:46,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:46,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2688 transitions. [2021-06-10 11:43:46,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.0) internal successors, (2688), 3 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,613 INFO L185 Difference]: Start difference. First operand has 893 places, 886 transitions, 2018 flow. Second operand 3 states and 2688 transitions. [2021-06-10 11:43:46,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 895 places, 884 transitions, 2026 flow [2021-06-10 11:43:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 884 transitions, 2025 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:46,621 INFO L241 Difference]: Finished difference. Result has 894 places, 884 transitions, 2007 flow [2021-06-10 11:43:46,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2005, PETRI_DIFFERENCE_MINUEND_PLACES=892, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2007, PETRI_PLACES=894, PETRI_TRANSITIONS=884} [2021-06-10 11:43:46,622 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -11 predicate places. [2021-06-10 11:43:46,622 INFO L480 AbstractCegarLoop]: Abstraction has has 894 places, 884 transitions, 2007 flow [2021-06-10 11:43:46,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,622 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:46,622 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:46,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1796 [2021-06-10 11:43:46,622 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1264056133, now seen corresponding path program 1 times [2021-06-10 11:43:46,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:46,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281121797] [2021-06-10 11:43:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:46,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:46,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:46,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:46,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:43:46,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281121797] [2021-06-10 11:43:46,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:46,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:46,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710121576] [2021-06-10 11:43:46,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:46,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:46,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:46,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 884 transitions, 2007 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:46,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:46,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:46,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:46,991 INFO L129 PetriNetUnfolder]: 84/1000 cut-off events. [2021-06-10 11:43:46,992 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:47,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1000 events. 84/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4116 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1139. Up to 35 conditions per place. [2021-06-10 11:43:47,057 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/881 dead transitions. [2021-06-10 11:43:47,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 881 transitions, 2008 flow [2021-06-10 11:43:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:47,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:47,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:47,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:47,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:47,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:47,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,062 INFO L185 Difference]: Start difference. First operand has 894 places, 884 transitions, 2007 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:47,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 881 transitions, 2008 flow [2021-06-10 11:43:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 881 transitions, 2003 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:47,072 INFO L241 Difference]: Finished difference. Result has 891 places, 881 transitions, 1993 flow [2021-06-10 11:43:47,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=889, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1993, PETRI_PLACES=891, PETRI_TRANSITIONS=881} [2021-06-10 11:43:47,073 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -14 predicate places. [2021-06-10 11:43:47,073 INFO L480 AbstractCegarLoop]: Abstraction has has 891 places, 881 transitions, 1993 flow [2021-06-10 11:43:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,073 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:47,073 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:47,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1797 [2021-06-10 11:43:47,073 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:47,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:47,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1226336717, now seen corresponding path program 1 times [2021-06-10 11:43:47,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:47,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555346625] [2021-06-10 11:43:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:47,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:47,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:47,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:43:47,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555346625] [2021-06-10 11:43:47,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:47,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:47,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110078777] [2021-06-10 11:43:47,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:47,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:47,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:47,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 881 transitions, 1993 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:47,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:47,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:47,456 INFO L129 PetriNetUnfolder]: 82/1005 cut-off events. [2021-06-10 11:43:47,456 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:47,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 1005 events. 82/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4164 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1147. Up to 35 conditions per place. [2021-06-10 11:43:47,527 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/882 dead transitions. [2021-06-10 11:43:47,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 882 transitions, 2009 flow [2021-06-10 11:43:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:47,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:47,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:47,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:47,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:47,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:47,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,532 INFO L185 Difference]: Start difference. First operand has 891 places, 881 transitions, 1993 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:47,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 882 transitions, 2009 flow [2021-06-10 11:43:47,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 892 places, 882 transitions, 2008 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:47,540 INFO L241 Difference]: Finished difference. Result has 894 places, 882 transitions, 2006 flow [2021-06-10 11:43:47,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=890, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2006, PETRI_PLACES=894, PETRI_TRANSITIONS=882} [2021-06-10 11:43:47,541 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -11 predicate places. [2021-06-10 11:43:47,541 INFO L480 AbstractCegarLoop]: Abstraction has has 894 places, 882 transitions, 2006 flow [2021-06-10 11:43:47,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,541 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:47,541 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:47,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1798 [2021-06-10 11:43:47,541 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1226337740, now seen corresponding path program 1 times [2021-06-10 11:43:47,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:47,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412074798] [2021-06-10 11:43:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:47,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:47,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:47,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:47,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:43:47,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412074798] [2021-06-10 11:43:47,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:47,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:47,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62795089] [2021-06-10 11:43:47,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:47,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:47,563 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:47,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 882 transitions, 2006 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:47,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:47,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:47,926 INFO L129 PetriNetUnfolder]: 82/1006 cut-off events. [2021-06-10 11:43:47,927 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:47,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1006 events. 82/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4171 event pairs, 0 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 1153. Up to 35 conditions per place. [2021-06-10 11:43:47,992 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/883 dead transitions. [2021-06-10 11:43:47,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 883 transitions, 2032 flow [2021-06-10 11:43:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:47,993 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:47,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:47,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:47,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:47,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:47,996 INFO L185 Difference]: Start difference. First operand has 894 places, 882 transitions, 2006 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:47,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 883 transitions, 2032 flow [2021-06-10 11:43:48,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 883 transitions, 2030 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:48,004 INFO L241 Difference]: Finished difference. Result has 897 places, 883 transitions, 2022 flow [2021-06-10 11:43:48,004 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2022, PETRI_PLACES=897, PETRI_TRANSITIONS=883} [2021-06-10 11:43:48,004 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -8 predicate places. [2021-06-10 11:43:48,004 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 883 transitions, 2022 flow [2021-06-10 11:43:48,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,005 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:48,005 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:48,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1799 [2021-06-10 11:43:48,005 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1225384428, now seen corresponding path program 1 times [2021-06-10 11:43:48,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:48,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776730565] [2021-06-10 11:43:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:48,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:48,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:43:48,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776730565] [2021-06-10 11:43:48,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:48,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:48,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621115033] [2021-06-10 11:43:48,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:48,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:48,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:48,026 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:48,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 883 transitions, 2022 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:48,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:48,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:48,389 INFO L129 PetriNetUnfolder]: 81/1002 cut-off events. [2021-06-10 11:43:48,390 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:48,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1002 events. 81/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4143 event pairs, 0 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1146. Up to 35 conditions per place. [2021-06-10 11:43:48,457 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/880 dead transitions. [2021-06-10 11:43:48,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 880 transitions, 2019 flow [2021-06-10 11:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:48,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:48,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:48,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:48,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:48,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:48,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,461 INFO L185 Difference]: Start difference. First operand has 897 places, 883 transitions, 2022 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:48,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 880 transitions, 2019 flow [2021-06-10 11:43:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 880 transitions, 2011 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:48,470 INFO L241 Difference]: Finished difference. Result has 896 places, 880 transitions, 2001 flow [2021-06-10 11:43:48,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=896, PETRI_TRANSITIONS=880} [2021-06-10 11:43:48,470 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -9 predicate places. [2021-06-10 11:43:48,470 INFO L480 AbstractCegarLoop]: Abstraction has has 896 places, 880 transitions, 2001 flow [2021-06-10 11:43:48,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:48,470 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:48,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1800 [2021-06-10 11:43:48,470 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1225383405, now seen corresponding path program 1 times [2021-06-10 11:43:48,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:48,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217672478] [2021-06-10 11:43:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:48,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:48,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:43:48,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217672478] [2021-06-10 11:43:48,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:48,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:48,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832750413] [2021-06-10 11:43:48,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:48,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:48,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:48,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 880 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:48,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:48,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:48,842 INFO L129 PetriNetUnfolder]: 81/1000 cut-off events. [2021-06-10 11:43:48,842 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:48,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1000 events. 81/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4129 event pairs, 0 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1149. Up to 35 conditions per place. [2021-06-10 11:43:48,907 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/878 dead transitions. [2021-06-10 11:43:48,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 878 transitions, 2014 flow [2021-06-10 11:43:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:48,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:48,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:48,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:48,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:48,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:48,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,912 INFO L185 Difference]: Start difference. First operand has 896 places, 880 transitions, 2001 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 878 transitions, 2014 flow [2021-06-10 11:43:48,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 895 places, 878 transitions, 2013 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:48,920 INFO L241 Difference]: Finished difference. Result has 895 places, 878 transitions, 1997 flow [2021-06-10 11:43:48,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1997, PETRI_PLACES=895, PETRI_TRANSITIONS=878} [2021-06-10 11:43:48,920 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -10 predicate places. [2021-06-10 11:43:48,920 INFO L480 AbstractCegarLoop]: Abstraction has has 895 places, 878 transitions, 1997 flow [2021-06-10 11:43:48,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:48,920 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:48,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1801 [2021-06-10 11:43:48,920 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2135333650, now seen corresponding path program 1 times [2021-06-10 11:43:48,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:48,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949682222] [2021-06-10 11:43:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:48,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:48,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:48,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:43:48,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949682222] [2021-06-10 11:43:48,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:48,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:48,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454446349] [2021-06-10 11:43:48,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:48,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:48,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:48,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:48,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 878 transitions, 1997 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:48,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:48,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:48,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:49,299 INFO L129 PetriNetUnfolder]: 80/1007 cut-off events. [2021-06-10 11:43:49,299 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:49,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 1007 events. 80/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4191 event pairs, 0 based on Foata normal form. 0/892 useless extension candidates. Maximal degree in co-relation 1154. Up to 35 conditions per place. [2021-06-10 11:43:49,365 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/879 dead transitions. [2021-06-10 11:43:49,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 879 transitions, 2013 flow [2021-06-10 11:43:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:49,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:49,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:49,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:49,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:49,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:49,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,370 INFO L185 Difference]: Start difference. First operand has 895 places, 878 transitions, 1997 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:49,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 897 places, 879 transitions, 2013 flow [2021-06-10 11:43:49,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 879 transitions, 2012 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:49,378 INFO L241 Difference]: Finished difference. Result has 897 places, 878 transitions, 2001 flow [2021-06-10 11:43:49,378 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=897, PETRI_TRANSITIONS=878} [2021-06-10 11:43:49,378 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -8 predicate places. [2021-06-10 11:43:49,378 INFO L480 AbstractCegarLoop]: Abstraction has has 897 places, 878 transitions, 2001 flow [2021-06-10 11:43:49,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:49,379 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:49,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1802 [2021-06-10 11:43:49,379 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2135332627, now seen corresponding path program 1 times [2021-06-10 11:43:49,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:49,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824358614] [2021-06-10 11:43:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:49,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:49,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:49,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:43:49,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824358614] [2021-06-10 11:43:49,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:49,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:49,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150886935] [2021-06-10 11:43:49,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:49,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:49,400 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:49,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 878 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:49,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:49,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:49,798 INFO L129 PetriNetUnfolder]: 78/1009 cut-off events. [2021-06-10 11:43:49,799 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:49,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 1009 events. 78/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4226 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1165. Up to 35 conditions per place. [2021-06-10 11:43:49,840 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/879 dead transitions. [2021-06-10 11:43:49,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 879 transitions, 2027 flow [2021-06-10 11:43:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:49,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:49,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:49,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:49,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:49,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:49,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,845 INFO L185 Difference]: Start difference. First operand has 897 places, 878 transitions, 2001 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:49,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 879 transitions, 2027 flow [2021-06-10 11:43:49,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 898 places, 879 transitions, 2026 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:49,852 INFO L241 Difference]: Finished difference. Result has 900 places, 879 transitions, 2018 flow [2021-06-10 11:43:49,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2018, PETRI_PLACES=900, PETRI_TRANSITIONS=879} [2021-06-10 11:43:49,852 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -5 predicate places. [2021-06-10 11:43:49,852 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 879 transitions, 2018 flow [2021-06-10 11:43:49,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:49,853 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:49,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1803 [2021-06-10 11:43:49,853 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2136285939, now seen corresponding path program 1 times [2021-06-10 11:43:49,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:49,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994270560] [2021-06-10 11:43:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:49,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:49,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:49,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:49,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:43:49,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994270560] [2021-06-10 11:43:49,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:49,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:49,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620793440] [2021-06-10 11:43:49,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:49,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:49,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:49,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:49,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:49,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 879 transitions, 2018 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:49,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:49,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:49,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:50,240 INFO L129 PetriNetUnfolder]: 78/1002 cut-off events. [2021-06-10 11:43:50,240 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:50,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1002 events. 78/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4164 event pairs, 0 based on Foata normal form. 1/892 useless extension candidates. Maximal degree in co-relation 1151. Up to 35 conditions per place. [2021-06-10 11:43:50,307 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/877 dead transitions. [2021-06-10 11:43:50,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 877 transitions, 2020 flow [2021-06-10 11:43:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:50,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:50,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:50,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:50,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:50,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:50,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,311 INFO L185 Difference]: Start difference. First operand has 900 places, 879 transitions, 2018 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 877 transitions, 2020 flow [2021-06-10 11:43:50,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 877 transitions, 2012 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:50,320 INFO L241 Difference]: Finished difference. Result has 900 places, 877 transitions, 2005 flow [2021-06-10 11:43:50,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2005, PETRI_PLACES=900, PETRI_TRANSITIONS=877} [2021-06-10 11:43:50,320 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -5 predicate places. [2021-06-10 11:43:50,320 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 877 transitions, 2005 flow [2021-06-10 11:43:50,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:50,320 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:50,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1804 [2021-06-10 11:43:50,320 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2136286962, now seen corresponding path program 1 times [2021-06-10 11:43:50,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:50,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541595432] [2021-06-10 11:43:50,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:50,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:50,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:50,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:43:50,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541595432] [2021-06-10 11:43:50,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:50,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:50,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656488813] [2021-06-10 11:43:50,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:50,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:50,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:50,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 877 transitions, 2005 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:50,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:50,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:50,700 INFO L129 PetriNetUnfolder]: 78/1000 cut-off events. [2021-06-10 11:43:50,701 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:50,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 1000 events. 78/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4146 event pairs, 0 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1155. Up to 35 conditions per place. [2021-06-10 11:43:50,767 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/875 dead transitions. [2021-06-10 11:43:50,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 875 transitions, 2018 flow [2021-06-10 11:43:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:50,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:50,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:50,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:50,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:50,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:50,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,771 INFO L185 Difference]: Start difference. First operand has 900 places, 877 transitions, 2005 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:50,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 875 transitions, 2018 flow [2021-06-10 11:43:50,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 875 transitions, 2017 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:50,779 INFO L241 Difference]: Finished difference. Result has 899 places, 875 transitions, 2001 flow [2021-06-10 11:43:50,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2001, PETRI_PLACES=899, PETRI_TRANSITIONS=875} [2021-06-10 11:43:50,780 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -6 predicate places. [2021-06-10 11:43:50,780 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 875 transitions, 2001 flow [2021-06-10 11:43:50,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:50,780 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:50,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1805 [2021-06-10 11:43:50,780 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1742793704, now seen corresponding path program 1 times [2021-06-10 11:43:50,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:50,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443513827] [2021-06-10 11:43:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:50,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:50,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:50,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:50,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:43:50,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443513827] [2021-06-10 11:43:50,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:50,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:50,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867219457] [2021-06-10 11:43:50,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:50,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:50,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:50,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 875 transitions, 2001 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:50,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:50,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:50,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:51,167 INFO L129 PetriNetUnfolder]: 76/1005 cut-off events. [2021-06-10 11:43:51,167 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:51,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 1005 events. 76/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4199 event pairs, 0 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 1158. Up to 35 conditions per place. [2021-06-10 11:43:51,233 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/876 dead transitions. [2021-06-10 11:43:51,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 876 transitions, 2017 flow [2021-06-10 11:43:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:51,234 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:51,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:51,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:51,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:51,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:51,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,237 INFO L185 Difference]: Start difference. First operand has 899 places, 875 transitions, 2001 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:51,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 876 transitions, 2017 flow [2021-06-10 11:43:51,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 876 transitions, 2016 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:51,245 INFO L241 Difference]: Finished difference. Result has 902 places, 876 transitions, 2014 flow [2021-06-10 11:43:51,246 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2014, PETRI_PLACES=902, PETRI_TRANSITIONS=876} [2021-06-10 11:43:51,246 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -3 predicate places. [2021-06-10 11:43:51,246 INFO L480 AbstractCegarLoop]: Abstraction has has 902 places, 876 transitions, 2014 flow [2021-06-10 11:43:51,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:51,246 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:51,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1806 [2021-06-10 11:43:51,246 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1742792681, now seen corresponding path program 1 times [2021-06-10 11:43:51,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:51,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805410373] [2021-06-10 11:43:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:51,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:51,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:51,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:43:51,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805410373] [2021-06-10 11:43:51,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:51,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:51,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772655125] [2021-06-10 11:43:51,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:51,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:51,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:51,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 876 transitions, 2014 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:51,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:51,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:51,636 INFO L129 PetriNetUnfolder]: 76/1006 cut-off events. [2021-06-10 11:43:51,636 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:51,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 1006 events. 76/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4209 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1166. Up to 35 conditions per place. [2021-06-10 11:43:51,702 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/877 dead transitions. [2021-06-10 11:43:51,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 877 transitions, 2040 flow [2021-06-10 11:43:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:51,704 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:51,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:51,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:51,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:51,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:51,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,706 INFO L185 Difference]: Start difference. First operand has 902 places, 876 transitions, 2014 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:51,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 877 transitions, 2040 flow [2021-06-10 11:43:51,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 877 transitions, 2038 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:51,715 INFO L241 Difference]: Finished difference. Result has 905 places, 877 transitions, 2030 flow [2021-06-10 11:43:51,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2030, PETRI_PLACES=905, PETRI_TRANSITIONS=877} [2021-06-10 11:43:51,715 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 0 predicate places. [2021-06-10 11:43:51,715 INFO L480 AbstractCegarLoop]: Abstraction has has 905 places, 877 transitions, 2030 flow [2021-06-10 11:43:51,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:51,716 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:51,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1807 [2021-06-10 11:43:51,716 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1743747016, now seen corresponding path program 1 times [2021-06-10 11:43:51,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:51,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564137959] [2021-06-10 11:43:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:51,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:51,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:51,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:51,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:43:51,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564137959] [2021-06-10 11:43:51,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:51,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:51,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725352129] [2021-06-10 11:43:51,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:51,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:51,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:51,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:51,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 877 transitions, 2030 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:51,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:51,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:51,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:52,116 INFO L129 PetriNetUnfolder]: 75/1003 cut-off events. [2021-06-10 11:43:52,116 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-06-10 11:43:52,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 1003 events. 75/1003 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4192 event pairs, 0 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 1165. Up to 35 conditions per place. [2021-06-10 11:43:52,178 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 9 selfloop transitions, 1 changer transitions 0/875 dead transitions. [2021-06-10 11:43:52,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 875 transitions, 2038 flow [2021-06-10 11:43:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2688 transitions. [2021-06-10 11:43:52,179 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2021-06-10 11:43:52,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2688 transitions. [2021-06-10 11:43:52,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2688 transitions. [2021-06-10 11:43:52,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:52,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2688 transitions. [2021-06-10 11:43:52,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.0) internal successors, (2688), 3 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,182 INFO L185 Difference]: Start difference. First operand has 905 places, 877 transitions, 2030 flow. Second operand 3 states and 2688 transitions. [2021-06-10 11:43:52,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 907 places, 875 transitions, 2038 flow [2021-06-10 11:43:52,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 906 places, 875 transitions, 2037 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:52,190 INFO L241 Difference]: Finished difference. Result has 906 places, 875 transitions, 2019 flow [2021-06-10 11:43:52,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=904, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2019, PETRI_PLACES=906, PETRI_TRANSITIONS=875} [2021-06-10 11:43:52,191 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 1 predicate places. [2021-06-10 11:43:52,191 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 875 transitions, 2019 flow [2021-06-10 11:43:52,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:52,191 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:52,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1808 [2021-06-10 11:43:52,191 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1743745993, now seen corresponding path program 1 times [2021-06-10 11:43:52,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:52,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543198742] [2021-06-10 11:43:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:52,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:52,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:52,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:43:52,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543198742] [2021-06-10 11:43:52,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:52,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:52,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732970948] [2021-06-10 11:43:52,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:52,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:52,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:52,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 875 transitions, 2019 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:52,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:52,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:52,575 INFO L129 PetriNetUnfolder]: 75/1000 cut-off events. [2021-06-10 11:43:52,576 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:52,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 1000 events. 75/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4169 event pairs, 0 based on Foata normal form. 0/892 useless extension candidates. Maximal degree in co-relation 1159. Up to 35 conditions per place. [2021-06-10 11:43:52,646 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/872 dead transitions. [2021-06-10 11:43:52,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 906 places, 872 transitions, 2020 flow [2021-06-10 11:43:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:52,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:52,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:52,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:52,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:52,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:52,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,651 INFO L185 Difference]: Start difference. First operand has 906 places, 875 transitions, 2019 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:52,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 906 places, 872 transitions, 2020 flow [2021-06-10 11:43:52,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 872 transitions, 2015 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:52,659 INFO L241 Difference]: Finished difference. Result has 903 places, 872 transitions, 2005 flow [2021-06-10 11:43:52,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2005, PETRI_PLACES=903, PETRI_TRANSITIONS=872} [2021-06-10 11:43:52,660 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, -2 predicate places. [2021-06-10 11:43:52,660 INFO L480 AbstractCegarLoop]: Abstraction has has 903 places, 872 transitions, 2005 flow [2021-06-10 11:43:52,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:52,660 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:52,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1809 [2021-06-10 11:43:52,660 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -31353276, now seen corresponding path program 1 times [2021-06-10 11:43:52,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:52,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384103411] [2021-06-10 11:43:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:52,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:52,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:52,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:52,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:43:52,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384103411] [2021-06-10 11:43:52,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:52,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:52,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161945012] [2021-06-10 11:43:52,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:52,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:52,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:52,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:52,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:52,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 872 transitions, 2005 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:52,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:52,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:52,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:53,051 INFO L129 PetriNetUnfolder]: 73/1005 cut-off events. [2021-06-10 11:43:53,052 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:53,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1005 events. 73/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4219 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1167. Up to 35 conditions per place. [2021-06-10 11:43:53,119 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/873 dead transitions. [2021-06-10 11:43:53,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 873 transitions, 2021 flow [2021-06-10 11:43:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:53,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:53,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:53,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:53,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:53,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:53,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,124 INFO L185 Difference]: Start difference. First operand has 903 places, 872 transitions, 2005 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:53,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 873 transitions, 2021 flow [2021-06-10 11:43:53,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 904 places, 873 transitions, 2020 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:53,133 INFO L241 Difference]: Finished difference. Result has 906 places, 873 transitions, 2018 flow [2021-06-10 11:43:53,133 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2018, PETRI_PLACES=906, PETRI_TRANSITIONS=873} [2021-06-10 11:43:53,133 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 1 predicate places. [2021-06-10 11:43:53,133 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 873 transitions, 2018 flow [2021-06-10 11:43:53,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:53,133 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:53,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1810 [2021-06-10 11:43:53,134 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash -31354299, now seen corresponding path program 1 times [2021-06-10 11:43:53,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:53,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120955411] [2021-06-10 11:43:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:53,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:53,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:53,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:43:53,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120955411] [2021-06-10 11:43:53,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:53,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:53,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767512239] [2021-06-10 11:43:53,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:53,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:53,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:53,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 873 transitions, 2018 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:53,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:53,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:53,525 INFO L129 PetriNetUnfolder]: 73/1006 cut-off events. [2021-06-10 11:43:53,525 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:53,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 1006 events. 73/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4226 event pairs, 0 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1173. Up to 35 conditions per place. [2021-06-10 11:43:53,591 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/874 dead transitions. [2021-06-10 11:43:53,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 874 transitions, 2044 flow [2021-06-10 11:43:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:53,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:53,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:53,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:53,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:53,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,595 INFO L185 Difference]: Start difference. First operand has 906 places, 873 transitions, 2018 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:53,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 874 transitions, 2044 flow [2021-06-10 11:43:53,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 874 transitions, 2042 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:53,603 INFO L241 Difference]: Finished difference. Result has 909 places, 874 transitions, 2034 flow [2021-06-10 11:43:53,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2034, PETRI_PLACES=909, PETRI_TRANSITIONS=874} [2021-06-10 11:43:53,604 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 4 predicate places. [2021-06-10 11:43:53,604 INFO L480 AbstractCegarLoop]: Abstraction has has 909 places, 874 transitions, 2034 flow [2021-06-10 11:43:53,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:53,604 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:53,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1811 [2021-06-10 11:43:53,604 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -30399964, now seen corresponding path program 1 times [2021-06-10 11:43:53,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:53,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72852940] [2021-06-10 11:43:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:53,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:53,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:53,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:53,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:43:53,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72852940] [2021-06-10 11:43:53,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:53,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:53,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376007437] [2021-06-10 11:43:53,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:53,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:53,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:53,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 874 transitions, 2034 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:53,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:53,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:53,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:54,027 INFO L129 PetriNetUnfolder]: 72/1003 cut-off events. [2021-06-10 11:43:54,027 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-06-10 11:43:54,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 1003 events. 72/1003 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4207 event pairs, 0 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1172. Up to 35 conditions per place. [2021-06-10 11:43:54,068 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 9 selfloop transitions, 1 changer transitions 0/872 dead transitions. [2021-06-10 11:43:54,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 872 transitions, 2042 flow [2021-06-10 11:43:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2688 transitions. [2021-06-10 11:43:54,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2021-06-10 11:43:54,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2688 transitions. [2021-06-10 11:43:54,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2688 transitions. [2021-06-10 11:43:54,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:54,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2688 transitions. [2021-06-10 11:43:54,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.0) internal successors, (2688), 3 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,073 INFO L185 Difference]: Start difference. First operand has 909 places, 874 transitions, 2034 flow. Second operand 3 states and 2688 transitions. [2021-06-10 11:43:54,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 872 transitions, 2042 flow [2021-06-10 11:43:54,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 872 transitions, 2041 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:54,080 INFO L241 Difference]: Finished difference. Result has 910 places, 872 transitions, 2023 flow [2021-06-10 11:43:54,080 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2023, PETRI_PLACES=910, PETRI_TRANSITIONS=872} [2021-06-10 11:43:54,080 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 5 predicate places. [2021-06-10 11:43:54,080 INFO L480 AbstractCegarLoop]: Abstraction has has 910 places, 872 transitions, 2023 flow [2021-06-10 11:43:54,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:54,081 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:54,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1812 [2021-06-10 11:43:54,081 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash -30400987, now seen corresponding path program 1 times [2021-06-10 11:43:54,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:54,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704890934] [2021-06-10 11:43:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:54,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:54,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:54,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:43:54,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704890934] [2021-06-10 11:43:54,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:54,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:54,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140263606] [2021-06-10 11:43:54,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:54,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:54,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:54,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 910 places, 872 transitions, 2023 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:54,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:54,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:54,471 INFO L129 PetriNetUnfolder]: 72/1000 cut-off events. [2021-06-10 11:43:54,472 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:54,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 1000 events. 72/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4186 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1166. Up to 35 conditions per place. [2021-06-10 11:43:54,535 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/869 dead transitions. [2021-06-10 11:43:54,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 869 transitions, 2024 flow [2021-06-10 11:43:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:54,537 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:54,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:54,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:54,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:54,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:54,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,540 INFO L185 Difference]: Start difference. First operand has 910 places, 872 transitions, 2023 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:54,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 869 transitions, 2024 flow [2021-06-10 11:43:54,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 869 transitions, 2019 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:54,548 INFO L241 Difference]: Finished difference. Result has 907 places, 869 transitions, 2009 flow [2021-06-10 11:43:54,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2009, PETRI_PLACES=907, PETRI_TRANSITIONS=869} [2021-06-10 11:43:54,548 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 2 predicate places. [2021-06-10 11:43:54,548 INFO L480 AbstractCegarLoop]: Abstraction has has 907 places, 869 transitions, 2009 flow [2021-06-10 11:43:54,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:54,549 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:54,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1813 [2021-06-10 11:43:54,549 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1785769090, now seen corresponding path program 1 times [2021-06-10 11:43:54,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:54,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295723031] [2021-06-10 11:43:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:54,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:54,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:54,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:54,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:54,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295723031] [2021-06-10 11:43:54,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:54,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:54,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976926615] [2021-06-10 11:43:54,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:54,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:54,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:54,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 869 transitions, 2009 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:54,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:54,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:54,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:54,936 INFO L129 PetriNetUnfolder]: 71/1007 cut-off events. [2021-06-10 11:43:54,937 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:54,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 1007 events. 71/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4244 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1176. Up to 35 conditions per place. [2021-06-10 11:43:55,002 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/870 dead transitions. [2021-06-10 11:43:55,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 870 transitions, 2025 flow [2021-06-10 11:43:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:55,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:55,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:55,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:55,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:55,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:55,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,006 INFO L185 Difference]: Start difference. First operand has 907 places, 869 transitions, 2009 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 870 transitions, 2025 flow [2021-06-10 11:43:55,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 908 places, 870 transitions, 2024 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:55,015 INFO L241 Difference]: Finished difference. Result has 909 places, 869 transitions, 2013 flow [2021-06-10 11:43:55,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=906, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2013, PETRI_PLACES=909, PETRI_TRANSITIONS=869} [2021-06-10 11:43:55,015 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 4 predicate places. [2021-06-10 11:43:55,015 INFO L480 AbstractCegarLoop]: Abstraction has has 909 places, 869 transitions, 2013 flow [2021-06-10 11:43:55,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:55,015 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:55,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1814 [2021-06-10 11:43:55,015 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1785770113, now seen corresponding path program 1 times [2021-06-10 11:43:55,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:55,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788567939] [2021-06-10 11:43:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:55,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:55,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:55,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788567939] [2021-06-10 11:43:55,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:55,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:55,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860714638] [2021-06-10 11:43:55,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:55,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:55,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:55,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 869 transitions, 2013 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:55,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:55,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:55,418 INFO L129 PetriNetUnfolder]: 69/1009 cut-off events. [2021-06-10 11:43:55,418 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:55,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1009 events. 69/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4279 event pairs, 0 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1185. Up to 35 conditions per place. [2021-06-10 11:43:55,485 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/870 dead transitions. [2021-06-10 11:43:55,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 870 transitions, 2039 flow [2021-06-10 11:43:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:55,487 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:55,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:55,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:55,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:55,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:55,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,490 INFO L185 Difference]: Start difference. First operand has 909 places, 869 transitions, 2013 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:55,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 870 transitions, 2039 flow [2021-06-10 11:43:55,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 910 places, 870 transitions, 2038 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:55,499 INFO L241 Difference]: Finished difference. Result has 912 places, 870 transitions, 2030 flow [2021-06-10 11:43:55,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=908, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2030, PETRI_PLACES=912, PETRI_TRANSITIONS=870} [2021-06-10 11:43:55,499 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 7 predicate places. [2021-06-10 11:43:55,499 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 870 transitions, 2030 flow [2021-06-10 11:43:55,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:55,500 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:55,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1815 [2021-06-10 11:43:55,500 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1784816801, now seen corresponding path program 1 times [2021-06-10 11:43:55,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:55,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933314142] [2021-06-10 11:43:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:55,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:55,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:55,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933314142] [2021-06-10 11:43:55,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:55,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:55,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284791999] [2021-06-10 11:43:55,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:55,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:55,523 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:55,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 870 transitions, 2030 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:55,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:55,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:55,894 INFO L129 PetriNetUnfolder]: 69/1002 cut-off events. [2021-06-10 11:43:55,895 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:55,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 1002 events. 69/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4217 event pairs, 0 based on Foata normal form. 1/901 useless extension candidates. Maximal degree in co-relation 1171. Up to 35 conditions per place. [2021-06-10 11:43:55,959 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/868 dead transitions. [2021-06-10 11:43:55,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 868 transitions, 2032 flow [2021-06-10 11:43:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:55,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:55,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:55,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:55,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:55,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:55,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,964 INFO L185 Difference]: Start difference. First operand has 912 places, 870 transitions, 2030 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:55,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 868 transitions, 2032 flow [2021-06-10 11:43:55,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 868 transitions, 2024 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:55,972 INFO L241 Difference]: Finished difference. Result has 912 places, 868 transitions, 2017 flow [2021-06-10 11:43:55,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2017, PETRI_PLACES=912, PETRI_TRANSITIONS=868} [2021-06-10 11:43:55,972 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 7 predicate places. [2021-06-10 11:43:55,972 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 868 transitions, 2017 flow [2021-06-10 11:43:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,973 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:55,973 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:55,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1816 [2021-06-10 11:43:55,973 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1784815778, now seen corresponding path program 1 times [2021-06-10 11:43:55,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:55,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456476522] [2021-06-10 11:43:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:55,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:55,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:55,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:43:55,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456476522] [2021-06-10 11:43:55,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:55,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:55,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098028178] [2021-06-10 11:43:55,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:55,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:55,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:55,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:55,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 868 transitions, 2017 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:55,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:55,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:55,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:56,365 INFO L129 PetriNetUnfolder]: 69/1000 cut-off events. [2021-06-10 11:43:56,365 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:43:56,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1000 events. 69/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4203 event pairs, 0 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1175. Up to 35 conditions per place. [2021-06-10 11:43:56,426 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/866 dead transitions. [2021-06-10 11:43:56,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 866 transitions, 2030 flow [2021-06-10 11:43:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:56,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:56,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:56,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:56,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:56,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:56,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,430 INFO L185 Difference]: Start difference. First operand has 912 places, 868 transitions, 2017 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:56,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 866 transitions, 2030 flow [2021-06-10 11:43:56,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 866 transitions, 2029 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:56,438 INFO L241 Difference]: Finished difference. Result has 911 places, 866 transitions, 2013 flow [2021-06-10 11:43:56,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2013, PETRI_PLACES=911, PETRI_TRANSITIONS=866} [2021-06-10 11:43:56,438 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 6 predicate places. [2021-06-10 11:43:56,438 INFO L480 AbstractCegarLoop]: Abstraction has has 911 places, 866 transitions, 2013 flow [2021-06-10 11:43:56,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:56,439 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:56,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1817 [2021-06-10 11:43:56,439 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2060801151, now seen corresponding path program 1 times [2021-06-10 11:43:56,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:56,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681630206] [2021-06-10 11:43:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:56,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:56,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:56,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:56,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681630206] [2021-06-10 11:43:56,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:56,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:56,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936778102] [2021-06-10 11:43:56,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:56,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:56,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:56,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 866 transitions, 2013 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:56,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:56,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:56,825 INFO L129 PetriNetUnfolder]: 67/1005 cut-off events. [2021-06-10 11:43:56,826 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:56,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 1005 events. 67/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4255 event pairs, 0 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1178. Up to 35 conditions per place. [2021-06-10 11:43:56,890 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/867 dead transitions. [2021-06-10 11:43:56,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 867 transitions, 2029 flow [2021-06-10 11:43:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:56,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:56,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:56,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:56,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:56,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:56,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,894 INFO L185 Difference]: Start difference. First operand has 911 places, 866 transitions, 2013 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:56,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 867 transitions, 2029 flow [2021-06-10 11:43:56,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 867 transitions, 2028 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:56,903 INFO L241 Difference]: Finished difference. Result has 914 places, 867 transitions, 2026 flow [2021-06-10 11:43:56,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2026, PETRI_PLACES=914, PETRI_TRANSITIONS=867} [2021-06-10 11:43:56,903 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 9 predicate places. [2021-06-10 11:43:56,903 INFO L480 AbstractCegarLoop]: Abstraction has has 914 places, 867 transitions, 2026 flow [2021-06-10 11:43:56,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:56,903 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:56,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1818 [2021-06-10 11:43:56,904 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2060800128, now seen corresponding path program 1 times [2021-06-10 11:43:56,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:56,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487775559] [2021-06-10 11:43:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:56,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:56,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:56,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:56,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:56,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487775559] [2021-06-10 11:43:56,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:56,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:56,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085101422] [2021-06-10 11:43:56,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:56,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:56,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:56,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 867 transitions, 2026 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:56,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:56,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:56,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:57,306 INFO L129 PetriNetUnfolder]: 67/1006 cut-off events. [2021-06-10 11:43:57,306 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:43:57,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1006 events. 67/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4264 event pairs, 0 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1186. Up to 35 conditions per place. [2021-06-10 11:43:57,373 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/868 dead transitions. [2021-06-10 11:43:57,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 868 transitions, 2052 flow [2021-06-10 11:43:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:43:57,374 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:43:57,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:43:57,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:43:57,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:57,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:43:57,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,377 INFO L185 Difference]: Start difference. First operand has 914 places, 867 transitions, 2026 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:43:57,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 868 transitions, 2052 flow [2021-06-10 11:43:57,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 868 transitions, 2050 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:57,386 INFO L241 Difference]: Finished difference. Result has 917 places, 868 transitions, 2042 flow [2021-06-10 11:43:57,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=917, PETRI_TRANSITIONS=868} [2021-06-10 11:43:57,386 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 12 predicate places. [2021-06-10 11:43:57,386 INFO L480 AbstractCegarLoop]: Abstraction has has 917 places, 868 transitions, 2042 flow [2021-06-10 11:43:57,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:57,387 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:57,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1819 [2021-06-10 11:43:57,387 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2061753440, now seen corresponding path program 1 times [2021-06-10 11:43:57,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:57,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794374464] [2021-06-10 11:43:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:57,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:57,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:57,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:57,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794374464] [2021-06-10 11:43:57,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:57,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:57,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828783696] [2021-06-10 11:43:57,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:57,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:57,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:57,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:57,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 868 transitions, 2042 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:57,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:57,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:57,786 INFO L129 PetriNetUnfolder]: 66/1002 cut-off events. [2021-06-10 11:43:57,786 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:57,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1002 events. 66/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4237 event pairs, 0 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1179. Up to 35 conditions per place. [2021-06-10 11:43:57,851 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/865 dead transitions. [2021-06-10 11:43:57,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 865 transitions, 2039 flow [2021-06-10 11:43:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:57,852 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:57,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:57,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:57,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:57,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:57,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,855 INFO L185 Difference]: Start difference. First operand has 917 places, 868 transitions, 2042 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:57,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 865 transitions, 2039 flow [2021-06-10 11:43:57,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 916 places, 865 transitions, 2031 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:57,864 INFO L241 Difference]: Finished difference. Result has 916 places, 865 transitions, 2021 flow [2021-06-10 11:43:57,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2021, PETRI_PLACES=916, PETRI_TRANSITIONS=865} [2021-06-10 11:43:57,864 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 11 predicate places. [2021-06-10 11:43:57,864 INFO L480 AbstractCegarLoop]: Abstraction has has 916 places, 865 transitions, 2021 flow [2021-06-10 11:43:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:57,864 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:57,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1820 [2021-06-10 11:43:57,864 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2061754463, now seen corresponding path program 1 times [2021-06-10 11:43:57,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:57,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367120565] [2021-06-10 11:43:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:57,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:57,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:57,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:57,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:43:57,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367120565] [2021-06-10 11:43:57,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:57,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:57,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806811599] [2021-06-10 11:43:57,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:57,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:57,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:57,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 916 places, 865 transitions, 2021 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:57,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:57,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:57,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:58,260 INFO L129 PetriNetUnfolder]: 66/1000 cut-off events. [2021-06-10 11:43:58,260 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:58,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1000 events. 66/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4222 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1182. Up to 35 conditions per place. [2021-06-10 11:43:58,307 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/863 dead transitions. [2021-06-10 11:43:58,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 863 transitions, 2034 flow [2021-06-10 11:43:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:43:58,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:43:58,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:43:58,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:43:58,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:58,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:43:58,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,311 INFO L185 Difference]: Start difference. First operand has 916 places, 865 transitions, 2021 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:43:58,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 863 transitions, 2034 flow [2021-06-10 11:43:58,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 863 transitions, 2033 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:58,319 INFO L241 Difference]: Finished difference. Result has 915 places, 863 transitions, 2017 flow [2021-06-10 11:43:58,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2017, PETRI_PLACES=915, PETRI_TRANSITIONS=863} [2021-06-10 11:43:58,319 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 10 predicate places. [2021-06-10 11:43:58,319 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 863 transitions, 2017 flow [2021-06-10 11:43:58,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:58,320 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:58,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1821 [2021-06-10 11:43:58,320 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1271856190, now seen corresponding path program 1 times [2021-06-10 11:43:58,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:58,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028598028] [2021-06-10 11:43:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:58,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:58,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:43:58,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:58,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028598028] [2021-06-10 11:43:58,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:58,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:58,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37659464] [2021-06-10 11:43:58,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:58,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:58,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:58,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 863 transitions, 2017 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:58,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:58,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:58,724 INFO L129 PetriNetUnfolder]: 65/1008 cut-off events. [2021-06-10 11:43:58,724 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:43:58,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 1008 events. 65/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4291 event pairs, 0 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1194. Up to 35 conditions per place. [2021-06-10 11:43:58,788 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/865 dead transitions. [2021-06-10 11:43:58,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 865 transitions, 2047 flow [2021-06-10 11:43:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:43:58,789 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:43:58,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:43:58,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:43:58,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:58,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:43:58,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,792 INFO L185 Difference]: Start difference. First operand has 915 places, 863 transitions, 2017 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:43:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 865 transitions, 2047 flow [2021-06-10 11:43:58,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 916 places, 865 transitions, 2046 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:58,801 INFO L241 Difference]: Finished difference. Result has 918 places, 865 transitions, 2040 flow [2021-06-10 11:43:58,801 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2040, PETRI_PLACES=918, PETRI_TRANSITIONS=865} [2021-06-10 11:43:58,801 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 13 predicate places. [2021-06-10 11:43:58,801 INFO L480 AbstractCegarLoop]: Abstraction has has 918 places, 865 transitions, 2040 flow [2021-06-10 11:43:58,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:58,801 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:58,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1822 [2021-06-10 11:43:58,801 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1271855167, now seen corresponding path program 1 times [2021-06-10 11:43:58,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:58,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673916347] [2021-06-10 11:43:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:58,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:58,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:58,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:58,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:58,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673916347] [2021-06-10 11:43:58,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:58,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:58,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391728029] [2021-06-10 11:43:58,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:58,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:58,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:58,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 865 transitions, 2040 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:58,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:58,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:58,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:59,193 INFO L129 PetriNetUnfolder]: 63/1009 cut-off events. [2021-06-10 11:43:59,194 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:59,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 1009 events. 63/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4318 event pairs, 0 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 35 conditions per place. [2021-06-10 11:43:59,257 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/865 dead transitions. [2021-06-10 11:43:59,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 865 transitions, 2052 flow [2021-06-10 11:43:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:43:59,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:43:59,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:43:59,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:43:59,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:59,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:43:59,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,262 INFO L185 Difference]: Start difference. First operand has 918 places, 865 transitions, 2040 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:43:59,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 865 transitions, 2052 flow [2021-06-10 11:43:59,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 865 transitions, 2047 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:43:59,270 INFO L241 Difference]: Finished difference. Result has 920 places, 864 transitions, 2036 flow [2021-06-10 11:43:59,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2036, PETRI_PLACES=920, PETRI_TRANSITIONS=864} [2021-06-10 11:43:59,270 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 15 predicate places. [2021-06-10 11:43:59,270 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 864 transitions, 2036 flow [2021-06-10 11:43:59,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,270 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:59,270 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:59,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1823 [2021-06-10 11:43:59,271 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1270902878, now seen corresponding path program 1 times [2021-06-10 11:43:59,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:59,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643385742] [2021-06-10 11:43:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:59,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:59,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:43:59,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:59,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643385742] [2021-06-10 11:43:59,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:59,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:59,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929463596] [2021-06-10 11:43:59,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:59,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:59,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:43:59,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 864 transitions, 2036 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:59,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:43:59,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:43:59,669 INFO L129 PetriNetUnfolder]: 63/1002 cut-off events. [2021-06-10 11:43:59,669 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:43:59,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1002 events. 63/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4254 event pairs, 0 based on Foata normal form. 1/907 useless extension candidates. Maximal degree in co-relation 1188. Up to 35 conditions per place. [2021-06-10 11:43:59,731 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/862 dead transitions. [2021-06-10 11:43:59,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 862 transitions, 2039 flow [2021-06-10 11:43:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:43:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:43:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:43:59,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:43:59,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:43:59,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:43:59,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:43:59,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:43:59,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,736 INFO L185 Difference]: Start difference. First operand has 920 places, 864 transitions, 2036 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:43:59,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 862 transitions, 2039 flow [2021-06-10 11:43:59,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 862 transitions, 2032 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:43:59,745 INFO L241 Difference]: Finished difference. Result has 920 places, 862 transitions, 2025 flow [2021-06-10 11:43:59,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=861, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2025, PETRI_PLACES=920, PETRI_TRANSITIONS=862} [2021-06-10 11:43:59,745 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 15 predicate places. [2021-06-10 11:43:59,745 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 862 transitions, 2025 flow [2021-06-10 11:43:59,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:43:59,745 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:43:59,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1824 [2021-06-10 11:43:59,745 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:43:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:43:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1270901855, now seen corresponding path program 1 times [2021-06-10 11:43:59,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:43:59,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578380079] [2021-06-10 11:43:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:43:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:43:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:59,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:43:59,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:43:59,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:43:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:43:59,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578380079] [2021-06-10 11:43:59,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:43:59,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:43:59,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391652625] [2021-06-10 11:43:59,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:43:59,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:43:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:43:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:43:59,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:43:59,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 862 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:43:59,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:43:59,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:43:59,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:00,138 INFO L129 PetriNetUnfolder]: 63/1000 cut-off events. [2021-06-10 11:44:00,138 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:00,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 1000 events. 63/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4237 event pairs, 0 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1188. Up to 35 conditions per place. [2021-06-10 11:44:00,202 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/860 dead transitions. [2021-06-10 11:44:00,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 860 transitions, 2038 flow [2021-06-10 11:44:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:00,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:00,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:00,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:00,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:00,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:00,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,206 INFO L185 Difference]: Start difference. First operand has 920 places, 862 transitions, 2025 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:00,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 860 transitions, 2038 flow [2021-06-10 11:44:00,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 860 transitions, 2037 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:00,265 INFO L241 Difference]: Finished difference. Result has 919 places, 860 transitions, 2021 flow [2021-06-10 11:44:00,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2021, PETRI_PLACES=919, PETRI_TRANSITIONS=860} [2021-06-10 11:44:00,265 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 14 predicate places. [2021-06-10 11:44:00,265 INFO L480 AbstractCegarLoop]: Abstraction has has 919 places, 860 transitions, 2021 flow [2021-06-10 11:44:00,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:00,266 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:00,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1825 [2021-06-10 11:44:00,266 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 396129182, now seen corresponding path program 1 times [2021-06-10 11:44:00,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:00,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820599403] [2021-06-10 11:44:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:00,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:00,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:00,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:44:00,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820599403] [2021-06-10 11:44:00,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:00,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:00,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312646295] [2021-06-10 11:44:00,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:00,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:00,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:00,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:00,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 860 transitions, 2021 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:00,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:00,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:00,665 INFO L129 PetriNetUnfolder]: 62/1008 cut-off events. [2021-06-10 11:44:00,665 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:00,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 1008 events. 62/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4309 event pairs, 0 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1200. Up to 35 conditions per place. [2021-06-10 11:44:00,728 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/862 dead transitions. [2021-06-10 11:44:00,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 862 transitions, 2051 flow [2021-06-10 11:44:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:00,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:00,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:00,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:00,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:00,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:00,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,732 INFO L185 Difference]: Start difference. First operand has 919 places, 860 transitions, 2021 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:00,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 862 transitions, 2051 flow [2021-06-10 11:44:00,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 862 transitions, 2050 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:00,740 INFO L241 Difference]: Finished difference. Result has 922 places, 862 transitions, 2044 flow [2021-06-10 11:44:00,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2044, PETRI_PLACES=922, PETRI_TRANSITIONS=862} [2021-06-10 11:44:00,740 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 17 predicate places. [2021-06-10 11:44:00,740 INFO L480 AbstractCegarLoop]: Abstraction has has 922 places, 862 transitions, 2044 flow [2021-06-10 11:44:00,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,741 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:00,741 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:00,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1826 [2021-06-10 11:44:00,741 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash 396128159, now seen corresponding path program 1 times [2021-06-10 11:44:00,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:00,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727389517] [2021-06-10 11:44:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:00,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:00,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:00,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:44:00,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727389517] [2021-06-10 11:44:00,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:00,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:00,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663704242] [2021-06-10 11:44:00,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:00,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:00,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:00,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 862 transitions, 2044 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:00,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:00,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:00,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:01,153 INFO L129 PetriNetUnfolder]: 60/1009 cut-off events. [2021-06-10 11:44:01,153 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:01,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1009 events. 60/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4331 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1200. Up to 35 conditions per place. [2021-06-10 11:44:01,218 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/862 dead transitions. [2021-06-10 11:44:01,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 862 transitions, 2056 flow [2021-06-10 11:44:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:01,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:01,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:01,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:01,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:01,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:01,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,223 INFO L185 Difference]: Start difference. First operand has 922 places, 862 transitions, 2044 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:01,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 862 transitions, 2056 flow [2021-06-10 11:44:01,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 862 transitions, 2051 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:01,231 INFO L241 Difference]: Finished difference. Result has 924 places, 861 transitions, 2040 flow [2021-06-10 11:44:01,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2040, PETRI_PLACES=924, PETRI_TRANSITIONS=861} [2021-06-10 11:44:01,231 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 19 predicate places. [2021-06-10 11:44:01,232 INFO L480 AbstractCegarLoop]: Abstraction has has 924 places, 861 transitions, 2040 flow [2021-06-10 11:44:01,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:01,232 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:01,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1827 [2021-06-10 11:44:01,232 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 395175870, now seen corresponding path program 1 times [2021-06-10 11:44:01,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:01,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626684778] [2021-06-10 11:44:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:01,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:01,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:01,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:44:01,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626684778] [2021-06-10 11:44:01,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:01,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:01,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620882505] [2021-06-10 11:44:01,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:01,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:01,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:01,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 861 transitions, 2040 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:01,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:01,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:01,631 INFO L129 PetriNetUnfolder]: 60/1002 cut-off events. [2021-06-10 11:44:01,631 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:01,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 1002 events. 60/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4272 event pairs, 0 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 1194. Up to 35 conditions per place. [2021-06-10 11:44:01,695 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/859 dead transitions. [2021-06-10 11:44:01,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 859 transitions, 2043 flow [2021-06-10 11:44:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:01,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:01,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:01,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:01,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:01,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:01,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,699 INFO L185 Difference]: Start difference. First operand has 924 places, 861 transitions, 2040 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:01,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 859 transitions, 2043 flow [2021-06-10 11:44:01,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 859 transitions, 2036 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:01,708 INFO L241 Difference]: Finished difference. Result has 924 places, 859 transitions, 2029 flow [2021-06-10 11:44:01,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2029, PETRI_PLACES=924, PETRI_TRANSITIONS=859} [2021-06-10 11:44:01,708 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 19 predicate places. [2021-06-10 11:44:01,708 INFO L480 AbstractCegarLoop]: Abstraction has has 924 places, 859 transitions, 2029 flow [2021-06-10 11:44:01,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:01,708 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:01,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1828 [2021-06-10 11:44:01,708 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash 395174847, now seen corresponding path program 1 times [2021-06-10 11:44:01,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:01,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002198124] [2021-06-10 11:44:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:01,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:01,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:01,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:01,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:44:01,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002198124] [2021-06-10 11:44:01,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:01,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:01,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441337354] [2021-06-10 11:44:01,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:01,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:01,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:01,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:01,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:01,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 859 transitions, 2029 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:01,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:01,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:01,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:02,108 INFO L129 PetriNetUnfolder]: 60/1000 cut-off events. [2021-06-10 11:44:02,108 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:02,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 1000 events. 60/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4257 event pairs, 0 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1194. Up to 35 conditions per place. [2021-06-10 11:44:02,171 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2021-06-10 11:44:02,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 857 transitions, 2042 flow [2021-06-10 11:44:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:02,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:02,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:02,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:02,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:02,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:02,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,175 INFO L185 Difference]: Start difference. First operand has 924 places, 859 transitions, 2029 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 857 transitions, 2042 flow [2021-06-10 11:44:02,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 857 transitions, 2041 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:02,184 INFO L241 Difference]: Finished difference. Result has 923 places, 857 transitions, 2025 flow [2021-06-10 11:44:02,184 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2025, PETRI_PLACES=923, PETRI_TRANSITIONS=857} [2021-06-10 11:44:02,184 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 18 predicate places. [2021-06-10 11:44:02,184 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 857 transitions, 2025 flow [2021-06-10 11:44:02,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,185 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:02,185 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:02,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1829 [2021-06-10 11:44:02,185 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1449917665, now seen corresponding path program 1 times [2021-06-10 11:44:02,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:02,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326832527] [2021-06-10 11:44:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:02,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:02,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:02,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:44:02,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326832527] [2021-06-10 11:44:02,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:02,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:02,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183090553] [2021-06-10 11:44:02,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:02,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:02,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:02,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:02,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:02,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 857 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:02,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:02,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:02,577 INFO L129 PetriNetUnfolder]: 58/1005 cut-off events. [2021-06-10 11:44:02,578 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:02,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1005 events. 58/1005 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4306 event pairs, 0 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1197. Up to 35 conditions per place. [2021-06-10 11:44:02,636 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/858 dead transitions. [2021-06-10 11:44:02,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 858 transitions, 2041 flow [2021-06-10 11:44:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:02,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:02,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:02,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:02,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:02,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:02,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,640 INFO L185 Difference]: Start difference. First operand has 923 places, 857 transitions, 2025 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:02,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 858 transitions, 2041 flow [2021-06-10 11:44:02,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 858 transitions, 2040 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:02,648 INFO L241 Difference]: Finished difference. Result has 926 places, 858 transitions, 2038 flow [2021-06-10 11:44:02,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2038, PETRI_PLACES=926, PETRI_TRANSITIONS=858} [2021-06-10 11:44:02,648 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 21 predicate places. [2021-06-10 11:44:02,649 INFO L480 AbstractCegarLoop]: Abstraction has has 926 places, 858 transitions, 2038 flow [2021-06-10 11:44:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:02,649 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:02,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1830 [2021-06-10 11:44:02,649 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1449918688, now seen corresponding path program 1 times [2021-06-10 11:44:02,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:02,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647000207] [2021-06-10 11:44:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:02,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:02,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:02,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:02,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:44:02,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647000207] [2021-06-10 11:44:02,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:02,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:02,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913401636] [2021-06-10 11:44:02,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:02,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:02,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:02,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 858 transitions, 2038 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:02,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:02,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:02,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:03,062 INFO L129 PetriNetUnfolder]: 58/1006 cut-off events. [2021-06-10 11:44:03,062 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:03,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1006 events. 58/1006 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4312 event pairs, 0 based on Foata normal form. 0/913 useless extension candidates. Maximal degree in co-relation 1205. Up to 35 conditions per place. [2021-06-10 11:44:03,126 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/859 dead transitions. [2021-06-10 11:44:03,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 859 transitions, 2064 flow [2021-06-10 11:44:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:44:03,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:44:03,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:44:03,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:44:03,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:03,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:44:03,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,131 INFO L185 Difference]: Start difference. First operand has 926 places, 858 transitions, 2038 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:44:03,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 859 transitions, 2064 flow [2021-06-10 11:44:03,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 859 transitions, 2062 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:03,139 INFO L241 Difference]: Finished difference. Result has 929 places, 859 transitions, 2054 flow [2021-06-10 11:44:03,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2054, PETRI_PLACES=929, PETRI_TRANSITIONS=859} [2021-06-10 11:44:03,139 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 24 predicate places. [2021-06-10 11:44:03,140 INFO L480 AbstractCegarLoop]: Abstraction has has 929 places, 859 transitions, 2054 flow [2021-06-10 11:44:03,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,140 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:03,140 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:03,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1831 [2021-06-10 11:44:03,140 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1448964353, now seen corresponding path program 1 times [2021-06-10 11:44:03,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:03,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840843757] [2021-06-10 11:44:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:03,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:03,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:03,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:44:03,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840843757] [2021-06-10 11:44:03,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:03,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:03,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653004599] [2021-06-10 11:44:03,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:03,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:03,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:03,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:03,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 859 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:03,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:03,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:03,552 INFO L129 PetriNetUnfolder]: 57/1003 cut-off events. [2021-06-10 11:44:03,552 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-06-10 11:44:03,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1003 events. 57/1003 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4297 event pairs, 0 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 1204. Up to 35 conditions per place. [2021-06-10 11:44:03,617 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 9 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2021-06-10 11:44:03,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 857 transitions, 2062 flow [2021-06-10 11:44:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2688 transitions. [2021-06-10 11:44:03,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2021-06-10 11:44:03,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2688 transitions. [2021-06-10 11:44:03,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2688 transitions. [2021-06-10 11:44:03,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:03,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2688 transitions. [2021-06-10 11:44:03,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.0) internal successors, (2688), 3 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,621 INFO L185 Difference]: Start difference. First operand has 929 places, 859 transitions, 2054 flow. Second operand 3 states and 2688 transitions. [2021-06-10 11:44:03,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 857 transitions, 2062 flow [2021-06-10 11:44:03,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 857 transitions, 2061 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:03,631 INFO L241 Difference]: Finished difference. Result has 930 places, 857 transitions, 2043 flow [2021-06-10 11:44:03,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2043, PETRI_PLACES=930, PETRI_TRANSITIONS=857} [2021-06-10 11:44:03,631 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 25 predicate places. [2021-06-10 11:44:03,631 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 857 transitions, 2043 flow [2021-06-10 11:44:03,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:03,631 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:03,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1832 [2021-06-10 11:44:03,631 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1448965376, now seen corresponding path program 1 times [2021-06-10 11:44:03,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:03,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108305476] [2021-06-10 11:44:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:03,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:03,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:03,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:03,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:44:03,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108305476] [2021-06-10 11:44:03,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:03,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:03,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218002120] [2021-06-10 11:44:03,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:03,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:03,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:03,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 857 transitions, 2043 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:03,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:03,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:03,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:04,055 INFO L129 PetriNetUnfolder]: 57/1000 cut-off events. [2021-06-10 11:44:04,055 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:04,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 1000 events. 57/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4274 event pairs, 0 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1198. Up to 35 conditions per place. [2021-06-10 11:44:04,118 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/854 dead transitions. [2021-06-10 11:44:04,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 854 transitions, 2044 flow [2021-06-10 11:44:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:04,120 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:04,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:04,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:04,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:04,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:04,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,122 INFO L185 Difference]: Start difference. First operand has 930 places, 857 transitions, 2043 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:04,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 854 transitions, 2044 flow [2021-06-10 11:44:04,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 854 transitions, 2039 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:04,131 INFO L241 Difference]: Finished difference. Result has 927 places, 854 transitions, 2029 flow [2021-06-10 11:44:04,131 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=925, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=853, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2029, PETRI_PLACES=927, PETRI_TRANSITIONS=854} [2021-06-10 11:44:04,131 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 22 predicate places. [2021-06-10 11:44:04,131 INFO L480 AbstractCegarLoop]: Abstraction has has 927 places, 854 transitions, 2029 flow [2021-06-10 11:44:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:04,132 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:04,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1833 [2021-06-10 11:44:04,132 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1341952031, now seen corresponding path program 1 times [2021-06-10 11:44:04,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:04,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921203609] [2021-06-10 11:44:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:04,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:04,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:04,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:44:04,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921203609] [2021-06-10 11:44:04,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:04,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:04,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637798835] [2021-06-10 11:44:04,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:04,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:04,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:04,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 854 transitions, 2029 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:04,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:04,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:04,541 INFO L129 PetriNetUnfolder]: 56/1008 cut-off events. [2021-06-10 11:44:04,542 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:04,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 1008 events. 56/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4344 event pairs, 0 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1215. Up to 35 conditions per place. [2021-06-10 11:44:04,591 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/856 dead transitions. [2021-06-10 11:44:04,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 856 transitions, 2059 flow [2021-06-10 11:44:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:04,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:04,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:04,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:04,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:04,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:04,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,596 INFO L185 Difference]: Start difference. First operand has 927 places, 854 transitions, 2029 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:04,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 856 transitions, 2059 flow [2021-06-10 11:44:04,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 856 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:04,604 INFO L241 Difference]: Finished difference. Result has 930 places, 856 transitions, 2052 flow [2021-06-10 11:44:04,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2052, PETRI_PLACES=930, PETRI_TRANSITIONS=856} [2021-06-10 11:44:04,604 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 25 predicate places. [2021-06-10 11:44:04,604 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 856 transitions, 2052 flow [2021-06-10 11:44:04,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:04,605 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:04,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1834 [2021-06-10 11:44:04,605 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1341953054, now seen corresponding path program 1 times [2021-06-10 11:44:04,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:04,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408311208] [2021-06-10 11:44:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:04,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:04,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:04,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:04,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:44:04,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408311208] [2021-06-10 11:44:04,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:04,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:04,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652103602] [2021-06-10 11:44:04,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:04,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:04,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:04,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 856 transitions, 2052 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:04,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:04,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:04,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:05,015 INFO L129 PetriNetUnfolder]: 54/1009 cut-off events. [2021-06-10 11:44:05,015 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:05,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1009 events. 54/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4366 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1213. Up to 35 conditions per place. [2021-06-10 11:44:05,079 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/856 dead transitions. [2021-06-10 11:44:05,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 856 transitions, 2064 flow [2021-06-10 11:44:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:05,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:05,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:05,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:05,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:05,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:05,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,083 INFO L185 Difference]: Start difference. First operand has 930 places, 856 transitions, 2052 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 856 transitions, 2064 flow [2021-06-10 11:44:05,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 856 transitions, 2059 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:05,092 INFO L241 Difference]: Finished difference. Result has 932 places, 855 transitions, 2048 flow [2021-06-10 11:44:05,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2048, PETRI_PLACES=932, PETRI_TRANSITIONS=855} [2021-06-10 11:44:05,092 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 27 predicate places. [2021-06-10 11:44:05,092 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 855 transitions, 2048 flow [2021-06-10 11:44:05,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:05,092 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:05,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1835 [2021-06-10 11:44:05,093 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1342905343, now seen corresponding path program 1 times [2021-06-10 11:44:05,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:05,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959253738] [2021-06-10 11:44:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:05,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:05,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:05,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:44:05,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959253738] [2021-06-10 11:44:05,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:05,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:05,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633288691] [2021-06-10 11:44:05,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:05,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:05,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:05,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 855 transitions, 2048 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:05,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:05,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:05,501 INFO L129 PetriNetUnfolder]: 54/1002 cut-off events. [2021-06-10 11:44:05,501 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:05,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1002 events. 54/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4307 event pairs, 0 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 1207. Up to 35 conditions per place. [2021-06-10 11:44:05,566 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/853 dead transitions. [2021-06-10 11:44:05,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 853 transitions, 2051 flow [2021-06-10 11:44:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:05,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:05,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:05,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:05,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:05,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:05,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,570 INFO L185 Difference]: Start difference. First operand has 932 places, 855 transitions, 2048 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:05,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 853 transitions, 2051 flow [2021-06-10 11:44:05,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 853 transitions, 2044 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:05,579 INFO L241 Difference]: Finished difference. Result has 932 places, 853 transitions, 2037 flow [2021-06-10 11:44:05,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2037, PETRI_PLACES=932, PETRI_TRANSITIONS=853} [2021-06-10 11:44:05,579 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 27 predicate places. [2021-06-10 11:44:05,579 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 853 transitions, 2037 flow [2021-06-10 11:44:05,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:05,579 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:05,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1836 [2021-06-10 11:44:05,580 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1342906366, now seen corresponding path program 1 times [2021-06-10 11:44:05,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:05,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430796254] [2021-06-10 11:44:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:05,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:05,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:05,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:05,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:44:05,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430796254] [2021-06-10 11:44:05,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:05,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:05,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078835306] [2021-06-10 11:44:05,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:05,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:05,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:05,603 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:05,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 853 transitions, 2037 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:05,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:05,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:05,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:05,990 INFO L129 PetriNetUnfolder]: 54/1000 cut-off events. [2021-06-10 11:44:05,991 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:06,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1000 events. 54/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4292 event pairs, 0 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1207. Up to 35 conditions per place. [2021-06-10 11:44:06,054 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/851 dead transitions. [2021-06-10 11:44:06,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 851 transitions, 2050 flow [2021-06-10 11:44:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:06,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:06,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:06,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:06,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:06,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:06,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,058 INFO L185 Difference]: Start difference. First operand has 932 places, 853 transitions, 2037 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:06,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 851 transitions, 2050 flow [2021-06-10 11:44:06,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 851 transitions, 2049 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:06,067 INFO L241 Difference]: Finished difference. Result has 931 places, 851 transitions, 2033 flow [2021-06-10 11:44:06,067 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2033, PETRI_PLACES=931, PETRI_TRANSITIONS=851} [2021-06-10 11:44:06,067 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 26 predicate places. [2021-06-10 11:44:06,067 INFO L480 AbstractCegarLoop]: Abstraction has has 931 places, 851 transitions, 2033 flow [2021-06-10 11:44:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:06,067 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:06,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1837 [2021-06-10 11:44:06,067 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1325612315, now seen corresponding path program 1 times [2021-06-10 11:44:06,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:06,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034613210] [2021-06-10 11:44:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:06,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:06,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:06,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:44:06,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034613210] [2021-06-10 11:44:06,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:06,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:06,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987054558] [2021-06-10 11:44:06,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:06,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:06,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:06,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 851 transitions, 2033 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:06,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:06,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:06,540 INFO L129 PetriNetUnfolder]: 53/1008 cut-off events. [2021-06-10 11:44:06,541 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:06,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 1008 events. 53/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4358 event pairs, 0 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1219. Up to 35 conditions per place. [2021-06-10 11:44:06,584 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/853 dead transitions. [2021-06-10 11:44:06,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 853 transitions, 2063 flow [2021-06-10 11:44:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:06,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:06,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:06,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:06,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:06,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:06,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,589 INFO L185 Difference]: Start difference. First operand has 931 places, 851 transitions, 2033 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 853 transitions, 2063 flow [2021-06-10 11:44:06,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 853 transitions, 2062 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:06,597 INFO L241 Difference]: Finished difference. Result has 934 places, 853 transitions, 2056 flow [2021-06-10 11:44:06,598 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2056, PETRI_PLACES=934, PETRI_TRANSITIONS=853} [2021-06-10 11:44:06,598 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 29 predicate places. [2021-06-10 11:44:06,598 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 853 transitions, 2056 flow [2021-06-10 11:44:06,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:06,598 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:06,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1838 [2021-06-10 11:44:06,598 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:06,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:06,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1325611292, now seen corresponding path program 1 times [2021-06-10 11:44:06,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:06,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011200121] [2021-06-10 11:44:06,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:06,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:06,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:06,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:06,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:44:06,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011200121] [2021-06-10 11:44:06,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:06,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:06,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772833471] [2021-06-10 11:44:06,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:06,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:06,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:06,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 853 transitions, 2056 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:06,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:06,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:06,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:07,025 INFO L129 PetriNetUnfolder]: 52/1006 cut-off events. [2021-06-10 11:44:07,025 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:07,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1006 events. 52/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4346 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1216. Up to 35 conditions per place. [2021-06-10 11:44:07,089 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/853 dead transitions. [2021-06-10 11:44:07,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 853 transitions, 2068 flow [2021-06-10 11:44:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:07,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:07,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:07,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:07,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:07,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:07,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,093 INFO L185 Difference]: Start difference. First operand has 934 places, 853 transitions, 2056 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:07,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 853 transitions, 2068 flow [2021-06-10 11:44:07,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 853 transitions, 2063 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:07,102 INFO L241 Difference]: Finished difference. Result has 937 places, 853 transitions, 2061 flow [2021-06-10 11:44:07,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2061, PETRI_PLACES=937, PETRI_TRANSITIONS=853} [2021-06-10 11:44:07,102 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 32 predicate places. [2021-06-10 11:44:07,102 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 853 transitions, 2061 flow [2021-06-10 11:44:07,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:07,103 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:07,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1839 [2021-06-10 11:44:07,103 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1324659003, now seen corresponding path program 1 times [2021-06-10 11:44:07,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:07,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679650255] [2021-06-10 11:44:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:07,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:07,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:07,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:44:07,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679650255] [2021-06-10 11:44:07,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:07,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:07,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026214371] [2021-06-10 11:44:07,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:07,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:07,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:07,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 853 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:07,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:07,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:07,511 INFO L129 PetriNetUnfolder]: 51/1002 cut-off events. [2021-06-10 11:44:07,511 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:07,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 1002 events. 51/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4321 event pairs, 0 based on Foata normal form. 1/919 useless extension candidates. Maximal degree in co-relation 1213. Up to 35 conditions per place. [2021-06-10 11:44:07,574 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/850 dead transitions. [2021-06-10 11:44:07,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 850 transitions, 2058 flow [2021-06-10 11:44:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:07,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:07,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:07,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:07,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:07,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:07,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,578 INFO L185 Difference]: Start difference. First operand has 937 places, 853 transitions, 2061 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:07,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 850 transitions, 2058 flow [2021-06-10 11:44:07,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 850 transitions, 2051 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:07,587 INFO L241 Difference]: Finished difference. Result has 936 places, 850 transitions, 2041 flow [2021-06-10 11:44:07,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=936, PETRI_TRANSITIONS=850} [2021-06-10 11:44:07,588 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 31 predicate places. [2021-06-10 11:44:07,588 INFO L480 AbstractCegarLoop]: Abstraction has has 936 places, 850 transitions, 2041 flow [2021-06-10 11:44:07,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:07,588 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:07,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1840 [2021-06-10 11:44:07,588 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1324657980, now seen corresponding path program 1 times [2021-06-10 11:44:07,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:07,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90844955] [2021-06-10 11:44:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:07,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:07,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:07,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:07,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:44:07,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90844955] [2021-06-10 11:44:07,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:07,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:07,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384938515] [2021-06-10 11:44:07,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:07,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:07,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:07,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 850 transitions, 2041 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:07,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:07,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:07,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:08,004 INFO L129 PetriNetUnfolder]: 51/1000 cut-off events. [2021-06-10 11:44:08,004 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:08,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 1000 events. 51/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4304 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1214. Up to 35 conditions per place. [2021-06-10 11:44:08,068 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/848 dead transitions. [2021-06-10 11:44:08,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 848 transitions, 2054 flow [2021-06-10 11:44:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:08,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:08,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:08,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:08,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:08,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:08,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,072 INFO L185 Difference]: Start difference. First operand has 936 places, 850 transitions, 2041 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:08,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 848 transitions, 2054 flow [2021-06-10 11:44:08,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 848 transitions, 2053 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:08,081 INFO L241 Difference]: Finished difference. Result has 935 places, 848 transitions, 2037 flow [2021-06-10 11:44:08,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=847, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2037, PETRI_PLACES=935, PETRI_TRANSITIONS=848} [2021-06-10 11:44:08,081 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 30 predicate places. [2021-06-10 11:44:08,081 INFO L480 AbstractCegarLoop]: Abstraction has has 935 places, 848 transitions, 2037 flow [2021-06-10 11:44:08,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:08,082 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:08,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1841 [2021-06-10 11:44:08,082 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1968723785, now seen corresponding path program 1 times [2021-06-10 11:44:08,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:08,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606248787] [2021-06-10 11:44:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:08,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:08,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:08,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:44:08,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606248787] [2021-06-10 11:44:08,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:08,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:08,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993521380] [2021-06-10 11:44:08,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:08,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:08,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:08,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 848 transitions, 2037 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:08,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:08,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:08,499 INFO L129 PetriNetUnfolder]: 50/1008 cut-off events. [2021-06-10 11:44:08,499 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:08,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1008 events. 50/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4378 event pairs, 0 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1226. Up to 35 conditions per place. [2021-06-10 11:44:08,600 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/850 dead transitions. [2021-06-10 11:44:08,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 850 transitions, 2067 flow [2021-06-10 11:44:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:08,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:08,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:08,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:08,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:08,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:08,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,604 INFO L185 Difference]: Start difference. First operand has 935 places, 848 transitions, 2037 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:08,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 850 transitions, 2067 flow [2021-06-10 11:44:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 850 transitions, 2066 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:08,612 INFO L241 Difference]: Finished difference. Result has 938 places, 850 transitions, 2060 flow [2021-06-10 11:44:08,612 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2060, PETRI_PLACES=938, PETRI_TRANSITIONS=850} [2021-06-10 11:44:08,612 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 33 predicate places. [2021-06-10 11:44:08,612 INFO L480 AbstractCegarLoop]: Abstraction has has 938 places, 850 transitions, 2060 flow [2021-06-10 11:44:08,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,612 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:08,612 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:08,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1842 [2021-06-10 11:44:08,612 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1968724808, now seen corresponding path program 1 times [2021-06-10 11:44:08,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:08,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014617461] [2021-06-10 11:44:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:08,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:08,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:08,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:08,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:44:08,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014617461] [2021-06-10 11:44:08,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:08,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:08,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178738641] [2021-06-10 11:44:08,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:08,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:08,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:08,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 850 transitions, 2060 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:08,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:08,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:08,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:09,020 INFO L129 PetriNetUnfolder]: 49/1006 cut-off events. [2021-06-10 11:44:09,020 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:09,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 1006 events. 49/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4366 event pairs, 0 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 1223. Up to 35 conditions per place. [2021-06-10 11:44:09,082 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/850 dead transitions. [2021-06-10 11:44:09,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 850 transitions, 2072 flow [2021-06-10 11:44:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:09,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:09,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:09,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:09,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:09,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:09,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,086 INFO L185 Difference]: Start difference. First operand has 938 places, 850 transitions, 2060 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:09,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 850 transitions, 2072 flow [2021-06-10 11:44:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 850 transitions, 2067 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:09,095 INFO L241 Difference]: Finished difference. Result has 941 places, 850 transitions, 2065 flow [2021-06-10 11:44:09,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=847, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2065, PETRI_PLACES=941, PETRI_TRANSITIONS=850} [2021-06-10 11:44:09,095 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 36 predicate places. [2021-06-10 11:44:09,095 INFO L480 AbstractCegarLoop]: Abstraction has has 941 places, 850 transitions, 2065 flow [2021-06-10 11:44:09,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:09,095 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:09,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1843 [2021-06-10 11:44:09,095 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1969677097, now seen corresponding path program 1 times [2021-06-10 11:44:09,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:09,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438799868] [2021-06-10 11:44:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:09,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:09,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:09,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:44:09,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438799868] [2021-06-10 11:44:09,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:09,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:09,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978709638] [2021-06-10 11:44:09,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:09,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:09,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:09,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:09,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 850 transitions, 2065 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:09,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:09,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:09,504 INFO L129 PetriNetUnfolder]: 48/1002 cut-off events. [2021-06-10 11:44:09,505 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:09,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 1002 events. 48/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4341 event pairs, 0 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1220. Up to 35 conditions per place. [2021-06-10 11:44:09,567 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/847 dead transitions. [2021-06-10 11:44:09,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 847 transitions, 2062 flow [2021-06-10 11:44:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:09,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:09,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:09,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:09,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:09,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:09,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,571 INFO L185 Difference]: Start difference. First operand has 941 places, 850 transitions, 2065 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:09,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 847 transitions, 2062 flow [2021-06-10 11:44:09,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 847 transitions, 2055 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:09,580 INFO L241 Difference]: Finished difference. Result has 940 places, 847 transitions, 2045 flow [2021-06-10 11:44:09,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2045, PETRI_PLACES=940, PETRI_TRANSITIONS=847} [2021-06-10 11:44:09,581 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 35 predicate places. [2021-06-10 11:44:09,581 INFO L480 AbstractCegarLoop]: Abstraction has has 940 places, 847 transitions, 2045 flow [2021-06-10 11:44:09,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:09,581 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:09,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1844 [2021-06-10 11:44:09,581 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1969678120, now seen corresponding path program 1 times [2021-06-10 11:44:09,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:09,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686966799] [2021-06-10 11:44:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:09,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:09,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:09,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:09,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:44:09,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686966799] [2021-06-10 11:44:09,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:09,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:09,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291401072] [2021-06-10 11:44:09,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:09,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:09,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:09,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:09,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 847 transitions, 2045 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:09,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:09,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:09,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:10,005 INFO L129 PetriNetUnfolder]: 48/1000 cut-off events. [2021-06-10 11:44:10,005 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:10,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1000 events. 48/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4326 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1221. Up to 35 conditions per place. [2021-06-10 11:44:10,066 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/845 dead transitions. [2021-06-10 11:44:10,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 845 transitions, 2058 flow [2021-06-10 11:44:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:10,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:10,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:10,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:10,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:10,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:10,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,070 INFO L185 Difference]: Start difference. First operand has 940 places, 847 transitions, 2045 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:10,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 845 transitions, 2058 flow [2021-06-10 11:44:10,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 845 transitions, 2057 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:10,079 INFO L241 Difference]: Finished difference. Result has 939 places, 845 transitions, 2041 flow [2021-06-10 11:44:10,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=939, PETRI_TRANSITIONS=845} [2021-06-10 11:44:10,079 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 34 predicate places. [2021-06-10 11:44:10,079 INFO L480 AbstractCegarLoop]: Abstraction has has 939 places, 845 transitions, 2041 flow [2021-06-10 11:44:10,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:10,080 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:10,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1845 [2021-06-10 11:44:10,080 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash 237938350, now seen corresponding path program 1 times [2021-06-10 11:44:10,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:10,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275527347] [2021-06-10 11:44:10,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:10,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:10,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:10,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:44:10,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275527347] [2021-06-10 11:44:10,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:10,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:10,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563424442] [2021-06-10 11:44:10,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:10,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:10,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:10,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 845 transitions, 2041 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:10,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:10,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:10,502 INFO L129 PetriNetUnfolder]: 47/1008 cut-off events. [2021-06-10 11:44:10,502 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:10,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1008 events. 47/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4393 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1233. Up to 35 conditions per place. [2021-06-10 11:44:10,564 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/847 dead transitions. [2021-06-10 11:44:10,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 847 transitions, 2071 flow [2021-06-10 11:44:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:10,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:10,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:10,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:10,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:10,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:10,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,569 INFO L185 Difference]: Start difference. First operand has 939 places, 845 transitions, 2041 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:10,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 847 transitions, 2071 flow [2021-06-10 11:44:10,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 847 transitions, 2070 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:10,577 INFO L241 Difference]: Finished difference. Result has 942 places, 847 transitions, 2064 flow [2021-06-10 11:44:10,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2064, PETRI_PLACES=942, PETRI_TRANSITIONS=847} [2021-06-10 11:44:10,578 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 37 predicate places. [2021-06-10 11:44:10,578 INFO L480 AbstractCegarLoop]: Abstraction has has 942 places, 847 transitions, 2064 flow [2021-06-10 11:44:10,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:10,578 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:10,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1846 [2021-06-10 11:44:10,578 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 237939373, now seen corresponding path program 1 times [2021-06-10 11:44:10,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:10,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67591732] [2021-06-10 11:44:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:10,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:10,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:10,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:10,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:44:10,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67591732] [2021-06-10 11:44:10,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:10,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:10,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416784008] [2021-06-10 11:44:10,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:10,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:10,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:10,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 847 transitions, 2064 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:10,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:10,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:10,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:10,994 INFO L129 PetriNetUnfolder]: 46/1006 cut-off events. [2021-06-10 11:44:10,994 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:11,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 1006 events. 46/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4380 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1230. Up to 35 conditions per place. [2021-06-10 11:44:11,057 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/847 dead transitions. [2021-06-10 11:44:11,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 847 transitions, 2076 flow [2021-06-10 11:44:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:11,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:11,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:11,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:11,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:11,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:11,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,061 INFO L185 Difference]: Start difference. First operand has 942 places, 847 transitions, 2064 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:11,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 847 transitions, 2076 flow [2021-06-10 11:44:11,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 847 transitions, 2071 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:11,070 INFO L241 Difference]: Finished difference. Result has 945 places, 847 transitions, 2069 flow [2021-06-10 11:44:11,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2069, PETRI_PLACES=945, PETRI_TRANSITIONS=847} [2021-06-10 11:44:11,070 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 40 predicate places. [2021-06-10 11:44:11,070 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 847 transitions, 2069 flow [2021-06-10 11:44:11,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:11,070 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:11,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1847 [2021-06-10 11:44:11,071 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 238891662, now seen corresponding path program 1 times [2021-06-10 11:44:11,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:11,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880258666] [2021-06-10 11:44:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:11,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:11,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:11,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:44:11,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880258666] [2021-06-10 11:44:11,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:11,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:11,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26285898] [2021-06-10 11:44:11,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:11,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:11,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:11,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 847 transitions, 2069 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:11,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:11,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:11,482 INFO L129 PetriNetUnfolder]: 45/1002 cut-off events. [2021-06-10 11:44:11,482 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:11,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1002 events. 45/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4356 event pairs, 0 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 1227. Up to 35 conditions per place. [2021-06-10 11:44:11,546 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/844 dead transitions. [2021-06-10 11:44:11,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 844 transitions, 2066 flow [2021-06-10 11:44:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:11,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:11,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:11,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:11,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:11,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:11,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,550 INFO L185 Difference]: Start difference. First operand has 945 places, 847 transitions, 2069 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:11,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 844 transitions, 2066 flow [2021-06-10 11:44:11,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 844 transitions, 2059 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:11,559 INFO L241 Difference]: Finished difference. Result has 944 places, 844 transitions, 2049 flow [2021-06-10 11:44:11,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=942, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2049, PETRI_PLACES=944, PETRI_TRANSITIONS=844} [2021-06-10 11:44:11,559 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 39 predicate places. [2021-06-10 11:44:11,559 INFO L480 AbstractCegarLoop]: Abstraction has has 944 places, 844 transitions, 2049 flow [2021-06-10 11:44:11,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,560 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:11,560 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:11,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1848 [2021-06-10 11:44:11,560 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash 238892685, now seen corresponding path program 1 times [2021-06-10 11:44:11,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:11,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556697388] [2021-06-10 11:44:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:11,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:11,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:11,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:11,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:44:11,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556697388] [2021-06-10 11:44:11,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:11,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:11,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344382682] [2021-06-10 11:44:11,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:11,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:11,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:11,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 844 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:11,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:11,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:11,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:11,970 INFO L129 PetriNetUnfolder]: 45/1000 cut-off events. [2021-06-10 11:44:11,970 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:12,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 1000 events. 45/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4343 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1228. Up to 35 conditions per place. [2021-06-10 11:44:12,032 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/842 dead transitions. [2021-06-10 11:44:12,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 842 transitions, 2062 flow [2021-06-10 11:44:12,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:12,033 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:12,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:12,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:12,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:12,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:12,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,036 INFO L185 Difference]: Start difference. First operand has 944 places, 844 transitions, 2049 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:12,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 842 transitions, 2062 flow [2021-06-10 11:44:12,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 842 transitions, 2061 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:12,045 INFO L241 Difference]: Finished difference. Result has 943 places, 842 transitions, 2045 flow [2021-06-10 11:44:12,045 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2045, PETRI_PLACES=943, PETRI_TRANSITIONS=842} [2021-06-10 11:44:12,045 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 38 predicate places. [2021-06-10 11:44:12,045 INFO L480 AbstractCegarLoop]: Abstraction has has 943 places, 842 transitions, 2045 flow [2021-06-10 11:44:12,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:12,046 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:12,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1849 [2021-06-10 11:44:12,046 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:12,046 INFO L82 PathProgramCache]: Analyzing trace with hash -796479372, now seen corresponding path program 1 times [2021-06-10 11:44:12,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:12,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609493104] [2021-06-10 11:44:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:12,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:12,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:12,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:44:12,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609493104] [2021-06-10 11:44:12,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:12,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:12,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030739588] [2021-06-10 11:44:12,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:12,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:12,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:12,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 842 transitions, 2045 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:12,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:12,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:12,479 INFO L129 PetriNetUnfolder]: 44/1007 cut-off events. [2021-06-10 11:44:12,480 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:12,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1007 events. 44/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4401 event pairs, 0 based on Foata normal form. 0/928 useless extension candidates. Maximal degree in co-relation 1233. Up to 35 conditions per place. [2021-06-10 11:44:12,543 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/843 dead transitions. [2021-06-10 11:44:12,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 843 transitions, 2061 flow [2021-06-10 11:44:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:12,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:12,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:12,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:12,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:12,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:12,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,548 INFO L185 Difference]: Start difference. First operand has 943 places, 842 transitions, 2045 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:12,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 843 transitions, 2061 flow [2021-06-10 11:44:12,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 843 transitions, 2060 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:12,557 INFO L241 Difference]: Finished difference. Result has 945 places, 842 transitions, 2049 flow [2021-06-10 11:44:12,557 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=942, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2049, PETRI_PLACES=945, PETRI_TRANSITIONS=842} [2021-06-10 11:44:12,557 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 40 predicate places. [2021-06-10 11:44:12,557 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 842 transitions, 2049 flow [2021-06-10 11:44:12,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:12,557 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:12,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1850 [2021-06-10 11:44:12,557 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash -796478349, now seen corresponding path program 1 times [2021-06-10 11:44:12,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:12,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208293411] [2021-06-10 11:44:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:12,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:12,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:12,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:12,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:44:12,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208293411] [2021-06-10 11:44:12,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:12,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:12,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671582003] [2021-06-10 11:44:12,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:12,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:12,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:12,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 842 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:12,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:12,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:12,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:12,966 INFO L129 PetriNetUnfolder]: 42/1009 cut-off events. [2021-06-10 11:44:12,966 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:13,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1009 events. 42/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4433 event pairs, 0 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1244. Up to 35 conditions per place. [2021-06-10 11:44:13,021 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/843 dead transitions. [2021-06-10 11:44:13,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 843 transitions, 2075 flow [2021-06-10 11:44:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:44:13,023 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:44:13,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:44:13,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:44:13,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:13,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:44:13,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,026 INFO L185 Difference]: Start difference. First operand has 945 places, 842 transitions, 2049 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:44:13,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 843 transitions, 2075 flow [2021-06-10 11:44:13,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 843 transitions, 2074 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:13,034 INFO L241 Difference]: Finished difference. Result has 948 places, 843 transitions, 2066 flow [2021-06-10 11:44:13,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2066, PETRI_PLACES=948, PETRI_TRANSITIONS=843} [2021-06-10 11:44:13,035 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 43 predicate places. [2021-06-10 11:44:13,035 INFO L480 AbstractCegarLoop]: Abstraction has has 948 places, 843 transitions, 2066 flow [2021-06-10 11:44:13,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:13,035 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:13,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1851 [2021-06-10 11:44:13,035 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -797431661, now seen corresponding path program 1 times [2021-06-10 11:44:13,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:13,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684436540] [2021-06-10 11:44:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:13,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:13,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:13,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:44:13,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684436540] [2021-06-10 11:44:13,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:13,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:13,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239680178] [2021-06-10 11:44:13,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:13,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:13,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:13,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:13,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 843 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:13,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:13,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:13,447 INFO L129 PetriNetUnfolder]: 42/1002 cut-off events. [2021-06-10 11:44:13,447 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:13,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 1002 events. 42/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4371 event pairs, 0 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 1230. Up to 35 conditions per place. [2021-06-10 11:44:13,507 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/841 dead transitions. [2021-06-10 11:44:13,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 841 transitions, 2068 flow [2021-06-10 11:44:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:13,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:13,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:13,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:13,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:13,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:13,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,512 INFO L185 Difference]: Start difference. First operand has 948 places, 843 transitions, 2066 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:13,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 841 transitions, 2068 flow [2021-06-10 11:44:13,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 841 transitions, 2060 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:13,520 INFO L241 Difference]: Finished difference. Result has 948 places, 841 transitions, 2053 flow [2021-06-10 11:44:13,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2053, PETRI_PLACES=948, PETRI_TRANSITIONS=841} [2021-06-10 11:44:13,521 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 43 predicate places. [2021-06-10 11:44:13,521 INFO L480 AbstractCegarLoop]: Abstraction has has 948 places, 841 transitions, 2053 flow [2021-06-10 11:44:13,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:13,521 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:13,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1852 [2021-06-10 11:44:13,521 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash -797432684, now seen corresponding path program 1 times [2021-06-10 11:44:13,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:13,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030621596] [2021-06-10 11:44:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:13,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:13,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:13,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:13,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:44:13,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030621596] [2021-06-10 11:44:13,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:13,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:13,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559915563] [2021-06-10 11:44:13,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:13,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:13,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:13,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 841 transitions, 2053 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:13,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:13,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:13,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:13,940 INFO L129 PetriNetUnfolder]: 42/1000 cut-off events. [2021-06-10 11:44:13,940 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:13,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1000 events. 42/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4356 event pairs, 0 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 1234. Up to 35 conditions per place. [2021-06-10 11:44:14,001 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/839 dead transitions. [2021-06-10 11:44:14,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 839 transitions, 2066 flow [2021-06-10 11:44:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:14,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:14,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:14,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:14,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:14,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:14,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,005 INFO L185 Difference]: Start difference. First operand has 948 places, 841 transitions, 2053 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:14,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 839 transitions, 2066 flow [2021-06-10 11:44:14,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 839 transitions, 2065 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:14,014 INFO L241 Difference]: Finished difference. Result has 947 places, 839 transitions, 2049 flow [2021-06-10 11:44:14,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2049, PETRI_PLACES=947, PETRI_TRANSITIONS=839} [2021-06-10 11:44:14,014 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 42 predicate places. [2021-06-10 11:44:14,014 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 839 transitions, 2049 flow [2021-06-10 11:44:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:14,015 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:14,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1853 [2021-06-10 11:44:14,015 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 590674010, now seen corresponding path program 1 times [2021-06-10 11:44:14,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:14,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215274412] [2021-06-10 11:44:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:14,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:14,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:14,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:44:14,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215274412] [2021-06-10 11:44:14,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:14,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:14,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971034572] [2021-06-10 11:44:14,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:14,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:14,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:14,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:14,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 839 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:14,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:14,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:14,443 INFO L129 PetriNetUnfolder]: 41/1008 cut-off events. [2021-06-10 11:44:14,444 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:14,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1008 events. 41/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4429 event pairs, 0 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1246. Up to 35 conditions per place. [2021-06-10 11:44:14,506 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/841 dead transitions. [2021-06-10 11:44:14,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 841 transitions, 2079 flow [2021-06-10 11:44:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:14,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:14,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:14,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:14,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:14,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:14,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,513 INFO L185 Difference]: Start difference. First operand has 947 places, 839 transitions, 2049 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:14,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 841 transitions, 2079 flow [2021-06-10 11:44:14,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 841 transitions, 2078 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:14,522 INFO L241 Difference]: Finished difference. Result has 950 places, 841 transitions, 2072 flow [2021-06-10 11:44:14,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2072, PETRI_PLACES=950, PETRI_TRANSITIONS=841} [2021-06-10 11:44:14,522 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 45 predicate places. [2021-06-10 11:44:14,522 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 841 transitions, 2072 flow [2021-06-10 11:44:14,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:14,522 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:14,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1854 [2021-06-10 11:44:14,523 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 590672987, now seen corresponding path program 1 times [2021-06-10 11:44:14,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:14,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11183408] [2021-06-10 11:44:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:14,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:14,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:14,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:14,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:44:14,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11183408] [2021-06-10 11:44:14,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:14,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:14,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277753241] [2021-06-10 11:44:14,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:14,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:14,548 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:14,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 841 transitions, 2072 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:14,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:14,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:14,931 INFO L129 PetriNetUnfolder]: 39/1009 cut-off events. [2021-06-10 11:44:14,931 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:14,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1009 events. 39/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4447 event pairs, 0 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1246. Up to 35 conditions per place. [2021-06-10 11:44:14,980 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/841 dead transitions. [2021-06-10 11:44:14,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 841 transitions, 2084 flow [2021-06-10 11:44:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:14,982 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:14,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:14,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:14,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:14,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:14,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,985 INFO L185 Difference]: Start difference. First operand has 950 places, 841 transitions, 2072 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:14,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 841 transitions, 2084 flow [2021-06-10 11:44:14,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 841 transitions, 2079 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:14,993 INFO L241 Difference]: Finished difference. Result has 952 places, 840 transitions, 2068 flow [2021-06-10 11:44:14,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2068, PETRI_PLACES=952, PETRI_TRANSITIONS=840} [2021-06-10 11:44:14,993 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 47 predicate places. [2021-06-10 11:44:14,993 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 840 transitions, 2068 flow [2021-06-10 11:44:14,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:14,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:14,994 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:14,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1855 [2021-06-10 11:44:14,994 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 589720698, now seen corresponding path program 1 times [2021-06-10 11:44:14,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:14,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92516424] [2021-06-10 11:44:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:15,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:15,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:15,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:44:15,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92516424] [2021-06-10 11:44:15,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:15,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:15,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817403695] [2021-06-10 11:44:15,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:15,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:15,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:15,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 840 transitions, 2068 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:15,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:15,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:15,417 INFO L129 PetriNetUnfolder]: 39/1002 cut-off events. [2021-06-10 11:44:15,417 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:15,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 1002 events. 39/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4390 event pairs, 0 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 1240. Up to 35 conditions per place. [2021-06-10 11:44:15,479 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/838 dead transitions. [2021-06-10 11:44:15,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 838 transitions, 2071 flow [2021-06-10 11:44:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:15,480 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:15,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:15,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:15,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:15,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:15,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,483 INFO L185 Difference]: Start difference. First operand has 952 places, 840 transitions, 2068 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:15,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 838 transitions, 2071 flow [2021-06-10 11:44:15,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 838 transitions, 2064 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:15,492 INFO L241 Difference]: Finished difference. Result has 952 places, 838 transitions, 2057 flow [2021-06-10 11:44:15,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2057, PETRI_PLACES=952, PETRI_TRANSITIONS=838} [2021-06-10 11:44:15,493 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 47 predicate places. [2021-06-10 11:44:15,493 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 838 transitions, 2057 flow [2021-06-10 11:44:15,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,493 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:15,493 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:15,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1856 [2021-06-10 11:44:15,493 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 589719675, now seen corresponding path program 1 times [2021-06-10 11:44:15,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:15,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475850085] [2021-06-10 11:44:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:15,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:15,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:15,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:15,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:44:15,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475850085] [2021-06-10 11:44:15,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:15,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:15,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832027645] [2021-06-10 11:44:15,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:15,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:15,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:15,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 838 transitions, 2057 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:15,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:15,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:15,920 INFO L129 PetriNetUnfolder]: 39/1000 cut-off events. [2021-06-10 11:44:15,920 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:15,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1000 events. 39/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4376 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1240. Up to 35 conditions per place. [2021-06-10 11:44:15,981 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/836 dead transitions. [2021-06-10 11:44:15,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 836 transitions, 2070 flow [2021-06-10 11:44:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:15,983 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:15,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:15,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:15,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:15,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:15,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,986 INFO L185 Difference]: Start difference. First operand has 952 places, 838 transitions, 2057 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:15,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 836 transitions, 2070 flow [2021-06-10 11:44:15,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 836 transitions, 2069 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:15,995 INFO L241 Difference]: Finished difference. Result has 951 places, 836 transitions, 2053 flow [2021-06-10 11:44:15,995 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=835, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2053, PETRI_PLACES=951, PETRI_TRANSITIONS=836} [2021-06-10 11:44:15,995 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 46 predicate places. [2021-06-10 11:44:15,995 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 836 transitions, 2053 flow [2021-06-10 11:44:15,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:15,995 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:15,995 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:15,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1857 [2021-06-10 11:44:15,995 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1195741122, now seen corresponding path program 1 times [2021-06-10 11:44:15,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:15,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737538703] [2021-06-10 11:44:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:16,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:16,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:16,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:44:16,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737538703] [2021-06-10 11:44:16,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:16,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:16,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640186000] [2021-06-10 11:44:16,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:16,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:16,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:16,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 836 transitions, 2053 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:16,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:16,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:16,430 INFO L129 PetriNetUnfolder]: 38/1008 cut-off events. [2021-06-10 11:44:16,431 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:16,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1008 events. 38/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4443 event pairs, 0 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1252. Up to 35 conditions per place. [2021-06-10 11:44:16,493 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/838 dead transitions. [2021-06-10 11:44:16,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 838 transitions, 2083 flow [2021-06-10 11:44:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:16,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:16,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:16,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:16,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:16,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,498 INFO L185 Difference]: Start difference. First operand has 951 places, 836 transitions, 2053 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:16,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 838 transitions, 2083 flow [2021-06-10 11:44:16,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 838 transitions, 2082 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:16,507 INFO L241 Difference]: Finished difference. Result has 954 places, 838 transitions, 2076 flow [2021-06-10 11:44:16,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2076, PETRI_PLACES=954, PETRI_TRANSITIONS=838} [2021-06-10 11:44:16,507 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 49 predicate places. [2021-06-10 11:44:16,507 INFO L480 AbstractCegarLoop]: Abstraction has has 954 places, 838 transitions, 2076 flow [2021-06-10 11:44:16,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:16,507 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:16,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1858 [2021-06-10 11:44:16,508 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1195740099, now seen corresponding path program 1 times [2021-06-10 11:44:16,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:16,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136155315] [2021-06-10 11:44:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:16,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:16,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:16,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:16,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:44:16,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136155315] [2021-06-10 11:44:16,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:16,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:16,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900986685] [2021-06-10 11:44:16,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:16,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:16,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:16,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 838 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:16,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:16,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:16,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:16,959 INFO L129 PetriNetUnfolder]: 36/1009 cut-off events. [2021-06-10 11:44:16,959 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:17,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1009 events. 36/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4465 event pairs, 0 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1252. Up to 35 conditions per place. [2021-06-10 11:44:17,005 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/838 dead transitions. [2021-06-10 11:44:17,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 838 transitions, 2088 flow [2021-06-10 11:44:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:17,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:17,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:17,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:17,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:17,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:17,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,009 INFO L185 Difference]: Start difference. First operand has 954 places, 838 transitions, 2076 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:17,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 838 transitions, 2088 flow [2021-06-10 11:44:17,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 838 transitions, 2083 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:17,017 INFO L241 Difference]: Finished difference. Result has 956 places, 837 transitions, 2072 flow [2021-06-10 11:44:17,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2072, PETRI_PLACES=956, PETRI_TRANSITIONS=837} [2021-06-10 11:44:17,018 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 51 predicate places. [2021-06-10 11:44:17,018 INFO L480 AbstractCegarLoop]: Abstraction has has 956 places, 837 transitions, 2072 flow [2021-06-10 11:44:17,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,018 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:17,018 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:17,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1859 [2021-06-10 11:44:17,018 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1194787810, now seen corresponding path program 1 times [2021-06-10 11:44:17,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:17,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718383986] [2021-06-10 11:44:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:17,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:17,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:17,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:44:17,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718383986] [2021-06-10 11:44:17,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:17,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:17,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080805711] [2021-06-10 11:44:17,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:17,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:17,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:17,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 837 transitions, 2072 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:17,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:17,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:17,433 INFO L129 PetriNetUnfolder]: 36/1002 cut-off events. [2021-06-10 11:44:17,433 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:17,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1002 events. 36/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4408 event pairs, 0 based on Foata normal form. 1/934 useless extension candidates. Maximal degree in co-relation 1246. Up to 35 conditions per place. [2021-06-10 11:44:17,493 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/835 dead transitions. [2021-06-10 11:44:17,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 835 transitions, 2075 flow [2021-06-10 11:44:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:17,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:17,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:17,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:17,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:17,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:17,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,498 INFO L185 Difference]: Start difference. First operand has 956 places, 837 transitions, 2072 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:17,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 835 transitions, 2075 flow [2021-06-10 11:44:17,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 835 transitions, 2068 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:17,506 INFO L241 Difference]: Finished difference. Result has 956 places, 835 transitions, 2061 flow [2021-06-10 11:44:17,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2061, PETRI_PLACES=956, PETRI_TRANSITIONS=835} [2021-06-10 11:44:17,507 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 51 predicate places. [2021-06-10 11:44:17,507 INFO L480 AbstractCegarLoop]: Abstraction has has 956 places, 835 transitions, 2061 flow [2021-06-10 11:44:17,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:17,507 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:17,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1860 [2021-06-10 11:44:17,507 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1194786787, now seen corresponding path program 1 times [2021-06-10 11:44:17,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:17,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291780279] [2021-06-10 11:44:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:17,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:17,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:17,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:17,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:44:17,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291780279] [2021-06-10 11:44:17,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:17,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:17,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773551594] [2021-06-10 11:44:17,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:17,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:17,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:17,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:17,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 835 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:17,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:17,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:17,929 INFO L129 PetriNetUnfolder]: 36/1000 cut-off events. [2021-06-10 11:44:17,929 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:17,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 1000 events. 36/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4391 event pairs, 0 based on Foata normal form. 0/930 useless extension candidates. Maximal degree in co-relation 1246. Up to 35 conditions per place. [2021-06-10 11:44:17,989 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/833 dead transitions. [2021-06-10 11:44:17,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 833 transitions, 2074 flow [2021-06-10 11:44:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:17,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:17,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:17,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:17,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:17,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:17,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:17,993 INFO L185 Difference]: Start difference. First operand has 956 places, 835 transitions, 2061 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:17,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 833 transitions, 2074 flow [2021-06-10 11:44:17,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 833 transitions, 2073 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:18,002 INFO L241 Difference]: Finished difference. Result has 955 places, 833 transitions, 2057 flow [2021-06-10 11:44:18,002 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2057, PETRI_PLACES=955, PETRI_TRANSITIONS=833} [2021-06-10 11:44:18,002 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 50 predicate places. [2021-06-10 11:44:18,002 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 833 transitions, 2057 flow [2021-06-10 11:44:18,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,002 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:18,002 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:18,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1861 [2021-06-10 11:44:18,003 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1750480683, now seen corresponding path program 1 times [2021-06-10 11:44:18,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:18,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527174495] [2021-06-10 11:44:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:18,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:18,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:18,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:44:18,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527174495] [2021-06-10 11:44:18,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:18,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:18,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679360480] [2021-06-10 11:44:18,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:18,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:18,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:18,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 833 transitions, 2057 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:18,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:18,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:18,452 INFO L129 PetriNetUnfolder]: 35/1008 cut-off events. [2021-06-10 11:44:18,452 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:18,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1008 events. 35/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4464 event pairs, 0 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1258. Up to 35 conditions per place. [2021-06-10 11:44:18,515 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/835 dead transitions. [2021-06-10 11:44:18,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 835 transitions, 2087 flow [2021-06-10 11:44:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:18,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:18,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:18,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:18,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:18,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:18,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,519 INFO L185 Difference]: Start difference. First operand has 955 places, 833 transitions, 2057 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:18,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 835 transitions, 2087 flow [2021-06-10 11:44:18,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 956 places, 835 transitions, 2086 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:18,528 INFO L241 Difference]: Finished difference. Result has 958 places, 835 transitions, 2080 flow [2021-06-10 11:44:18,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=954, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=958, PETRI_TRANSITIONS=835} [2021-06-10 11:44:18,529 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 53 predicate places. [2021-06-10 11:44:18,529 INFO L480 AbstractCegarLoop]: Abstraction has has 958 places, 835 transitions, 2080 flow [2021-06-10 11:44:18,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:18,529 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:18,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1862 [2021-06-10 11:44:18,529 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1750479660, now seen corresponding path program 1 times [2021-06-10 11:44:18,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:18,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210024755] [2021-06-10 11:44:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:18,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:18,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:18,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:18,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:44:18,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210024755] [2021-06-10 11:44:18,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:18,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:18,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212281692] [2021-06-10 11:44:18,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:18,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:18,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:18,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 835 transitions, 2080 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:18,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:18,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:18,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:18,953 INFO L129 PetriNetUnfolder]: 33/1009 cut-off events. [2021-06-10 11:44:18,953 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:18,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1009 events. 33/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4482 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 1258. Up to 35 conditions per place. [2021-06-10 11:44:18,998 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/835 dead transitions. [2021-06-10 11:44:18,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 835 transitions, 2092 flow [2021-06-10 11:44:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:18,999 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:18,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:18,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:18,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:18,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:19,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,002 INFO L185 Difference]: Start difference. First operand has 958 places, 835 transitions, 2080 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:19,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 835 transitions, 2092 flow [2021-06-10 11:44:19,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 835 transitions, 2087 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:19,010 INFO L241 Difference]: Finished difference. Result has 960 places, 834 transitions, 2076 flow [2021-06-10 11:44:19,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2076, PETRI_PLACES=960, PETRI_TRANSITIONS=834} [2021-06-10 11:44:19,010 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 55 predicate places. [2021-06-10 11:44:19,010 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 834 transitions, 2076 flow [2021-06-10 11:44:19,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:19,011 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:19,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1863 [2021-06-10 11:44:19,011 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1749527371, now seen corresponding path program 1 times [2021-06-10 11:44:19,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:19,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515276884] [2021-06-10 11:44:19,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:19,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:19,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:19,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:44:19,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515276884] [2021-06-10 11:44:19,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:19,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:19,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576543458] [2021-06-10 11:44:19,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:19,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:19,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:19,035 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:19,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 834 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:19,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:19,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:19,431 INFO L129 PetriNetUnfolder]: 33/1002 cut-off events. [2021-06-10 11:44:19,431 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:19,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1002 events. 33/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4423 event pairs, 0 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 1252. Up to 35 conditions per place. [2021-06-10 11:44:19,491 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/832 dead transitions. [2021-06-10 11:44:19,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 832 transitions, 2079 flow [2021-06-10 11:44:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:19,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:19,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:19,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:19,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:19,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:19,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,496 INFO L185 Difference]: Start difference. First operand has 960 places, 834 transitions, 2076 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:19,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 832 transitions, 2079 flow [2021-06-10 11:44:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 832 transitions, 2072 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:19,504 INFO L241 Difference]: Finished difference. Result has 960 places, 832 transitions, 2065 flow [2021-06-10 11:44:19,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2065, PETRI_PLACES=960, PETRI_TRANSITIONS=832} [2021-06-10 11:44:19,505 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 55 predicate places. [2021-06-10 11:44:19,505 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 832 transitions, 2065 flow [2021-06-10 11:44:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:19,505 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:19,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1864 [2021-06-10 11:44:19,505 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1749526348, now seen corresponding path program 1 times [2021-06-10 11:44:19,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:19,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78840191] [2021-06-10 11:44:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:19,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:19,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:19,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:19,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:44:19,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78840191] [2021-06-10 11:44:19,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:19,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:19,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078227889] [2021-06-10 11:44:19,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:19,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:19,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:19,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:19,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 832 transitions, 2065 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:19,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:19,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:19,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:19,936 INFO L129 PetriNetUnfolder]: 33/1000 cut-off events. [2021-06-10 11:44:19,936 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:19,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1000 events. 33/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4408 event pairs, 0 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 1252. Up to 35 conditions per place. [2021-06-10 11:44:19,996 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/830 dead transitions. [2021-06-10 11:44:19,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 830 transitions, 2078 flow [2021-06-10 11:44:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:19,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:19,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:19,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:19,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:19,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:19,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,000 INFO L185 Difference]: Start difference. First operand has 960 places, 832 transitions, 2065 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:20,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 830 transitions, 2078 flow [2021-06-10 11:44:20,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 830 transitions, 2077 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:20,010 INFO L241 Difference]: Finished difference. Result has 959 places, 830 transitions, 2061 flow [2021-06-10 11:44:20,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2061, PETRI_PLACES=959, PETRI_TRANSITIONS=830} [2021-06-10 11:44:20,010 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 54 predicate places. [2021-06-10 11:44:20,010 INFO L480 AbstractCegarLoop]: Abstraction has has 959 places, 830 transitions, 2061 flow [2021-06-10 11:44:20,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:20,010 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:20,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1865 [2021-06-10 11:44:20,011 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2110337302, now seen corresponding path program 1 times [2021-06-10 11:44:20,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:20,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998607470] [2021-06-10 11:44:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:20,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:20,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:20,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:44:20,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998607470] [2021-06-10 11:44:20,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:20,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:20,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178787217] [2021-06-10 11:44:20,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:20,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:20,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:20,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 830 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:20,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:20,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:20,440 INFO L129 PetriNetUnfolder]: 32/1007 cut-off events. [2021-06-10 11:44:20,440 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:20,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1007 events. 32/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4470 event pairs, 0 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1257. Up to 35 conditions per place. [2021-06-10 11:44:20,502 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/831 dead transitions. [2021-06-10 11:44:20,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 831 transitions, 2077 flow [2021-06-10 11:44:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:20,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:20,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:20,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:20,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:20,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:20,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,506 INFO L185 Difference]: Start difference. First operand has 959 places, 830 transitions, 2061 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 831 transitions, 2077 flow [2021-06-10 11:44:20,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 831 transitions, 2076 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:20,515 INFO L241 Difference]: Finished difference. Result has 961 places, 830 transitions, 2065 flow [2021-06-10 11:44:20,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2065, PETRI_PLACES=961, PETRI_TRANSITIONS=830} [2021-06-10 11:44:20,515 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 56 predicate places. [2021-06-10 11:44:20,516 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 830 transitions, 2065 flow [2021-06-10 11:44:20,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,516 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:20,516 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:20,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1866 [2021-06-10 11:44:20,516 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2110338325, now seen corresponding path program 1 times [2021-06-10 11:44:20,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:20,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358190665] [2021-06-10 11:44:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:20,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:20,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:20,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:20,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:44:20,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358190665] [2021-06-10 11:44:20,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:20,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:20,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061202774] [2021-06-10 11:44:20,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:20,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:20,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:20,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 830 transitions, 2065 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:20,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:20,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:20,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:20,955 INFO L129 PetriNetUnfolder]: 30/1009 cut-off events. [2021-06-10 11:44:20,955 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:20,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1009 events. 30/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4503 event pairs, 0 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1268. Up to 35 conditions per place. [2021-06-10 11:44:20,999 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/831 dead transitions. [2021-06-10 11:44:20,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 831 transitions, 2091 flow [2021-06-10 11:44:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:44:21,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:44:21,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:44:21,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:44:21,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:21,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:44:21,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,003 INFO L185 Difference]: Start difference. First operand has 961 places, 830 transitions, 2065 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:44:21,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 831 transitions, 2091 flow [2021-06-10 11:44:21,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 831 transitions, 2090 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:21,011 INFO L241 Difference]: Finished difference. Result has 964 places, 831 transitions, 2082 flow [2021-06-10 11:44:21,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2082, PETRI_PLACES=964, PETRI_TRANSITIONS=831} [2021-06-10 11:44:21,011 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 59 predicate places. [2021-06-10 11:44:21,012 INFO L480 AbstractCegarLoop]: Abstraction has has 964 places, 831 transitions, 2082 flow [2021-06-10 11:44:21,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:21,012 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:21,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1867 [2021-06-10 11:44:21,012 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:21,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2109385013, now seen corresponding path program 1 times [2021-06-10 11:44:21,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:21,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308010385] [2021-06-10 11:44:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:21,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:21,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:21,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:44:21,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308010385] [2021-06-10 11:44:21,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:21,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:21,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377892915] [2021-06-10 11:44:21,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:21,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:21,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:21,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 831 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:21,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:21,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:21,444 INFO L129 PetriNetUnfolder]: 30/1002 cut-off events. [2021-06-10 11:44:21,444 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:21,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1002 events. 30/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4443 event pairs, 0 based on Foata normal form. 1/940 useless extension candidates. Maximal degree in co-relation 1254. Up to 35 conditions per place. [2021-06-10 11:44:21,505 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/829 dead transitions. [2021-06-10 11:44:21,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 966 places, 829 transitions, 2084 flow [2021-06-10 11:44:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:21,507 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:21,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:21,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:21,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:21,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:21,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,509 INFO L185 Difference]: Start difference. First operand has 964 places, 831 transitions, 2082 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:21,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 966 places, 829 transitions, 2084 flow [2021-06-10 11:44:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 963 places, 829 transitions, 2076 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:21,519 INFO L241 Difference]: Finished difference. Result has 964 places, 829 transitions, 2069 flow [2021-06-10 11:44:21,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2069, PETRI_PLACES=964, PETRI_TRANSITIONS=829} [2021-06-10 11:44:21,519 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 59 predicate places. [2021-06-10 11:44:21,519 INFO L480 AbstractCegarLoop]: Abstraction has has 964 places, 829 transitions, 2069 flow [2021-06-10 11:44:21,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:21,520 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:21,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1868 [2021-06-10 11:44:21,520 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2109383990, now seen corresponding path program 1 times [2021-06-10 11:44:21,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:21,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773802520] [2021-06-10 11:44:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:21,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:21,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:21,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:21,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:44:21,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773802520] [2021-06-10 11:44:21,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:21,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:21,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794673658] [2021-06-10 11:44:21,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:21,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:21,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:21,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 829 transitions, 2069 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:21,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:21,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:21,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:21,967 INFO L129 PetriNetUnfolder]: 30/1000 cut-off events. [2021-06-10 11:44:21,967 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:22,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 1000 events. 30/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4425 event pairs, 0 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1258. Up to 35 conditions per place. [2021-06-10 11:44:22,027 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/827 dead transitions. [2021-06-10 11:44:22,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 827 transitions, 2082 flow [2021-06-10 11:44:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:22,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:22,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:22,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:22,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:22,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:22,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,032 INFO L185 Difference]: Start difference. First operand has 964 places, 829 transitions, 2069 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:22,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 827 transitions, 2082 flow [2021-06-10 11:44:22,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 963 places, 827 transitions, 2081 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:22,040 INFO L241 Difference]: Finished difference. Result has 963 places, 827 transitions, 2065 flow [2021-06-10 11:44:22,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=826, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2065, PETRI_PLACES=963, PETRI_TRANSITIONS=827} [2021-06-10 11:44:22,041 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 58 predicate places. [2021-06-10 11:44:22,041 INFO L480 AbstractCegarLoop]: Abstraction has has 963 places, 827 transitions, 2065 flow [2021-06-10 11:44:22,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:22,041 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:22,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1869 [2021-06-10 11:44:22,041 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash 672486656, now seen corresponding path program 1 times [2021-06-10 11:44:22,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:22,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368533666] [2021-06-10 11:44:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:22,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:22,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:22,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:44:22,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368533666] [2021-06-10 11:44:22,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:22,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:22,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879020372] [2021-06-10 11:44:22,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:22,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:22,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:22,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:22,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 963 places, 827 transitions, 2065 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:22,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:22,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:22,490 INFO L129 PetriNetUnfolder]: 29/1008 cut-off events. [2021-06-10 11:44:22,491 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:22,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 1008 events. 29/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4497 event pairs, 0 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 1270. Up to 35 conditions per place. [2021-06-10 11:44:22,551 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/829 dead transitions. [2021-06-10 11:44:22,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 829 transitions, 2095 flow [2021-06-10 11:44:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:22,553 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:22,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:22,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:22,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:22,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:22,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,556 INFO L185 Difference]: Start difference. First operand has 963 places, 827 transitions, 2065 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:22,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 829 transitions, 2095 flow [2021-06-10 11:44:22,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 829 transitions, 2094 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:22,565 INFO L241 Difference]: Finished difference. Result has 966 places, 829 transitions, 2088 flow [2021-06-10 11:44:22,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=966, PETRI_TRANSITIONS=829} [2021-06-10 11:44:22,565 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 61 predicate places. [2021-06-10 11:44:22,565 INFO L480 AbstractCegarLoop]: Abstraction has has 966 places, 829 transitions, 2088 flow [2021-06-10 11:44:22,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:22,565 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:22,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1870 [2021-06-10 11:44:22,566 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 672485633, now seen corresponding path program 1 times [2021-06-10 11:44:22,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:22,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008019763] [2021-06-10 11:44:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:22,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:22,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:22,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:22,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:44:22,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008019763] [2021-06-10 11:44:22,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:22,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:22,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527235990] [2021-06-10 11:44:22,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:22,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:22,591 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:22,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 829 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:22,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:22,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:22,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:23,023 INFO L129 PetriNetUnfolder]: 27/1009 cut-off events. [2021-06-10 11:44:23,024 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:23,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 1009 events. 27/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4519 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1270. Up to 35 conditions per place. [2021-06-10 11:44:23,068 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/829 dead transitions. [2021-06-10 11:44:23,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 829 transitions, 2100 flow [2021-06-10 11:44:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:23,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:23,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:23,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:23,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:23,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:23,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,073 INFO L185 Difference]: Start difference. First operand has 966 places, 829 transitions, 2088 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:23,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 829 transitions, 2100 flow [2021-06-10 11:44:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 967 places, 829 transitions, 2095 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:23,081 INFO L241 Difference]: Finished difference. Result has 968 places, 828 transitions, 2084 flow [2021-06-10 11:44:23,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=965, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=968, PETRI_TRANSITIONS=828} [2021-06-10 11:44:23,081 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 63 predicate places. [2021-06-10 11:44:23,081 INFO L480 AbstractCegarLoop]: Abstraction has has 968 places, 828 transitions, 2084 flow [2021-06-10 11:44:23,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:23,082 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:23,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1871 [2021-06-10 11:44:23,082 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash 671533344, now seen corresponding path program 1 times [2021-06-10 11:44:23,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:23,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960531905] [2021-06-10 11:44:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:23,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:23,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:23,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:44:23,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960531905] [2021-06-10 11:44:23,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:23,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:23,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166628156] [2021-06-10 11:44:23,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:23,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:23,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:23,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 828 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:23,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:23,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:23,527 INFO L129 PetriNetUnfolder]: 27/1002 cut-off events. [2021-06-10 11:44:23,527 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:23,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1002 events. 27/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4459 event pairs, 0 based on Foata normal form. 1/943 useless extension candidates. Maximal degree in co-relation 1264. Up to 35 conditions per place. [2021-06-10 11:44:23,586 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/826 dead transitions. [2021-06-10 11:44:23,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 826 transitions, 2087 flow [2021-06-10 11:44:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:23,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:23,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:23,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:23,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:23,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:23,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,590 INFO L185 Difference]: Start difference. First operand has 968 places, 828 transitions, 2084 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:23,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 826 transitions, 2087 flow [2021-06-10 11:44:23,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 967 places, 826 transitions, 2080 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:23,599 INFO L241 Difference]: Finished difference. Result has 968 places, 826 transitions, 2073 flow [2021-06-10 11:44:23,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=965, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2073, PETRI_PLACES=968, PETRI_TRANSITIONS=826} [2021-06-10 11:44:23,600 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 63 predicate places. [2021-06-10 11:44:23,600 INFO L480 AbstractCegarLoop]: Abstraction has has 968 places, 826 transitions, 2073 flow [2021-06-10 11:44:23,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:23,600 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:23,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1872 [2021-06-10 11:44:23,600 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:23,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 671532321, now seen corresponding path program 1 times [2021-06-10 11:44:23,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:23,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661873891] [2021-06-10 11:44:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:23,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:23,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:23,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:23,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:44:23,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661873891] [2021-06-10 11:44:23,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:23,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:23,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241767557] [2021-06-10 11:44:23,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:23,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:23,625 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:23,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 826 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:23,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:23,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:23,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:24,032 INFO L129 PetriNetUnfolder]: 27/1000 cut-off events. [2021-06-10 11:44:24,033 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:24,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1000 events. 27/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4447 event pairs, 0 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1264. Up to 35 conditions per place. [2021-06-10 11:44:24,092 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/824 dead transitions. [2021-06-10 11:44:24,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 824 transitions, 2086 flow [2021-06-10 11:44:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:24,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:24,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:24,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:24,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:24,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:24,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,096 INFO L185 Difference]: Start difference. First operand has 968 places, 826 transitions, 2073 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:24,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 824 transitions, 2086 flow [2021-06-10 11:44:24,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 967 places, 824 transitions, 2085 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:24,105 INFO L241 Difference]: Finished difference. Result has 967 places, 824 transitions, 2069 flow [2021-06-10 11:44:24,105 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=965, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2069, PETRI_PLACES=967, PETRI_TRANSITIONS=824} [2021-06-10 11:44:24,105 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 62 predicate places. [2021-06-10 11:44:24,105 INFO L480 AbstractCegarLoop]: Abstraction has has 967 places, 824 transitions, 2069 flow [2021-06-10 11:44:24,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:24,105 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:24,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1873 [2021-06-10 11:44:24,105 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:24,106 INFO L82 PathProgramCache]: Analyzing trace with hash -104924820, now seen corresponding path program 1 times [2021-06-10 11:44:24,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:24,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620326875] [2021-06-10 11:44:24,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:24,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:24,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:24,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:44:24,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620326875] [2021-06-10 11:44:24,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:24,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:24,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566429105] [2021-06-10 11:44:24,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:24,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:24,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:24,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 824 transitions, 2069 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:24,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:24,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:24,554 INFO L129 PetriNetUnfolder]: 26/1008 cut-off events. [2021-06-10 11:44:24,555 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:24,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1008 events. 26/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4513 event pairs, 0 based on Foata normal form. 0/947 useless extension candidates. Maximal degree in co-relation 1276. Up to 35 conditions per place. [2021-06-10 11:44:24,617 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/826 dead transitions. [2021-06-10 11:44:24,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 826 transitions, 2099 flow [2021-06-10 11:44:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:24,618 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:24,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:24,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:24,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:24,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:24,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,621 INFO L185 Difference]: Start difference. First operand has 967 places, 824 transitions, 2069 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 826 transitions, 2099 flow [2021-06-10 11:44:24,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 826 transitions, 2098 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:24,631 INFO L241 Difference]: Finished difference. Result has 970 places, 826 transitions, 2092 flow [2021-06-10 11:44:24,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=970, PETRI_TRANSITIONS=826} [2021-06-10 11:44:24,631 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 65 predicate places. [2021-06-10 11:44:24,631 INFO L480 AbstractCegarLoop]: Abstraction has has 970 places, 826 transitions, 2092 flow [2021-06-10 11:44:24,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:24,631 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:24,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1874 [2021-06-10 11:44:24,632 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -104925843, now seen corresponding path program 1 times [2021-06-10 11:44:24,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:24,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667034108] [2021-06-10 11:44:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:24,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:24,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:24,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:24,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:44:24,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667034108] [2021-06-10 11:44:24,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:24,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:24,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273395216] [2021-06-10 11:44:24,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:24,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:24,659 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:24,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 826 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:24,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:24,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:24,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:25,067 INFO L129 PetriNetUnfolder]: 24/1009 cut-off events. [2021-06-10 11:44:25,068 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:25,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1009 events. 24/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4539 event pairs, 0 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1276. Up to 35 conditions per place. [2021-06-10 11:44:25,113 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/826 dead transitions. [2021-06-10 11:44:25,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 826 transitions, 2104 flow [2021-06-10 11:44:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:25,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:25,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:25,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:25,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:25,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:25,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,117 INFO L185 Difference]: Start difference. First operand has 970 places, 826 transitions, 2092 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:25,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 826 transitions, 2104 flow [2021-06-10 11:44:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 826 transitions, 2099 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:25,125 INFO L241 Difference]: Finished difference. Result has 972 places, 825 transitions, 2088 flow [2021-06-10 11:44:25,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=972, PETRI_TRANSITIONS=825} [2021-06-10 11:44:25,126 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 67 predicate places. [2021-06-10 11:44:25,126 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 825 transitions, 2088 flow [2021-06-10 11:44:25,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:25,126 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:25,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1875 [2021-06-10 11:44:25,126 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -105878132, now seen corresponding path program 1 times [2021-06-10 11:44:25,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:25,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533376639] [2021-06-10 11:44:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:25,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:25,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:25,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:44:25,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533376639] [2021-06-10 11:44:25,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:25,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:25,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243952665] [2021-06-10 11:44:25,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:25,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:25,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:25,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:25,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:25,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 825 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:25,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:25,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:25,556 INFO L129 PetriNetUnfolder]: 24/1002 cut-off events. [2021-06-10 11:44:25,556 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:25,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 1002 events. 24/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4477 event pairs, 0 based on Foata normal form. 1/946 useless extension candidates. Maximal degree in co-relation 1270. Up to 35 conditions per place. [2021-06-10 11:44:25,616 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/823 dead transitions. [2021-06-10 11:44:25,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 823 transitions, 2091 flow [2021-06-10 11:44:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:25,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:25,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:25,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:25,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:25,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:25,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,620 INFO L185 Difference]: Start difference. First operand has 972 places, 825 transitions, 2088 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:25,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 823 transitions, 2091 flow [2021-06-10 11:44:25,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 823 transitions, 2084 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:25,629 INFO L241 Difference]: Finished difference. Result has 972 places, 823 transitions, 2077 flow [2021-06-10 11:44:25,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=822, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2077, PETRI_PLACES=972, PETRI_TRANSITIONS=823} [2021-06-10 11:44:25,630 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 67 predicate places. [2021-06-10 11:44:25,630 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 823 transitions, 2077 flow [2021-06-10 11:44:25,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:25,630 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:25,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1876 [2021-06-10 11:44:25,630 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash -105879155, now seen corresponding path program 1 times [2021-06-10 11:44:25,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:25,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877590296] [2021-06-10 11:44:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:25,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:25,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:25,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:25,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:44:25,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877590296] [2021-06-10 11:44:25,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:25,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:25,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923995375] [2021-06-10 11:44:25,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:25,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:25,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:25,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 823 transitions, 2077 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:25,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:25,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:25,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:26,067 INFO L129 PetriNetUnfolder]: 24/1000 cut-off events. [2021-06-10 11:44:26,067 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:26,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 1000 events. 24/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4463 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 1270. Up to 35 conditions per place. [2021-06-10 11:44:26,127 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/821 dead transitions. [2021-06-10 11:44:26,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 821 transitions, 2090 flow [2021-06-10 11:44:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:26,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:26,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:26,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:26,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:26,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:26,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,131 INFO L185 Difference]: Start difference. First operand has 972 places, 823 transitions, 2077 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:26,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 821 transitions, 2090 flow [2021-06-10 11:44:26,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 821 transitions, 2089 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:26,140 INFO L241 Difference]: Finished difference. Result has 971 places, 821 transitions, 2073 flow [2021-06-10 11:44:26,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2073, PETRI_PLACES=971, PETRI_TRANSITIONS=821} [2021-06-10 11:44:26,140 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 66 predicate places. [2021-06-10 11:44:26,140 INFO L480 AbstractCegarLoop]: Abstraction has has 971 places, 821 transitions, 2073 flow [2021-06-10 11:44:26,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,140 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:26,140 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:26,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1877 [2021-06-10 11:44:26,141 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 97966042, now seen corresponding path program 1 times [2021-06-10 11:44:26,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:26,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385476110] [2021-06-10 11:44:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:26,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:26,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:26,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:44:26,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385476110] [2021-06-10 11:44:26,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:26,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:26,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448835597] [2021-06-10 11:44:26,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:26,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:26,166 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:26,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 821 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:26,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:26,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:26,580 INFO L129 PetriNetUnfolder]: 23/1007 cut-off events. [2021-06-10 11:44:26,580 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:26,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1007 events. 23/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4522 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1275. Up to 35 conditions per place. [2021-06-10 11:44:26,639 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/822 dead transitions. [2021-06-10 11:44:26,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 973 places, 822 transitions, 2089 flow [2021-06-10 11:44:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:26,641 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:26,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:26,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:26,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:26,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:26,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,644 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,644 INFO L185 Difference]: Start difference. First operand has 971 places, 821 transitions, 2073 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 973 places, 822 transitions, 2089 flow [2021-06-10 11:44:26,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 822 transitions, 2088 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:26,653 INFO L241 Difference]: Finished difference. Result has 973 places, 821 transitions, 2077 flow [2021-06-10 11:44:26,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=820, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2077, PETRI_PLACES=973, PETRI_TRANSITIONS=821} [2021-06-10 11:44:26,653 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 68 predicate places. [2021-06-10 11:44:26,653 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 821 transitions, 2077 flow [2021-06-10 11:44:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:26,653 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:26,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1878 [2021-06-10 11:44:26,653 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:26,654 INFO L82 PathProgramCache]: Analyzing trace with hash 97967065, now seen corresponding path program 1 times [2021-06-10 11:44:26,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:26,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293728209] [2021-06-10 11:44:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:26,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:26,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:26,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:26,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:44:26,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293728209] [2021-06-10 11:44:26,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:26,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:26,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086467691] [2021-06-10 11:44:26,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:26,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:26,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:26,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 821 transitions, 2077 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:26,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:26,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:26,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:27,087 INFO L129 PetriNetUnfolder]: 21/1009 cut-off events. [2021-06-10 11:44:27,087 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:27,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1009 events. 21/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4557 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1286. Up to 35 conditions per place. [2021-06-10 11:44:27,133 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/822 dead transitions. [2021-06-10 11:44:27,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 822 transitions, 2103 flow [2021-06-10 11:44:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:44:27,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:44:27,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:44:27,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:44:27,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:27,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:44:27,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,137 INFO L185 Difference]: Start difference. First operand has 973 places, 821 transitions, 2077 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:44:27,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 822 transitions, 2103 flow [2021-06-10 11:44:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 974 places, 822 transitions, 2102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:27,145 INFO L241 Difference]: Finished difference. Result has 976 places, 822 transitions, 2094 flow [2021-06-10 11:44:27,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=972, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=976, PETRI_TRANSITIONS=822} [2021-06-10 11:44:27,146 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 71 predicate places. [2021-06-10 11:44:27,146 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 822 transitions, 2094 flow [2021-06-10 11:44:27,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:27,146 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:27,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1879 [2021-06-10 11:44:27,146 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash 97013753, now seen corresponding path program 1 times [2021-06-10 11:44:27,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:27,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810233285] [2021-06-10 11:44:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:27,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:27,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:27,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:44:27,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810233285] [2021-06-10 11:44:27,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:27,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:27,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270180377] [2021-06-10 11:44:27,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:27,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:27,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:27,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:27,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:27,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 822 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:27,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:27,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:27,581 INFO L129 PetriNetUnfolder]: 21/1002 cut-off events. [2021-06-10 11:44:27,581 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:27,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1002 events. 21/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4495 event pairs, 0 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 1272. Up to 35 conditions per place. [2021-06-10 11:44:27,641 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/820 dead transitions. [2021-06-10 11:44:27,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 820 transitions, 2096 flow [2021-06-10 11:44:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:27,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:27,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:27,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:27,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:27,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:27,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,645 INFO L185 Difference]: Start difference. First operand has 976 places, 822 transitions, 2094 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:27,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 820 transitions, 2096 flow [2021-06-10 11:44:27,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 820 transitions, 2088 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:27,654 INFO L241 Difference]: Finished difference. Result has 976 places, 820 transitions, 2081 flow [2021-06-10 11:44:27,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=820, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=976, PETRI_TRANSITIONS=820} [2021-06-10 11:44:27,655 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 71 predicate places. [2021-06-10 11:44:27,655 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 820 transitions, 2081 flow [2021-06-10 11:44:27,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:27,655 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:27,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1880 [2021-06-10 11:44:27,655 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 97012730, now seen corresponding path program 1 times [2021-06-10 11:44:27,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:27,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018661674] [2021-06-10 11:44:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:27,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:27,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:27,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:27,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:44:27,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018661674] [2021-06-10 11:44:27,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:27,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:27,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110127570] [2021-06-10 11:44:27,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:27,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:27,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:27,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 820 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:27,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:27,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:27,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:28,104 INFO L129 PetriNetUnfolder]: 21/1000 cut-off events. [2021-06-10 11:44:28,104 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:28,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1000 events. 21/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4481 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1276. Up to 35 conditions per place. [2021-06-10 11:44:28,162 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/818 dead transitions. [2021-06-10 11:44:28,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 976 places, 818 transitions, 2094 flow [2021-06-10 11:44:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:28,163 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:28,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:28,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:28,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:28,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:28,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,166 INFO L185 Difference]: Start difference. First operand has 976 places, 820 transitions, 2081 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:28,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 976 places, 818 transitions, 2094 flow [2021-06-10 11:44:28,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 818 transitions, 2093 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:28,175 INFO L241 Difference]: Finished difference. Result has 975 places, 818 transitions, 2077 flow [2021-06-10 11:44:28,175 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2077, PETRI_PLACES=975, PETRI_TRANSITIONS=818} [2021-06-10 11:44:28,175 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 70 predicate places. [2021-06-10 11:44:28,175 INFO L480 AbstractCegarLoop]: Abstraction has has 975 places, 818 transitions, 2077 flow [2021-06-10 11:44:28,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:28,176 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:28,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1881 [2021-06-10 11:44:28,176 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash -238322456, now seen corresponding path program 1 times [2021-06-10 11:44:28,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:28,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946995149] [2021-06-10 11:44:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:28,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:28,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:28,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:44:28,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946995149] [2021-06-10 11:44:28,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:28,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:28,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463067234] [2021-06-10 11:44:28,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:28,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:28,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:28,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 818 transitions, 2077 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:28,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:28,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:28,636 INFO L129 PetriNetUnfolder]: 20/1008 cut-off events. [2021-06-10 11:44:28,636 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:28,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1008 events. 20/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4551 event pairs, 0 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 1288. Up to 35 conditions per place. [2021-06-10 11:44:28,695 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/820 dead transitions. [2021-06-10 11:44:28,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 820 transitions, 2107 flow [2021-06-10 11:44:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:28,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:28,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:28,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:28,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:28,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:28,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,700 INFO L185 Difference]: Start difference. First operand has 975 places, 818 transitions, 2077 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:28,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 820 transitions, 2107 flow [2021-06-10 11:44:28,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 820 transitions, 2106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:28,709 INFO L241 Difference]: Finished difference. Result has 978 places, 820 transitions, 2100 flow [2021-06-10 11:44:28,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=978, PETRI_TRANSITIONS=820} [2021-06-10 11:44:28,709 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 73 predicate places. [2021-06-10 11:44:28,709 INFO L480 AbstractCegarLoop]: Abstraction has has 978 places, 820 transitions, 2100 flow [2021-06-10 11:44:28,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:28,709 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:28,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1882 [2021-06-10 11:44:28,709 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash -238321433, now seen corresponding path program 1 times [2021-06-10 11:44:28,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:28,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973564254] [2021-06-10 11:44:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:28,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:28,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:28,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:28,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:44:28,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973564254] [2021-06-10 11:44:28,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:28,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:28,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755589155] [2021-06-10 11:44:28,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:28,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:28,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:28,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 820 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:28,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:28,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:28,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:29,132 INFO L129 PetriNetUnfolder]: 19/1006 cut-off events. [2021-06-10 11:44:29,132 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:29,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1006 events. 19/1006 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4542 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1285. Up to 35 conditions per place. [2021-06-10 11:44:29,181 INFO L132 encePairwiseOnDemand]: 970/973 looper letters, 5 selfloop transitions, 2 changer transitions 0/820 dead transitions. [2021-06-10 11:44:29,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 820 transitions, 2112 flow [2021-06-10 11:44:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:29,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:29,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:29,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:29,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:29,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:29,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,186 INFO L185 Difference]: Start difference. First operand has 978 places, 820 transitions, 2100 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 820 transitions, 2112 flow [2021-06-10 11:44:29,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 820 transitions, 2107 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:29,194 INFO L241 Difference]: Finished difference. Result has 981 places, 820 transitions, 2105 flow [2021-06-10 11:44:29,194 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=819, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2105, PETRI_PLACES=981, PETRI_TRANSITIONS=820} [2021-06-10 11:44:29,194 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 76 predicate places. [2021-06-10 11:44:29,194 INFO L480 AbstractCegarLoop]: Abstraction has has 981 places, 820 transitions, 2105 flow [2021-06-10 11:44:29,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:29,195 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:29,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1883 [2021-06-10 11:44:29,195 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -237369144, now seen corresponding path program 1 times [2021-06-10 11:44:29,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:29,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202134431] [2021-06-10 11:44:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:29,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:29,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:29,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:44:29,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202134431] [2021-06-10 11:44:29,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:29,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:29,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201582356] [2021-06-10 11:44:29,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:29,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:29,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:29,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:29,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 820 transitions, 2105 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:29,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:29,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:29,631 INFO L129 PetriNetUnfolder]: 18/1002 cut-off events. [2021-06-10 11:44:29,631 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:29,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1002 events. 18/1002 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4511 event pairs, 0 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 1282. Up to 35 conditions per place. [2021-06-10 11:44:29,692 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2021-06-10 11:44:29,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 817 transitions, 2102 flow [2021-06-10 11:44:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:29,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:29,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:29,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:29,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:29,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:29,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,696 INFO L185 Difference]: Start difference. First operand has 981 places, 820 transitions, 2105 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:29,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 817 transitions, 2102 flow [2021-06-10 11:44:29,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 817 transitions, 2095 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:29,705 INFO L241 Difference]: Finished difference. Result has 980 places, 817 transitions, 2085 flow [2021-06-10 11:44:29,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2085, PETRI_PLACES=980, PETRI_TRANSITIONS=817} [2021-06-10 11:44:29,705 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 75 predicate places. [2021-06-10 11:44:29,705 INFO L480 AbstractCegarLoop]: Abstraction has has 980 places, 817 transitions, 2085 flow [2021-06-10 11:44:29,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:29,705 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:29,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1884 [2021-06-10 11:44:29,706 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash -237368121, now seen corresponding path program 1 times [2021-06-10 11:44:29,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:29,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481721974] [2021-06-10 11:44:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:29,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:29,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:29,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:29,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:44:29,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481721974] [2021-06-10 11:44:29,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:29,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:29,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478217479] [2021-06-10 11:44:29,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:29,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:29,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:29,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 817 transitions, 2085 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:29,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:29,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:29,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:30,150 INFO L129 PetriNetUnfolder]: 18/1000 cut-off events. [2021-06-10 11:44:30,150 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:30,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1000 events. 18/1000 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4499 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1283. Up to 35 conditions per place. [2021-06-10 11:44:30,208 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/815 dead transitions. [2021-06-10 11:44:30,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 815 transitions, 2098 flow [2021-06-10 11:44:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:30,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:30,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:30,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:30,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:30,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:30,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,212 INFO L185 Difference]: Start difference. First operand has 980 places, 817 transitions, 2085 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:30,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 815 transitions, 2098 flow [2021-06-10 11:44:30,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 815 transitions, 2097 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:30,221 INFO L241 Difference]: Finished difference. Result has 979 places, 815 transitions, 2081 flow [2021-06-10 11:44:30,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=979, PETRI_TRANSITIONS=815} [2021-06-10 11:44:30,222 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 74 predicate places. [2021-06-10 11:44:30,222 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 815 transitions, 2081 flow [2021-06-10 11:44:30,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:30,222 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:30,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1885 [2021-06-10 11:44:30,222 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:30,222 INFO L82 PathProgramCache]: Analyzing trace with hash -143331913, now seen corresponding path program 1 times [2021-06-10 11:44:30,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:30,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537399605] [2021-06-10 11:44:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:30,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:30,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:30,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:44:30,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537399605] [2021-06-10 11:44:30,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:30,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:30,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300789714] [2021-06-10 11:44:30,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:30,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:30,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:30,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:30,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 815 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:30,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:30,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:30,675 INFO L129 PetriNetUnfolder]: 17/1007 cut-off events. [2021-06-10 11:44:30,675 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:30,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 1007 events. 17/1007 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4558 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1288. Up to 35 conditions per place. [2021-06-10 11:44:30,733 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/816 dead transitions. [2021-06-10 11:44:30,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 816 transitions, 2097 flow [2021-06-10 11:44:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:30,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:30,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:30,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:30,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:30,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:30,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,738 INFO L185 Difference]: Start difference. First operand has 979 places, 815 transitions, 2081 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:30,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 816 transitions, 2097 flow [2021-06-10 11:44:30,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 816 transitions, 2096 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:30,747 INFO L241 Difference]: Finished difference. Result has 981 places, 815 transitions, 2085 flow [2021-06-10 11:44:30,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2085, PETRI_PLACES=981, PETRI_TRANSITIONS=815} [2021-06-10 11:44:30,748 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 76 predicate places. [2021-06-10 11:44:30,748 INFO L480 AbstractCegarLoop]: Abstraction has has 981 places, 815 transitions, 2085 flow [2021-06-10 11:44:30,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:30,748 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:30,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1886 [2021-06-10 11:44:30,748 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash -143330890, now seen corresponding path program 1 times [2021-06-10 11:44:30,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:30,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56595915] [2021-06-10 11:44:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:30,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:30,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:30,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:30,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:44:30,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56595915] [2021-06-10 11:44:30,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:30,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:30,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222827259] [2021-06-10 11:44:30,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:30,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:30,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:30,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 815 transitions, 2085 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:30,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:30,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:30,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:31,188 INFO L129 PetriNetUnfolder]: 15/1009 cut-off events. [2021-06-10 11:44:31,189 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:31,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1009 events. 15/1009 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4595 event pairs, 0 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 1299. Up to 35 conditions per place. [2021-06-10 11:44:31,243 INFO L132 encePairwiseOnDemand]: 969/973 looper letters, 9 selfloop transitions, 3 changer transitions 0/816 dead transitions. [2021-06-10 11:44:31,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 816 transitions, 2111 flow [2021-06-10 11:44:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2689 transitions. [2021-06-10 11:44:31,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921205892428914 [2021-06-10 11:44:31,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2689 transitions. [2021-06-10 11:44:31,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2689 transitions. [2021-06-10 11:44:31,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:31,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2689 transitions. [2021-06-10 11:44:31,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 896.3333333333334) internal successors, (2689), 3 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,247 INFO L185 Difference]: Start difference. First operand has 981 places, 815 transitions, 2085 flow. Second operand 3 states and 2689 transitions. [2021-06-10 11:44:31,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 816 transitions, 2111 flow [2021-06-10 11:44:31,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 816 transitions, 2110 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:31,256 INFO L241 Difference]: Finished difference. Result has 984 places, 816 transitions, 2102 flow [2021-06-10 11:44:31,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=984, PETRI_TRANSITIONS=816} [2021-06-10 11:44:31,256 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 79 predicate places. [2021-06-10 11:44:31,256 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 816 transitions, 2102 flow [2021-06-10 11:44:31,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:31,256 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:31,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1887 [2021-06-10 11:44:31,257 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash -144284202, now seen corresponding path program 1 times [2021-06-10 11:44:31,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:31,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349028475] [2021-06-10 11:44:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:31,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:31,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:31,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:44:31,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349028475] [2021-06-10 11:44:31,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:31,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:31,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317104634] [2021-06-10 11:44:31,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:31,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:31,283 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:31,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 816 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:31,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:31,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:31,700 INFO L129 PetriNetUnfolder]: 15/1002 cut-off events. [2021-06-10 11:44:31,700 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:31,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 1002 events. 15/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4530 event pairs, 0 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 1285. Up to 35 conditions per place. [2021-06-10 11:44:31,758 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/814 dead transitions. [2021-06-10 11:44:31,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 814 transitions, 2104 flow [2021-06-10 11:44:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:31,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:31,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:31,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:31,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:31,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:31,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,762 INFO L185 Difference]: Start difference. First operand has 984 places, 816 transitions, 2102 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:31,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 814 transitions, 2104 flow [2021-06-10 11:44:31,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 814 transitions, 2096 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:31,771 INFO L241 Difference]: Finished difference. Result has 984 places, 814 transitions, 2089 flow [2021-06-10 11:44:31,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2089, PETRI_PLACES=984, PETRI_TRANSITIONS=814} [2021-06-10 11:44:31,771 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 79 predicate places. [2021-06-10 11:44:31,771 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 814 transitions, 2089 flow [2021-06-10 11:44:31,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:31,772 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:31,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1888 [2021-06-10 11:44:31,772 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -144285225, now seen corresponding path program 1 times [2021-06-10 11:44:31,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:31,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668503183] [2021-06-10 11:44:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:31,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:31,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:31,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:31,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:44:31,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668503183] [2021-06-10 11:44:31,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:31,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:31,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083883575] [2021-06-10 11:44:31,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:31,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:31,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:31,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:31,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 814 transitions, 2089 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:31,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:31,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:31,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:32,221 INFO L129 PetriNetUnfolder]: 15/1000 cut-off events. [2021-06-10 11:44:32,221 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:32,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1000 events. 15/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4513 event pairs, 0 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1289. Up to 35 conditions per place. [2021-06-10 11:44:32,280 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/812 dead transitions. [2021-06-10 11:44:32,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 812 transitions, 2102 flow [2021-06-10 11:44:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:32,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:32,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:32,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:32,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:32,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:32,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,284 INFO L185 Difference]: Start difference. First operand has 984 places, 814 transitions, 2089 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:32,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 812 transitions, 2102 flow [2021-06-10 11:44:32,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 812 transitions, 2101 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:32,293 INFO L241 Difference]: Finished difference. Result has 983 places, 812 transitions, 2085 flow [2021-06-10 11:44:32,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2085, PETRI_PLACES=983, PETRI_TRANSITIONS=812} [2021-06-10 11:44:32,294 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 78 predicate places. [2021-06-10 11:44:32,294 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 812 transitions, 2085 flow [2021-06-10 11:44:32,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:32,294 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:32,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1889 [2021-06-10 11:44:32,294 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 593958950, now seen corresponding path program 1 times [2021-06-10 11:44:32,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:32,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936435255] [2021-06-10 11:44:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:32,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:32,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:32,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:44:32,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936435255] [2021-06-10 11:44:32,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:32,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:32,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439805335] [2021-06-10 11:44:32,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:32,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:32,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:32,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 812 transitions, 2085 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:32,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:32,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:32,756 INFO L129 PetriNetUnfolder]: 14/1008 cut-off events. [2021-06-10 11:44:32,756 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-06-10 11:44:32,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 1008 events. 14/1008 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4586 event pairs, 0 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1301. Up to 35 conditions per place. [2021-06-10 11:44:32,815 INFO L132 encePairwiseOnDemand]: 968/973 looper letters, 10 selfloop transitions, 3 changer transitions 0/814 dead transitions. [2021-06-10 11:44:32,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 814 transitions, 2115 flow [2021-06-10 11:44:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2691 transitions. [2021-06-10 11:44:32,816 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9218910585817061 [2021-06-10 11:44:32,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2691 transitions. [2021-06-10 11:44:32,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2691 transitions. [2021-06-10 11:44:32,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:32,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2691 transitions. [2021-06-10 11:44:32,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 897.0) internal successors, (2691), 3 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,819 INFO L185 Difference]: Start difference. First operand has 983 places, 812 transitions, 2085 flow. Second operand 3 states and 2691 transitions. [2021-06-10 11:44:32,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 814 transitions, 2115 flow [2021-06-10 11:44:32,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 814 transitions, 2114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:32,828 INFO L241 Difference]: Finished difference. Result has 986 places, 814 transitions, 2108 flow [2021-06-10 11:44:32,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=986, PETRI_TRANSITIONS=814} [2021-06-10 11:44:32,828 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 81 predicate places. [2021-06-10 11:44:32,829 INFO L480 AbstractCegarLoop]: Abstraction has has 986 places, 814 transitions, 2108 flow [2021-06-10 11:44:32,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:32,829 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:32,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1890 [2021-06-10 11:44:32,829 INFO L428 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash 593957927, now seen corresponding path program 1 times [2021-06-10 11:44:32,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:32,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200385405] [2021-06-10 11:44:32,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:32,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:32,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:32,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:32,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:44:32,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200385405] [2021-06-10 11:44:32,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:32,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:32,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012719130] [2021-06-10 11:44:32,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:32,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:32,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:32,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 814 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:32,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:32,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:32,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:33,270 INFO L129 PetriNetUnfolder]: 12/1009 cut-off events. [2021-06-10 11:44:33,270 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:33,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1009 events. 12/1009 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4608 event pairs, 0 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 1301. Up to 35 conditions per place. [2021-06-10 11:44:33,328 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 6 selfloop transitions, 1 changer transitions 0/814 dead transitions. [2021-06-10 11:44:33,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 814 transitions, 2120 flow [2021-06-10 11:44:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2699 transitions. [2021-06-10 11:44:33,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246317231928742 [2021-06-10 11:44:33,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2699 transitions. [2021-06-10 11:44:33,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2699 transitions. [2021-06-10 11:44:33,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:33,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2699 transitions. [2021-06-10 11:44:33,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.6666666666666) internal successors, (2699), 3 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,332 INFO L185 Difference]: Start difference. First operand has 986 places, 814 transitions, 2108 flow. Second operand 3 states and 2699 transitions. [2021-06-10 11:44:33,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 814 transitions, 2120 flow [2021-06-10 11:44:33,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 814 transitions, 2115 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:33,341 INFO L241 Difference]: Finished difference. Result has 988 places, 813 transitions, 2104 flow [2021-06-10 11:44:33,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=988, PETRI_TRANSITIONS=813} [2021-06-10 11:44:33,342 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 83 predicate places. [2021-06-10 11:44:33,342 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 813 transitions, 2104 flow [2021-06-10 11:44:33,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:33,342 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:33,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1891 [2021-06-10 11:44:33,342 INFO L428 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash 593005638, now seen corresponding path program 1 times [2021-06-10 11:44:33,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:33,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556263231] [2021-06-10 11:44:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:33,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:33,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:33,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:44:33,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556263231] [2021-06-10 11:44:33,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:33,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:33,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232505576] [2021-06-10 11:44:33,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:33,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:33,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 973 [2021-06-10 11:44:33,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 813 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:33,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 973 [2021-06-10 11:44:33,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:33,803 INFO L129 PetriNetUnfolder]: 12/1002 cut-off events. [2021-06-10 11:44:33,803 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:33,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1002 events. 12/1002 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4549 event pairs, 0 based on Foata normal form. 1/958 useless extension candidates. Maximal degree in co-relation 1295. Up to 35 conditions per place. [2021-06-10 11:44:33,862 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 5 selfloop transitions, 1 changer transitions 0/811 dead transitions. [2021-06-10 11:44:33,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 811 transitions, 2107 flow [2021-06-10 11:44:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2698 transitions. [2021-06-10 11:44:33,864 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9242891401164782 [2021-06-10 11:44:33,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2698 transitions. [2021-06-10 11:44:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2698 transitions. [2021-06-10 11:44:33,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:33,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2698 transitions. [2021-06-10 11:44:33,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 899.3333333333334) internal successors, (2698), 3 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,867 INFO L185 Difference]: Start difference. First operand has 988 places, 813 transitions, 2104 flow. Second operand 3 states and 2698 transitions. [2021-06-10 11:44:33,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 811 transitions, 2107 flow [2021-06-10 11:44:33,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 811 transitions, 2100 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:33,876 INFO L241 Difference]: Finished difference. Result has 988 places, 811 transitions, 2093 flow [2021-06-10 11:44:33,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=988, PETRI_TRANSITIONS=811} [2021-06-10 11:44:33,877 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 83 predicate places. [2021-06-10 11:44:33,877 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 811 transitions, 2093 flow [2021-06-10 11:44:33,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 898.3333333333334) internal successors, (2695), 3 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:33,877 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:33,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1892 [2021-06-10 11:44:33,877 INFO L428 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash 593004615, now seen corresponding path program 1 times [2021-06-10 11:44:33,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:33,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567716504] [2021-06-10 11:44:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:33,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:33,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:33,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:33,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:44:33,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567716504] [2021-06-10 11:44:33,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:33,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:33,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750642447] [2021-06-10 11:44:33,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:33,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:33,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 892 out of 973 [2021-06-10 11:44:33,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 811 transitions, 2093 flow. Second operand has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:33,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:33,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 892 of 973 [2021-06-10 11:44:33,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:34,339 INFO L129 PetriNetUnfolder]: 12/1000 cut-off events. [2021-06-10 11:44:34,339 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:34,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1000 events. 12/1000 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4534 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1295. Up to 35 conditions per place. [2021-06-10 11:44:34,398 INFO L132 encePairwiseOnDemand]: 971/973 looper letters, 8 selfloop transitions, 1 changer transitions 0/809 dead transitions. [2021-06-10 11:44:34,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 809 transitions, 2106 flow [2021-06-10 11:44:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2686 transitions. [2021-06-10 11:44:34,399 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9201781431997259 [2021-06-10 11:44:34,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2686 transitions. [2021-06-10 11:44:34,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2686 transitions. [2021-06-10 11:44:34,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:34,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2686 transitions. [2021-06-10 11:44:34,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 895.3333333333334) internal successors, (2686), 3 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:34,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:34,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 973.0) internal successors, (3892), 4 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:34,402 INFO L185 Difference]: Start difference. First operand has 988 places, 811 transitions, 2093 flow. Second operand 3 states and 2686 transitions. [2021-06-10 11:44:34,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 809 transitions, 2106 flow [2021-06-10 11:44:34,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 809 transitions, 2105 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:34,411 INFO L241 Difference]: Finished difference. Result has 987 places, 809 transitions, 2089 flow [2021-06-10 11:44:34,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=973, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2089, PETRI_PLACES=987, PETRI_TRANSITIONS=809} [2021-06-10 11:44:34,411 INFO L343 CegarLoopForPetriNet]: 905 programPoint places, 82 predicate places. [2021-06-10 11:44:34,411 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 809 transitions, 2089 flow [2021-06-10 11:44:34,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 894.3333333333334) internal successors, (2683), 3 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:34,411 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:34,411 INFO L263 CegarLoopForPetriNet]: trace histogram [35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:34,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1893 [2021-06-10 11:44:34,411 INFO L428 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash 245511191, now seen corresponding path program 1 times [2021-06-10 11:44:34,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:34,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132085676] [2021-06-10 11:44:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:44:34,430 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:44:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:44:34,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:44:34,456 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:44:34,457 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:44:34,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1894 [2021-06-10 11:44:34,457 WARN L342 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:44:34,457 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,527 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,549 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of35ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of35ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:44:34,640 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:44:34,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-06-10 11:44:34,641 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:44:34,641 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:44:34,641 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:44:34,641 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:44:34,641 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:44:34,641 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:44:34,641 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:44:34,641 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:44:34,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 931 places, 1001 transitions, 3367 flow [2021-06-10 11:44:35,136 INFO L129 PetriNetUnfolder]: 176/1315 cut-off events. [2021-06-10 11:44:35,136 INFO L130 PetriNetUnfolder]: For 7735/7735 co-relation queries the response was YES. [2021-06-10 11:44:35,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 1315 events. 176/1315 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5718 event pairs, 0 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1966. Up to 72 conditions per place. [2021-06-10 11:44:35,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 931 places, 1001 transitions, 3367 flow [2021-06-10 11:44:35,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 931 places, 1001 transitions, 3367 flow [2021-06-10 11:44:35,230 INFO L129 PetriNetUnfolder]: 8/98 cut-off events. [2021-06-10 11:44:35,230 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:44:35,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:35,230 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-06-10 11:44:35,230 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash -520899033, now seen corresponding path program 1 times [2021-06-10 11:44:35,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:35,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674314147] [2021-06-10 11:44:35,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:35,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:35,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:35,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:44:35,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674314147] [2021-06-10 11:44:35,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:35,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:35,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118467393] [2021-06-10 11:44:35,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:35,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:35,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:35,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 1001 transitions, 3367 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:35,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:35,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:35,644 INFO L129 PetriNetUnfolder]: 103/1034 cut-off events. [2021-06-10 11:44:35,645 INFO L130 PetriNetUnfolder]: For 7736/7736 co-relation queries the response was YES. [2021-06-10 11:44:35,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1034 events. 103/1034 cut-off events. For 7736/7736 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4180 event pairs, 0 based on Foata normal form. 142/1036 useless extension candidates. Maximal degree in co-relation 1697. Up to 36 conditions per place. [2021-06-10 11:44:35,729 INFO L132 encePairwiseOnDemand]: 961/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2021-06-10 11:44:35,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 926 transitions, 3231 flow [2021-06-10 11:44:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2851 transitions. [2021-06-10 11:44:35,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9493839493839494 [2021-06-10 11:44:35,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2851 transitions. [2021-06-10 11:44:35,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2851 transitions. [2021-06-10 11:44:35,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:35,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2851 transitions. [2021-06-10 11:44:35,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,734 INFO L185 Difference]: Start difference. First operand has 931 places, 1001 transitions, 3367 flow. Second operand 3 states and 2851 transitions. [2021-06-10 11:44:35,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 926 transitions, 3231 flow [2021-06-10 11:44:35,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 893 places, 926 transitions, 2041 flow, removed 595 selfloop flow, removed 0 redundant places. [2021-06-10 11:44:35,750 INFO L241 Difference]: Finished difference. Result has 895 places, 926 transitions, 2039 flow [2021-06-10 11:44:35,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2025, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2039, PETRI_PLACES=895, PETRI_TRANSITIONS=926} [2021-06-10 11:44:35,751 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -36 predicate places. [2021-06-10 11:44:35,751 INFO L480 AbstractCegarLoop]: Abstraction has has 895 places, 926 transitions, 2039 flow [2021-06-10 11:44:35,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:35,751 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-06-10 11:44:35,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1895 [2021-06-10 11:44:35,751 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -520900056, now seen corresponding path program 1 times [2021-06-10 11:44:35,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:35,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707165935] [2021-06-10 11:44:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:35,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:35,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:35,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:35,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:44:35,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707165935] [2021-06-10 11:44:35,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:35,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:35,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964431829] [2021-06-10 11:44:35,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:35,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:35,771 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:35,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 926 transitions, 2039 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:35,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:35,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:35,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:36,132 INFO L129 PetriNetUnfolder]: 103/1035 cut-off events. [2021-06-10 11:44:36,132 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:36,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1035 events. 103/1035 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4189 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1140. Up to 36 conditions per place. [2021-06-10 11:44:36,208 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/927 dead transitions. [2021-06-10 11:44:36,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 897 places, 927 transitions, 2065 flow [2021-06-10 11:44:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:36,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:36,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:36,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:36,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:36,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,213 INFO L185 Difference]: Start difference. First operand has 895 places, 926 transitions, 2039 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:36,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 897 places, 927 transitions, 2065 flow [2021-06-10 11:44:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 927 transitions, 2063 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:36,221 INFO L241 Difference]: Finished difference. Result has 898 places, 927 transitions, 2055 flow [2021-06-10 11:44:36,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2055, PETRI_PLACES=898, PETRI_TRANSITIONS=927} [2021-06-10 11:44:36,222 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -33 predicate places. [2021-06-10 11:44:36,222 INFO L480 AbstractCegarLoop]: Abstraction has has 898 places, 927 transitions, 2055 flow [2021-06-10 11:44:36,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:36,222 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-06-10 11:44:36,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1896 [2021-06-10 11:44:36,222 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -519945721, now seen corresponding path program 1 times [2021-06-10 11:44:36,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:36,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839035490] [2021-06-10 11:44:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:36,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:36,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:36,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:44:36,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839035490] [2021-06-10 11:44:36,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:36,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:36,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060743606] [2021-06-10 11:44:36,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:36,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:36,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:36,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:36,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 927 transitions, 2055 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:36,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:36,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:36,619 INFO L129 PetriNetUnfolder]: 102/1032 cut-off events. [2021-06-10 11:44:36,620 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2021-06-10 11:44:36,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1032 events. 102/1032 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4171 event pairs, 0 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 1142. Up to 36 conditions per place. [2021-06-10 11:44:36,696 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 9 selfloop transitions, 1 changer transitions 0/925 dead transitions. [2021-06-10 11:44:36,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 925 transitions, 2063 flow [2021-06-10 11:44:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2766 transitions. [2021-06-10 11:44:36,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210789210789211 [2021-06-10 11:44:36,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2766 transitions. [2021-06-10 11:44:36,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2766 transitions. [2021-06-10 11:44:36,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:36,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2766 transitions. [2021-06-10 11:44:36,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.0) internal successors, (2766), 3 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,700 INFO L185 Difference]: Start difference. First operand has 898 places, 927 transitions, 2055 flow. Second operand 3 states and 2766 transitions. [2021-06-10 11:44:36,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 925 transitions, 2063 flow [2021-06-10 11:44:36,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 925 transitions, 2062 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:36,709 INFO L241 Difference]: Finished difference. Result has 899 places, 925 transitions, 2044 flow [2021-06-10 11:44:36,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=897, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2044, PETRI_PLACES=899, PETRI_TRANSITIONS=925} [2021-06-10 11:44:36,709 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -32 predicate places. [2021-06-10 11:44:36,709 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 925 transitions, 2044 flow [2021-06-10 11:44:36,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:36,709 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-06-10 11:44:36,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1897 [2021-06-10 11:44:36,710 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash -519946744, now seen corresponding path program 1 times [2021-06-10 11:44:36,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:36,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535108818] [2021-06-10 11:44:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:36,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:36,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:36,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:36,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:44:36,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535108818] [2021-06-10 11:44:36,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:36,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:36,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222992446] [2021-06-10 11:44:36,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:36,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:36,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:36,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:36,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 925 transitions, 2044 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:36,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:36,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:36,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:37,096 INFO L129 PetriNetUnfolder]: 102/1029 cut-off events. [2021-06-10 11:44:37,097 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:37,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 1029 events. 102/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4156 event pairs, 0 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1137. Up to 36 conditions per place. [2021-06-10 11:44:37,273 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/922 dead transitions. [2021-06-10 11:44:37,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 922 transitions, 2045 flow [2021-06-10 11:44:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:37,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:37,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:37,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:37,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:37,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:37,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,278 INFO L185 Difference]: Start difference. First operand has 899 places, 925 transitions, 2044 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 899 places, 922 transitions, 2045 flow [2021-06-10 11:44:37,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 922 transitions, 2040 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:37,286 INFO L241 Difference]: Finished difference. Result has 896 places, 922 transitions, 2030 flow [2021-06-10 11:44:37,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2030, PETRI_PLACES=896, PETRI_TRANSITIONS=922} [2021-06-10 11:44:37,286 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -35 predicate places. [2021-06-10 11:44:37,286 INFO L480 AbstractCegarLoop]: Abstraction has has 896 places, 922 transitions, 2030 flow [2021-06-10 11:44:37,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:37,286 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:37,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1898 [2021-06-10 11:44:37,286 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash -500743370, now seen corresponding path program 1 times [2021-06-10 11:44:37,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:37,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501282849] [2021-06-10 11:44:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:37,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:37,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:37,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:44:37,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501282849] [2021-06-10 11:44:37,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:37,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:37,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850269067] [2021-06-10 11:44:37,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:37,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:37,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:37,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 922 transitions, 2030 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:37,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:37,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:37,686 INFO L129 PetriNetUnfolder]: 101/1037 cut-off events. [2021-06-10 11:44:37,686 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:37,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 1037 events. 101/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4222 event pairs, 0 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 1154. Up to 36 conditions per place. [2021-06-10 11:44:37,764 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/924 dead transitions. [2021-06-10 11:44:37,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 898 places, 924 transitions, 2060 flow [2021-06-10 11:44:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:37,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:37,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:37,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:37,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:37,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:37,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,768 INFO L185 Difference]: Start difference. First operand has 896 places, 922 transitions, 2030 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:37,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 898 places, 924 transitions, 2060 flow [2021-06-10 11:44:37,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 897 places, 924 transitions, 2059 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:37,777 INFO L241 Difference]: Finished difference. Result has 899 places, 924 transitions, 2053 flow [2021-06-10 11:44:37,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2029, PETRI_DIFFERENCE_MINUEND_PLACES=895, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2053, PETRI_PLACES=899, PETRI_TRANSITIONS=924} [2021-06-10 11:44:37,777 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -32 predicate places. [2021-06-10 11:44:37,777 INFO L480 AbstractCegarLoop]: Abstraction has has 899 places, 924 transitions, 2053 flow [2021-06-10 11:44:37,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:37,778 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:37,778 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1899 [2021-06-10 11:44:37,778 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash -500744393, now seen corresponding path program 1 times [2021-06-10 11:44:37,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:37,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226674480] [2021-06-10 11:44:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:37,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:37,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:37,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:37,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:44:37,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226674480] [2021-06-10 11:44:37,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:37,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:37,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250031565] [2021-06-10 11:44:37,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:37,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:37,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:37,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 924 transitions, 2053 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:37,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:37,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:37,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:38,158 INFO L129 PetriNetUnfolder]: 99/1038 cut-off events. [2021-06-10 11:44:38,158 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:38,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1038 events. 99/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4247 event pairs, 0 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1151. Up to 36 conditions per place. [2021-06-10 11:44:38,231 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/924 dead transitions. [2021-06-10 11:44:38,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 924 transitions, 2065 flow [2021-06-10 11:44:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:38,233 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:38,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:38,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:38,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:38,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:38,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,235 INFO L185 Difference]: Start difference. First operand has 899 places, 924 transitions, 2053 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:38,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 924 transitions, 2065 flow [2021-06-10 11:44:38,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 924 transitions, 2060 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:38,244 INFO L241 Difference]: Finished difference. Result has 901 places, 923 transitions, 2049 flow [2021-06-10 11:44:38,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2049, PETRI_PLACES=901, PETRI_TRANSITIONS=923} [2021-06-10 11:44:38,244 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -30 predicate places. [2021-06-10 11:44:38,244 INFO L480 AbstractCegarLoop]: Abstraction has has 901 places, 923 transitions, 2049 flow [2021-06-10 11:44:38,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:38,244 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:38,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1900 [2021-06-10 11:44:38,244 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:38,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -501696682, now seen corresponding path program 1 times [2021-06-10 11:44:38,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:38,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113546360] [2021-06-10 11:44:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:38,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:38,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:38,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:44:38,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113546360] [2021-06-10 11:44:38,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:38,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:38,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407020906] [2021-06-10 11:44:38,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:38,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:38,264 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:38,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 923 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:38,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:38,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:38,615 INFO L129 PetriNetUnfolder]: 99/1031 cut-off events. [2021-06-10 11:44:38,615 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:38,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1031 events. 99/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4186 event pairs, 0 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 1146. Up to 36 conditions per place. [2021-06-10 11:44:38,691 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/921 dead transitions. [2021-06-10 11:44:38,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 921 transitions, 2052 flow [2021-06-10 11:44:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:38,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:38,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:38,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:38,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:38,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:38,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,696 INFO L185 Difference]: Start difference. First operand has 901 places, 923 transitions, 2049 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 921 transitions, 2052 flow [2021-06-10 11:44:38,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 921 transitions, 2045 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:38,708 INFO L241 Difference]: Finished difference. Result has 901 places, 921 transitions, 2038 flow [2021-06-10 11:44:38,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2038, PETRI_PLACES=901, PETRI_TRANSITIONS=921} [2021-06-10 11:44:38,708 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -30 predicate places. [2021-06-10 11:44:38,708 INFO L480 AbstractCegarLoop]: Abstraction has has 901 places, 921 transitions, 2038 flow [2021-06-10 11:44:38,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:38,709 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:38,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1901 [2021-06-10 11:44:38,709 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -501697705, now seen corresponding path program 1 times [2021-06-10 11:44:38,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:38,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927041398] [2021-06-10 11:44:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:38,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:38,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:38,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:38,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:44:38,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927041398] [2021-06-10 11:44:38,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:38,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:38,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009836231] [2021-06-10 11:44:38,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:38,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:38,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:38,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 921 transitions, 2038 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:38,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:38,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:38,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:39,087 INFO L129 PetriNetUnfolder]: 99/1029 cut-off events. [2021-06-10 11:44:39,087 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:39,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 1029 events. 99/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4171 event pairs, 0 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1146. Up to 36 conditions per place. [2021-06-10 11:44:39,159 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/919 dead transitions. [2021-06-10 11:44:39,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 901 places, 919 transitions, 2051 flow [2021-06-10 11:44:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:39,160 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:39,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:39,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:39,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:39,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:39,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,163 INFO L185 Difference]: Start difference. First operand has 901 places, 921 transitions, 2038 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:39,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 901 places, 919 transitions, 2051 flow [2021-06-10 11:44:39,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 919 transitions, 2050 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:39,171 INFO L241 Difference]: Finished difference. Result has 900 places, 919 transitions, 2034 flow [2021-06-10 11:44:39,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=898, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2034, PETRI_PLACES=900, PETRI_TRANSITIONS=919} [2021-06-10 11:44:39,172 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -31 predicate places. [2021-06-10 11:44:39,172 INFO L480 AbstractCegarLoop]: Abstraction has has 900 places, 919 transitions, 2034 flow [2021-06-10 11:44:39,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:39,172 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:39,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1902 [2021-06-10 11:44:39,172 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:39,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1657700358, now seen corresponding path program 1 times [2021-06-10 11:44:39,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:39,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941281257] [2021-06-10 11:44:39,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:39,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:39,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:39,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:44:39,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941281257] [2021-06-10 11:44:39,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:39,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:39,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031914162] [2021-06-10 11:44:39,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:39,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:39,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:39,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 900 places, 919 transitions, 2034 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:39,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:39,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:39,540 INFO L129 PetriNetUnfolder]: 97/1034 cut-off events. [2021-06-10 11:44:39,541 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:39,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1034 events. 97/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4222 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1149. Up to 36 conditions per place. [2021-06-10 11:44:39,600 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/920 dead transitions. [2021-06-10 11:44:39,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 920 transitions, 2050 flow [2021-06-10 11:44:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:39,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:39,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:39,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:39,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:39,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:39,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,604 INFO L185 Difference]: Start difference. First operand has 900 places, 919 transitions, 2034 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:39,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 902 places, 920 transitions, 2050 flow [2021-06-10 11:44:39,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 920 transitions, 2049 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:39,612 INFO L241 Difference]: Finished difference. Result has 903 places, 920 transitions, 2047 flow [2021-06-10 11:44:39,612 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=899, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2047, PETRI_PLACES=903, PETRI_TRANSITIONS=920} [2021-06-10 11:44:39,612 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -28 predicate places. [2021-06-10 11:44:39,612 INFO L480 AbstractCegarLoop]: Abstraction has has 903 places, 920 transitions, 2047 flow [2021-06-10 11:44:39,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:39,613 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:39,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1903 [2021-06-10 11:44:39,613 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1657699335, now seen corresponding path program 1 times [2021-06-10 11:44:39,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:39,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081752164] [2021-06-10 11:44:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:39,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:39,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:39,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:39,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:44:39,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081752164] [2021-06-10 11:44:39,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:39,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:39,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185295315] [2021-06-10 11:44:39,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:39,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:39,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:39,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:39,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 920 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:39,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:39,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:39,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:39,992 INFO L129 PetriNetUnfolder]: 97/1035 cut-off events. [2021-06-10 11:44:39,992 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:40,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1035 events. 97/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4230 event pairs, 0 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1157. Up to 36 conditions per place. [2021-06-10 11:44:40,065 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/921 dead transitions. [2021-06-10 11:44:40,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 921 transitions, 2073 flow [2021-06-10 11:44:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:40,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:40,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:40,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:40,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:40,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:40,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,069 INFO L185 Difference]: Start difference. First operand has 903 places, 920 transitions, 2047 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:40,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 921 transitions, 2073 flow [2021-06-10 11:44:40,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 904 places, 921 transitions, 2071 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:40,077 INFO L241 Difference]: Finished difference. Result has 906 places, 921 transitions, 2063 flow [2021-06-10 11:44:40,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2063, PETRI_PLACES=906, PETRI_TRANSITIONS=921} [2021-06-10 11:44:40,078 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -25 predicate places. [2021-06-10 11:44:40,078 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 921 transitions, 2063 flow [2021-06-10 11:44:40,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:40,078 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:40,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1904 [2021-06-10 11:44:40,078 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1658652647, now seen corresponding path program 1 times [2021-06-10 11:44:40,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:40,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232061620] [2021-06-10 11:44:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:40,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:40,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:40,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:44:40,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232061620] [2021-06-10 11:44:40,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:40,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:40,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969984626] [2021-06-10 11:44:40,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:40,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:40,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:40,099 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:40,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 921 transitions, 2063 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:40,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:40,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:40,466 INFO L129 PetriNetUnfolder]: 96/1031 cut-off events. [2021-06-10 11:44:40,466 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:40,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1031 events. 96/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4205 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1150. Up to 36 conditions per place. [2021-06-10 11:44:40,540 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/918 dead transitions. [2021-06-10 11:44:40,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 918 transitions, 2060 flow [2021-06-10 11:44:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:40,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:40,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:40,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:40,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:40,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:40,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,544 INFO L185 Difference]: Start difference. First operand has 906 places, 921 transitions, 2063 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:40,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 918 transitions, 2060 flow [2021-06-10 11:44:40,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 918 transitions, 2052 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:40,553 INFO L241 Difference]: Finished difference. Result has 905 places, 918 transitions, 2042 flow [2021-06-10 11:44:40,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=905, PETRI_TRANSITIONS=918} [2021-06-10 11:44:40,553 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -26 predicate places. [2021-06-10 11:44:40,553 INFO L480 AbstractCegarLoop]: Abstraction has has 905 places, 918 transitions, 2042 flow [2021-06-10 11:44:40,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:40,553 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:40,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1905 [2021-06-10 11:44:40,554 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1658653670, now seen corresponding path program 1 times [2021-06-10 11:44:40,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:40,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701915885] [2021-06-10 11:44:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:40,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:40,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:40,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:40,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:44:40,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701915885] [2021-06-10 11:44:40,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:40,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:40,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284713424] [2021-06-10 11:44:40,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:40,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:40,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:40,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:40,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 905 places, 918 transitions, 2042 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:40,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:40,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:40,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:40,932 INFO L129 PetriNetUnfolder]: 96/1029 cut-off events. [2021-06-10 11:44:40,932 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:40,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1029 events. 96/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4190 event pairs, 0 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1153. Up to 36 conditions per place. [2021-06-10 11:44:41,003 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/916 dead transitions. [2021-06-10 11:44:41,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 916 transitions, 2055 flow [2021-06-10 11:44:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:41,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:41,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:41,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:41,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:41,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:41,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,008 INFO L185 Difference]: Start difference. First operand has 905 places, 918 transitions, 2042 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:41,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 916 transitions, 2055 flow [2021-06-10 11:44:41,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 904 places, 916 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:41,016 INFO L241 Difference]: Finished difference. Result has 904 places, 916 transitions, 2038 flow [2021-06-10 11:44:41,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2038, PETRI_PLACES=904, PETRI_TRANSITIONS=916} [2021-06-10 11:44:41,016 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -27 predicate places. [2021-06-10 11:44:41,016 INFO L480 AbstractCegarLoop]: Abstraction has has 904 places, 916 transitions, 2038 flow [2021-06-10 11:44:41,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:41,017 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:41,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1906 [2021-06-10 11:44:41,017 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash 324521112, now seen corresponding path program 1 times [2021-06-10 11:44:41,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:41,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242544923] [2021-06-10 11:44:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:41,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:41,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:41,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:44:41,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242544923] [2021-06-10 11:44:41,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:41,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:41,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236795295] [2021-06-10 11:44:41,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:41,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:41,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:41,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 904 places, 916 transitions, 2038 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:41,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:41,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:41,403 INFO L129 PetriNetUnfolder]: 95/1036 cut-off events. [2021-06-10 11:44:41,403 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:41,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 1036 events. 95/1036 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4251 event pairs, 0 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1158. Up to 36 conditions per place. [2021-06-10 11:44:41,517 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/917 dead transitions. [2021-06-10 11:44:41,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 906 places, 917 transitions, 2054 flow [2021-06-10 11:44:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:41,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:41,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:41,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:41,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:41,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:41,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,522 INFO L185 Difference]: Start difference. First operand has 904 places, 916 transitions, 2038 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:41,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 906 places, 917 transitions, 2054 flow [2021-06-10 11:44:41,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 917 transitions, 2053 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:41,529 INFO L241 Difference]: Finished difference. Result has 906 places, 916 transitions, 2042 flow [2021-06-10 11:44:41,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=906, PETRI_TRANSITIONS=916} [2021-06-10 11:44:41,529 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -25 predicate places. [2021-06-10 11:44:41,529 INFO L480 AbstractCegarLoop]: Abstraction has has 906 places, 916 transitions, 2042 flow [2021-06-10 11:44:41,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,530 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:41,530 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:41,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1907 [2021-06-10 11:44:41,530 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:41,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash 324522135, now seen corresponding path program 1 times [2021-06-10 11:44:41,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:41,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650481772] [2021-06-10 11:44:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:41,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:41,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:41,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:41,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:44:41,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650481772] [2021-06-10 11:44:41,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:41,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:41,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343839873] [2021-06-10 11:44:41,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:41,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:41,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:41,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 916 transitions, 2042 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:41,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:41,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:41,915 INFO L129 PetriNetUnfolder]: 93/1038 cut-off events. [2021-06-10 11:44:41,915 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:41,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1038 events. 93/1038 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4282 event pairs, 0 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1169. Up to 36 conditions per place. [2021-06-10 11:44:41,987 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/917 dead transitions. [2021-06-10 11:44:41,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 908 places, 917 transitions, 2068 flow [2021-06-10 11:44:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:41,989 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:41,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:41,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:41,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:41,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:41,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:41,991 INFO L185 Difference]: Start difference. First operand has 906 places, 916 transitions, 2042 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:41,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 908 places, 917 transitions, 2068 flow [2021-06-10 11:44:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 917 transitions, 2067 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:42,000 INFO L241 Difference]: Finished difference. Result has 909 places, 917 transitions, 2059 flow [2021-06-10 11:44:42,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=905, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2059, PETRI_PLACES=909, PETRI_TRANSITIONS=917} [2021-06-10 11:44:42,000 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -22 predicate places. [2021-06-10 11:44:42,000 INFO L480 AbstractCegarLoop]: Abstraction has has 909 places, 917 transitions, 2059 flow [2021-06-10 11:44:42,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:42,001 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:42,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1908 [2021-06-10 11:44:42,001 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 323568823, now seen corresponding path program 1 times [2021-06-10 11:44:42,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:42,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582092164] [2021-06-10 11:44:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:42,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:42,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:44:42,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582092164] [2021-06-10 11:44:42,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:42,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:42,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2750428] [2021-06-10 11:44:42,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:42,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:42,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:42,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:42,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 917 transitions, 2059 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:42,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:42,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:42,399 INFO L129 PetriNetUnfolder]: 93/1031 cut-off events. [2021-06-10 11:44:42,399 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:42,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1031 events. 93/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4223 event pairs, 0 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 1155. Up to 36 conditions per place. [2021-06-10 11:44:42,472 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/915 dead transitions. [2021-06-10 11:44:42,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 915 transitions, 2061 flow [2021-06-10 11:44:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:42,474 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:42,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:42,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:42,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:42,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:42,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,477 INFO L185 Difference]: Start difference. First operand has 909 places, 917 transitions, 2059 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:42,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 915 transitions, 2061 flow [2021-06-10 11:44:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 908 places, 915 transitions, 2053 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:42,485 INFO L241 Difference]: Finished difference. Result has 909 places, 915 transitions, 2046 flow [2021-06-10 11:44:42,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=906, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2046, PETRI_PLACES=909, PETRI_TRANSITIONS=915} [2021-06-10 11:44:42,486 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -22 predicate places. [2021-06-10 11:44:42,486 INFO L480 AbstractCegarLoop]: Abstraction has has 909 places, 915 transitions, 2046 flow [2021-06-10 11:44:42,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:42,486 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:42,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1909 [2021-06-10 11:44:42,486 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 323567800, now seen corresponding path program 1 times [2021-06-10 11:44:42,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:42,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612694358] [2021-06-10 11:44:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:42,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:42,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:44:42,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612694358] [2021-06-10 11:44:42,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:42,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:42,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876776300] [2021-06-10 11:44:42,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:42,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:42,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:42,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 915 transitions, 2046 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:42,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:42,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:42,875 INFO L129 PetriNetUnfolder]: 93/1029 cut-off events. [2021-06-10 11:44:42,875 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:42,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1029 events. 93/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4206 event pairs, 0 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1159. Up to 36 conditions per place. [2021-06-10 11:44:42,947 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/913 dead transitions. [2021-06-10 11:44:42,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 913 transitions, 2059 flow [2021-06-10 11:44:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:42,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:42,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:42,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:42,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:42,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:42,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,952 INFO L185 Difference]: Start difference. First operand has 909 places, 915 transitions, 2046 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:42,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 913 transitions, 2059 flow [2021-06-10 11:44:42,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 908 places, 913 transitions, 2058 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:42,960 INFO L241 Difference]: Finished difference. Result has 908 places, 913 transitions, 2042 flow [2021-06-10 11:44:42,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=906, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=908, PETRI_TRANSITIONS=913} [2021-06-10 11:44:42,961 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -23 predicate places. [2021-06-10 11:44:42,961 INFO L480 AbstractCegarLoop]: Abstraction has has 908 places, 913 transitions, 2042 flow [2021-06-10 11:44:42,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:42,961 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:42,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1910 [2021-06-10 11:44:42,961 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2052495337, now seen corresponding path program 1 times [2021-06-10 11:44:42,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:42,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15914864] [2021-06-10 11:44:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:42,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:42,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:42,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:44:42,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15914864] [2021-06-10 11:44:42,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:42,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:42,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340793823] [2021-06-10 11:44:42,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:42,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:42,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:42,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 913 transitions, 2042 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:42,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:42,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:42,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:43,349 INFO L129 PetriNetUnfolder]: 91/1034 cut-off events. [2021-06-10 11:44:43,349 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:43,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1034 events. 91/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4259 event pairs, 0 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1162. Up to 36 conditions per place. [2021-06-10 11:44:43,427 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/914 dead transitions. [2021-06-10 11:44:43,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 914 transitions, 2058 flow [2021-06-10 11:44:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:43,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:43,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:43,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:43,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:43,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:43,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,431 INFO L185 Difference]: Start difference. First operand has 908 places, 913 transitions, 2042 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:43,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 914 transitions, 2058 flow [2021-06-10 11:44:43,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 909 places, 914 transitions, 2057 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:43,440 INFO L241 Difference]: Finished difference. Result has 911 places, 914 transitions, 2055 flow [2021-06-10 11:44:43,440 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=907, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2055, PETRI_PLACES=911, PETRI_TRANSITIONS=914} [2021-06-10 11:44:43,440 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -20 predicate places. [2021-06-10 11:44:43,440 INFO L480 AbstractCegarLoop]: Abstraction has has 911 places, 914 transitions, 2055 flow [2021-06-10 11:44:43,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:43,441 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:43,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1911 [2021-06-10 11:44:43,441 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2052494314, now seen corresponding path program 1 times [2021-06-10 11:44:43,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:43,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133296637] [2021-06-10 11:44:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:43,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:43,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:43,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:44:43,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133296637] [2021-06-10 11:44:43,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:43,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:43,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682131376] [2021-06-10 11:44:43,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:43,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:43,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:43,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:43,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 914 transitions, 2055 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:43,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:43,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:43,859 INFO L129 PetriNetUnfolder]: 91/1035 cut-off events. [2021-06-10 11:44:43,859 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:43,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 1035 events. 91/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4265 event pairs, 0 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1170. Up to 36 conditions per place. [2021-06-10 11:44:43,925 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/915 dead transitions. [2021-06-10 11:44:43,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 915 transitions, 2081 flow [2021-06-10 11:44:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:43,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:43,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:43,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:43,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:43,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:43,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,929 INFO L185 Difference]: Start difference. First operand has 911 places, 914 transitions, 2055 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:43,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 915 transitions, 2081 flow [2021-06-10 11:44:43,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 915 transitions, 2079 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:43,937 INFO L241 Difference]: Finished difference. Result has 914 places, 915 transitions, 2071 flow [2021-06-10 11:44:43,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2071, PETRI_PLACES=914, PETRI_TRANSITIONS=915} [2021-06-10 11:44:43,938 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -17 predicate places. [2021-06-10 11:44:43,938 INFO L480 AbstractCegarLoop]: Abstraction has has 914 places, 915 transitions, 2071 flow [2021-06-10 11:44:43,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:43,938 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:43,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1912 [2021-06-10 11:44:43,938 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2053447626, now seen corresponding path program 1 times [2021-06-10 11:44:43,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:43,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986955078] [2021-06-10 11:44:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:43,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:43,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:43,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:43,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:44:43,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986955078] [2021-06-10 11:44:43,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:43,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:43,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405503700] [2021-06-10 11:44:43,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:43,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:43,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:43,960 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:43,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 915 transitions, 2071 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:43,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:43,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:43,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:44,326 INFO L129 PetriNetUnfolder]: 90/1031 cut-off events. [2021-06-10 11:44:44,326 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:44,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1031 events. 90/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4239 event pairs, 0 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1163. Up to 36 conditions per place. [2021-06-10 11:44:44,399 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/912 dead transitions. [2021-06-10 11:44:44,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 912 transitions, 2068 flow [2021-06-10 11:44:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:44,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:44,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:44,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:44,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:44,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:44,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,403 INFO L185 Difference]: Start difference. First operand has 914 places, 915 transitions, 2071 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:44,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 912 transitions, 2068 flow [2021-06-10 11:44:44,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 912 transitions, 2060 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:44,412 INFO L241 Difference]: Finished difference. Result has 913 places, 912 transitions, 2050 flow [2021-06-10 11:44:44,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2050, PETRI_PLACES=913, PETRI_TRANSITIONS=912} [2021-06-10 11:44:44,412 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -18 predicate places. [2021-06-10 11:44:44,412 INFO L480 AbstractCegarLoop]: Abstraction has has 913 places, 912 transitions, 2050 flow [2021-06-10 11:44:44,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:44,413 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:44,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1913 [2021-06-10 11:44:44,413 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2053448649, now seen corresponding path program 1 times [2021-06-10 11:44:44,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:44,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091086371] [2021-06-10 11:44:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:44,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:44,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:44,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:44:44,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091086371] [2021-06-10 11:44:44,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:44,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:44,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857167361] [2021-06-10 11:44:44,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:44,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:44,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:44,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:44,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:44,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 912 transitions, 2050 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:44,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:44,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:44,816 INFO L129 PetriNetUnfolder]: 90/1029 cut-off events. [2021-06-10 11:44:44,816 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:44,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1029 events. 90/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4227 event pairs, 0 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1166. Up to 36 conditions per place. [2021-06-10 11:44:44,889 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/910 dead transitions. [2021-06-10 11:44:44,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 910 transitions, 2063 flow [2021-06-10 11:44:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:44,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:44,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:44,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:44,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:44,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:44,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,894 INFO L185 Difference]: Start difference. First operand has 913 places, 912 transitions, 2050 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:44,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 910 transitions, 2063 flow [2021-06-10 11:44:44,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 910 transitions, 2062 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:44,903 INFO L241 Difference]: Finished difference. Result has 912 places, 910 transitions, 2046 flow [2021-06-10 11:44:44,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2046, PETRI_PLACES=912, PETRI_TRANSITIONS=910} [2021-06-10 11:44:44,903 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -19 predicate places. [2021-06-10 11:44:44,903 INFO L480 AbstractCegarLoop]: Abstraction has has 912 places, 910 transitions, 2046 flow [2021-06-10 11:44:44,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:44,903 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:44,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1914 [2021-06-10 11:44:44,903 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:44,904 INFO L82 PathProgramCache]: Analyzing trace with hash -536390116, now seen corresponding path program 1 times [2021-06-10 11:44:44,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:44,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195403708] [2021-06-10 11:44:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:44,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:44,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:44,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:44,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:44:44,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195403708] [2021-06-10 11:44:44,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:44,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:44,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234056651] [2021-06-10 11:44:44,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:44,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:44,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:44,928 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:44,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 910 transitions, 2046 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:44,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:44,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:44,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:45,299 INFO L129 PetriNetUnfolder]: 88/1034 cut-off events. [2021-06-10 11:44:45,299 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:45,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1034 events. 88/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4277 event pairs, 0 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1169. Up to 36 conditions per place. [2021-06-10 11:44:45,371 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/911 dead transitions. [2021-06-10 11:44:45,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 914 places, 911 transitions, 2062 flow [2021-06-10 11:44:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:45,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:45,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:45,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:45,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:45,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:45,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,376 INFO L185 Difference]: Start difference. First operand has 912 places, 910 transitions, 2046 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:45,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 914 places, 911 transitions, 2062 flow [2021-06-10 11:44:45,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 911 transitions, 2061 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:45,384 INFO L241 Difference]: Finished difference. Result has 915 places, 911 transitions, 2059 flow [2021-06-10 11:44:45,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2059, PETRI_PLACES=915, PETRI_TRANSITIONS=911} [2021-06-10 11:44:45,385 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -16 predicate places. [2021-06-10 11:44:45,385 INFO L480 AbstractCegarLoop]: Abstraction has has 915 places, 911 transitions, 2059 flow [2021-06-10 11:44:45,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:45,385 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:45,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1915 [2021-06-10 11:44:45,385 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash -536391139, now seen corresponding path program 1 times [2021-06-10 11:44:45,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:45,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036018304] [2021-06-10 11:44:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:45,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:45,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:45,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:44:45,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036018304] [2021-06-10 11:44:45,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:45,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:45,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382312049] [2021-06-10 11:44:45,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:45,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:45,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:45,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:45,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 911 transitions, 2059 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:45,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:45,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:45,857 INFO L129 PetriNetUnfolder]: 88/1035 cut-off events. [2021-06-10 11:44:45,857 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:45,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1035 events. 88/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4282 event pairs, 0 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1177. Up to 36 conditions per place. [2021-06-10 11:44:45,904 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/912 dead transitions. [2021-06-10 11:44:45,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 912 transitions, 2085 flow [2021-06-10 11:44:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:45,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:45,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:45,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:45,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:45,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:45,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,909 INFO L185 Difference]: Start difference. First operand has 915 places, 911 transitions, 2059 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:45,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 912 transitions, 2085 flow [2021-06-10 11:44:45,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 916 places, 912 transitions, 2083 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:45,916 INFO L241 Difference]: Finished difference. Result has 918 places, 912 transitions, 2075 flow [2021-06-10 11:44:45,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=918, PETRI_TRANSITIONS=912} [2021-06-10 11:44:45,917 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -13 predicate places. [2021-06-10 11:44:45,917 INFO L480 AbstractCegarLoop]: Abstraction has has 918 places, 912 transitions, 2075 flow [2021-06-10 11:44:45,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:45,917 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:45,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1916 [2021-06-10 11:44:45,917 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash -535437827, now seen corresponding path program 1 times [2021-06-10 11:44:45,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:45,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082684149] [2021-06-10 11:44:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:45,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:45,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:45,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:45,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:44:45,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082684149] [2021-06-10 11:44:45,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:45,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:45,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789647588] [2021-06-10 11:44:45,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:45,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:45,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:45,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:45,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:45,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 912 transitions, 2075 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:45,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:45,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:45,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:46,310 INFO L129 PetriNetUnfolder]: 87/1031 cut-off events. [2021-06-10 11:44:46,310 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:46,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1031 events. 87/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4258 event pairs, 0 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1170. Up to 36 conditions per place. [2021-06-10 11:44:46,381 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/909 dead transitions. [2021-06-10 11:44:46,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 909 transitions, 2072 flow [2021-06-10 11:44:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:46,383 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:46,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:46,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:46,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:46,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:46,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,386 INFO L185 Difference]: Start difference. First operand has 918 places, 912 transitions, 2075 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 909 transitions, 2072 flow [2021-06-10 11:44:46,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 909 transitions, 2064 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:46,394 INFO L241 Difference]: Finished difference. Result has 917 places, 909 transitions, 2054 flow [2021-06-10 11:44:46,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2054, PETRI_PLACES=917, PETRI_TRANSITIONS=909} [2021-06-10 11:44:46,395 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -14 predicate places. [2021-06-10 11:44:46,395 INFO L480 AbstractCegarLoop]: Abstraction has has 917 places, 909 transitions, 2054 flow [2021-06-10 11:44:46,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:46,395 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:46,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1917 [2021-06-10 11:44:46,395 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash -535436804, now seen corresponding path program 1 times [2021-06-10 11:44:46,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:46,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970442600] [2021-06-10 11:44:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:46,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:46,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:46,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:44:46,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970442600] [2021-06-10 11:44:46,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:46,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:46,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796071139] [2021-06-10 11:44:46,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:46,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:46,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:46,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:46,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 909 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:46,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:46,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:46,789 INFO L129 PetriNetUnfolder]: 87/1029 cut-off events. [2021-06-10 11:44:46,789 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:46,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 1029 events. 87/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4241 event pairs, 0 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 1173. Up to 36 conditions per place. [2021-06-10 11:44:46,862 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/907 dead transitions. [2021-06-10 11:44:46,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 907 transitions, 2067 flow [2021-06-10 11:44:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:46,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:46,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:46,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:46,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:46,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:46,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,866 INFO L185 Difference]: Start difference. First operand has 917 places, 909 transitions, 2054 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:46,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 907 transitions, 2067 flow [2021-06-10 11:44:46,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 916 places, 907 transitions, 2066 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:46,875 INFO L241 Difference]: Finished difference. Result has 916 places, 907 transitions, 2050 flow [2021-06-10 11:44:46,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2050, PETRI_PLACES=916, PETRI_TRANSITIONS=907} [2021-06-10 11:44:46,875 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -15 predicate places. [2021-06-10 11:44:46,875 INFO L480 AbstractCegarLoop]: Abstraction has has 916 places, 907 transitions, 2050 flow [2021-06-10 11:44:46,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,876 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:46,876 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:46,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1918 [2021-06-10 11:44:46,876 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 419872944, now seen corresponding path program 1 times [2021-06-10 11:44:46,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:46,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065173398] [2021-06-10 11:44:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:46,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:46,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:46,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:46,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:44:46,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065173398] [2021-06-10 11:44:46,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:46,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:46,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940087643] [2021-06-10 11:44:46,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:46,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:46,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:46,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:46,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 916 places, 907 transitions, 2050 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:46,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:46,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:46,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:47,278 INFO L129 PetriNetUnfolder]: 86/1037 cut-off events. [2021-06-10 11:44:47,278 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:47,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 1037 events. 86/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4315 event pairs, 0 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1185. Up to 36 conditions per place. [2021-06-10 11:44:47,351 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/909 dead transitions. [2021-06-10 11:44:47,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 918 places, 909 transitions, 2080 flow [2021-06-10 11:44:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:47,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:47,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:47,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:47,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:47,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:47,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,355 INFO L185 Difference]: Start difference. First operand has 916 places, 907 transitions, 2050 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:47,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 918 places, 909 transitions, 2080 flow [2021-06-10 11:44:47,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 909 transitions, 2079 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:47,364 INFO L241 Difference]: Finished difference. Result has 919 places, 909 transitions, 2073 flow [2021-06-10 11:44:47,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2049, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2073, PETRI_PLACES=919, PETRI_TRANSITIONS=909} [2021-06-10 11:44:47,364 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -12 predicate places. [2021-06-10 11:44:47,364 INFO L480 AbstractCegarLoop]: Abstraction has has 919 places, 909 transitions, 2073 flow [2021-06-10 11:44:47,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,365 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:47,365 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:47,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1919 [2021-06-10 11:44:47,365 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 419871921, now seen corresponding path program 1 times [2021-06-10 11:44:47,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:47,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806564481] [2021-06-10 11:44:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:47,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:47,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:47,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:44:47,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806564481] [2021-06-10 11:44:47,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:47,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:47,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054118097] [2021-06-10 11:44:47,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:47,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:47,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:47,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 909 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:47,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:47,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:47,770 INFO L129 PetriNetUnfolder]: 84/1038 cut-off events. [2021-06-10 11:44:47,770 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:47,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1038 events. 84/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4337 event pairs, 0 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1185. Up to 36 conditions per place. [2021-06-10 11:44:47,840 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/909 dead transitions. [2021-06-10 11:44:47,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 909 transitions, 2085 flow [2021-06-10 11:44:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:47,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:47,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:47,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:47,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:47,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:47,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,845 INFO L185 Difference]: Start difference. First operand has 919 places, 909 transitions, 2073 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:47,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 909 transitions, 2085 flow [2021-06-10 11:44:47,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 909 transitions, 2080 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:47,853 INFO L241 Difference]: Finished difference. Result has 921 places, 908 transitions, 2069 flow [2021-06-10 11:44:47,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2069, PETRI_PLACES=921, PETRI_TRANSITIONS=908} [2021-06-10 11:44:47,853 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -10 predicate places. [2021-06-10 11:44:47,853 INFO L480 AbstractCegarLoop]: Abstraction has has 921 places, 908 transitions, 2069 flow [2021-06-10 11:44:47,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:47,854 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:47,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1920 [2021-06-10 11:44:47,854 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 418919632, now seen corresponding path program 1 times [2021-06-10 11:44:47,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:47,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911072696] [2021-06-10 11:44:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:47,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:47,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:47,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:47,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:44:47,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911072696] [2021-06-10 11:44:47,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:47,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:47,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514858402] [2021-06-10 11:44:47,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:47,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:47,897 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:47,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 908 transitions, 2069 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:47,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:47,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:47,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:48,261 INFO L129 PetriNetUnfolder]: 84/1031 cut-off events. [2021-06-10 11:44:48,261 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:48,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1031 events. 84/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4276 event pairs, 0 based on Foata normal form. 1/914 useless extension candidates. Maximal degree in co-relation 1179. Up to 36 conditions per place. [2021-06-10 11:44:48,331 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/906 dead transitions. [2021-06-10 11:44:48,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 906 transitions, 2072 flow [2021-06-10 11:44:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:48,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:48,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:48,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:48,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:48,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:48,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,335 INFO L185 Difference]: Start difference. First operand has 921 places, 908 transitions, 2069 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:48,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 906 transitions, 2072 flow [2021-06-10 11:44:48,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 906 transitions, 2065 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:48,344 INFO L241 Difference]: Finished difference. Result has 921 places, 906 transitions, 2058 flow [2021-06-10 11:44:48,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=921, PETRI_TRANSITIONS=906} [2021-06-10 11:44:48,344 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -10 predicate places. [2021-06-10 11:44:48,344 INFO L480 AbstractCegarLoop]: Abstraction has has 921 places, 906 transitions, 2058 flow [2021-06-10 11:44:48,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:48,344 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:48,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1921 [2021-06-10 11:44:48,344 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash 418918609, now seen corresponding path program 1 times [2021-06-10 11:44:48,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:48,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688134542] [2021-06-10 11:44:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:48,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:48,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:48,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:44:48,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688134542] [2021-06-10 11:44:48,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:48,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:48,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559010292] [2021-06-10 11:44:48,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:48,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:48,366 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:48,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 906 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:48,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:48,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:48,732 INFO L129 PetriNetUnfolder]: 84/1029 cut-off events. [2021-06-10 11:44:48,733 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:48,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 1029 events. 84/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4262 event pairs, 0 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 1179. Up to 36 conditions per place. [2021-06-10 11:44:48,801 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/904 dead transitions. [2021-06-10 11:44:48,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 904 transitions, 2071 flow [2021-06-10 11:44:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:48,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:48,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:48,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:48,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:48,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:48,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,806 INFO L185 Difference]: Start difference. First operand has 921 places, 906 transitions, 2058 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:48,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 904 transitions, 2071 flow [2021-06-10 11:44:48,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 904 transitions, 2070 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:48,814 INFO L241 Difference]: Finished difference. Result has 920 places, 904 transitions, 2054 flow [2021-06-10 11:44:48,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2054, PETRI_PLACES=920, PETRI_TRANSITIONS=904} [2021-06-10 11:44:48,814 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -11 predicate places. [2021-06-10 11:44:48,814 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 904 transitions, 2054 flow [2021-06-10 11:44:48,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:48,814 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:48,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1922 [2021-06-10 11:44:48,815 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash -566682523, now seen corresponding path program 1 times [2021-06-10 11:44:48,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:48,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047630757] [2021-06-10 11:44:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:48,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:48,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:44:48,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047630757] [2021-06-10 11:44:48,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:48,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:48,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586401789] [2021-06-10 11:44:48,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:48,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:48,836 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:48,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 904 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:48,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:48,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:48,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:49,214 INFO L129 PetriNetUnfolder]: 83/1037 cut-off events. [2021-06-10 11:44:49,214 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:49,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 1037 events. 83/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4326 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1191. Up to 36 conditions per place. [2021-06-10 11:44:49,284 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/906 dead transitions. [2021-06-10 11:44:49,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 906 transitions, 2084 flow [2021-06-10 11:44:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:49,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:49,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:49,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:49,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:49,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:49,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,288 INFO L185 Difference]: Start difference. First operand has 920 places, 904 transitions, 2054 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:49,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 906 transitions, 2084 flow [2021-06-10 11:44:49,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 906 transitions, 2083 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:49,297 INFO L241 Difference]: Finished difference. Result has 923 places, 906 transitions, 2077 flow [2021-06-10 11:44:49,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2077, PETRI_PLACES=923, PETRI_TRANSITIONS=906} [2021-06-10 11:44:49,297 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -8 predicate places. [2021-06-10 11:44:49,297 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 906 transitions, 2077 flow [2021-06-10 11:44:49,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:49,297 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:49,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1923 [2021-06-10 11:44:49,297 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -566683546, now seen corresponding path program 1 times [2021-06-10 11:44:49,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:49,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378276308] [2021-06-10 11:44:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:49,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:49,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:49,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:44:49,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378276308] [2021-06-10 11:44:49,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:49,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:49,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798267843] [2021-06-10 11:44:49,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:49,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:49,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:49,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:49,320 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:49,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 906 transitions, 2077 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:49,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:49,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:49,698 INFO L129 PetriNetUnfolder]: 81/1038 cut-off events. [2021-06-10 11:44:49,698 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:49,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1038 events. 81/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4353 event pairs, 0 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1191. Up to 36 conditions per place. [2021-06-10 11:44:49,768 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/906 dead transitions. [2021-06-10 11:44:49,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 906 transitions, 2089 flow [2021-06-10 11:44:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:49,770 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:49,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:49,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:49,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:49,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:49,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,772 INFO L185 Difference]: Start difference. First operand has 923 places, 906 transitions, 2077 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 906 transitions, 2089 flow [2021-06-10 11:44:49,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 906 transitions, 2084 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:49,781 INFO L241 Difference]: Finished difference. Result has 925 places, 905 transitions, 2073 flow [2021-06-10 11:44:49,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2073, PETRI_PLACES=925, PETRI_TRANSITIONS=905} [2021-06-10 11:44:49,781 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -6 predicate places. [2021-06-10 11:44:49,781 INFO L480 AbstractCegarLoop]: Abstraction has has 925 places, 905 transitions, 2073 flow [2021-06-10 11:44:49,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:49,782 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:49,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1924 [2021-06-10 11:44:49,782 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash -567635835, now seen corresponding path program 1 times [2021-06-10 11:44:49,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:49,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661184061] [2021-06-10 11:44:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:49,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:49,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:49,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:49,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:44:49,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661184061] [2021-06-10 11:44:49,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:49,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:49,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604613418] [2021-06-10 11:44:49,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:49,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:49,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:49,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 905 transitions, 2073 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:49,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:49,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:49,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:50,165 INFO L129 PetriNetUnfolder]: 81/1031 cut-off events. [2021-06-10 11:44:50,165 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:50,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 1031 events. 81/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4291 event pairs, 0 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 1185. Up to 36 conditions per place. [2021-06-10 11:44:50,223 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/903 dead transitions. [2021-06-10 11:44:50,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 903 transitions, 2076 flow [2021-06-10 11:44:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:50,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:50,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:50,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:50,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:50,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:50,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,228 INFO L185 Difference]: Start difference. First operand has 925 places, 905 transitions, 2073 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:50,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 903 transitions, 2076 flow [2021-06-10 11:44:50,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 903 transitions, 2069 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:50,236 INFO L241 Difference]: Finished difference. Result has 925 places, 903 transitions, 2062 flow [2021-06-10 11:44:50,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2062, PETRI_PLACES=925, PETRI_TRANSITIONS=903} [2021-06-10 11:44:50,236 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -6 predicate places. [2021-06-10 11:44:50,236 INFO L480 AbstractCegarLoop]: Abstraction has has 925 places, 903 transitions, 2062 flow [2021-06-10 11:44:50,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:50,237 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:50,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1925 [2021-06-10 11:44:50,237 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash -567636858, now seen corresponding path program 1 times [2021-06-10 11:44:50,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:50,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423854331] [2021-06-10 11:44:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:50,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:50,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:50,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:44:50,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423854331] [2021-06-10 11:44:50,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:50,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:50,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036368054] [2021-06-10 11:44:50,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:50,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:50,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:50,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 903 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:50,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:50,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:50,628 INFO L129 PetriNetUnfolder]: 81/1029 cut-off events. [2021-06-10 11:44:50,628 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:50,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 1029 events. 81/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4274 event pairs, 0 based on Foata normal form. 0/913 useless extension candidates. Maximal degree in co-relation 1185. Up to 36 conditions per place. [2021-06-10 11:44:50,696 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/901 dead transitions. [2021-06-10 11:44:50,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 901 transitions, 2075 flow [2021-06-10 11:44:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:50,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:50,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:50,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:50,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:50,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:50,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,701 INFO L185 Difference]: Start difference. First operand has 925 places, 903 transitions, 2062 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:50,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 901 transitions, 2075 flow [2021-06-10 11:44:50,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 901 transitions, 2074 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:50,709 INFO L241 Difference]: Finished difference. Result has 924 places, 901 transitions, 2058 flow [2021-06-10 11:44:50,709 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2056, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=924, PETRI_TRANSITIONS=901} [2021-06-10 11:44:50,709 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -7 predicate places. [2021-06-10 11:44:50,709 INFO L480 AbstractCegarLoop]: Abstraction has has 924 places, 901 transitions, 2058 flow [2021-06-10 11:44:50,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:50,709 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:50,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1926 [2021-06-10 11:44:50,710 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1886929084, now seen corresponding path program 1 times [2021-06-10 11:44:50,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:50,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731709182] [2021-06-10 11:44:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:50,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:50,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:50,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:50,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:44:50,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731709182] [2021-06-10 11:44:50,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:50,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:50,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530725594] [2021-06-10 11:44:50,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:50,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:50,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:50,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:50,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:50,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 901 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:50,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:50,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:50,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:51,114 INFO L129 PetriNetUnfolder]: 80/1037 cut-off events. [2021-06-10 11:44:51,114 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:51,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 1037 events. 80/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4349 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1197. Up to 36 conditions per place. [2021-06-10 11:44:51,185 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/903 dead transitions. [2021-06-10 11:44:51,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 903 transitions, 2088 flow [2021-06-10 11:44:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:51,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:51,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:51,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:51,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:51,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,190 INFO L185 Difference]: Start difference. First operand has 924 places, 901 transitions, 2058 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:51,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 903 transitions, 2088 flow [2021-06-10 11:44:51,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 903 transitions, 2087 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:51,199 INFO L241 Difference]: Finished difference. Result has 927 places, 903 transitions, 2081 flow [2021-06-10 11:44:51,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2081, PETRI_PLACES=927, PETRI_TRANSITIONS=903} [2021-06-10 11:44:51,199 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -4 predicate places. [2021-06-10 11:44:51,199 INFO L480 AbstractCegarLoop]: Abstraction has has 927 places, 903 transitions, 2081 flow [2021-06-10 11:44:51,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,199 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:51,199 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:51,199 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1927 [2021-06-10 11:44:51,199 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1886930107, now seen corresponding path program 1 times [2021-06-10 11:44:51,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:51,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787539168] [2021-06-10 11:44:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:51,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:51,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:51,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:44:51,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787539168] [2021-06-10 11:44:51,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:51,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:51,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68861369] [2021-06-10 11:44:51,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:51,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:51,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:51,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 903 transitions, 2081 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:51,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:51,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:51,599 INFO L129 PetriNetUnfolder]: 79/1035 cut-off events. [2021-06-10 11:44:51,599 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:51,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 1035 events. 79/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4334 event pairs, 0 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1194. Up to 36 conditions per place. [2021-06-10 11:44:51,669 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/903 dead transitions. [2021-06-10 11:44:51,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 903 transitions, 2093 flow [2021-06-10 11:44:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:51,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:51,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:51,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:51,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:51,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:51,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,674 INFO L185 Difference]: Start difference. First operand has 927 places, 903 transitions, 2081 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 903 transitions, 2093 flow [2021-06-10 11:44:51,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 903 transitions, 2088 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:51,682 INFO L241 Difference]: Finished difference. Result has 930 places, 903 transitions, 2086 flow [2021-06-10 11:44:51,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=930, PETRI_TRANSITIONS=903} [2021-06-10 11:44:51,682 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -1 predicate places. [2021-06-10 11:44:51,682 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 903 transitions, 2086 flow [2021-06-10 11:44:51,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:51,683 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:51,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1928 [2021-06-10 11:44:51,683 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1887882396, now seen corresponding path program 1 times [2021-06-10 11:44:51,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:51,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714075560] [2021-06-10 11:44:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:51,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:51,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:51,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:51,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:44:51,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714075560] [2021-06-10 11:44:51,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:51,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:51,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624766497] [2021-06-10 11:44:51,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:51,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:51,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:51,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 903 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:51,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:51,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:51,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:52,108 INFO L129 PetriNetUnfolder]: 78/1031 cut-off events. [2021-06-10 11:44:52,109 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:44:52,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 1031 events. 78/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4310 event pairs, 0 based on Foata normal form. 1/920 useless extension candidates. Maximal degree in co-relation 1191. Up to 36 conditions per place. [2021-06-10 11:44:52,155 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/900 dead transitions. [2021-06-10 11:44:52,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 900 transitions, 2083 flow [2021-06-10 11:44:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:52,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:52,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:52,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:52,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:52,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:52,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,159 INFO L185 Difference]: Start difference. First operand has 930 places, 903 transitions, 2086 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:52,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 900 transitions, 2083 flow [2021-06-10 11:44:52,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 900 transitions, 2076 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:52,167 INFO L241 Difference]: Finished difference. Result has 929 places, 900 transitions, 2066 flow [2021-06-10 11:44:52,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=899, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2066, PETRI_PLACES=929, PETRI_TRANSITIONS=900} [2021-06-10 11:44:52,168 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -2 predicate places. [2021-06-10 11:44:52,168 INFO L480 AbstractCegarLoop]: Abstraction has has 929 places, 900 transitions, 2066 flow [2021-06-10 11:44:52,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:52,168 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:52,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1929 [2021-06-10 11:44:52,168 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1887883419, now seen corresponding path program 1 times [2021-06-10 11:44:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:52,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109763380] [2021-06-10 11:44:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:52,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:52,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:52,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:44:52,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109763380] [2021-06-10 11:44:52,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:52,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:52,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486101605] [2021-06-10 11:44:52,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:52,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:52,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:52,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 900 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:52,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:52,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:52,574 INFO L129 PetriNetUnfolder]: 78/1029 cut-off events. [2021-06-10 11:44:52,574 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:52,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1029 events. 78/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4296 event pairs, 0 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1192. Up to 36 conditions per place. [2021-06-10 11:44:52,645 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/898 dead transitions. [2021-06-10 11:44:52,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 898 transitions, 2079 flow [2021-06-10 11:44:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:52,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:52,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:52,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:52,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:52,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:52,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,650 INFO L185 Difference]: Start difference. First operand has 929 places, 900 transitions, 2066 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 898 transitions, 2079 flow [2021-06-10 11:44:52,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 898 transitions, 2078 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:52,658 INFO L241 Difference]: Finished difference. Result has 928 places, 898 transitions, 2062 flow [2021-06-10 11:44:52,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2062, PETRI_PLACES=928, PETRI_TRANSITIONS=898} [2021-06-10 11:44:52,658 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, -3 predicate places. [2021-06-10 11:44:52,658 INFO L480 AbstractCegarLoop]: Abstraction has has 928 places, 898 transitions, 2062 flow [2021-06-10 11:44:52,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:52,659 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:52,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1930 [2021-06-10 11:44:52,659 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash -493849614, now seen corresponding path program 1 times [2021-06-10 11:44:52,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:52,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9622586] [2021-06-10 11:44:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:52,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:52,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:52,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:52,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:44:52,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9622586] [2021-06-10 11:44:52,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:52,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:52,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488446870] [2021-06-10 11:44:52,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:52,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:52,681 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:52,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 898 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:52,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:52,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:52,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:53,059 INFO L129 PetriNetUnfolder]: 76/1034 cut-off events. [2021-06-10 11:44:53,059 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:53,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 1034 events. 76/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4344 event pairs, 0 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1195. Up to 36 conditions per place. [2021-06-10 11:44:53,129 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/899 dead transitions. [2021-06-10 11:44:53,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 899 transitions, 2078 flow [2021-06-10 11:44:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:53,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:53,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:53,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:53,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:53,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:53,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,133 INFO L185 Difference]: Start difference. First operand has 928 places, 898 transitions, 2062 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:53,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 899 transitions, 2078 flow [2021-06-10 11:44:53,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 899 transitions, 2077 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:53,142 INFO L241 Difference]: Finished difference. Result has 931 places, 899 transitions, 2075 flow [2021-06-10 11:44:53,142 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=931, PETRI_TRANSITIONS=899} [2021-06-10 11:44:53,142 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 0 predicate places. [2021-06-10 11:44:53,142 INFO L480 AbstractCegarLoop]: Abstraction has has 931 places, 899 transitions, 2075 flow [2021-06-10 11:44:53,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,143 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:53,143 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:53,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1931 [2021-06-10 11:44:53,143 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -493850637, now seen corresponding path program 1 times [2021-06-10 11:44:53,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:53,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523228397] [2021-06-10 11:44:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:53,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:53,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:53,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:44:53,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523228397] [2021-06-10 11:44:53,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:53,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:53,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959508257] [2021-06-10 11:44:53,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:53,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:53,166 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:53,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 899 transitions, 2075 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:53,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:53,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:53,550 INFO L129 PetriNetUnfolder]: 76/1035 cut-off events. [2021-06-10 11:44:53,550 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:44:53,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1035 events. 76/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4349 event pairs, 0 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1203. Up to 36 conditions per place. [2021-06-10 11:44:53,621 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/900 dead transitions. [2021-06-10 11:44:53,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 900 transitions, 2101 flow [2021-06-10 11:44:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:53,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:53,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:53,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:53,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:53,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:53,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,625 INFO L185 Difference]: Start difference. First operand has 931 places, 899 transitions, 2075 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:53,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 900 transitions, 2101 flow [2021-06-10 11:44:53,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 900 transitions, 2099 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:53,634 INFO L241 Difference]: Finished difference. Result has 934 places, 900 transitions, 2091 flow [2021-06-10 11:44:53,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2073, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2091, PETRI_PLACES=934, PETRI_TRANSITIONS=900} [2021-06-10 11:44:53,634 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 3 predicate places. [2021-06-10 11:44:53,635 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 900 transitions, 2091 flow [2021-06-10 11:44:53,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:53,635 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:53,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1932 [2021-06-10 11:44:53,635 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash -492897325, now seen corresponding path program 1 times [2021-06-10 11:44:53,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:53,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109157391] [2021-06-10 11:44:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:53,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:53,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:53,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:53,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:44:53,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109157391] [2021-06-10 11:44:53,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:53,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:53,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949792450] [2021-06-10 11:44:53,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:53,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:53,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:53,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 900 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:53,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:53,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:53,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:54,048 INFO L129 PetriNetUnfolder]: 75/1031 cut-off events. [2021-06-10 11:44:54,048 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:54,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1031 events. 75/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4325 event pairs, 0 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1196. Up to 36 conditions per place. [2021-06-10 11:44:54,169 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/897 dead transitions. [2021-06-10 11:44:54,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 897 transitions, 2088 flow [2021-06-10 11:44:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:54,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:54,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:54,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:54,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:54,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:54,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,174 INFO L185 Difference]: Start difference. First operand has 934 places, 900 transitions, 2091 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:54,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 897 transitions, 2088 flow [2021-06-10 11:44:54,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 897 transitions, 2080 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:54,181 INFO L241 Difference]: Finished difference. Result has 933 places, 897 transitions, 2070 flow [2021-06-10 11:44:54,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2070, PETRI_PLACES=933, PETRI_TRANSITIONS=897} [2021-06-10 11:44:54,181 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 2 predicate places. [2021-06-10 11:44:54,181 INFO L480 AbstractCegarLoop]: Abstraction has has 933 places, 897 transitions, 2070 flow [2021-06-10 11:44:54,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:54,182 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:54,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1933 [2021-06-10 11:44:54,182 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -492896302, now seen corresponding path program 1 times [2021-06-10 11:44:54,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:54,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2768678] [2021-06-10 11:44:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:54,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:54,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:54,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:44:54,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2768678] [2021-06-10 11:44:54,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:54,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:54,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886568455] [2021-06-10 11:44:54,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:54,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:54,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:54,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 897 transitions, 2070 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:54,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:54,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:54,585 INFO L129 PetriNetUnfolder]: 75/1029 cut-off events. [2021-06-10 11:44:54,585 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:54,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 1029 events. 75/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4308 event pairs, 0 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1199. Up to 36 conditions per place. [2021-06-10 11:44:54,654 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/895 dead transitions. [2021-06-10 11:44:54,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 895 transitions, 2083 flow [2021-06-10 11:44:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:54,656 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:54,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:54,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:54,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:54,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:54,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,659 INFO L185 Difference]: Start difference. First operand has 933 places, 897 transitions, 2070 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:54,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 895 transitions, 2083 flow [2021-06-10 11:44:54,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 895 transitions, 2082 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:54,667 INFO L241 Difference]: Finished difference. Result has 932 places, 895 transitions, 2066 flow [2021-06-10 11:44:54,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2066, PETRI_PLACES=932, PETRI_TRANSITIONS=895} [2021-06-10 11:44:54,667 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 1 predicate places. [2021-06-10 11:44:54,667 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 895 transitions, 2066 flow [2021-06-10 11:44:54,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:54,668 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:54,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1934 [2021-06-10 11:44:54,668 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash -826612853, now seen corresponding path program 1 times [2021-06-10 11:44:54,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:54,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828933487] [2021-06-10 11:44:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:54,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:54,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:54,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:54,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:44:54,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828933487] [2021-06-10 11:44:54,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:54,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:54,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685888892] [2021-06-10 11:44:54,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:54,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:54,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:54,690 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:54,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 895 transitions, 2066 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:54,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:54,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:54,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:55,100 INFO L129 PetriNetUnfolder]: 74/1036 cut-off events. [2021-06-10 11:44:55,100 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:55,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 1036 events. 74/1036 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4374 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1204. Up to 36 conditions per place. [2021-06-10 11:44:55,173 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2021-06-10 11:44:55,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 896 transitions, 2082 flow [2021-06-10 11:44:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:55,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:55,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:55,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:55,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:55,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:55,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,177 INFO L185 Difference]: Start difference. First operand has 932 places, 895 transitions, 2066 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 896 transitions, 2082 flow [2021-06-10 11:44:55,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 896 transitions, 2081 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:55,186 INFO L241 Difference]: Finished difference. Result has 934 places, 895 transitions, 2070 flow [2021-06-10 11:44:55,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2070, PETRI_PLACES=934, PETRI_TRANSITIONS=895} [2021-06-10 11:44:55,187 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 3 predicate places. [2021-06-10 11:44:55,187 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 895 transitions, 2070 flow [2021-06-10 11:44:55,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:55,187 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:55,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1935 [2021-06-10 11:44:55,187 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash -826611830, now seen corresponding path program 1 times [2021-06-10 11:44:55,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:55,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360913520] [2021-06-10 11:44:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:55,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:55,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:55,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:44:55,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360913520] [2021-06-10 11:44:55,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:55,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:55,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984019070] [2021-06-10 11:44:55,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:55,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:55,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:55,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:55,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 895 transitions, 2070 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:55,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:55,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:55,598 INFO L129 PetriNetUnfolder]: 72/1038 cut-off events. [2021-06-10 11:44:55,598 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:55,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1038 events. 72/1038 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4402 event pairs, 0 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1215. Up to 36 conditions per place. [2021-06-10 11:44:55,668 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/896 dead transitions. [2021-06-10 11:44:55,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 896 transitions, 2096 flow [2021-06-10 11:44:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:44:55,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:44:55,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:44:55,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:44:55,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:55,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:44:55,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,673 INFO L185 Difference]: Start difference. First operand has 934 places, 895 transitions, 2070 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:44:55,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 896 transitions, 2096 flow [2021-06-10 11:44:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 896 transitions, 2095 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:55,681 INFO L241 Difference]: Finished difference. Result has 937 places, 896 transitions, 2087 flow [2021-06-10 11:44:55,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2087, PETRI_PLACES=937, PETRI_TRANSITIONS=896} [2021-06-10 11:44:55,682 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 6 predicate places. [2021-06-10 11:44:55,682 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 896 transitions, 2087 flow [2021-06-10 11:44:55,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:55,682 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:55,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1936 [2021-06-10 11:44:55,682 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -827565142, now seen corresponding path program 1 times [2021-06-10 11:44:55,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:55,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643814106] [2021-06-10 11:44:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:55,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:55,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:55,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:55,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:44:55,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643814106] [2021-06-10 11:44:55,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:55,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:55,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310814402] [2021-06-10 11:44:55,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:55,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:55,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:55,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 896 transitions, 2087 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:55,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:55,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:55,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:56,086 INFO L129 PetriNetUnfolder]: 72/1031 cut-off events. [2021-06-10 11:44:56,086 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:56,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1031 events. 72/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4345 event pairs, 0 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 1201. Up to 36 conditions per place. [2021-06-10 11:44:56,155 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/894 dead transitions. [2021-06-10 11:44:56,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 894 transitions, 2089 flow [2021-06-10 11:44:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:56,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:56,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:56,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:56,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:56,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:56,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,160 INFO L185 Difference]: Start difference. First operand has 937 places, 896 transitions, 2087 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 894 transitions, 2089 flow [2021-06-10 11:44:56,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 894 transitions, 2081 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:56,169 INFO L241 Difference]: Finished difference. Result has 937 places, 894 transitions, 2074 flow [2021-06-10 11:44:56,169 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2074, PETRI_PLACES=937, PETRI_TRANSITIONS=894} [2021-06-10 11:44:56,169 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 6 predicate places. [2021-06-10 11:44:56,169 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 894 transitions, 2074 flow [2021-06-10 11:44:56,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,170 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:56,170 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:56,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1937 [2021-06-10 11:44:56,170 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash -827566165, now seen corresponding path program 1 times [2021-06-10 11:44:56,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:56,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594072254] [2021-06-10 11:44:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:56,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:56,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:56,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:44:56,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594072254] [2021-06-10 11:44:56,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:56,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:56,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034541907] [2021-06-10 11:44:56,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:56,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:56,194 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:56,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 894 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:56,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:56,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:56,599 INFO L129 PetriNetUnfolder]: 72/1029 cut-off events. [2021-06-10 11:44:56,599 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:56,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1029 events. 72/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4331 event pairs, 0 based on Foata normal form. 0/922 useless extension candidates. Maximal degree in co-relation 1205. Up to 36 conditions per place. [2021-06-10 11:44:56,668 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/892 dead transitions. [2021-06-10 11:44:56,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 892 transitions, 2087 flow [2021-06-10 11:44:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:56,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:56,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:56,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:56,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:56,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:56,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,672 INFO L185 Difference]: Start difference. First operand has 937 places, 894 transitions, 2074 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:56,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 892 transitions, 2087 flow [2021-06-10 11:44:56,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 892 transitions, 2086 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:56,681 INFO L241 Difference]: Finished difference. Result has 936 places, 892 transitions, 2070 flow [2021-06-10 11:44:56,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2070, PETRI_PLACES=936, PETRI_TRANSITIONS=892} [2021-06-10 11:44:56,681 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 5 predicate places. [2021-06-10 11:44:56,681 INFO L480 AbstractCegarLoop]: Abstraction has has 936 places, 892 transitions, 2070 flow [2021-06-10 11:44:56,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:56,681 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:56,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1938 [2021-06-10 11:44:56,681 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:56,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2051754051, now seen corresponding path program 1 times [2021-06-10 11:44:56,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:56,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582550326] [2021-06-10 11:44:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:56,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:56,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:44:56,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:56,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:44:56,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582550326] [2021-06-10 11:44:56,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:56,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:56,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440704941] [2021-06-10 11:44:56,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:56,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:56,704 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:56,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 892 transitions, 2070 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:56,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:56,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:56,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:57,097 INFO L129 PetriNetUnfolder]: 71/1037 cut-off events. [2021-06-10 11:44:57,097 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:57,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1037 events. 71/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4396 event pairs, 0 based on Foata normal form. 0/930 useless extension candidates. Maximal degree in co-relation 1217. Up to 36 conditions per place. [2021-06-10 11:44:57,166 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/894 dead transitions. [2021-06-10 11:44:57,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 894 transitions, 2100 flow [2021-06-10 11:44:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:57,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:57,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:57,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:57,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:57,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:57,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,170 INFO L185 Difference]: Start difference. First operand has 936 places, 892 transitions, 2070 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:57,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 894 transitions, 2100 flow [2021-06-10 11:44:57,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 894 transitions, 2099 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:57,179 INFO L241 Difference]: Finished difference. Result has 939 places, 894 transitions, 2093 flow [2021-06-10 11:44:57,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2093, PETRI_PLACES=939, PETRI_TRANSITIONS=894} [2021-06-10 11:44:57,179 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 8 predicate places. [2021-06-10 11:44:57,179 INFO L480 AbstractCegarLoop]: Abstraction has has 939 places, 894 transitions, 2093 flow [2021-06-10 11:44:57,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:57,179 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:57,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1939 [2021-06-10 11:44:57,180 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2051753028, now seen corresponding path program 1 times [2021-06-10 11:44:57,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:57,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068976728] [2021-06-10 11:44:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:57,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:57,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:57,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:44:57,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068976728] [2021-06-10 11:44:57,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:57,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:57,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909544644] [2021-06-10 11:44:57,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:57,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:57,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:57,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 894 transitions, 2093 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:57,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:57,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:57,590 INFO L129 PetriNetUnfolder]: 69/1038 cut-off events. [2021-06-10 11:44:57,590 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:57,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 1038 events. 69/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4419 event pairs, 0 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1217. Up to 36 conditions per place. [2021-06-10 11:44:57,662 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/894 dead transitions. [2021-06-10 11:44:57,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 894 transitions, 2105 flow [2021-06-10 11:44:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:57,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:57,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:57,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:57,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,667 INFO L185 Difference]: Start difference. First operand has 939 places, 894 transitions, 2093 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:57,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 894 transitions, 2105 flow [2021-06-10 11:44:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 894 transitions, 2100 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:57,676 INFO L241 Difference]: Finished difference. Result has 941 places, 893 transitions, 2089 flow [2021-06-10 11:44:57,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2089, PETRI_PLACES=941, PETRI_TRANSITIONS=893} [2021-06-10 11:44:57,676 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 10 predicate places. [2021-06-10 11:44:57,676 INFO L480 AbstractCegarLoop]: Abstraction has has 941 places, 893 transitions, 2089 flow [2021-06-10 11:44:57,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:57,677 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:57,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1940 [2021-06-10 11:44:57,677 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2050800739, now seen corresponding path program 1 times [2021-06-10 11:44:57,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:57,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943207375] [2021-06-10 11:44:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:57,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:57,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:57,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:57,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:44:57,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943207375] [2021-06-10 11:44:57,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:57,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:57,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803792948] [2021-06-10 11:44:57,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:57,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:57,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:57,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 893 transitions, 2089 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:57,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:57,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:57,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:58,100 INFO L129 PetriNetUnfolder]: 69/1031 cut-off events. [2021-06-10 11:44:58,100 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:58,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1031 events. 69/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4361 event pairs, 0 based on Foata normal form. 1/929 useless extension candidates. Maximal degree in co-relation 1211. Up to 36 conditions per place. [2021-06-10 11:44:58,168 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/891 dead transitions. [2021-06-10 11:44:58,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 891 transitions, 2092 flow [2021-06-10 11:44:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:44:58,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:44:58,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:44:58,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:44:58,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:58,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:44:58,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,173 INFO L185 Difference]: Start difference. First operand has 941 places, 893 transitions, 2089 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:44:58,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 891 transitions, 2092 flow [2021-06-10 11:44:58,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 891 transitions, 2085 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:44:58,181 INFO L241 Difference]: Finished difference. Result has 941 places, 891 transitions, 2078 flow [2021-06-10 11:44:58,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2073, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=941, PETRI_TRANSITIONS=891} [2021-06-10 11:44:58,182 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 10 predicate places. [2021-06-10 11:44:58,182 INFO L480 AbstractCegarLoop]: Abstraction has has 941 places, 891 transitions, 2078 flow [2021-06-10 11:44:58,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:58,182 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:58,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1941 [2021-06-10 11:44:58,182 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2050799716, now seen corresponding path program 1 times [2021-06-10 11:44:58,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:58,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255949457] [2021-06-10 11:44:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:58,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:58,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:58,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:44:58,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255949457] [2021-06-10 11:44:58,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:58,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:58,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164541377] [2021-06-10 11:44:58,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:58,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:58,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:58,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:58,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 891 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:58,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:58,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:58,585 INFO L129 PetriNetUnfolder]: 69/1029 cut-off events. [2021-06-10 11:44:58,585 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:44:58,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1029 events. 69/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4344 event pairs, 0 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1211. Up to 36 conditions per place. [2021-06-10 11:44:58,645 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/889 dead transitions. [2021-06-10 11:44:58,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 889 transitions, 2091 flow [2021-06-10 11:44:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:44:58,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:44:58,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:44:58,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:44:58,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:58,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:44:58,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,649 INFO L185 Difference]: Start difference. First operand has 941 places, 891 transitions, 2078 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:44:58,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 889 transitions, 2091 flow [2021-06-10 11:44:58,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 889 transitions, 2090 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:58,657 INFO L241 Difference]: Finished difference. Result has 940 places, 889 transitions, 2074 flow [2021-06-10 11:44:58,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2074, PETRI_PLACES=940, PETRI_TRANSITIONS=889} [2021-06-10 11:44:58,657 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 9 predicate places. [2021-06-10 11:44:58,657 INFO L480 AbstractCegarLoop]: Abstraction has has 940 places, 889 transitions, 2074 flow [2021-06-10 11:44:58,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,658 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:58,658 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:58,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1942 [2021-06-10 11:44:58,658 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1325869922, now seen corresponding path program 1 times [2021-06-10 11:44:58,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:58,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327635963] [2021-06-10 11:44:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:58,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:58,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:44:58,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:58,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:44:58,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327635963] [2021-06-10 11:44:58,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:58,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:58,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903342242] [2021-06-10 11:44:58,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:58,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:58,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:44:58,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 889 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:58,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:58,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:44:58,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:59,073 INFO L129 PetriNetUnfolder]: 68/1037 cut-off events. [2021-06-10 11:44:59,073 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:44:59,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 1037 events. 68/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4419 event pairs, 0 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 1223. Up to 36 conditions per place. [2021-06-10 11:44:59,143 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/891 dead transitions. [2021-06-10 11:44:59,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 891 transitions, 2104 flow [2021-06-10 11:44:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:44:59,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:44:59,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:44:59,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:44:59,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:59,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:44:59,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,147 INFO L185 Difference]: Start difference. First operand has 940 places, 889 transitions, 2074 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:44:59,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 891 transitions, 2104 flow [2021-06-10 11:44:59,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 891 transitions, 2103 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:59,156 INFO L241 Difference]: Finished difference. Result has 943 places, 891 transitions, 2097 flow [2021-06-10 11:44:59,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2073, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2097, PETRI_PLACES=943, PETRI_TRANSITIONS=891} [2021-06-10 11:44:59,156 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 12 predicate places. [2021-06-10 11:44:59,156 INFO L480 AbstractCegarLoop]: Abstraction has has 943 places, 891 transitions, 2097 flow [2021-06-10 11:44:59,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:59,156 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:59,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1943 [2021-06-10 11:44:59,156 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1325868899, now seen corresponding path program 1 times [2021-06-10 11:44:59,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:59,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530776117] [2021-06-10 11:44:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:59,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:59,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:59,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:44:59,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530776117] [2021-06-10 11:44:59,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:59,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:59,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451521289] [2021-06-10 11:44:59,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:59,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:59,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:59,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 891 transitions, 2097 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:59,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:59,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:44:59,576 INFO L129 PetriNetUnfolder]: 67/1035 cut-off events. [2021-06-10 11:44:59,576 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:44:59,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1035 events. 67/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4409 event pairs, 0 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1220. Up to 36 conditions per place. [2021-06-10 11:44:59,646 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/891 dead transitions. [2021-06-10 11:44:59,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 891 transitions, 2109 flow [2021-06-10 11:44:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:44:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:44:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:44:59,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:44:59,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:44:59,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:44:59,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:44:59,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:44:59,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,651 INFO L185 Difference]: Start difference. First operand has 943 places, 891 transitions, 2097 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:44:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 891 transitions, 2109 flow [2021-06-10 11:44:59,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 891 transitions, 2104 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:44:59,660 INFO L241 Difference]: Finished difference. Result has 946 places, 891 transitions, 2102 flow [2021-06-10 11:44:59,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=942, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=946, PETRI_TRANSITIONS=891} [2021-06-10 11:44:59,660 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 15 predicate places. [2021-06-10 11:44:59,660 INFO L480 AbstractCegarLoop]: Abstraction has has 946 places, 891 transitions, 2102 flow [2021-06-10 11:44:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:44:59,661 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:44:59,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1944 [2021-06-10 11:44:59,661 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:44:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:44:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1324916610, now seen corresponding path program 1 times [2021-06-10 11:44:59,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:44:59,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447218743] [2021-06-10 11:44:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:44:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:44:59,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:59,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:44:59,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:44:59,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:44:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:44:59,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447218743] [2021-06-10 11:44:59,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:44:59,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:44:59,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263590859] [2021-06-10 11:44:59,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:44:59,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:44:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:44:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:44:59,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:44:59,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 891 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:44:59,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:44:59,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:44:59,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:00,075 INFO L129 PetriNetUnfolder]: 66/1031 cut-off events. [2021-06-10 11:45:00,075 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:00,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 1031 events. 66/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4378 event pairs, 0 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 1217. Up to 36 conditions per place. [2021-06-10 11:45:00,142 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/888 dead transitions. [2021-06-10 11:45:00,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 888 transitions, 2099 flow [2021-06-10 11:45:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:00,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:00,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:00,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:00,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:00,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:00,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,147 INFO L185 Difference]: Start difference. First operand has 946 places, 891 transitions, 2102 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 888 transitions, 2099 flow [2021-06-10 11:45:00,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 888 transitions, 2092 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:00,155 INFO L241 Difference]: Finished difference. Result has 945 places, 888 transitions, 2082 flow [2021-06-10 11:45:00,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2082, PETRI_PLACES=945, PETRI_TRANSITIONS=888} [2021-06-10 11:45:00,156 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 14 predicate places. [2021-06-10 11:45:00,156 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 888 transitions, 2082 flow [2021-06-10 11:45:00,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:00,156 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:00,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1945 [2021-06-10 11:45:00,156 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1324915587, now seen corresponding path program 1 times [2021-06-10 11:45:00,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:00,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525034880] [2021-06-10 11:45:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:00,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:00,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:00,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:45:00,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525034880] [2021-06-10 11:45:00,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:00,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:00,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271803098] [2021-06-10 11:45:00,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:00,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:00,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:00,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 888 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:00,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:00,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:00,562 INFO L129 PetriNetUnfolder]: 66/1029 cut-off events. [2021-06-10 11:45:00,563 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:00,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 1029 events. 66/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4363 event pairs, 0 based on Foata normal form. 0/928 useless extension candidates. Maximal degree in co-relation 1218. Up to 36 conditions per place. [2021-06-10 11:45:00,615 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/886 dead transitions. [2021-06-10 11:45:00,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 886 transitions, 2095 flow [2021-06-10 11:45:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:00,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:00,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:00,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:00,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:00,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:00,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,620 INFO L185 Difference]: Start difference. First operand has 945 places, 888 transitions, 2082 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 886 transitions, 2095 flow [2021-06-10 11:45:00,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 886 transitions, 2094 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:00,628 INFO L241 Difference]: Finished difference. Result has 944 places, 886 transitions, 2078 flow [2021-06-10 11:45:00,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=942, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=944, PETRI_TRANSITIONS=886} [2021-06-10 11:45:00,628 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 13 predicate places. [2021-06-10 11:45:00,628 INFO L480 AbstractCegarLoop]: Abstraction has has 944 places, 886 transitions, 2078 flow [2021-06-10 11:45:00,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:00,628 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:00,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1946 [2021-06-10 11:45:00,629 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:00,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1733203672, now seen corresponding path program 1 times [2021-06-10 11:45:00,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:00,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718090417] [2021-06-10 11:45:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:00,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:00,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:00,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:00,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:45:00,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718090417] [2021-06-10 11:45:00,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:00,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:00,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436939086] [2021-06-10 11:45:00,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:00,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:00,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:00,652 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:00,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 886 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:00,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:00,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:00,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:01,038 INFO L129 PetriNetUnfolder]: 64/1034 cut-off events. [2021-06-10 11:45:01,038 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:01,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 1034 events. 64/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4412 event pairs, 0 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1221. Up to 36 conditions per place. [2021-06-10 11:45:01,107 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/887 dead transitions. [2021-06-10 11:45:01,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 887 transitions, 2094 flow [2021-06-10 11:45:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:01,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:01,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:01,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:01,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:01,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:01,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,112 INFO L185 Difference]: Start difference. First operand has 944 places, 886 transitions, 2078 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:01,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 887 transitions, 2094 flow [2021-06-10 11:45:01,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 887 transitions, 2093 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:01,121 INFO L241 Difference]: Finished difference. Result has 947 places, 887 transitions, 2091 flow [2021-06-10 11:45:01,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2091, PETRI_PLACES=947, PETRI_TRANSITIONS=887} [2021-06-10 11:45:01,121 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 16 predicate places. [2021-06-10 11:45:01,121 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 887 transitions, 2091 flow [2021-06-10 11:45:01,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,122 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:01,122 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:01,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1947 [2021-06-10 11:45:01,122 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1733202649, now seen corresponding path program 1 times [2021-06-10 11:45:01,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:01,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804030219] [2021-06-10 11:45:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:01,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:01,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:01,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:45:01,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804030219] [2021-06-10 11:45:01,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:01,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:01,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435089390] [2021-06-10 11:45:01,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:01,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:01,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:01,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 887 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:01,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:01,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:01,567 INFO L129 PetriNetUnfolder]: 64/1035 cut-off events. [2021-06-10 11:45:01,567 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:01,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1035 events. 64/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4419 event pairs, 0 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1229. Up to 36 conditions per place. [2021-06-10 11:45:01,635 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/888 dead transitions. [2021-06-10 11:45:01,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 888 transitions, 2117 flow [2021-06-10 11:45:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:01,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:01,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:01,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:01,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:01,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:01,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,641 INFO L185 Difference]: Start difference. First operand has 947 places, 887 transitions, 2091 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:01,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 888 transitions, 2117 flow [2021-06-10 11:45:01,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 888 transitions, 2115 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:01,653 INFO L241 Difference]: Finished difference. Result has 950 places, 888 transitions, 2107 flow [2021-06-10 11:45:01,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=950, PETRI_TRANSITIONS=888} [2021-06-10 11:45:01,653 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 19 predicate places. [2021-06-10 11:45:01,653 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 888 transitions, 2107 flow [2021-06-10 11:45:01,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:01,654 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:01,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1948 [2021-06-10 11:45:01,654 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1734156984, now seen corresponding path program 1 times [2021-06-10 11:45:01,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:01,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181609867] [2021-06-10 11:45:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:01,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:01,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:01,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:01,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:45:01,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181609867] [2021-06-10 11:45:01,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:01,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:01,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365684018] [2021-06-10 11:45:01,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:01,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:01,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:01,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 888 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:01,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:01,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:01,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:02,102 INFO L129 PetriNetUnfolder]: 63/1032 cut-off events. [2021-06-10 11:45:02,102 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 11:45:02,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1032 events. 63/1032 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4399 event pairs, 0 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 1228. Up to 36 conditions per place. [2021-06-10 11:45:02,171 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 9 selfloop transitions, 1 changer transitions 0/886 dead transitions. [2021-06-10 11:45:02,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 886 transitions, 2115 flow [2021-06-10 11:45:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2766 transitions. [2021-06-10 11:45:02,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210789210789211 [2021-06-10 11:45:02,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2766 transitions. [2021-06-10 11:45:02,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2766 transitions. [2021-06-10 11:45:02,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:02,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2766 transitions. [2021-06-10 11:45:02,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.0) internal successors, (2766), 3 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,176 INFO L185 Difference]: Start difference. First operand has 950 places, 888 transitions, 2107 flow. Second operand 3 states and 2766 transitions. [2021-06-10 11:45:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 886 transitions, 2115 flow [2021-06-10 11:45:02,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 886 transitions, 2114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:02,185 INFO L241 Difference]: Finished difference. Result has 951 places, 886 transitions, 2096 flow [2021-06-10 11:45:02,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=951, PETRI_TRANSITIONS=886} [2021-06-10 11:45:02,185 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 20 predicate places. [2021-06-10 11:45:02,185 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 886 transitions, 2096 flow [2021-06-10 11:45:02,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:02,186 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:02,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1949 [2021-06-10 11:45:02,186 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1734155961, now seen corresponding path program 1 times [2021-06-10 11:45:02,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:02,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122036401] [2021-06-10 11:45:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:02,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:02,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:02,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:45:02,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122036401] [2021-06-10 11:45:02,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:02,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:02,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418617064] [2021-06-10 11:45:02,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:02,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:02,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:02,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 886 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:02,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:02,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:02,621 INFO L129 PetriNetUnfolder]: 63/1029 cut-off events. [2021-06-10 11:45:02,621 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:02,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 1029 events. 63/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4375 event pairs, 0 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1222. Up to 36 conditions per place. [2021-06-10 11:45:02,673 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/883 dead transitions. [2021-06-10 11:45:02,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 883 transitions, 2097 flow [2021-06-10 11:45:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:02,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:02,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:02,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:02,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:02,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:02,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,677 INFO L185 Difference]: Start difference. First operand has 951 places, 886 transitions, 2096 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:02,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 883 transitions, 2097 flow [2021-06-10 11:45:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 883 transitions, 2092 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:02,686 INFO L241 Difference]: Finished difference. Result has 948 places, 883 transitions, 2082 flow [2021-06-10 11:45:02,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2082, PETRI_PLACES=948, PETRI_TRANSITIONS=883} [2021-06-10 11:45:02,686 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 17 predicate places. [2021-06-10 11:45:02,686 INFO L480 AbstractCegarLoop]: Abstraction has has 948 places, 883 transitions, 2082 flow [2021-06-10 11:45:02,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:02,686 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:02,686 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1950 [2021-06-10 11:45:02,686 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1185860981, now seen corresponding path program 1 times [2021-06-10 11:45:02,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:02,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976705733] [2021-06-10 11:45:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:02,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:02,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:02,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:02,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:45:02,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976705733] [2021-06-10 11:45:02,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:02,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:02,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159338607] [2021-06-10 11:45:02,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:02,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:02,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:02,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 883 transitions, 2082 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:02,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:02,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:02,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:03,133 INFO L129 PetriNetUnfolder]: 62/1036 cut-off events. [2021-06-10 11:45:03,134 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:03,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 1036 events. 62/1036 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4440 event pairs, 0 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1232. Up to 36 conditions per place. [2021-06-10 11:45:03,204 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/884 dead transitions. [2021-06-10 11:45:03,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 884 transitions, 2098 flow [2021-06-10 11:45:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:03,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:03,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:03,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:03,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:03,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:03,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,209 INFO L185 Difference]: Start difference. First operand has 948 places, 883 transitions, 2082 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:03,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 884 transitions, 2098 flow [2021-06-10 11:45:03,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 949 places, 884 transitions, 2097 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:03,218 INFO L241 Difference]: Finished difference. Result has 950 places, 883 transitions, 2086 flow [2021-06-10 11:45:03,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2081, PETRI_DIFFERENCE_MINUEND_PLACES=947, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=950, PETRI_TRANSITIONS=883} [2021-06-10 11:45:03,218 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 19 predicate places. [2021-06-10 11:45:03,218 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 883 transitions, 2086 flow [2021-06-10 11:45:03,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:03,219 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:03,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1951 [2021-06-10 11:45:03,219 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1185862004, now seen corresponding path program 1 times [2021-06-10 11:45:03,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:03,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883880979] [2021-06-10 11:45:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:03,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:03,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:03,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:45:03,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883880979] [2021-06-10 11:45:03,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:03,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:03,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635625087] [2021-06-10 11:45:03,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:03,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:03,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:03,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 883 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:03,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:03,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:03,664 INFO L129 PetriNetUnfolder]: 60/1038 cut-off events. [2021-06-10 11:45:03,664 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:03,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 1038 events. 60/1038 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4468 event pairs, 0 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1241. Up to 36 conditions per place. [2021-06-10 11:45:03,732 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/884 dead transitions. [2021-06-10 11:45:03,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 884 transitions, 2112 flow [2021-06-10 11:45:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:03,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:03,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:03,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:03,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:03,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:03,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,736 INFO L185 Difference]: Start difference. First operand has 950 places, 883 transitions, 2086 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:03,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 884 transitions, 2112 flow [2021-06-10 11:45:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 884 transitions, 2111 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:03,746 INFO L241 Difference]: Finished difference. Result has 953 places, 884 transitions, 2103 flow [2021-06-10 11:45:03,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2103, PETRI_PLACES=953, PETRI_TRANSITIONS=884} [2021-06-10 11:45:03,746 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 22 predicate places. [2021-06-10 11:45:03,746 INFO L480 AbstractCegarLoop]: Abstraction has has 953 places, 884 transitions, 2103 flow [2021-06-10 11:45:03,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:03,746 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:03,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1952 [2021-06-10 11:45:03,746 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1184908692, now seen corresponding path program 1 times [2021-06-10 11:45:03,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:03,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818999535] [2021-06-10 11:45:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:03,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:03,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:03,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:03,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:45:03,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818999535] [2021-06-10 11:45:03,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:03,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:03,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712994425] [2021-06-10 11:45:03,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:03,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:03,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:03,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 884 transitions, 2103 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:03,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:03,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:03,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:04,184 INFO L129 PetriNetUnfolder]: 60/1031 cut-off events. [2021-06-10 11:45:04,184 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:04,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1031 events. 60/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4412 event pairs, 0 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 1227. Up to 36 conditions per place. [2021-06-10 11:45:04,253 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/882 dead transitions. [2021-06-10 11:45:04,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 882 transitions, 2105 flow [2021-06-10 11:45:04,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:04,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:04,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:04,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:04,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:04,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:04,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,257 INFO L185 Difference]: Start difference. First operand has 953 places, 884 transitions, 2103 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:04,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 882 transitions, 2105 flow [2021-06-10 11:45:04,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 882 transitions, 2097 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:04,266 INFO L241 Difference]: Finished difference. Result has 953 places, 882 transitions, 2090 flow [2021-06-10 11:45:04,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=953, PETRI_TRANSITIONS=882} [2021-06-10 11:45:04,266 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 22 predicate places. [2021-06-10 11:45:04,266 INFO L480 AbstractCegarLoop]: Abstraction has has 953 places, 882 transitions, 2090 flow [2021-06-10 11:45:04,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:04,267 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:04,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1953 [2021-06-10 11:45:04,267 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1184907669, now seen corresponding path program 1 times [2021-06-10 11:45:04,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:04,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640291126] [2021-06-10 11:45:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:04,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:04,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:04,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:45:04,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640291126] [2021-06-10 11:45:04,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:04,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:04,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564397361] [2021-06-10 11:45:04,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:04,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:04,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:04,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 882 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:04,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:04,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:04,717 INFO L129 PetriNetUnfolder]: 60/1029 cut-off events. [2021-06-10 11:45:04,718 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:04,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 1029 events. 60/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4396 event pairs, 0 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1231. Up to 36 conditions per place. [2021-06-10 11:45:04,766 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/880 dead transitions. [2021-06-10 11:45:04,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 880 transitions, 2103 flow [2021-06-10 11:45:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:04,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:04,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:04,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:04,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:04,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:04,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,780 INFO L185 Difference]: Start difference. First operand has 953 places, 882 transitions, 2090 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:04,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 880 transitions, 2103 flow [2021-06-10 11:45:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 880 transitions, 2102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:04,788 INFO L241 Difference]: Finished difference. Result has 952 places, 880 transitions, 2086 flow [2021-06-10 11:45:04,789 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=952, PETRI_TRANSITIONS=880} [2021-06-10 11:45:04,789 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 21 predicate places. [2021-06-10 11:45:04,789 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 880 transitions, 2086 flow [2021-06-10 11:45:04,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:04,789 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:04,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1954 [2021-06-10 11:45:04,789 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1502665810, now seen corresponding path program 1 times [2021-06-10 11:45:04,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:04,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961715098] [2021-06-10 11:45:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:04,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:04,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:04,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:04,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:45:04,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961715098] [2021-06-10 11:45:04,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:04,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:04,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596743526] [2021-06-10 11:45:04,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:04,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:04,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:04,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:04,828 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:04,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 880 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:04,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:04,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:04,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:05,251 INFO L129 PetriNetUnfolder]: 59/1037 cut-off events. [2021-06-10 11:45:05,251 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:05,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1037 events. 59/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4466 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 1243. Up to 36 conditions per place. [2021-06-10 11:45:05,320 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/882 dead transitions. [2021-06-10 11:45:05,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 882 transitions, 2116 flow [2021-06-10 11:45:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:05,321 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:05,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:05,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:05,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:05,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:05,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,324 INFO L185 Difference]: Start difference. First operand has 952 places, 880 transitions, 2086 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:05,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 882 transitions, 2116 flow [2021-06-10 11:45:05,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 882 transitions, 2115 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:05,333 INFO L241 Difference]: Finished difference. Result has 955 places, 882 transitions, 2109 flow [2021-06-10 11:45:05,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2109, PETRI_PLACES=955, PETRI_TRANSITIONS=882} [2021-06-10 11:45:05,333 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 24 predicate places. [2021-06-10 11:45:05,333 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 882 transitions, 2109 flow [2021-06-10 11:45:05,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:05,334 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:05,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1955 [2021-06-10 11:45:05,334 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1502666833, now seen corresponding path program 1 times [2021-06-10 11:45:05,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:05,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799782967] [2021-06-10 11:45:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:05,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:05,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:05,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:45:05,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799782967] [2021-06-10 11:45:05,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:05,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:05,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381951244] [2021-06-10 11:45:05,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:05,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:05,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:05,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:05,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:05,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 882 transitions, 2109 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:05,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:05,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:05,769 INFO L129 PetriNetUnfolder]: 58/1035 cut-off events. [2021-06-10 11:45:05,769 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:05,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1035 events. 58/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4455 event pairs, 0 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1240. Up to 36 conditions per place. [2021-06-10 11:45:05,837 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/882 dead transitions. [2021-06-10 11:45:05,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 882 transitions, 2121 flow [2021-06-10 11:45:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:05,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:05,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:05,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:05,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:05,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:05,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,841 INFO L185 Difference]: Start difference. First operand has 955 places, 882 transitions, 2109 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:05,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 882 transitions, 2121 flow [2021-06-10 11:45:05,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 956 places, 882 transitions, 2116 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:05,850 INFO L241 Difference]: Finished difference. Result has 958 places, 882 transitions, 2114 flow [2021-06-10 11:45:05,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=954, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=958, PETRI_TRANSITIONS=882} [2021-06-10 11:45:05,850 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 27 predicate places. [2021-06-10 11:45:05,850 INFO L480 AbstractCegarLoop]: Abstraction has has 958 places, 882 transitions, 2114 flow [2021-06-10 11:45:05,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:05,850 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:05,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1956 [2021-06-10 11:45:05,851 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:05,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1503619122, now seen corresponding path program 1 times [2021-06-10 11:45:05,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:05,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901455723] [2021-06-10 11:45:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:05,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:05,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:05,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:05,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:45:05,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901455723] [2021-06-10 11:45:05,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:05,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:05,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031796387] [2021-06-10 11:45:05,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:05,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:05,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:05,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 882 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:05,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:05,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:05,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:06,279 INFO L129 PetriNetUnfolder]: 57/1031 cut-off events. [2021-06-10 11:45:06,279 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:06,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1031 events. 57/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4431 event pairs, 0 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 1237. Up to 36 conditions per place. [2021-06-10 11:45:06,346 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/879 dead transitions. [2021-06-10 11:45:06,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 879 transitions, 2111 flow [2021-06-10 11:45:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:06,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:06,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:06,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:06,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:06,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:06,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,351 INFO L185 Difference]: Start difference. First operand has 958 places, 882 transitions, 2114 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:06,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 879 transitions, 2111 flow [2021-06-10 11:45:06,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 879 transitions, 2104 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:06,360 INFO L241 Difference]: Finished difference. Result has 957 places, 879 transitions, 2094 flow [2021-06-10 11:45:06,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=957, PETRI_TRANSITIONS=879} [2021-06-10 11:45:06,361 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 26 predicate places. [2021-06-10 11:45:06,361 INFO L480 AbstractCegarLoop]: Abstraction has has 957 places, 879 transitions, 2094 flow [2021-06-10 11:45:06,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:06,361 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:06,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1957 [2021-06-10 11:45:06,361 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1503620145, now seen corresponding path program 1 times [2021-06-10 11:45:06,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:06,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173610403] [2021-06-10 11:45:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:06,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:06,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:06,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:45:06,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173610403] [2021-06-10 11:45:06,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:06,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:06,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367020187] [2021-06-10 11:45:06,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:06,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:06,386 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:06,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 879 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:06,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:06,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:06,800 INFO L129 PetriNetUnfolder]: 57/1029 cut-off events. [2021-06-10 11:45:06,800 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:06,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 1029 events. 57/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4413 event pairs, 0 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1238. Up to 36 conditions per place. [2021-06-10 11:45:06,846 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/877 dead transitions. [2021-06-10 11:45:06,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 877 transitions, 2107 flow [2021-06-10 11:45:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:06,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:06,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:06,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:06,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:06,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:06,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,850 INFO L185 Difference]: Start difference. First operand has 957 places, 879 transitions, 2094 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:06,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 877 transitions, 2107 flow [2021-06-10 11:45:06,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 956 places, 877 transitions, 2106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:06,858 INFO L241 Difference]: Finished difference. Result has 956 places, 877 transitions, 2090 flow [2021-06-10 11:45:06,859 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=954, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=956, PETRI_TRANSITIONS=877} [2021-06-10 11:45:06,859 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 25 predicate places. [2021-06-10 11:45:06,859 INFO L480 AbstractCegarLoop]: Abstraction has has 956 places, 877 transitions, 2090 flow [2021-06-10 11:45:06,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:06,859 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:06,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1958 [2021-06-10 11:45:06,859 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash -280203409, now seen corresponding path program 1 times [2021-06-10 11:45:06,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:06,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712859556] [2021-06-10 11:45:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:06,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:06,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:06,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:06,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:45:06,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712859556] [2021-06-10 11:45:06,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:06,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:06,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140949550] [2021-06-10 11:45:06,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:06,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:06,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:06,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 877 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:06,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:06,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:06,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:07,341 INFO L129 PetriNetUnfolder]: 56/1037 cut-off events. [2021-06-10 11:45:07,341 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:07,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1037 events. 56/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4484 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1250. Up to 36 conditions per place. [2021-06-10 11:45:07,412 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/879 dead transitions. [2021-06-10 11:45:07,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 879 transitions, 2120 flow [2021-06-10 11:45:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:07,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:07,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:07,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:07,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:07,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:07,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,417 INFO L185 Difference]: Start difference. First operand has 956 places, 877 transitions, 2090 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:07,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 879 transitions, 2120 flow [2021-06-10 11:45:07,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 879 transitions, 2119 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:07,426 INFO L241 Difference]: Finished difference. Result has 959 places, 879 transitions, 2113 flow [2021-06-10 11:45:07,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2113, PETRI_PLACES=959, PETRI_TRANSITIONS=879} [2021-06-10 11:45:07,427 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 28 predicate places. [2021-06-10 11:45:07,427 INFO L480 AbstractCegarLoop]: Abstraction has has 959 places, 879 transitions, 2113 flow [2021-06-10 11:45:07,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:07,427 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:07,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1959 [2021-06-10 11:45:07,427 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -280204432, now seen corresponding path program 1 times [2021-06-10 11:45:07,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:07,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847492627] [2021-06-10 11:45:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:07,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:07,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:07,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:45:07,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847492627] [2021-06-10 11:45:07,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:07,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:07,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968865292] [2021-06-10 11:45:07,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:07,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:07,452 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:07,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 879 transitions, 2113 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:07,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:07,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:07,861 INFO L129 PetriNetUnfolder]: 54/1038 cut-off events. [2021-06-10 11:45:07,861 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:07,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1038 events. 54/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4505 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1250. Up to 36 conditions per place. [2021-06-10 11:45:07,928 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/879 dead transitions. [2021-06-10 11:45:07,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 879 transitions, 2125 flow [2021-06-10 11:45:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:07,930 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:07,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:07,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:07,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:07,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:07,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,933 INFO L185 Difference]: Start difference. First operand has 959 places, 879 transitions, 2113 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 879 transitions, 2125 flow [2021-06-10 11:45:07,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 879 transitions, 2120 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:07,942 INFO L241 Difference]: Finished difference. Result has 961 places, 878 transitions, 2109 flow [2021-06-10 11:45:07,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2109, PETRI_PLACES=961, PETRI_TRANSITIONS=878} [2021-06-10 11:45:07,942 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 30 predicate places. [2021-06-10 11:45:07,942 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 878 transitions, 2109 flow [2021-06-10 11:45:07,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,942 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:07,942 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:07,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1960 [2021-06-10 11:45:07,943 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash -281156721, now seen corresponding path program 1 times [2021-06-10 11:45:07,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:07,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77206495] [2021-06-10 11:45:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:07,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:07,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:07,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:07,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:45:07,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77206495] [2021-06-10 11:45:07,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:07,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:07,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900098537] [2021-06-10 11:45:07,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:07,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:07,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:07,966 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:07,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 878 transitions, 2109 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:07,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:07,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:07,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:08,373 INFO L129 PetriNetUnfolder]: 54/1031 cut-off events. [2021-06-10 11:45:08,373 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:08,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 1031 events. 54/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4447 event pairs, 0 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 1244. Up to 36 conditions per place. [2021-06-10 11:45:08,439 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/876 dead transitions. [2021-06-10 11:45:08,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 876 transitions, 2112 flow [2021-06-10 11:45:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:08,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:08,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:08,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:08,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:08,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:08,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,444 INFO L185 Difference]: Start difference. First operand has 961 places, 878 transitions, 2109 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:08,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 876 transitions, 2112 flow [2021-06-10 11:45:08,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 876 transitions, 2105 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:08,452 INFO L241 Difference]: Finished difference. Result has 961 places, 876 transitions, 2098 flow [2021-06-10 11:45:08,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=961, PETRI_TRANSITIONS=876} [2021-06-10 11:45:08,453 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 30 predicate places. [2021-06-10 11:45:08,453 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 876 transitions, 2098 flow [2021-06-10 11:45:08,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:08,453 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:08,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1961 [2021-06-10 11:45:08,453 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash -281157744, now seen corresponding path program 1 times [2021-06-10 11:45:08,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:08,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914502810] [2021-06-10 11:45:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:08,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:08,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:08,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:45:08,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914502810] [2021-06-10 11:45:08,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:08,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:08,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128739477] [2021-06-10 11:45:08,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:08,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:08,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:08,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 876 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:08,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:08,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:08,896 INFO L129 PetriNetUnfolder]: 54/1029 cut-off events. [2021-06-10 11:45:08,896 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:08,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 1029 events. 54/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4431 event pairs, 0 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1244. Up to 36 conditions per place. [2021-06-10 11:45:08,941 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/874 dead transitions. [2021-06-10 11:45:08,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 874 transitions, 2111 flow [2021-06-10 11:45:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:08,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:08,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:08,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:08,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:08,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:08,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,946 INFO L185 Difference]: Start difference. First operand has 961 places, 876 transitions, 2098 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:08,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 874 transitions, 2111 flow [2021-06-10 11:45:08,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 874 transitions, 2110 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:08,954 INFO L241 Difference]: Finished difference. Result has 960 places, 874 transitions, 2094 flow [2021-06-10 11:45:08,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=960, PETRI_TRANSITIONS=874} [2021-06-10 11:45:08,954 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 29 predicate places. [2021-06-10 11:45:08,954 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 874 transitions, 2094 flow [2021-06-10 11:45:08,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:08,954 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:08,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1962 [2021-06-10 11:45:08,955 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 378981583, now seen corresponding path program 1 times [2021-06-10 11:45:08,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:08,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441549495] [2021-06-10 11:45:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:08,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:08,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:08,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:08,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:45:08,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441549495] [2021-06-10 11:45:08,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:08,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:08,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096484415] [2021-06-10 11:45:08,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:08,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:08,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:08,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 874 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:08,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:08,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:08,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:09,415 INFO L129 PetriNetUnfolder]: 53/1037 cut-off events. [2021-06-10 11:45:09,415 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:09,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1037 events. 53/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4502 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1256. Up to 36 conditions per place. [2021-06-10 11:45:09,483 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/876 dead transitions. [2021-06-10 11:45:09,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 876 transitions, 2124 flow [2021-06-10 11:45:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:09,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:09,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:09,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:09,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:09,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:09,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:09,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:09,488 INFO L185 Difference]: Start difference. First operand has 960 places, 874 transitions, 2094 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:09,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 876 transitions, 2124 flow [2021-06-10 11:45:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 876 transitions, 2123 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:09,497 INFO L241 Difference]: Finished difference. Result has 963 places, 876 transitions, 2117 flow [2021-06-10 11:45:09,497 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2117, PETRI_PLACES=963, PETRI_TRANSITIONS=876} [2021-06-10 11:45:09,497 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 32 predicate places. [2021-06-10 11:45:09,497 INFO L480 AbstractCegarLoop]: Abstraction has has 963 places, 876 transitions, 2117 flow [2021-06-10 11:45:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:09,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:09,497 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:09,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1963 [2021-06-10 11:45:09,498 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 378982606, now seen corresponding path program 1 times [2021-06-10 11:45:09,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:09,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177619404] [2021-06-10 11:45:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:09,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:09,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:09,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:09,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:09,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:09,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:45:09,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177619404] [2021-06-10 11:45:09,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:09,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:09,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976319732] [2021-06-10 11:45:09,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:09,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:09,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:09,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 963 places, 876 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:09,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:09,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:09,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:09,931 INFO L129 PetriNetUnfolder]: 52/1035 cut-off events. [2021-06-10 11:45:09,931 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:09,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1035 events. 52/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4490 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1253. Up to 36 conditions per place. [2021-06-10 11:45:09,999 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/876 dead transitions. [2021-06-10 11:45:09,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 876 transitions, 2129 flow [2021-06-10 11:45:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:10,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:10,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:10,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:10,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:10,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,003 INFO L185 Difference]: Start difference. First operand has 963 places, 876 transitions, 2117 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:10,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 876 transitions, 2129 flow [2021-06-10 11:45:10,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 876 transitions, 2124 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:10,013 INFO L241 Difference]: Finished difference. Result has 966 places, 876 transitions, 2122 flow [2021-06-10 11:45:10,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=966, PETRI_TRANSITIONS=876} [2021-06-10 11:45:10,013 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 35 predicate places. [2021-06-10 11:45:10,013 INFO L480 AbstractCegarLoop]: Abstraction has has 966 places, 876 transitions, 2122 flow [2021-06-10 11:45:10,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:10,013 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:10,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1964 [2021-06-10 11:45:10,013 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 379934895, now seen corresponding path program 1 times [2021-06-10 11:45:10,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:10,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475192531] [2021-06-10 11:45:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:10,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:10,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:10,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:45:10,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475192531] [2021-06-10 11:45:10,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:10,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:10,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036220964] [2021-06-10 11:45:10,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:10,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:10,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:10,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:10,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:10,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 876 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:10,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:10,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:10,444 INFO L129 PetriNetUnfolder]: 51/1031 cut-off events. [2021-06-10 11:45:10,444 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:10,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 1031 events. 51/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4467 event pairs, 0 based on Foata normal form. 1/947 useless extension candidates. Maximal degree in co-relation 1250. Up to 36 conditions per place. [2021-06-10 11:45:10,509 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/873 dead transitions. [2021-06-10 11:45:10,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 873 transitions, 2119 flow [2021-06-10 11:45:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:10,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:10,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:10,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:10,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:10,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:10,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,513 INFO L185 Difference]: Start difference. First operand has 966 places, 876 transitions, 2122 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:10,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 873 transitions, 2119 flow [2021-06-10 11:45:10,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 873 transitions, 2112 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:10,522 INFO L241 Difference]: Finished difference. Result has 965 places, 873 transitions, 2102 flow [2021-06-10 11:45:10,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=963, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=965, PETRI_TRANSITIONS=873} [2021-06-10 11:45:10,522 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 34 predicate places. [2021-06-10 11:45:10,522 INFO L480 AbstractCegarLoop]: Abstraction has has 965 places, 873 transitions, 2102 flow [2021-06-10 11:45:10,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:10,523 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:10,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1965 [2021-06-10 11:45:10,523 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 379935918, now seen corresponding path program 1 times [2021-06-10 11:45:10,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:10,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029988072] [2021-06-10 11:45:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:10,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:10,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:10,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:10,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:45:10,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029988072] [2021-06-10 11:45:10,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:10,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:10,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627043318] [2021-06-10 11:45:10,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:10,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:10,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:10,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 965 places, 873 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:10,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:10,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:10,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:10,950 INFO L129 PetriNetUnfolder]: 51/1029 cut-off events. [2021-06-10 11:45:10,950 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:10,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1029 events. 51/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4449 event pairs, 0 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1251. Up to 36 conditions per place. [2021-06-10 11:45:10,999 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/871 dead transitions. [2021-06-10 11:45:11,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 871 transitions, 2115 flow [2021-06-10 11:45:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:11,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:11,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:11,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:11,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:11,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:11,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,004 INFO L185 Difference]: Start difference. First operand has 965 places, 873 transitions, 2102 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:11,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 871 transitions, 2115 flow [2021-06-10 11:45:11,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 871 transitions, 2114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:11,013 INFO L241 Difference]: Finished difference. Result has 964 places, 871 transitions, 2098 flow [2021-06-10 11:45:11,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=964, PETRI_TRANSITIONS=871} [2021-06-10 11:45:11,013 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 33 predicate places. [2021-06-10 11:45:11,013 INFO L480 AbstractCegarLoop]: Abstraction has has 964 places, 871 transitions, 2098 flow [2021-06-10 11:45:11,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:11,013 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:11,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1966 [2021-06-10 11:45:11,014 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1712498034, now seen corresponding path program 1 times [2021-06-10 11:45:11,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:11,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439116678] [2021-06-10 11:45:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:11,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:11,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:11,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:45:11,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439116678] [2021-06-10 11:45:11,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:11,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:11,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648331920] [2021-06-10 11:45:11,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:11,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:11,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:11,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 871 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:11,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:11,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:11,460 INFO L129 PetriNetUnfolder]: 49/1034 cut-off events. [2021-06-10 11:45:11,461 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:11,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1034 events. 49/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4498 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1254. Up to 36 conditions per place. [2021-06-10 11:45:11,527 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/872 dead transitions. [2021-06-10 11:45:11,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 966 places, 872 transitions, 2114 flow [2021-06-10 11:45:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:11,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:11,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:11,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:11,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:11,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:11,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,531 INFO L185 Difference]: Start difference. First operand has 964 places, 871 transitions, 2098 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:11,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 966 places, 872 transitions, 2114 flow [2021-06-10 11:45:11,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 872 transitions, 2113 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:11,540 INFO L241 Difference]: Finished difference. Result has 967 places, 872 transitions, 2111 flow [2021-06-10 11:45:11,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=963, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=967, PETRI_TRANSITIONS=872} [2021-06-10 11:45:11,540 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 36 predicate places. [2021-06-10 11:45:11,540 INFO L480 AbstractCegarLoop]: Abstraction has has 967 places, 872 transitions, 2111 flow [2021-06-10 11:45:11,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,541 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:11,541 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:11,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1967 [2021-06-10 11:45:11,541 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1712499057, now seen corresponding path program 1 times [2021-06-10 11:45:11,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:11,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342251317] [2021-06-10 11:45:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:11,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:11,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:11,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:11,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:45:11,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342251317] [2021-06-10 11:45:11,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:11,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:11,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403602737] [2021-06-10 11:45:11,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:11,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:11,565 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:11,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 872 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:11,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:11,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:11,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:11,994 INFO L129 PetriNetUnfolder]: 49/1035 cut-off events. [2021-06-10 11:45:11,994 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:12,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1035 events. 49/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4508 event pairs, 0 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1262. Up to 36 conditions per place. [2021-06-10 11:45:12,063 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/873 dead transitions. [2021-06-10 11:45:12,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 873 transitions, 2137 flow [2021-06-10 11:45:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:12,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:12,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:12,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:12,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:12,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:12,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,068 INFO L185 Difference]: Start difference. First operand has 967 places, 872 transitions, 2111 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:12,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 873 transitions, 2137 flow [2021-06-10 11:45:12,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 873 transitions, 2135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:12,078 INFO L241 Difference]: Finished difference. Result has 970 places, 873 transitions, 2127 flow [2021-06-10 11:45:12,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=970, PETRI_TRANSITIONS=873} [2021-06-10 11:45:12,078 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 39 predicate places. [2021-06-10 11:45:12,078 INFO L480 AbstractCegarLoop]: Abstraction has has 970 places, 873 transitions, 2127 flow [2021-06-10 11:45:12,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:12,079 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:12,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1968 [2021-06-10 11:45:12,079 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1711545745, now seen corresponding path program 1 times [2021-06-10 11:45:12,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:12,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789040251] [2021-06-10 11:45:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:12,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:12,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:12,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:45:12,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789040251] [2021-06-10 11:45:12,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:12,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:12,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858269004] [2021-06-10 11:45:12,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:12,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:12,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:12,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 873 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:12,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:12,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:12,536 INFO L129 PetriNetUnfolder]: 48/1031 cut-off events. [2021-06-10 11:45:12,536 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:12,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1031 events. 48/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4482 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1255. Up to 36 conditions per place. [2021-06-10 11:45:12,602 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/870 dead transitions. [2021-06-10 11:45:12,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 870 transitions, 2124 flow [2021-06-10 11:45:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:12,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:12,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:12,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:12,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:12,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:12,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,607 INFO L185 Difference]: Start difference. First operand has 970 places, 873 transitions, 2127 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:12,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 870 transitions, 2124 flow [2021-06-10 11:45:12,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 870 transitions, 2116 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:12,616 INFO L241 Difference]: Finished difference. Result has 969 places, 870 transitions, 2106 flow [2021-06-10 11:45:12,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=969, PETRI_TRANSITIONS=870} [2021-06-10 11:45:12,616 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 38 predicate places. [2021-06-10 11:45:12,617 INFO L480 AbstractCegarLoop]: Abstraction has has 969 places, 870 transitions, 2106 flow [2021-06-10 11:45:12,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:12,617 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:12,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1969 [2021-06-10 11:45:12,617 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1711544722, now seen corresponding path program 1 times [2021-06-10 11:45:12,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:12,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441413564] [2021-06-10 11:45:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:12,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:12,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:12,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:12,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:45:12,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441413564] [2021-06-10 11:45:12,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:12,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:12,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689538743] [2021-06-10 11:45:12,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:12,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:12,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:12,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 870 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:12,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:12,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:12,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:13,054 INFO L129 PetriNetUnfolder]: 48/1029 cut-off events. [2021-06-10 11:45:13,055 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:13,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1029 events. 48/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4466 event pairs, 0 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 1258. Up to 36 conditions per place. [2021-06-10 11:45:13,103 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/868 dead transitions. [2021-06-10 11:45:13,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 868 transitions, 2119 flow [2021-06-10 11:45:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:13,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:13,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:13,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:13,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:13,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:13,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,107 INFO L185 Difference]: Start difference. First operand has 969 places, 870 transitions, 2106 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 868 transitions, 2119 flow [2021-06-10 11:45:13,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 868 transitions, 2118 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:13,115 INFO L241 Difference]: Finished difference. Result has 968 places, 868 transitions, 2102 flow [2021-06-10 11:45:13,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=968, PETRI_TRANSITIONS=868} [2021-06-10 11:45:13,116 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 37 predicate places. [2021-06-10 11:45:13,116 INFO L480 AbstractCegarLoop]: Abstraction has has 968 places, 868 transitions, 2102 flow [2021-06-10 11:45:13,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,116 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:13,116 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:13,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1970 [2021-06-10 11:45:13,116 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2103228624, now seen corresponding path program 1 times [2021-06-10 11:45:13,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:13,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265585140] [2021-06-10 11:45:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:13,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:13,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:13,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:45:13,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265585140] [2021-06-10 11:45:13,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:13,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:13,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196443822] [2021-06-10 11:45:13,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:13,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:13,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:13,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 868 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:13,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:13,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:13,569 INFO L129 PetriNetUnfolder]: 47/1036 cut-off events. [2021-06-10 11:45:13,569 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:13,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1036 events. 47/1036 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4527 event pairs, 0 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 1263. Up to 36 conditions per place. [2021-06-10 11:45:13,636 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/869 dead transitions. [2021-06-10 11:45:13,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 869 transitions, 2118 flow [2021-06-10 11:45:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:13,637 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:13,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:13,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:13,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:13,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:13,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,640 INFO L185 Difference]: Start difference. First operand has 968 places, 868 transitions, 2102 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 869 transitions, 2118 flow [2021-06-10 11:45:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 869 transitions, 2117 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:13,650 INFO L241 Difference]: Finished difference. Result has 970 places, 868 transitions, 2106 flow [2021-06-10 11:45:13,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=970, PETRI_TRANSITIONS=868} [2021-06-10 11:45:13,650 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 39 predicate places. [2021-06-10 11:45:13,650 INFO L480 AbstractCegarLoop]: Abstraction has has 970 places, 868 transitions, 2106 flow [2021-06-10 11:45:13,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:13,650 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:13,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1971 [2021-06-10 11:45:13,651 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2103227601, now seen corresponding path program 1 times [2021-06-10 11:45:13,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:13,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288447665] [2021-06-10 11:45:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:13,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:13,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:13,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:13,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:45:13,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288447665] [2021-06-10 11:45:13,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:13,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:13,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43175137] [2021-06-10 11:45:13,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:13,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:13,677 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:13,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 868 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:13,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:13,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:13,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:14,128 INFO L129 PetriNetUnfolder]: 45/1038 cut-off events. [2021-06-10 11:45:14,128 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:14,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1038 events. 45/1038 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4558 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1274. Up to 36 conditions per place. [2021-06-10 11:45:14,196 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/869 dead transitions. [2021-06-10 11:45:14,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 869 transitions, 2132 flow [2021-06-10 11:45:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:14,198 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:14,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:14,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:14,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:14,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:14,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,200 INFO L185 Difference]: Start difference. First operand has 970 places, 868 transitions, 2106 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 869 transitions, 2132 flow [2021-06-10 11:45:14,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 869 transitions, 2131 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:14,210 INFO L241 Difference]: Finished difference. Result has 973 places, 869 transitions, 2123 flow [2021-06-10 11:45:14,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=973, PETRI_TRANSITIONS=869} [2021-06-10 11:45:14,210 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 42 predicate places. [2021-06-10 11:45:14,210 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 869 transitions, 2123 flow [2021-06-10 11:45:14,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:14,210 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:14,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1972 [2021-06-10 11:45:14,211 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2104180913, now seen corresponding path program 1 times [2021-06-10 11:45:14,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:14,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101520167] [2021-06-10 11:45:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:14,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:14,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:14,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:45:14,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101520167] [2021-06-10 11:45:14,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:14,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:14,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24100653] [2021-06-10 11:45:14,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:14,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:14,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:14,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 869 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:14,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:14,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:14,680 INFO L129 PetriNetUnfolder]: 45/1031 cut-off events. [2021-06-10 11:45:14,680 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:14,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1031 events. 45/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4502 event pairs, 0 based on Foata normal form. 1/953 useless extension candidates. Maximal degree in co-relation 1260. Up to 36 conditions per place. [2021-06-10 11:45:14,747 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/867 dead transitions. [2021-06-10 11:45:14,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 867 transitions, 2125 flow [2021-06-10 11:45:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:14,749 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:14,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:14,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:14,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:14,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:14,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,751 INFO L185 Difference]: Start difference. First operand has 973 places, 869 transitions, 2123 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:14,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 867 transitions, 2125 flow [2021-06-10 11:45:14,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 867 transitions, 2117 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:14,761 INFO L241 Difference]: Finished difference. Result has 973 places, 867 transitions, 2110 flow [2021-06-10 11:45:14,761 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=973, PETRI_TRANSITIONS=867} [2021-06-10 11:45:14,761 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 42 predicate places. [2021-06-10 11:45:14,761 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 867 transitions, 2110 flow [2021-06-10 11:45:14,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:14,761 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:14,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1973 [2021-06-10 11:45:14,762 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2104181936, now seen corresponding path program 1 times [2021-06-10 11:45:14,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:14,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205279461] [2021-06-10 11:45:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:14,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:14,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:14,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:14,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:45:14,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205279461] [2021-06-10 11:45:14,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:14,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:14,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363213628] [2021-06-10 11:45:14,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:14,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:14,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:14,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 867 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:14,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:14,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:14,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:15,202 INFO L129 PetriNetUnfolder]: 45/1029 cut-off events. [2021-06-10 11:45:15,203 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:15,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1029 events. 45/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4484 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1264. Up to 36 conditions per place. [2021-06-10 11:45:15,254 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/865 dead transitions. [2021-06-10 11:45:15,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 973 places, 865 transitions, 2123 flow [2021-06-10 11:45:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:15,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:15,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:15,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:15,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:15,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:15,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,258 INFO L185 Difference]: Start difference. First operand has 973 places, 867 transitions, 2110 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:15,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 973 places, 865 transitions, 2123 flow [2021-06-10 11:45:15,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 865 transitions, 2122 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:15,267 INFO L241 Difference]: Finished difference. Result has 972 places, 865 transitions, 2106 flow [2021-06-10 11:45:15,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=972, PETRI_TRANSITIONS=865} [2021-06-10 11:45:15,267 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 41 predicate places. [2021-06-10 11:45:15,267 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 865 transitions, 2106 flow [2021-06-10 11:45:15,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:15,268 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:15,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1974 [2021-06-10 11:45:15,268 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2022660465, now seen corresponding path program 1 times [2021-06-10 11:45:15,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:15,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592494695] [2021-06-10 11:45:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:15,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:15,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:15,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:45:15,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592494695] [2021-06-10 11:45:15,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:15,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:15,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769034082] [2021-06-10 11:45:15,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:15,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:15,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:15,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 865 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:15,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:15,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:15,737 INFO L129 PetriNetUnfolder]: 44/1037 cut-off events. [2021-06-10 11:45:15,738 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:15,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1037 events. 44/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4555 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1276. Up to 36 conditions per place. [2021-06-10 11:45:15,804 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/867 dead transitions. [2021-06-10 11:45:15,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 867 transitions, 2136 flow [2021-06-10 11:45:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:15,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:15,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:15,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:15,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:15,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:15,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,812 INFO L185 Difference]: Start difference. First operand has 972 places, 865 transitions, 2106 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 867 transitions, 2136 flow [2021-06-10 11:45:15,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 867 transitions, 2135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:15,821 INFO L241 Difference]: Finished difference. Result has 975 places, 867 transitions, 2129 flow [2021-06-10 11:45:15,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2129, PETRI_PLACES=975, PETRI_TRANSITIONS=867} [2021-06-10 11:45:15,821 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 44 predicate places. [2021-06-10 11:45:15,821 INFO L480 AbstractCegarLoop]: Abstraction has has 975 places, 867 transitions, 2129 flow [2021-06-10 11:45:15,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:15,822 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:15,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1975 [2021-06-10 11:45:15,822 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2022659442, now seen corresponding path program 1 times [2021-06-10 11:45:15,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:15,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723253655] [2021-06-10 11:45:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:15,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:15,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:15,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:15,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:45:15,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723253655] [2021-06-10 11:45:15,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:15,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:15,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633272025] [2021-06-10 11:45:15,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:15,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:15,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:15,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 867 transitions, 2129 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:15,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:15,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:15,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:16,282 INFO L129 PetriNetUnfolder]: 42/1038 cut-off events. [2021-06-10 11:45:16,282 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:16,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1038 events. 42/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4576 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1276. Up to 36 conditions per place. [2021-06-10 11:45:16,350 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/867 dead transitions. [2021-06-10 11:45:16,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 867 transitions, 2141 flow [2021-06-10 11:45:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:16,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:16,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:16,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:16,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:16,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,354 INFO L185 Difference]: Start difference. First operand has 975 places, 867 transitions, 2129 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:16,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 867 transitions, 2141 flow [2021-06-10 11:45:16,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 867 transitions, 2136 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:16,364 INFO L241 Difference]: Finished difference. Result has 977 places, 866 transitions, 2125 flow [2021-06-10 11:45:16,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2125, PETRI_PLACES=977, PETRI_TRANSITIONS=866} [2021-06-10 11:45:16,364 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 46 predicate places. [2021-06-10 11:45:16,364 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 866 transitions, 2125 flow [2021-06-10 11:45:16,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:16,364 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:16,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1976 [2021-06-10 11:45:16,365 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2021707153, now seen corresponding path program 1 times [2021-06-10 11:45:16,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:16,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758951059] [2021-06-10 11:45:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:16,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:16,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:16,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:45:16,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758951059] [2021-06-10 11:45:16,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:16,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:16,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637977649] [2021-06-10 11:45:16,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:16,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:16,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:16,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:16,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 866 transitions, 2125 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:16,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:16,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:16,819 INFO L129 PetriNetUnfolder]: 42/1031 cut-off events. [2021-06-10 11:45:16,819 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:16,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 1031 events. 42/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4518 event pairs, 0 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 1270. Up to 36 conditions per place. [2021-06-10 11:45:16,886 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/864 dead transitions. [2021-06-10 11:45:16,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 864 transitions, 2128 flow [2021-06-10 11:45:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:16,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:16,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:16,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:16,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:16,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:16,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,891 INFO L185 Difference]: Start difference. First operand has 977 places, 866 transitions, 2125 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:16,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 864 transitions, 2128 flow [2021-06-10 11:45:16,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 864 transitions, 2121 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:16,900 INFO L241 Difference]: Finished difference. Result has 977 places, 864 transitions, 2114 flow [2021-06-10 11:45:16,900 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=977, PETRI_TRANSITIONS=864} [2021-06-10 11:45:16,900 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 46 predicate places. [2021-06-10 11:45:16,900 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 864 transitions, 2114 flow [2021-06-10 11:45:16,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:16,901 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:16,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1977 [2021-06-10 11:45:16,901 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2021706130, now seen corresponding path program 1 times [2021-06-10 11:45:16,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:16,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687296822] [2021-06-10 11:45:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:16,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:16,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:16,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:16,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:45:16,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687296822] [2021-06-10 11:45:16,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:16,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:16,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95534149] [2021-06-10 11:45:16,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:16,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:16,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:16,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 864 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:16,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:16,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:16,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:17,340 INFO L129 PetriNetUnfolder]: 42/1029 cut-off events. [2021-06-10 11:45:17,341 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:17,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1029 events. 42/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4502 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1270. Up to 36 conditions per place. [2021-06-10 11:45:17,398 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/862 dead transitions. [2021-06-10 11:45:17,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 862 transitions, 2127 flow [2021-06-10 11:45:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:17,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:17,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:17,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:17,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:17,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:17,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,403 INFO L185 Difference]: Start difference. First operand has 977 places, 864 transitions, 2114 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:17,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 862 transitions, 2127 flow [2021-06-10 11:45:17,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 862 transitions, 2126 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:17,411 INFO L241 Difference]: Finished difference. Result has 976 places, 862 transitions, 2110 flow [2021-06-10 11:45:17,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=861, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=976, PETRI_TRANSITIONS=862} [2021-06-10 11:45:17,412 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 45 predicate places. [2021-06-10 11:45:17,412 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 862 transitions, 2110 flow [2021-06-10 11:45:17,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:17,412 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:17,412 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1978 [2021-06-10 11:45:17,412 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1803783723, now seen corresponding path program 1 times [2021-06-10 11:45:17,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:17,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195075407] [2021-06-10 11:45:17,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:17,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:17,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:17,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:17,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:17,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:17,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:45:17,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195075407] [2021-06-10 11:45:17,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:17,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:17,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076097446] [2021-06-10 11:45:17,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:17,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:17,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:17,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 862 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:17,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:17,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:17,896 INFO L129 PetriNetUnfolder]: 41/1037 cut-off events. [2021-06-10 11:45:17,896 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:17,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1037 events. 41/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4572 event pairs, 0 based on Foata normal form. 0/960 useless extension candidates. Maximal degree in co-relation 1282. Up to 36 conditions per place. [2021-06-10 11:45:17,969 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/864 dead transitions. [2021-06-10 11:45:17,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 864 transitions, 2140 flow [2021-06-10 11:45:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:17,971 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:17,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:17,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:17,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:17,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:17,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,974 INFO L185 Difference]: Start difference. First operand has 976 places, 862 transitions, 2110 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:17,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 864 transitions, 2140 flow [2021-06-10 11:45:17,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 864 transitions, 2139 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:17,984 INFO L241 Difference]: Finished difference. Result has 979 places, 864 transitions, 2133 flow [2021-06-10 11:45:17,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2133, PETRI_PLACES=979, PETRI_TRANSITIONS=864} [2021-06-10 11:45:17,984 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 48 predicate places. [2021-06-10 11:45:17,984 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 864 transitions, 2133 flow [2021-06-10 11:45:17,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:17,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:17,984 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:17,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1979 [2021-06-10 11:45:17,985 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1803782700, now seen corresponding path program 1 times [2021-06-10 11:45:17,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:17,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421459437] [2021-06-10 11:45:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:18,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:18,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:18,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:45:18,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421459437] [2021-06-10 11:45:18,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:18,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:18,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538941621] [2021-06-10 11:45:18,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:18,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:18,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:18,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:18,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 864 transitions, 2133 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:18,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:18,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:18,444 INFO L129 PetriNetUnfolder]: 40/1035 cut-off events. [2021-06-10 11:45:18,444 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:18,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1035 events. 40/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4562 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1279. Up to 36 conditions per place. [2021-06-10 11:45:18,511 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/864 dead transitions. [2021-06-10 11:45:18,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 864 transitions, 2145 flow [2021-06-10 11:45:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:18,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:18,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:18,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:18,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:18,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:18,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,516 INFO L185 Difference]: Start difference. First operand has 979 places, 864 transitions, 2133 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 864 transitions, 2145 flow [2021-06-10 11:45:18,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 864 transitions, 2140 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:18,525 INFO L241 Difference]: Finished difference. Result has 982 places, 864 transitions, 2138 flow [2021-06-10 11:45:18,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=861, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=982, PETRI_TRANSITIONS=864} [2021-06-10 11:45:18,526 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 51 predicate places. [2021-06-10 11:45:18,526 INFO L480 AbstractCegarLoop]: Abstraction has has 982 places, 864 transitions, 2138 flow [2021-06-10 11:45:18,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:18,526 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:18,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1980 [2021-06-10 11:45:18,526 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1802830411, now seen corresponding path program 1 times [2021-06-10 11:45:18,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:18,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876517570] [2021-06-10 11:45:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:18,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:18,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:18,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:18,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:45:18,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876517570] [2021-06-10 11:45:18,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:18,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:18,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822716349] [2021-06-10 11:45:18,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:18,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:18,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:18,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 864 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:18,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:18,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:18,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:18,989 INFO L129 PetriNetUnfolder]: 39/1031 cut-off events. [2021-06-10 11:45:18,989 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:19,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1031 events. 39/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4539 event pairs, 0 based on Foata normal form. 1/959 useless extension candidates. Maximal degree in co-relation 1276. Up to 36 conditions per place. [2021-06-10 11:45:19,055 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/861 dead transitions. [2021-06-10 11:45:19,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 861 transitions, 2135 flow [2021-06-10 11:45:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:19,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:19,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:19,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:19,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:19,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:19,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,059 INFO L185 Difference]: Start difference. First operand has 982 places, 864 transitions, 2138 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:19,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 861 transitions, 2135 flow [2021-06-10 11:45:19,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 861 transitions, 2128 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:19,069 INFO L241 Difference]: Finished difference. Result has 981 places, 861 transitions, 2118 flow [2021-06-10 11:45:19,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=981, PETRI_TRANSITIONS=861} [2021-06-10 11:45:19,069 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 50 predicate places. [2021-06-10 11:45:19,070 INFO L480 AbstractCegarLoop]: Abstraction has has 981 places, 861 transitions, 2118 flow [2021-06-10 11:45:19,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:19,070 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:19,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1981 [2021-06-10 11:45:19,070 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1802829388, now seen corresponding path program 1 times [2021-06-10 11:45:19,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:19,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751874675] [2021-06-10 11:45:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:19,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:19,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:19,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:45:19,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751874675] [2021-06-10 11:45:19,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:19,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:19,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825588492] [2021-06-10 11:45:19,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:19,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:19,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:19,102 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:19,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 861 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:19,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:19,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:19,528 INFO L129 PetriNetUnfolder]: 39/1029 cut-off events. [2021-06-10 11:45:19,528 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:19,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 1029 events. 39/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4524 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1277. Up to 36 conditions per place. [2021-06-10 11:45:19,586 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/859 dead transitions. [2021-06-10 11:45:19,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 859 transitions, 2131 flow [2021-06-10 11:45:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:19,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:19,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:19,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:19,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:19,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:19,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,590 INFO L185 Difference]: Start difference. First operand has 981 places, 861 transitions, 2118 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:19,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 859 transitions, 2131 flow [2021-06-10 11:45:19,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 859 transitions, 2130 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:19,599 INFO L241 Difference]: Finished difference. Result has 980 places, 859 transitions, 2114 flow [2021-06-10 11:45:19,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=980, PETRI_TRANSITIONS=859} [2021-06-10 11:45:19,600 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 49 predicate places. [2021-06-10 11:45:19,600 INFO L480 AbstractCegarLoop]: Abstraction has has 980 places, 859 transitions, 2114 flow [2021-06-10 11:45:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:19,600 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:19,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1982 [2021-06-10 11:45:19,600 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash 523807896, now seen corresponding path program 1 times [2021-06-10 11:45:19,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:19,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936531372] [2021-06-10 11:45:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:19,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:19,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:19,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:19,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:45:19,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936531372] [2021-06-10 11:45:19,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:19,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:19,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008867593] [2021-06-10 11:45:19,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:19,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:19,627 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:19,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 859 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:19,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:19,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:19,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:20,043 INFO L129 PetriNetUnfolder]: 37/1034 cut-off events. [2021-06-10 11:45:20,044 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:20,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1034 events. 37/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4573 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1280. Up to 36 conditions per place. [2021-06-10 11:45:20,111 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/860 dead transitions. [2021-06-10 11:45:20,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 860 transitions, 2130 flow [2021-06-10 11:45:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:20,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:20,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:20,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:20,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:20,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:20,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,116 INFO L185 Difference]: Start difference. First operand has 980 places, 859 transitions, 2114 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:20,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 860 transitions, 2130 flow [2021-06-10 11:45:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 860 transitions, 2129 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:20,124 INFO L241 Difference]: Finished difference. Result has 983 places, 860 transitions, 2127 flow [2021-06-10 11:45:20,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=983, PETRI_TRANSITIONS=860} [2021-06-10 11:45:20,125 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 52 predicate places. [2021-06-10 11:45:20,125 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 860 transitions, 2127 flow [2021-06-10 11:45:20,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:20,125 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:20,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1983 [2021-06-10 11:45:20,125 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 523806873, now seen corresponding path program 1 times [2021-06-10 11:45:20,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:20,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631849741] [2021-06-10 11:45:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:20,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:20,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:20,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:45:20,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631849741] [2021-06-10 11:45:20,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:20,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:20,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076209291] [2021-06-10 11:45:20,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:20,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:20,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:20,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 860 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:20,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:20,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:20,600 INFO L129 PetriNetUnfolder]: 37/1035 cut-off events. [2021-06-10 11:45:20,600 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:20,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1035 events. 37/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4579 event pairs, 0 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 1288. Up to 36 conditions per place. [2021-06-10 11:45:20,665 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/861 dead transitions. [2021-06-10 11:45:20,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 861 transitions, 2153 flow [2021-06-10 11:45:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:20,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:20,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:20,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:20,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:20,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:20,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,669 INFO L185 Difference]: Start difference. First operand has 983 places, 860 transitions, 2127 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:20,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 861 transitions, 2153 flow [2021-06-10 11:45:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 861 transitions, 2151 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:20,678 INFO L241 Difference]: Finished difference. Result has 986 places, 861 transitions, 2143 flow [2021-06-10 11:45:20,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=986, PETRI_TRANSITIONS=861} [2021-06-10 11:45:20,679 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 55 predicate places. [2021-06-10 11:45:20,679 INFO L480 AbstractCegarLoop]: Abstraction has has 986 places, 861 transitions, 2143 flow [2021-06-10 11:45:20,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,679 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:20,679 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:20,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1984 [2021-06-10 11:45:20,679 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash 524761208, now seen corresponding path program 1 times [2021-06-10 11:45:20,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:20,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405431773] [2021-06-10 11:45:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:20,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:20,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:20,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:20,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:45:20,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405431773] [2021-06-10 11:45:20,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:20,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:20,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488114255] [2021-06-10 11:45:20,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:20,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:20,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:20,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 861 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:20,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:20,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:20,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:21,138 INFO L129 PetriNetUnfolder]: 36/1032 cut-off events. [2021-06-10 11:45:21,138 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 11:45:21,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1032 events. 36/1032 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4560 event pairs, 0 based on Foata normal form. 2/963 useless extension candidates. Maximal degree in co-relation 1287. Up to 36 conditions per place. [2021-06-10 11:45:21,205 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 9 selfloop transitions, 1 changer transitions 0/859 dead transitions. [2021-06-10 11:45:21,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 859 transitions, 2151 flow [2021-06-10 11:45:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2766 transitions. [2021-06-10 11:45:21,206 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210789210789211 [2021-06-10 11:45:21,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2766 transitions. [2021-06-10 11:45:21,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2766 transitions. [2021-06-10 11:45:21,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:21,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2766 transitions. [2021-06-10 11:45:21,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.0) internal successors, (2766), 3 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,209 INFO L185 Difference]: Start difference. First operand has 986 places, 861 transitions, 2143 flow. Second operand 3 states and 2766 transitions. [2021-06-10 11:45:21,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 859 transitions, 2151 flow [2021-06-10 11:45:21,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 859 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:21,219 INFO L241 Difference]: Finished difference. Result has 987 places, 859 transitions, 2132 flow [2021-06-10 11:45:21,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=987, PETRI_TRANSITIONS=859} [2021-06-10 11:45:21,219 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 56 predicate places. [2021-06-10 11:45:21,219 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 859 transitions, 2132 flow [2021-06-10 11:45:21,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:21,220 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:21,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1985 [2021-06-10 11:45:21,220 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash 524760185, now seen corresponding path program 1 times [2021-06-10 11:45:21,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:21,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237805788] [2021-06-10 11:45:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:21,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:21,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:21,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:45:21,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237805788] [2021-06-10 11:45:21,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:21,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:21,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083580459] [2021-06-10 11:45:21,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:21,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:21,247 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:21,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 859 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:21,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:21,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:21,656 INFO L129 PetriNetUnfolder]: 36/1029 cut-off events. [2021-06-10 11:45:21,656 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:21,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1029 events. 36/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4541 event pairs, 0 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1281. Up to 36 conditions per place. [2021-06-10 11:45:21,715 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/856 dead transitions. [2021-06-10 11:45:21,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 856 transitions, 2133 flow [2021-06-10 11:45:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:21,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:21,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:21,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:21,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:21,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:21,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,719 INFO L185 Difference]: Start difference. First operand has 987 places, 859 transitions, 2132 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:21,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 856 transitions, 2133 flow [2021-06-10 11:45:21,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 856 transitions, 2128 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:21,728 INFO L241 Difference]: Finished difference. Result has 984 places, 856 transitions, 2118 flow [2021-06-10 11:45:21,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=984, PETRI_TRANSITIONS=856} [2021-06-10 11:45:21,728 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 53 predicate places. [2021-06-10 11:45:21,729 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 856 transitions, 2118 flow [2021-06-10 11:45:21,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:21,729 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:21,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1986 [2021-06-10 11:45:21,729 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash 231882589, now seen corresponding path program 1 times [2021-06-10 11:45:21,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:21,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501406703] [2021-06-10 11:45:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:21,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:21,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:21,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:21,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:45:21,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501406703] [2021-06-10 11:45:21,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:21,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:21,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450656667] [2021-06-10 11:45:21,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:21,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:21,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:21,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 856 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:21,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:21,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:21,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:22,194 INFO L129 PetriNetUnfolder]: 34/1034 cut-off events. [2021-06-10 11:45:22,195 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:22,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1034 events. 34/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4592 event pairs, 0 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 1289. Up to 36 conditions per place. [2021-06-10 11:45:22,260 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/857 dead transitions. [2021-06-10 11:45:22,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 857 transitions, 2134 flow [2021-06-10 11:45:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:22,262 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:22,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:22,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:22,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:22,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:22,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,265 INFO L185 Difference]: Start difference. First operand has 984 places, 856 transitions, 2118 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:22,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 857 transitions, 2134 flow [2021-06-10 11:45:22,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 857 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:22,274 INFO L241 Difference]: Finished difference. Result has 987 places, 857 transitions, 2131 flow [2021-06-10 11:45:22,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2117, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2131, PETRI_PLACES=987, PETRI_TRANSITIONS=857} [2021-06-10 11:45:22,275 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 56 predicate places. [2021-06-10 11:45:22,275 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 857 transitions, 2131 flow [2021-06-10 11:45:22,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:22,275 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:22,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1987 [2021-06-10 11:45:22,275 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 231881566, now seen corresponding path program 1 times [2021-06-10 11:45:22,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:22,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916282607] [2021-06-10 11:45:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:22,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:22,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:22,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:45:22,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916282607] [2021-06-10 11:45:22,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:22,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:22,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485439723] [2021-06-10 11:45:22,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:22,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:22,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:22,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 857 transitions, 2131 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:22,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:22,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:22,746 INFO L129 PetriNetUnfolder]: 34/1035 cut-off events. [2021-06-10 11:45:22,746 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:22,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1035 events. 34/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4601 event pairs, 0 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1295. Up to 36 conditions per place. [2021-06-10 11:45:22,812 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/858 dead transitions. [2021-06-10 11:45:22,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 858 transitions, 2157 flow [2021-06-10 11:45:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:22,813 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:22,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:22,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:22,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:22,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:22,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,816 INFO L185 Difference]: Start difference. First operand has 987 places, 857 transitions, 2131 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:22,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 858 transitions, 2157 flow [2021-06-10 11:45:22,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 858 transitions, 2155 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:22,826 INFO L241 Difference]: Finished difference. Result has 990 places, 858 transitions, 2147 flow [2021-06-10 11:45:22,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=990, PETRI_TRANSITIONS=858} [2021-06-10 11:45:22,826 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 59 predicate places. [2021-06-10 11:45:22,826 INFO L480 AbstractCegarLoop]: Abstraction has has 990 places, 858 transitions, 2147 flow [2021-06-10 11:45:22,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:22,827 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:22,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1988 [2021-06-10 11:45:22,827 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash 232834878, now seen corresponding path program 1 times [2021-06-10 11:45:22,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:22,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984765330] [2021-06-10 11:45:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:22,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:22,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:22,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:22,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:45:22,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984765330] [2021-06-10 11:45:22,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:22,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:22,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455221081] [2021-06-10 11:45:22,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:22,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:22,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:22,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 858 transitions, 2147 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:22,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:22,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:22,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:23,291 INFO L129 PetriNetUnfolder]: 33/1031 cut-off events. [2021-06-10 11:45:23,291 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:23,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1031 events. 33/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4573 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1288. Up to 36 conditions per place. [2021-06-10 11:45:23,356 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/855 dead transitions. [2021-06-10 11:45:23,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 855 transitions, 2144 flow [2021-06-10 11:45:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:23,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:23,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:23,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:23,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:23,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:23,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,361 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,361 INFO L185 Difference]: Start difference. First operand has 990 places, 858 transitions, 2147 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:23,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 992 places, 855 transitions, 2144 flow [2021-06-10 11:45:23,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 855 transitions, 2136 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:23,370 INFO L241 Difference]: Finished difference. Result has 989 places, 855 transitions, 2126 flow [2021-06-10 11:45:23,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=989, PETRI_TRANSITIONS=855} [2021-06-10 11:45:23,371 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 58 predicate places. [2021-06-10 11:45:23,371 INFO L480 AbstractCegarLoop]: Abstraction has has 989 places, 855 transitions, 2126 flow [2021-06-10 11:45:23,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:23,371 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:23,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1989 [2021-06-10 11:45:23,371 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:23,371 INFO L82 PathProgramCache]: Analyzing trace with hash 232835901, now seen corresponding path program 1 times [2021-06-10 11:45:23,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:23,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356887419] [2021-06-10 11:45:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:23,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:23,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:23,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:45:23,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356887419] [2021-06-10 11:45:23,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:23,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:23,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023557167] [2021-06-10 11:45:23,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:23,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:23,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:23,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:23,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 855 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:23,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:23,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:23,843 INFO L129 PetriNetUnfolder]: 33/1029 cut-off events. [2021-06-10 11:45:23,843 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:23,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 1029 events. 33/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4559 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1291. Up to 36 conditions per place. [2021-06-10 11:45:23,908 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/853 dead transitions. [2021-06-10 11:45:23,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 853 transitions, 2139 flow [2021-06-10 11:45:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:23,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:23,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:23,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:23,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:23,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:23,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,912 INFO L185 Difference]: Start difference. First operand has 989 places, 855 transitions, 2126 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:23,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 853 transitions, 2139 flow [2021-06-10 11:45:23,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 853 transitions, 2138 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:23,922 INFO L241 Difference]: Finished difference. Result has 988 places, 853 transitions, 2122 flow [2021-06-10 11:45:23,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=988, PETRI_TRANSITIONS=853} [2021-06-10 11:45:23,922 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 57 predicate places. [2021-06-10 11:45:23,922 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 853 transitions, 2122 flow [2021-06-10 11:45:23,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:23,923 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:23,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1990 [2021-06-10 11:45:23,923 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash -522145116, now seen corresponding path program 1 times [2021-06-10 11:45:23,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:23,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417347942] [2021-06-10 11:45:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:23,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:23,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:23,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:23,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:45:23,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417347942] [2021-06-10 11:45:23,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:23,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:23,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869836479] [2021-06-10 11:45:23,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:23,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:23,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:23,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:23,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:23,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 853 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:23,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:23,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:23,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:24,398 INFO L129 PetriNetUnfolder]: 32/1037 cut-off events. [2021-06-10 11:45:24,398 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:24,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1037 events. 32/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4627 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1303. Up to 36 conditions per place. [2021-06-10 11:45:24,463 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/855 dead transitions. [2021-06-10 11:45:24,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 855 transitions, 2152 flow [2021-06-10 11:45:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:24,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:24,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:24,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:24,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:24,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:24,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:24,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:24,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:24,468 INFO L185 Difference]: Start difference. First operand has 988 places, 853 transitions, 2122 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:24,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 855 transitions, 2152 flow [2021-06-10 11:45:24,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 855 transitions, 2151 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:24,477 INFO L241 Difference]: Finished difference. Result has 991 places, 855 transitions, 2145 flow [2021-06-10 11:45:24,478 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2145, PETRI_PLACES=991, PETRI_TRANSITIONS=855} [2021-06-10 11:45:24,478 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 60 predicate places. [2021-06-10 11:45:24,478 INFO L480 AbstractCegarLoop]: Abstraction has has 991 places, 855 transitions, 2145 flow [2021-06-10 11:45:24,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:24,478 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:24,478 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:24,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1991 [2021-06-10 11:45:24,478 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash -522144093, now seen corresponding path program 1 times [2021-06-10 11:45:24,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:24,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235485033] [2021-06-10 11:45:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:24,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:24,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:24,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:24,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:24,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:24,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:45:24,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235485033] [2021-06-10 11:45:24,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:24,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:24,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88156912] [2021-06-10 11:45:24,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:24,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:24,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:24,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 855 transitions, 2145 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:24,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:24,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:24,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:24,963 INFO L129 PetriNetUnfolder]: 31/1035 cut-off events. [2021-06-10 11:45:24,963 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:25,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1035 events. 31/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4616 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1300. Up to 36 conditions per place. [2021-06-10 11:45:25,029 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/855 dead transitions. [2021-06-10 11:45:25,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 855 transitions, 2157 flow [2021-06-10 11:45:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:25,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:25,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:25,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:25,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:25,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:25,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,033 INFO L185 Difference]: Start difference. First operand has 991 places, 855 transitions, 2145 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:25,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 855 transitions, 2157 flow [2021-06-10 11:45:25,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 855 transitions, 2152 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:25,043 INFO L241 Difference]: Finished difference. Result has 994 places, 855 transitions, 2150 flow [2021-06-10 11:45:25,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=994, PETRI_TRANSITIONS=855} [2021-06-10 11:45:25,043 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 63 predicate places. [2021-06-10 11:45:25,043 INFO L480 AbstractCegarLoop]: Abstraction has has 994 places, 855 transitions, 2150 flow [2021-06-10 11:45:25,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:25,043 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:25,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1992 [2021-06-10 11:45:25,043 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -521191804, now seen corresponding path program 1 times [2021-06-10 11:45:25,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:25,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390678119] [2021-06-10 11:45:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:25,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:25,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:25,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:45:25,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390678119] [2021-06-10 11:45:25,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:25,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566241281] [2021-06-10 11:45:25,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:25,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:25,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:25,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 855 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:25,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:25,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:25,505 INFO L129 PetriNetUnfolder]: 30/1031 cut-off events. [2021-06-10 11:45:25,505 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:25,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1031 events. 30/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4587 event pairs, 0 based on Foata normal form. 1/968 useless extension candidates. Maximal degree in co-relation 1297. Up to 36 conditions per place. [2021-06-10 11:45:25,570 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/852 dead transitions. [2021-06-10 11:45:25,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 852 transitions, 2147 flow [2021-06-10 11:45:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:25,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:25,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:25,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:25,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:25,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:25,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,574 INFO L185 Difference]: Start difference. First operand has 994 places, 855 transitions, 2150 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:25,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 852 transitions, 2147 flow [2021-06-10 11:45:25,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 852 transitions, 2140 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:25,634 INFO L241 Difference]: Finished difference. Result has 993 places, 852 transitions, 2130 flow [2021-06-10 11:45:25,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=993, PETRI_TRANSITIONS=852} [2021-06-10 11:45:25,634 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 62 predicate places. [2021-06-10 11:45:25,634 INFO L480 AbstractCegarLoop]: Abstraction has has 993 places, 852 transitions, 2130 flow [2021-06-10 11:45:25,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:25,635 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:25,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1993 [2021-06-10 11:45:25,635 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -521190781, now seen corresponding path program 1 times [2021-06-10 11:45:25,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:25,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089413976] [2021-06-10 11:45:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:25,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:25,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:25,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:25,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:45:25,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089413976] [2021-06-10 11:45:25,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:25,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:25,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480911212] [2021-06-10 11:45:25,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:25,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:25,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:25,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:25,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:25,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 852 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:25,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:25,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:25,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:26,097 INFO L129 PetriNetUnfolder]: 30/1029 cut-off events. [2021-06-10 11:45:26,097 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:26,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 1029 events. 30/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4573 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1298. Up to 36 conditions per place. [2021-06-10 11:45:26,163 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/850 dead transitions. [2021-06-10 11:45:26,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 850 transitions, 2143 flow [2021-06-10 11:45:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:26,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:26,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:26,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:26,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,167 INFO L185 Difference]: Start difference. First operand has 993 places, 852 transitions, 2130 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:26,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 850 transitions, 2143 flow [2021-06-10 11:45:26,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 850 transitions, 2142 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:26,177 INFO L241 Difference]: Finished difference. Result has 992 places, 850 transitions, 2126 flow [2021-06-10 11:45:26,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=992, PETRI_TRANSITIONS=850} [2021-06-10 11:45:26,178 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 61 predicate places. [2021-06-10 11:45:26,178 INFO L480 AbstractCegarLoop]: Abstraction has has 992 places, 850 transitions, 2126 flow [2021-06-10 11:45:26,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:26,178 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:26,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1994 [2021-06-10 11:45:26,178 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:26,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:26,178 INFO L82 PathProgramCache]: Analyzing trace with hash 885161450, now seen corresponding path program 1 times [2021-06-10 11:45:26,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:26,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412082735] [2021-06-10 11:45:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:26,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:26,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:26,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:45:26,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412082735] [2021-06-10 11:45:26,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:26,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:26,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135223982] [2021-06-10 11:45:26,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:26,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:26,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:26,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 850 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:26,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:26,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:26,649 INFO L129 PetriNetUnfolder]: 28/1034 cut-off events. [2021-06-10 11:45:26,649 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:26,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1034 events. 28/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4628 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1301. Up to 36 conditions per place. [2021-06-10 11:45:26,713 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/851 dead transitions. [2021-06-10 11:45:26,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 851 transitions, 2142 flow [2021-06-10 11:45:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:26,715 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:26,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:26,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:26,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:26,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:26,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,718 INFO L185 Difference]: Start difference. First operand has 992 places, 850 transitions, 2126 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:26,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 851 transitions, 2142 flow [2021-06-10 11:45:26,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 851 transitions, 2141 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:26,727 INFO L241 Difference]: Finished difference. Result has 995 places, 851 transitions, 2139 flow [2021-06-10 11:45:26,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2139, PETRI_PLACES=995, PETRI_TRANSITIONS=851} [2021-06-10 11:45:26,727 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 64 predicate places. [2021-06-10 11:45:26,727 INFO L480 AbstractCegarLoop]: Abstraction has has 995 places, 851 transitions, 2139 flow [2021-06-10 11:45:26,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:26,728 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:26,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1995 [2021-06-10 11:45:26,728 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:26,728 INFO L82 PathProgramCache]: Analyzing trace with hash 885160427, now seen corresponding path program 1 times [2021-06-10 11:45:26,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:26,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917091139] [2021-06-10 11:45:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:26,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:26,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:26,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:26,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:45:26,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917091139] [2021-06-10 11:45:26,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:26,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:26,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335374214] [2021-06-10 11:45:26,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:26,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:26,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:26,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 851 transitions, 2139 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:26,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:26,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:26,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:27,198 INFO L129 PetriNetUnfolder]: 28/1035 cut-off events. [2021-06-10 11:45:27,198 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:27,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1035 events. 28/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4635 event pairs, 0 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 1309. Up to 36 conditions per place. [2021-06-10 11:45:27,263 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/852 dead transitions. [2021-06-10 11:45:27,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 852 transitions, 2165 flow [2021-06-10 11:45:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:27,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:27,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:27,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:27,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:27,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:27,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,268 INFO L185 Difference]: Start difference. First operand has 995 places, 851 transitions, 2139 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 852 transitions, 2165 flow [2021-06-10 11:45:27,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 852 transitions, 2163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:27,278 INFO L241 Difference]: Finished difference. Result has 998 places, 852 transitions, 2155 flow [2021-06-10 11:45:27,278 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=998, PETRI_TRANSITIONS=852} [2021-06-10 11:45:27,278 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 67 predicate places. [2021-06-10 11:45:27,278 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 852 transitions, 2155 flow [2021-06-10 11:45:27,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:27,278 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:27,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1996 [2021-06-10 11:45:27,278 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:27,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash 886114762, now seen corresponding path program 1 times [2021-06-10 11:45:27,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:27,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544873031] [2021-06-10 11:45:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:27,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:27,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:27,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:45:27,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544873031] [2021-06-10 11:45:27,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:27,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:27,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450236649] [2021-06-10 11:45:27,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:27,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:27,305 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:27,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 852 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:27,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:27,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:27,755 INFO L129 PetriNetUnfolder]: 27/1032 cut-off events. [2021-06-10 11:45:27,755 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 11:45:27,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1032 events. 27/1032 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4615 event pairs, 0 based on Foata normal form. 2/972 useless extension candidates. Maximal degree in co-relation 1308. Up to 36 conditions per place. [2021-06-10 11:45:27,801 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 9 selfloop transitions, 1 changer transitions 0/850 dead transitions. [2021-06-10 11:45:27,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 850 transitions, 2163 flow [2021-06-10 11:45:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2766 transitions. [2021-06-10 11:45:27,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210789210789211 [2021-06-10 11:45:27,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2766 transitions. [2021-06-10 11:45:27,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2766 transitions. [2021-06-10 11:45:27,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:27,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2766 transitions. [2021-06-10 11:45:27,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.0) internal successors, (2766), 3 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,805 INFO L185 Difference]: Start difference. First operand has 998 places, 852 transitions, 2155 flow. Second operand 3 states and 2766 transitions. [2021-06-10 11:45:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 850 transitions, 2163 flow [2021-06-10 11:45:27,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 850 transitions, 2162 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:27,814 INFO L241 Difference]: Finished difference. Result has 999 places, 850 transitions, 2144 flow [2021-06-10 11:45:27,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=999, PETRI_TRANSITIONS=850} [2021-06-10 11:45:27,814 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 68 predicate places. [2021-06-10 11:45:27,814 INFO L480 AbstractCegarLoop]: Abstraction has has 999 places, 850 transitions, 2144 flow [2021-06-10 11:45:27,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:27,815 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:27,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1997 [2021-06-10 11:45:27,815 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash 886113739, now seen corresponding path program 1 times [2021-06-10 11:45:27,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:27,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413611057] [2021-06-10 11:45:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:27,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:27,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:27,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:27,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:45:27,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413611057] [2021-06-10 11:45:27,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:27,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:27,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986348097] [2021-06-10 11:45:27,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:27,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:27,842 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:27,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 850 transitions, 2144 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:27,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:27,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:27,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:28,265 INFO L129 PetriNetUnfolder]: 27/1029 cut-off events. [2021-06-10 11:45:28,265 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:28,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1029 events. 27/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4589 event pairs, 0 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1302. Up to 36 conditions per place. [2021-06-10 11:45:28,327 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/847 dead transitions. [2021-06-10 11:45:28,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 999 places, 847 transitions, 2145 flow [2021-06-10 11:45:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:28,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:28,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:28,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:28,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:28,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:28,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,332 INFO L185 Difference]: Start difference. First operand has 999 places, 850 transitions, 2144 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:28,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 999 places, 847 transitions, 2145 flow [2021-06-10 11:45:28,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 847 transitions, 2140 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:28,341 INFO L241 Difference]: Finished difference. Result has 996 places, 847 transitions, 2130 flow [2021-06-10 11:45:28,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=996, PETRI_TRANSITIONS=847} [2021-06-10 11:45:28,341 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 65 predicate places. [2021-06-10 11:45:28,341 INFO L480 AbstractCegarLoop]: Abstraction has has 996 places, 847 transitions, 2130 flow [2021-06-10 11:45:28,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:28,342 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:28,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1998 [2021-06-10 11:45:28,342 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 412977554, now seen corresponding path program 1 times [2021-06-10 11:45:28,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:28,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698332704] [2021-06-10 11:45:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:28,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:28,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:28,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:45:28,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698332704] [2021-06-10 11:45:28,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:28,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:28,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579289535] [2021-06-10 11:45:28,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:28,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:28,368 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:28,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 847 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:28,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:28,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:28,821 INFO L129 PetriNetUnfolder]: 26/1037 cut-off events. [2021-06-10 11:45:28,821 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:28,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1037 events. 26/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4662 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1319. Up to 36 conditions per place. [2021-06-10 11:45:28,885 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/849 dead transitions. [2021-06-10 11:45:28,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 849 transitions, 2160 flow [2021-06-10 11:45:28,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:28,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:28,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:28,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:28,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:28,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:28,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,889 INFO L185 Difference]: Start difference. First operand has 996 places, 847 transitions, 2130 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:28,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 849 transitions, 2160 flow [2021-06-10 11:45:28,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 849 transitions, 2159 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:28,899 INFO L241 Difference]: Finished difference. Result has 999 places, 849 transitions, 2153 flow [2021-06-10 11:45:28,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=844, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2153, PETRI_PLACES=999, PETRI_TRANSITIONS=849} [2021-06-10 11:45:28,899 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 68 predicate places. [2021-06-10 11:45:28,899 INFO L480 AbstractCegarLoop]: Abstraction has has 999 places, 849 transitions, 2153 flow [2021-06-10 11:45:28,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:28,899 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:28,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1999 [2021-06-10 11:45:28,900 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 412976531, now seen corresponding path program 1 times [2021-06-10 11:45:28,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:28,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384908282] [2021-06-10 11:45:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:28,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:28,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:28,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:28,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:45:28,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384908282] [2021-06-10 11:45:28,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:28,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:28,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065795653] [2021-06-10 11:45:28,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:28,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:28,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:28,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 849 transitions, 2153 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:28,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:28,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:28,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:29,369 INFO L129 PetriNetUnfolder]: 24/1038 cut-off events. [2021-06-10 11:45:29,369 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:29,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1038 events. 24/1038 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4678 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1317. Up to 36 conditions per place. [2021-06-10 11:45:29,433 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/849 dead transitions. [2021-06-10 11:45:29,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 849 transitions, 2165 flow [2021-06-10 11:45:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:29,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:29,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:29,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:29,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:29,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:29,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,437 INFO L185 Difference]: Start difference. First operand has 999 places, 849 transitions, 2153 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:29,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 849 transitions, 2165 flow [2021-06-10 11:45:29,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 849 transitions, 2160 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:29,446 INFO L241 Difference]: Finished difference. Result has 1001 places, 848 transitions, 2149 flow [2021-06-10 11:45:29,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=847, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2149, PETRI_PLACES=1001, PETRI_TRANSITIONS=848} [2021-06-10 11:45:29,446 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 70 predicate places. [2021-06-10 11:45:29,446 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 848 transitions, 2149 flow [2021-06-10 11:45:29,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,447 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:29,447 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:29,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000 [2021-06-10 11:45:29,447 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 412024242, now seen corresponding path program 1 times [2021-06-10 11:45:29,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:29,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802894644] [2021-06-10 11:45:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:29,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:29,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:29,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:45:29,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802894644] [2021-06-10 11:45:29,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:29,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:29,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251672489] [2021-06-10 11:45:29,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:29,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:29,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:29,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 848 transitions, 2149 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:29,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:29,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:29,895 INFO L129 PetriNetUnfolder]: 24/1031 cut-off events. [2021-06-10 11:45:29,895 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:29,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1031 events. 24/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4625 event pairs, 0 based on Foata normal form. 1/974 useless extension candidates. Maximal degree in co-relation 1311. Up to 36 conditions per place. [2021-06-10 11:45:29,946 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/846 dead transitions. [2021-06-10 11:45:29,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 846 transitions, 2152 flow [2021-06-10 11:45:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:29,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:29,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:29,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:29,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:29,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:29,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,950 INFO L185 Difference]: Start difference. First operand has 1001 places, 848 transitions, 2149 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 846 transitions, 2152 flow [2021-06-10 11:45:29,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 846 transitions, 2145 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:29,958 INFO L241 Difference]: Finished difference. Result has 1001 places, 846 transitions, 2138 flow [2021-06-10 11:45:29,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1001, PETRI_TRANSITIONS=846} [2021-06-10 11:45:29,959 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 70 predicate places. [2021-06-10 11:45:29,959 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 846 transitions, 2138 flow [2021-06-10 11:45:29,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:29,959 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:29,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2001 [2021-06-10 11:45:29,959 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 412023219, now seen corresponding path program 1 times [2021-06-10 11:45:29,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:29,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128384558] [2021-06-10 11:45:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:29,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:29,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:29,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:29,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:45:29,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128384558] [2021-06-10 11:45:29,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:29,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:29,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131368409] [2021-06-10 11:45:29,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:29,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:29,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:29,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 846 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:29,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:29,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:29,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:30,416 INFO L129 PetriNetUnfolder]: 24/1029 cut-off events. [2021-06-10 11:45:30,416 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:30,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 1029 events. 24/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4609 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1311. Up to 36 conditions per place. [2021-06-10 11:45:30,479 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/844 dead transitions. [2021-06-10 11:45:30,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 844 transitions, 2151 flow [2021-06-10 11:45:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:30,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:30,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:30,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:30,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:30,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:30,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:30,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:30,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:30,484 INFO L185 Difference]: Start difference. First operand has 1001 places, 846 transitions, 2138 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:30,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 844 transitions, 2151 flow [2021-06-10 11:45:30,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 844 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:30,493 INFO L241 Difference]: Finished difference. Result has 1000 places, 844 transitions, 2134 flow [2021-06-10 11:45:30,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1000, PETRI_TRANSITIONS=844} [2021-06-10 11:45:30,493 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 69 predicate places. [2021-06-10 11:45:30,493 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 844 transitions, 2134 flow [2021-06-10 11:45:30,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:30,493 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:30,493 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:30,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2002 [2021-06-10 11:45:30,494 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash -203850629, now seen corresponding path program 1 times [2021-06-10 11:45:30,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:30,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654914485] [2021-06-10 11:45:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:30,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:30,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:30,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:30,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:30,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:30,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:45:30,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654914485] [2021-06-10 11:45:30,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:30,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:30,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275923320] [2021-06-10 11:45:30,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:30,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:30,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:30,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 844 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:30,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:30,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:30,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:30,971 INFO L129 PetriNetUnfolder]: 22/1034 cut-off events. [2021-06-10 11:45:30,971 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:31,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1034 events. 22/1034 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4662 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1314. Up to 36 conditions per place. [2021-06-10 11:45:31,035 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/845 dead transitions. [2021-06-10 11:45:31,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 845 transitions, 2150 flow [2021-06-10 11:45:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:31,036 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:31,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:31,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:31,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:31,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:31,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,039 INFO L185 Difference]: Start difference. First operand has 1000 places, 844 transitions, 2134 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:31,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 845 transitions, 2150 flow [2021-06-10 11:45:31,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 845 transitions, 2149 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:31,048 INFO L241 Difference]: Finished difference. Result has 1003 places, 845 transitions, 2147 flow [2021-06-10 11:45:31,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=1003, PETRI_TRANSITIONS=845} [2021-06-10 11:45:31,049 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 72 predicate places. [2021-06-10 11:45:31,049 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 845 transitions, 2147 flow [2021-06-10 11:45:31,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:31,049 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:31,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2003 [2021-06-10 11:45:31,049 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -203851652, now seen corresponding path program 1 times [2021-06-10 11:45:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:31,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810656787] [2021-06-10 11:45:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:31,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:31,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:31,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:45:31,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810656787] [2021-06-10 11:45:31,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:31,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:31,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264605863] [2021-06-10 11:45:31,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:31,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:31,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:31,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 845 transitions, 2147 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:31,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:31,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:31,527 INFO L129 PetriNetUnfolder]: 22/1035 cut-off events. [2021-06-10 11:45:31,527 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:31,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1035 events. 22/1035 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4668 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1322. Up to 36 conditions per place. [2021-06-10 11:45:31,591 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/846 dead transitions. [2021-06-10 11:45:31,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 846 transitions, 2173 flow [2021-06-10 11:45:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:31,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:31,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:31,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:31,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:31,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:31,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,595 INFO L185 Difference]: Start difference. First operand has 1003 places, 845 transitions, 2147 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:31,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 846 transitions, 2173 flow [2021-06-10 11:45:31,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 846 transitions, 2171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:31,604 INFO L241 Difference]: Finished difference. Result has 1006 places, 846 transitions, 2163 flow [2021-06-10 11:45:31,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=1006, PETRI_TRANSITIONS=846} [2021-06-10 11:45:31,605 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 75 predicate places. [2021-06-10 11:45:31,605 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 846 transitions, 2163 flow [2021-06-10 11:45:31,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,605 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:31,605 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:31,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2004 [2021-06-10 11:45:31,605 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash -202897317, now seen corresponding path program 1 times [2021-06-10 11:45:31,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:31,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619396982] [2021-06-10 11:45:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:31,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:31,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:31,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:31,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:45:31,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619396982] [2021-06-10 11:45:31,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:31,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:31,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341314192] [2021-06-10 11:45:31,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:31,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:31,632 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:31,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 846 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:31,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:31,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:31,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:32,058 INFO L129 PetriNetUnfolder]: 21/1032 cut-off events. [2021-06-10 11:45:32,059 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 11:45:32,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1032 events. 21/1032 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4654 event pairs, 0 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 1321. Up to 36 conditions per place. [2021-06-10 11:45:32,118 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 9 selfloop transitions, 1 changer transitions 0/844 dead transitions. [2021-06-10 11:45:32,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 844 transitions, 2171 flow [2021-06-10 11:45:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2766 transitions. [2021-06-10 11:45:32,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210789210789211 [2021-06-10 11:45:32,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2766 transitions. [2021-06-10 11:45:32,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2766 transitions. [2021-06-10 11:45:32,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:32,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2766 transitions. [2021-06-10 11:45:32,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.0) internal successors, (2766), 3 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,122 INFO L185 Difference]: Start difference. First operand has 1006 places, 846 transitions, 2163 flow. Second operand 3 states and 2766 transitions. [2021-06-10 11:45:32,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 844 transitions, 2171 flow [2021-06-10 11:45:32,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 844 transitions, 2170 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:32,131 INFO L241 Difference]: Finished difference. Result has 1007 places, 844 transitions, 2152 flow [2021-06-10 11:45:32,131 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2152, PETRI_PLACES=1007, PETRI_TRANSITIONS=844} [2021-06-10 11:45:32,131 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 76 predicate places. [2021-06-10 11:45:32,131 INFO L480 AbstractCegarLoop]: Abstraction has has 1007 places, 844 transitions, 2152 flow [2021-06-10 11:45:32,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:32,132 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:32,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2005 [2021-06-10 11:45:32,132 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash -202898340, now seen corresponding path program 1 times [2021-06-10 11:45:32,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:32,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115523566] [2021-06-10 11:45:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:32,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:32,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:32,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:45:32,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115523566] [2021-06-10 11:45:32,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:32,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:32,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367212054] [2021-06-10 11:45:32,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:32,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:32,159 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:32,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 844 transitions, 2152 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:32,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:32,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:32,602 INFO L129 PetriNetUnfolder]: 21/1029 cut-off events. [2021-06-10 11:45:32,602 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:32,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 1029 events. 21/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4631 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1315. Up to 36 conditions per place. [2021-06-10 11:45:32,664 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/841 dead transitions. [2021-06-10 11:45:32,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 841 transitions, 2153 flow [2021-06-10 11:45:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:32,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:32,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:32,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:32,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:32,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:32,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,668 INFO L185 Difference]: Start difference. First operand has 1007 places, 844 transitions, 2152 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:32,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 841 transitions, 2153 flow [2021-06-10 11:45:32,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 841 transitions, 2148 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:32,678 INFO L241 Difference]: Finished difference. Result has 1004 places, 841 transitions, 2138 flow [2021-06-10 11:45:32,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1004, PETRI_TRANSITIONS=841} [2021-06-10 11:45:32,678 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 73 predicate places. [2021-06-10 11:45:32,678 INFO L480 AbstractCegarLoop]: Abstraction has has 1004 places, 841 transitions, 2138 flow [2021-06-10 11:45:32,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:32,678 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:32,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2006 [2021-06-10 11:45:32,678 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -513147962, now seen corresponding path program 1 times [2021-06-10 11:45:32,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:32,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192649848] [2021-06-10 11:45:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:32,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:32,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:32,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:32,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:45:32,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192649848] [2021-06-10 11:45:32,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:32,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:32,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408712673] [2021-06-10 11:45:32,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:32,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:32,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:32,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 841 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:32,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:32,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:32,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:33,171 INFO L129 PetriNetUnfolder]: 20/1037 cut-off events. [2021-06-10 11:45:33,171 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:33,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1037 events. 20/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4698 event pairs, 0 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1332. Up to 36 conditions per place. [2021-06-10 11:45:33,235 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/843 dead transitions. [2021-06-10 11:45:33,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 843 transitions, 2168 flow [2021-06-10 11:45:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:33,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:33,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:33,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:33,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:33,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:33,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,240 INFO L185 Difference]: Start difference. First operand has 1004 places, 841 transitions, 2138 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 843 transitions, 2168 flow [2021-06-10 11:45:33,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 843 transitions, 2167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:33,249 INFO L241 Difference]: Finished difference. Result has 1007 places, 843 transitions, 2161 flow [2021-06-10 11:45:33,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=841, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2161, PETRI_PLACES=1007, PETRI_TRANSITIONS=843} [2021-06-10 11:45:33,249 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 76 predicate places. [2021-06-10 11:45:33,250 INFO L480 AbstractCegarLoop]: Abstraction has has 1007 places, 843 transitions, 2161 flow [2021-06-10 11:45:33,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:33,250 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:33,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2007 [2021-06-10 11:45:33,250 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash -513146939, now seen corresponding path program 1 times [2021-06-10 11:45:33,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:33,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405165814] [2021-06-10 11:45:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:33,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:33,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:33,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:45:33,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405165814] [2021-06-10 11:45:33,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:33,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:33,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378058135] [2021-06-10 11:45:33,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:33,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:33,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:33,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 843 transitions, 2161 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:33,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:33,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:33,794 INFO L129 PetriNetUnfolder]: 19/1035 cut-off events. [2021-06-10 11:45:33,794 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:33,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1035 events. 19/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4686 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1327. Up to 36 conditions per place. [2021-06-10 11:45:33,831 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/843 dead transitions. [2021-06-10 11:45:33,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 843 transitions, 2173 flow [2021-06-10 11:45:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:33,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:33,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:33,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:33,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:33,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:33,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,836 INFO L185 Difference]: Start difference. First operand has 1007 places, 843 transitions, 2161 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:33,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 843 transitions, 2173 flow [2021-06-10 11:45:33,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 843 transitions, 2168 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:33,844 INFO L241 Difference]: Finished difference. Result has 1010 places, 843 transitions, 2166 flow [2021-06-10 11:45:33,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=840, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2166, PETRI_PLACES=1010, PETRI_TRANSITIONS=843} [2021-06-10 11:45:33,845 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 79 predicate places. [2021-06-10 11:45:33,845 INFO L480 AbstractCegarLoop]: Abstraction has has 1010 places, 843 transitions, 2166 flow [2021-06-10 11:45:33,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:33,845 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:33,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2008 [2021-06-10 11:45:33,845 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -512194650, now seen corresponding path program 1 times [2021-06-10 11:45:33,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:33,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114923898] [2021-06-10 11:45:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:33,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:33,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:33,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:33,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:45:33,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114923898] [2021-06-10 11:45:33,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:33,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:33,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070567851] [2021-06-10 11:45:33,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:33,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:33,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:33,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 843 transitions, 2166 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:33,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:33,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:33,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:34,307 INFO L129 PetriNetUnfolder]: 18/1031 cut-off events. [2021-06-10 11:45:34,307 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:34,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 1031 events. 18/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4661 event pairs, 0 based on Foata normal form. 1/980 useless extension candidates. Maximal degree in co-relation 1324. Up to 36 conditions per place. [2021-06-10 11:45:34,369 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/840 dead transitions. [2021-06-10 11:45:34,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 840 transitions, 2163 flow [2021-06-10 11:45:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:34,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:34,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:34,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:34,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:34,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:34,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,373 INFO L185 Difference]: Start difference. First operand has 1010 places, 843 transitions, 2166 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:34,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 840 transitions, 2163 flow [2021-06-10 11:45:34,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 840 transitions, 2156 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:34,383 INFO L241 Difference]: Finished difference. Result has 1009 places, 840 transitions, 2146 flow [2021-06-10 11:45:34,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2146, PETRI_PLACES=1009, PETRI_TRANSITIONS=840} [2021-06-10 11:45:34,383 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 78 predicate places. [2021-06-10 11:45:34,383 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 840 transitions, 2146 flow [2021-06-10 11:45:34,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,383 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:34,383 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:34,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2009 [2021-06-10 11:45:34,383 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash -512193627, now seen corresponding path program 1 times [2021-06-10 11:45:34,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:34,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688251941] [2021-06-10 11:45:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:34,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:34,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:34,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:45:34,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688251941] [2021-06-10 11:45:34,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:34,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:34,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640292665] [2021-06-10 11:45:34,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:34,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:34,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:34,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 840 transitions, 2146 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:34,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:34,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:34,852 INFO L129 PetriNetUnfolder]: 18/1029 cut-off events. [2021-06-10 11:45:34,852 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:34,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 1029 events. 18/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4648 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1325. Up to 36 conditions per place. [2021-06-10 11:45:34,915 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/838 dead transitions. [2021-06-10 11:45:34,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 838 transitions, 2159 flow [2021-06-10 11:45:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:34,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:34,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:34,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:34,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:34,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:34,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,920 INFO L185 Difference]: Start difference. First operand has 1009 places, 840 transitions, 2146 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:34,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 838 transitions, 2159 flow [2021-06-10 11:45:34,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 838 transitions, 2158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:34,930 INFO L241 Difference]: Finished difference. Result has 1008 places, 838 transitions, 2142 flow [2021-06-10 11:45:34,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2142, PETRI_PLACES=1008, PETRI_TRANSITIONS=838} [2021-06-10 11:45:34,930 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 77 predicate places. [2021-06-10 11:45:34,930 INFO L480 AbstractCegarLoop]: Abstraction has has 1008 places, 838 transitions, 2142 flow [2021-06-10 11:45:34,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,931 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:34,931 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:34,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2010 [2021-06-10 11:45:34,931 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1138716945, now seen corresponding path program 1 times [2021-06-10 11:45:34,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:34,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262333707] [2021-06-10 11:45:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:34,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:34,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:34,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:34,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:45:34,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262333707] [2021-06-10 11:45:34,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:34,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:34,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708102219] [2021-06-10 11:45:34,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:34,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:34,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:34,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:34,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 838 transitions, 2142 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:34,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:34,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:34,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:35,425 INFO L129 PetriNetUnfolder]: 17/1037 cut-off events. [2021-06-10 11:45:35,425 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:35,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1037 events. 17/1037 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4716 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1337. Up to 36 conditions per place. [2021-06-10 11:45:35,489 INFO L132 encePairwiseOnDemand]: 996/1001 looper letters, 10 selfloop transitions, 3 changer transitions 0/840 dead transitions. [2021-06-10 11:45:35,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 840 transitions, 2172 flow [2021-06-10 11:45:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2769 transitions. [2021-06-10 11:45:35,491 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2021-06-10 11:45:35,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2769 transitions. [2021-06-10 11:45:35,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2769 transitions. [2021-06-10 11:45:35,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:35,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2769 transitions. [2021-06-10 11:45:35,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 923.0) internal successors, (2769), 3 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:35,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:35,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:35,494 INFO L185 Difference]: Start difference. First operand has 1008 places, 838 transitions, 2142 flow. Second operand 3 states and 2769 transitions. [2021-06-10 11:45:35,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 840 transitions, 2172 flow [2021-06-10 11:45:35,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 840 transitions, 2171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:35,503 INFO L241 Difference]: Finished difference. Result has 1011 places, 840 transitions, 2165 flow [2021-06-10 11:45:35,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=835, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2165, PETRI_PLACES=1011, PETRI_TRANSITIONS=840} [2021-06-10 11:45:35,503 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 80 predicate places. [2021-06-10 11:45:35,503 INFO L480 AbstractCegarLoop]: Abstraction has has 1011 places, 840 transitions, 2165 flow [2021-06-10 11:45:35,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:35,504 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:35,504 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:35,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2011 [2021-06-10 11:45:35,504 INFO L428 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1138717968, now seen corresponding path program 1 times [2021-06-10 11:45:35,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:35,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685397275] [2021-06-10 11:45:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:35,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:35,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:35,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:35,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:35,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:35,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:45:35,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685397275] [2021-06-10 11:45:35,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:35,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:35,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294123654] [2021-06-10 11:45:35,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:35,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:35,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:35,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 840 transitions, 2165 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:35,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:35,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:35,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:35,965 INFO L129 PetriNetUnfolder]: 16/1035 cut-off events. [2021-06-10 11:45:35,965 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:36,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 1035 events. 16/1035 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4708 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1334. Up to 36 conditions per place. [2021-06-10 11:45:36,014 INFO L132 encePairwiseOnDemand]: 998/1001 looper letters, 5 selfloop transitions, 2 changer transitions 0/840 dead transitions. [2021-06-10 11:45:36,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 840 transitions, 2177 flow [2021-06-10 11:45:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:36,015 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:36,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:36,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:36,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:36,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:36,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,018 INFO L185 Difference]: Start difference. First operand has 1011 places, 840 transitions, 2165 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:36,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 840 transitions, 2177 flow [2021-06-10 11:45:36,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 840 transitions, 2172 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:36,027 INFO L241 Difference]: Finished difference. Result has 1014 places, 840 transitions, 2170 flow [2021-06-10 11:45:36,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2170, PETRI_PLACES=1014, PETRI_TRANSITIONS=840} [2021-06-10 11:45:36,027 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 83 predicate places. [2021-06-10 11:45:36,028 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 840 transitions, 2170 flow [2021-06-10 11:45:36,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:36,028 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:36,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2012 [2021-06-10 11:45:36,028 INFO L428 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1139670257, now seen corresponding path program 1 times [2021-06-10 11:45:36,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:36,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544954290] [2021-06-10 11:45:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:36,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:36,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:36,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:45:36,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544954290] [2021-06-10 11:45:36,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:36,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:36,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32589882] [2021-06-10 11:45:36,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:36,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:36,057 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:36,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 840 transitions, 2170 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:36,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:36,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:36,504 INFO L129 PetriNetUnfolder]: 15/1031 cut-off events. [2021-06-10 11:45:36,505 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:36,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 1031 events. 15/1031 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4680 event pairs, 0 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 1331. Up to 36 conditions per place. [2021-06-10 11:45:36,567 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/837 dead transitions. [2021-06-10 11:45:36,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 837 transitions, 2167 flow [2021-06-10 11:45:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:36,569 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:36,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:36,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:36,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:36,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:36,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,571 INFO L185 Difference]: Start difference. First operand has 1014 places, 840 transitions, 2170 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:36,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 837 transitions, 2167 flow [2021-06-10 11:45:36,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 837 transitions, 2160 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:36,581 INFO L241 Difference]: Finished difference. Result has 1013 places, 837 transitions, 2150 flow [2021-06-10 11:45:36,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=1013, PETRI_TRANSITIONS=837} [2021-06-10 11:45:36,581 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 82 predicate places. [2021-06-10 11:45:36,581 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 837 transitions, 2150 flow [2021-06-10 11:45:36,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:36,581 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:36,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2013 [2021-06-10 11:45:36,581 INFO L428 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1139671280, now seen corresponding path program 1 times [2021-06-10 11:45:36,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:36,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607264715] [2021-06-10 11:45:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:36,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:36,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:36,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:36,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:45:36,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607264715] [2021-06-10 11:45:36,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:36,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:36,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925652767] [2021-06-10 11:45:36,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:36,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:36,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:36,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 837 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:36,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:36,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:36,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:37,094 INFO L129 PetriNetUnfolder]: 15/1029 cut-off events. [2021-06-10 11:45:37,094 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:37,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 1029 events. 15/1029 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4662 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1332. Up to 36 conditions per place. [2021-06-10 11:45:37,157 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/835 dead transitions. [2021-06-10 11:45:37,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 835 transitions, 2163 flow [2021-06-10 11:45:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:37,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:37,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:37,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:37,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:37,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:37,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,162 INFO L185 Difference]: Start difference. First operand has 1013 places, 837 transitions, 2150 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:37,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 835 transitions, 2163 flow [2021-06-10 11:45:37,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 835 transitions, 2162 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:37,171 INFO L241 Difference]: Finished difference. Result has 1012 places, 835 transitions, 2146 flow [2021-06-10 11:45:37,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2146, PETRI_PLACES=1012, PETRI_TRANSITIONS=835} [2021-06-10 11:45:37,172 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 81 predicate places. [2021-06-10 11:45:37,172 INFO L480 AbstractCegarLoop]: Abstraction has has 1012 places, 835 transitions, 2146 flow [2021-06-10 11:45:37,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:37,172 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:37,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2014 [2021-06-10 11:45:37,172 INFO L428 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash -790906435, now seen corresponding path program 1 times [2021-06-10 11:45:37,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:37,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491004066] [2021-06-10 11:45:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:37,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:37,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:37,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:45:37,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491004066] [2021-06-10 11:45:37,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:37,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:37,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689769498] [2021-06-10 11:45:37,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:37,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:37,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:37,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 835 transitions, 2146 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:37,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:37,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:37,655 INFO L129 PetriNetUnfolder]: 14/1036 cut-off events. [2021-06-10 11:45:37,655 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-10 11:45:37,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1036 events. 14/1036 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4725 event pairs, 0 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 1337. Up to 36 conditions per place. [2021-06-10 11:45:37,722 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 6 selfloop transitions, 1 changer transitions 0/836 dead transitions. [2021-06-10 11:45:37,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 836 transitions, 2162 flow [2021-06-10 11:45:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2021-06-10 11:45:37,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247419247419247 [2021-06-10 11:45:37,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2777 transitions. [2021-06-10 11:45:37,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2777 transitions. [2021-06-10 11:45:37,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:37,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2777 transitions. [2021-06-10 11:45:37,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.6666666666666) internal successors, (2777), 3 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,726 INFO L185 Difference]: Start difference. First operand has 1012 places, 835 transitions, 2146 flow. Second operand 3 states and 2777 transitions. [2021-06-10 11:45:37,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 836 transitions, 2162 flow [2021-06-10 11:45:37,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 836 transitions, 2161 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:37,735 INFO L241 Difference]: Finished difference. Result has 1014 places, 835 transitions, 2150 flow [2021-06-10 11:45:37,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=834, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=1014, PETRI_TRANSITIONS=835} [2021-06-10 11:45:37,736 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 83 predicate places. [2021-06-10 11:45:37,736 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 835 transitions, 2150 flow [2021-06-10 11:45:37,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:37,736 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:37,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2015 [2021-06-10 11:45:37,736 INFO L428 AbstractCegarLoop]: === Iteration 122 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash -790905412, now seen corresponding path program 1 times [2021-06-10 11:45:37,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:37,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746619796] [2021-06-10 11:45:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:37,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:37,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:37,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:37,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:45:37,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746619796] [2021-06-10 11:45:37,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:37,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:37,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248945861] [2021-06-10 11:45:37,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:37,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:37,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:37,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:37,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 835 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:37,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:37,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:37,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:38,205 INFO L129 PetriNetUnfolder]: 12/1038 cut-off events. [2021-06-10 11:45:38,205 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:38,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 1038 events. 12/1038 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4755 event pairs, 0 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1348. Up to 36 conditions per place. [2021-06-10 11:45:38,262 INFO L132 encePairwiseOnDemand]: 997/1001 looper letters, 9 selfloop transitions, 3 changer transitions 0/836 dead transitions. [2021-06-10 11:45:38,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 836 transitions, 2176 flow [2021-06-10 11:45:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2021-06-10 11:45:38,264 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214119214119214 [2021-06-10 11:45:38,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2767 transitions. [2021-06-10 11:45:38,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2767 transitions. [2021-06-10 11:45:38,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:38,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2767 transitions. [2021-06-10 11:45:38,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 922.3333333333334) internal successors, (2767), 3 states have internal predecessors, (2767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,267 INFO L185 Difference]: Start difference. First operand has 1014 places, 835 transitions, 2150 flow. Second operand 3 states and 2767 transitions. [2021-06-10 11:45:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 836 transitions, 2176 flow [2021-06-10 11:45:38,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 836 transitions, 2175 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:38,276 INFO L241 Difference]: Finished difference. Result has 1017 places, 836 transitions, 2167 flow [2021-06-10 11:45:38,276 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2167, PETRI_PLACES=1017, PETRI_TRANSITIONS=836} [2021-06-10 11:45:38,276 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 86 predicate places. [2021-06-10 11:45:38,276 INFO L480 AbstractCegarLoop]: Abstraction has has 1017 places, 836 transitions, 2167 flow [2021-06-10 11:45:38,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:38,276 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:38,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2016 [2021-06-10 11:45:38,276 INFO L428 AbstractCegarLoop]: === Iteration 123 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -791858724, now seen corresponding path program 1 times [2021-06-10 11:45:38,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:38,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990333891] [2021-06-10 11:45:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:38,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:38,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:38,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:45:38,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990333891] [2021-06-10 11:45:38,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:38,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:38,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472430478] [2021-06-10 11:45:38,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:38,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:38,304 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 1001 [2021-06-10 11:45:38,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 836 transitions, 2167 flow. Second operand has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:38,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 1001 [2021-06-10 11:45:38,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:38,774 INFO L129 PetriNetUnfolder]: 12/1031 cut-off events. [2021-06-10 11:45:38,774 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:38,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1031 events. 12/1031 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4696 event pairs, 0 based on Foata normal form. 1/986 useless extension candidates. Maximal degree in co-relation 1334. Up to 36 conditions per place. [2021-06-10 11:45:38,837 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 5 selfloop transitions, 1 changer transitions 0/834 dead transitions. [2021-06-10 11:45:38,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 834 transitions, 2169 flow [2021-06-10 11:45:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2776 transitions. [2021-06-10 11:45:38,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9244089244089244 [2021-06-10 11:45:38,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2776 transitions. [2021-06-10 11:45:38,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2776 transitions. [2021-06-10 11:45:38,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:38,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2776 transitions. [2021-06-10 11:45:38,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 925.3333333333334) internal successors, (2776), 3 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,841 INFO L185 Difference]: Start difference. First operand has 1017 places, 836 transitions, 2167 flow. Second operand 3 states and 2776 transitions. [2021-06-10 11:45:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 834 transitions, 2169 flow [2021-06-10 11:45:38,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 834 transitions, 2161 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:38,851 INFO L241 Difference]: Finished difference. Result has 1017 places, 834 transitions, 2154 flow [2021-06-10 11:45:38,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2154, PETRI_PLACES=1017, PETRI_TRANSITIONS=834} [2021-06-10 11:45:38,851 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 86 predicate places. [2021-06-10 11:45:38,851 INFO L480 AbstractCegarLoop]: Abstraction has has 1017 places, 834 transitions, 2154 flow [2021-06-10 11:45:38,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:38,852 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:38,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2017 [2021-06-10 11:45:38,852 INFO L428 AbstractCegarLoop]: === Iteration 124 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash -791859747, now seen corresponding path program 1 times [2021-06-10 11:45:38,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:38,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951226725] [2021-06-10 11:45:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:38,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:38,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:38,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:38,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:45:38,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951226725] [2021-06-10 11:45:38,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:38,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:38,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955904154] [2021-06-10 11:45:38,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:38,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:38,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 1001 [2021-06-10 11:45:38,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 834 transitions, 2154 flow. Second operand has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:38,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:38,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 1001 [2021-06-10 11:45:38,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:39,333 INFO L129 PetriNetUnfolder]: 12/1029 cut-off events. [2021-06-10 11:45:39,333 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:39,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1029 events. 12/1029 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4682 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1338. Up to 36 conditions per place. [2021-06-10 11:45:39,394 INFO L132 encePairwiseOnDemand]: 999/1001 looper letters, 8 selfloop transitions, 1 changer transitions 0/832 dead transitions. [2021-06-10 11:45:39,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 832 transitions, 2167 flow [2021-06-10 11:45:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2764 transitions. [2021-06-10 11:45:39,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204129204129204 [2021-06-10 11:45:39,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2764 transitions. [2021-06-10 11:45:39,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2764 transitions. [2021-06-10 11:45:39,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:39,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2764 transitions. [2021-06-10 11:45:39,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 921.3333333333334) internal successors, (2764), 3 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:39,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:39,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1001.0) internal successors, (4004), 4 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:39,398 INFO L185 Difference]: Start difference. First operand has 1017 places, 834 transitions, 2154 flow. Second operand 3 states and 2764 transitions. [2021-06-10 11:45:39,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 832 transitions, 2167 flow [2021-06-10 11:45:39,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 832 transitions, 2166 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:39,407 INFO L241 Difference]: Finished difference. Result has 1016 places, 832 transitions, 2150 flow [2021-06-10 11:45:39,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1001, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=1016, PETRI_TRANSITIONS=832} [2021-06-10 11:45:39,408 INFO L343 CegarLoopForPetriNet]: 931 programPoint places, 85 predicate places. [2021-06-10 11:45:39,408 INFO L480 AbstractCegarLoop]: Abstraction has has 1016 places, 832 transitions, 2150 flow [2021-06-10 11:45:39,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 920.3333333333334) internal successors, (2761), 3 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:39,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:39,408 INFO L263 CegarLoopForPetriNet]: trace histogram [36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:39,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2018 [2021-06-10 11:45:39,408 INFO L428 AbstractCegarLoop]: === Iteration 125 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1741493368, now seen corresponding path program 1 times [2021-06-10 11:45:39,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:39,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662124861] [2021-06-10 11:45:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:45:39,428 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:45:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:45:39,435 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:45:39,455 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:45:39,456 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:45:39,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2019 [2021-06-10 11:45:39,456 WARN L342 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:45:39,456 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2021-06-10 11:45:39,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,518 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,519 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,527 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,528 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,529 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,530 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,531 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,532 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,533 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,539 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,541 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,542 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,548 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,549 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,557 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,558 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,560 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,563 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,564 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,565 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,566 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,567 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,572 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,585 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,591 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,600 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,601 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,607 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,611 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of36ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of36ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:45:39,638 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:45:39,638 INFO L253 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-06-10 11:45:39,639 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:45:39,639 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:45:39,639 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:45:39,639 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:45:39,639 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:45:39,639 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:45:39,639 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:45:39,639 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:45:39,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 957 places, 1029 transitions, 3498 flow [2021-06-10 11:45:40,147 INFO L129 PetriNetUnfolder]: 181/1352 cut-off events. [2021-06-10 11:45:40,147 INFO L130 PetriNetUnfolder]: For 8400/8400 co-relation queries the response was YES. [2021-06-10 11:45:40,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 1352 events. 181/1352 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5831 event pairs, 0 based on Foata normal form. 0/1098 useless extension candidates. Maximal degree in co-relation 2041. Up to 74 conditions per place. [2021-06-10 11:45:40,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 957 places, 1029 transitions, 3498 flow [2021-06-10 11:45:40,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 957 places, 1029 transitions, 3498 flow [2021-06-10 11:45:40,256 INFO L129 PetriNetUnfolder]: 10/104 cut-off events. [2021-06-10 11:45:40,256 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:45:40,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:40,256 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-06-10 11:45:40,256 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1017794722, now seen corresponding path program 1 times [2021-06-10 11:45:40,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:40,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484419851] [2021-06-10 11:45:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:40,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:40,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:40,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:45:40,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484419851] [2021-06-10 11:45:40,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:40,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:40,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285926597] [2021-06-10 11:45:40,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:40,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:40,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:40,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 1029 transitions, 3498 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:40,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:40,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:40,683 INFO L129 PetriNetUnfolder]: 106/1063 cut-off events. [2021-06-10 11:45:40,684 INFO L130 PetriNetUnfolder]: For 8401/8401 co-relation queries the response was YES. [2021-06-10 11:45:40,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1063 events. 106/1063 cut-off events. For 8401/8401 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4293 event pairs, 0 based on Foata normal form. 146/1065 useless extension candidates. Maximal degree in co-relation 1764. Up to 37 conditions per place. [2021-06-10 11:45:40,771 INFO L132 encePairwiseOnDemand]: 988/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/952 dead transitions. [2021-06-10 11:45:40,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 918 places, 952 transitions, 3358 flow [2021-06-10 11:45:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2931 transitions. [2021-06-10 11:45:40,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9494655004859086 [2021-06-10 11:45:40,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2931 transitions. [2021-06-10 11:45:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2931 transitions. [2021-06-10 11:45:40,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:40,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2931 transitions. [2021-06-10 11:45:40,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.0) internal successors, (2931), 3 states have internal predecessors, (2931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,776 INFO L185 Difference]: Start difference. First operand has 957 places, 1029 transitions, 3498 flow. Second operand 3 states and 2931 transitions. [2021-06-10 11:45:40,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 918 places, 952 transitions, 3358 flow [2021-06-10 11:45:40,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 952 transitions, 2098 flow, removed 630 selfloop flow, removed 0 redundant places. [2021-06-10 11:45:40,790 INFO L241 Difference]: Finished difference. Result has 920 places, 952 transitions, 2096 flow [2021-06-10 11:45:40,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=920, PETRI_TRANSITIONS=952} [2021-06-10 11:45:40,790 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -37 predicate places. [2021-06-10 11:45:40,790 INFO L480 AbstractCegarLoop]: Abstraction has has 920 places, 952 transitions, 2096 flow [2021-06-10 11:45:40,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:40,791 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-06-10 11:45:40,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2020 [2021-06-10 11:45:40,791 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:40,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1017793699, now seen corresponding path program 1 times [2021-06-10 11:45:40,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:40,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679873417] [2021-06-10 11:45:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:40,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:40,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:40,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:40,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:45:40,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679873417] [2021-06-10 11:45:40,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:40,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:40,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645241097] [2021-06-10 11:45:40,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:40,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:40,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:40,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 952 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:40,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:40,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:40,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:41,190 INFO L129 PetriNetUnfolder]: 106/1064 cut-off events. [2021-06-10 11:45:41,191 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:41,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 1064 events. 106/1064 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4303 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1172. Up to 37 conditions per place. [2021-06-10 11:45:41,274 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/953 dead transitions. [2021-06-10 11:45:41,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 953 transitions, 2122 flow [2021-06-10 11:45:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:45:41,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:45:41,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:45:41,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:45:41,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:41,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:45:41,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,279 INFO L185 Difference]: Start difference. First operand has 920 places, 952 transitions, 2096 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:45:41,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 953 transitions, 2122 flow [2021-06-10 11:45:41,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 953 transitions, 2120 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:41,288 INFO L241 Difference]: Finished difference. Result has 923 places, 953 transitions, 2112 flow [2021-06-10 11:45:41,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=923, PETRI_TRANSITIONS=953} [2021-06-10 11:45:41,289 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -34 predicate places. [2021-06-10 11:45:41,289 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 953 transitions, 2112 flow [2021-06-10 11:45:41,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,289 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:41,289 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-06-10 11:45:41,289 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2021 [2021-06-10 11:45:41,289 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1018748034, now seen corresponding path program 1 times [2021-06-10 11:45:41,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:41,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460455263] [2021-06-10 11:45:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:41,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:41,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:41,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:45:41,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460455263] [2021-06-10 11:45:41,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:41,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:41,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542160743] [2021-06-10 11:45:41,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:41,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:41,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:41,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 953 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:41,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:41,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:41,703 INFO L129 PetriNetUnfolder]: 105/1061 cut-off events. [2021-06-10 11:45:41,703 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-10 11:45:41,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 1061 events. 105/1061 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4280 event pairs, 0 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 1174. Up to 37 conditions per place. [2021-06-10 11:45:41,783 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 9 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2021-06-10 11:45:41,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 951 transitions, 2120 flow [2021-06-10 11:45:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2021-06-10 11:45:41,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212827988338192 [2021-06-10 11:45:41,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2844 transitions. [2021-06-10 11:45:41,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2844 transitions. [2021-06-10 11:45:41,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:41,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2844 transitions. [2021-06-10 11:45:41,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.0) internal successors, (2844), 3 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,787 INFO L185 Difference]: Start difference. First operand has 923 places, 953 transitions, 2112 flow. Second operand 3 states and 2844 transitions. [2021-06-10 11:45:41,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 951 transitions, 2120 flow [2021-06-10 11:45:41,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 951 transitions, 2119 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:41,796 INFO L241 Difference]: Finished difference. Result has 924 places, 951 transitions, 2101 flow [2021-06-10 11:45:41,796 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2101, PETRI_PLACES=924, PETRI_TRANSITIONS=951} [2021-06-10 11:45:41,796 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -33 predicate places. [2021-06-10 11:45:41,796 INFO L480 AbstractCegarLoop]: Abstraction has has 924 places, 951 transitions, 2101 flow [2021-06-10 11:45:41,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:41,796 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-06-10 11:45:41,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2022 [2021-06-10 11:45:41,796 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1018747011, now seen corresponding path program 1 times [2021-06-10 11:45:41,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:41,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229832328] [2021-06-10 11:45:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:41,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:41,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:41,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:41,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:45:41,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229832328] [2021-06-10 11:45:41,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:41,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:41,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420395944] [2021-06-10 11:45:41,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:41,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:41,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:41,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 951 transitions, 2101 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:41,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:41,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:41,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:42,202 INFO L129 PetriNetUnfolder]: 105/1058 cut-off events. [2021-06-10 11:45:42,202 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:42,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 1058 events. 105/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4264 event pairs, 0 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1169. Up to 37 conditions per place. [2021-06-10 11:45:42,258 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/948 dead transitions. [2021-06-10 11:45:42,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 948 transitions, 2102 flow [2021-06-10 11:45:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:42,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:42,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:42,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:42,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:42,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:42,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,263 INFO L185 Difference]: Start difference. First operand has 924 places, 951 transitions, 2101 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:42,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 948 transitions, 2102 flow [2021-06-10 11:45:42,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 948 transitions, 2097 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:42,271 INFO L241 Difference]: Finished difference. Result has 921 places, 948 transitions, 2087 flow [2021-06-10 11:45:42,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2087, PETRI_PLACES=921, PETRI_TRANSITIONS=948} [2021-06-10 11:45:42,271 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -36 predicate places. [2021-06-10 11:45:42,271 INFO L480 AbstractCegarLoop]: Abstraction has has 921 places, 948 transitions, 2087 flow [2021-06-10 11:45:42,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:42,271 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:42,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2023 [2021-06-10 11:45:42,271 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1856365197, now seen corresponding path program 1 times [2021-06-10 11:45:42,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:42,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274150715] [2021-06-10 11:45:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:42,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:42,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:42,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:45:42,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274150715] [2021-06-10 11:45:42,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:42,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:42,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783493582] [2021-06-10 11:45:42,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:42,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:42,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:42,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 948 transitions, 2087 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:42,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:42,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:42,676 INFO L129 PetriNetUnfolder]: 104/1065 cut-off events. [2021-06-10 11:45:42,677 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:42,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 1065 events. 104/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4322 event pairs, 0 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1179. Up to 37 conditions per place. [2021-06-10 11:45:42,755 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/949 dead transitions. [2021-06-10 11:45:42,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 949 transitions, 2103 flow [2021-06-10 11:45:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:42,757 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:42,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:42,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:42,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:42,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:42,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,760 INFO L185 Difference]: Start difference. First operand has 921 places, 948 transitions, 2087 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:42,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 949 transitions, 2103 flow [2021-06-10 11:45:42,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 949 transitions, 2102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:42,768 INFO L241 Difference]: Finished difference. Result has 923 places, 948 transitions, 2091 flow [2021-06-10 11:45:42,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2091, PETRI_PLACES=923, PETRI_TRANSITIONS=948} [2021-06-10 11:45:42,769 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -34 predicate places. [2021-06-10 11:45:42,769 INFO L480 AbstractCegarLoop]: Abstraction has has 923 places, 948 transitions, 2091 flow [2021-06-10 11:45:42,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:42,769 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:42,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2024 [2021-06-10 11:45:42,769 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1856366220, now seen corresponding path program 1 times [2021-06-10 11:45:42,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:42,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129489601] [2021-06-10 11:45:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:42,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:42,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:42,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:42,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:45:42,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129489601] [2021-06-10 11:45:42,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:42,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:42,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218936346] [2021-06-10 11:45:42,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:42,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:42,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:42,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 948 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:42,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:42,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:42,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:43,173 INFO L129 PetriNetUnfolder]: 102/1067 cut-off events. [2021-06-10 11:45:43,174 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:43,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1067 events. 102/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4358 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1188. Up to 37 conditions per place. [2021-06-10 11:45:43,254 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/949 dead transitions. [2021-06-10 11:45:43,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 949 transitions, 2117 flow [2021-06-10 11:45:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:45:43,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:45:43,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:45:43,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:45:43,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:43,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:45:43,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,259 INFO L185 Difference]: Start difference. First operand has 923 places, 948 transitions, 2091 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:45:43,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 949 transitions, 2117 flow [2021-06-10 11:45:43,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 949 transitions, 2116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:43,268 INFO L241 Difference]: Finished difference. Result has 926 places, 949 transitions, 2108 flow [2021-06-10 11:45:43,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=926, PETRI_TRANSITIONS=949} [2021-06-10 11:45:43,268 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -31 predicate places. [2021-06-10 11:45:43,268 INFO L480 AbstractCegarLoop]: Abstraction has has 926 places, 949 transitions, 2108 flow [2021-06-10 11:45:43,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:43,268 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:43,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2025 [2021-06-10 11:45:43,269 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:43,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1855412908, now seen corresponding path program 1 times [2021-06-10 11:45:43,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:43,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986228450] [2021-06-10 11:45:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:43,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:43,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:43,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:45:43,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986228450] [2021-06-10 11:45:43,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:43,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:43,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722836518] [2021-06-10 11:45:43,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:43,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:43,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:43,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 949 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:43,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:43,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:43,679 INFO L129 PetriNetUnfolder]: 102/1060 cut-off events. [2021-06-10 11:45:43,679 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:43,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 1060 events. 102/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4294 event pairs, 0 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 1173. Up to 37 conditions per place. [2021-06-10 11:45:43,766 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2021-06-10 11:45:43,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 947 transitions, 2110 flow [2021-06-10 11:45:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:43,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:43,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:43,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:43,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:43,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:43,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,771 INFO L185 Difference]: Start difference. First operand has 926 places, 949 transitions, 2108 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:43,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 947 transitions, 2110 flow [2021-06-10 11:45:43,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 947 transitions, 2102 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:43,780 INFO L241 Difference]: Finished difference. Result has 926 places, 947 transitions, 2095 flow [2021-06-10 11:45:43,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2095, PETRI_PLACES=926, PETRI_TRANSITIONS=947} [2021-06-10 11:45:43,780 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -31 predicate places. [2021-06-10 11:45:43,780 INFO L480 AbstractCegarLoop]: Abstraction has has 926 places, 947 transitions, 2095 flow [2021-06-10 11:45:43,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:43,781 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:43,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2026 [2021-06-10 11:45:43,781 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:43,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1855411885, now seen corresponding path program 1 times [2021-06-10 11:45:43,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:43,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522606183] [2021-06-10 11:45:43,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:43,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:43,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:43,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:43,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:45:43,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522606183] [2021-06-10 11:45:43,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:43,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:43,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006917854] [2021-06-10 11:45:43,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:43,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:43,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:43,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 926 places, 947 transitions, 2095 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:43,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:43,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:43,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:44,300 INFO L129 PetriNetUnfolder]: 102/1058 cut-off events. [2021-06-10 11:45:44,300 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:44,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 1058 events. 102/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4277 event pairs, 0 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1178. Up to 37 conditions per place. [2021-06-10 11:45:44,345 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/945 dead transitions. [2021-06-10 11:45:44,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 945 transitions, 2108 flow [2021-06-10 11:45:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:44,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:44,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:44,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:44,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:44,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:44,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,350 INFO L185 Difference]: Start difference. First operand has 926 places, 947 transitions, 2095 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:44,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 945 transitions, 2108 flow [2021-06-10 11:45:44,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 945 transitions, 2107 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:44,358 INFO L241 Difference]: Finished difference. Result has 925 places, 945 transitions, 2091 flow [2021-06-10 11:45:44,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2091, PETRI_PLACES=925, PETRI_TRANSITIONS=945} [2021-06-10 11:45:44,359 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -32 predicate places. [2021-06-10 11:45:44,359 INFO L480 AbstractCegarLoop]: Abstraction has has 925 places, 945 transitions, 2091 flow [2021-06-10 11:45:44,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:44,359 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:44,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2027 [2021-06-10 11:45:44,359 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1626979511, now seen corresponding path program 1 times [2021-06-10 11:45:44,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:44,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276617874] [2021-06-10 11:45:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:44,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:44,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:44,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:45:44,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276617874] [2021-06-10 11:45:44,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:44,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:44,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611817251] [2021-06-10 11:45:44,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:44,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:44,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:44,383 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:44,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 945 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:44,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:44,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:44,776 INFO L129 PetriNetUnfolder]: 100/1063 cut-off events. [2021-06-10 11:45:44,776 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:44,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 1063 events. 100/1063 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4330 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1181. Up to 37 conditions per place. [2021-06-10 11:45:44,855 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2021-06-10 11:45:44,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 946 transitions, 2107 flow [2021-06-10 11:45:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:44,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:44,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:44,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:44,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:44,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:44,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,860 INFO L185 Difference]: Start difference. First operand has 925 places, 945 transitions, 2091 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:44,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 946 transitions, 2107 flow [2021-06-10 11:45:44,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 946 transitions, 2106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:44,869 INFO L241 Difference]: Finished difference. Result has 928 places, 946 transitions, 2104 flow [2021-06-10 11:45:44,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=928, PETRI_TRANSITIONS=946} [2021-06-10 11:45:44,869 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -29 predicate places. [2021-06-10 11:45:44,869 INFO L480 AbstractCegarLoop]: Abstraction has has 928 places, 946 transitions, 2104 flow [2021-06-10 11:45:44,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:44,870 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:44,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2028 [2021-06-10 11:45:44,870 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:44,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1626978488, now seen corresponding path program 1 times [2021-06-10 11:45:44,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:44,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511031493] [2021-06-10 11:45:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:44,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:44,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:44,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:44,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:45:44,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511031493] [2021-06-10 11:45:44,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:44,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:44,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828086288] [2021-06-10 11:45:44,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:44,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:44,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:44,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 946 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:44,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:44,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:44,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:45,286 INFO L129 PetriNetUnfolder]: 100/1064 cut-off events. [2021-06-10 11:45:45,286 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:45:45,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1064 events. 100/1064 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4339 event pairs, 0 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1189. Up to 37 conditions per place. [2021-06-10 11:45:45,365 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/947 dead transitions. [2021-06-10 11:45:45,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 947 transitions, 2130 flow [2021-06-10 11:45:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:45:45,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:45:45,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:45:45,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:45:45,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:45,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:45:45,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,370 INFO L185 Difference]: Start difference. First operand has 928 places, 946 transitions, 2104 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:45:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 947 transitions, 2130 flow [2021-06-10 11:45:45,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 947 transitions, 2128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:45,379 INFO L241 Difference]: Finished difference. Result has 931 places, 947 transitions, 2120 flow [2021-06-10 11:45:45,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=931, PETRI_TRANSITIONS=947} [2021-06-10 11:45:45,379 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -26 predicate places. [2021-06-10 11:45:45,379 INFO L480 AbstractCegarLoop]: Abstraction has has 931 places, 947 transitions, 2120 flow [2021-06-10 11:45:45,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:45,379 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:45,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2029 [2021-06-10 11:45:45,380 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1627931800, now seen corresponding path program 1 times [2021-06-10 11:45:45,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:45,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907425716] [2021-06-10 11:45:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:45,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:45,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:45,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:45:45,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907425716] [2021-06-10 11:45:45,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:45,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:45,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727006366] [2021-06-10 11:45:45,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:45,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:45,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:45,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 947 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:45,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:45,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:45,777 INFO L129 PetriNetUnfolder]: 99/1060 cut-off events. [2021-06-10 11:45:45,777 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:45,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1060 events. 99/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4313 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1182. Up to 37 conditions per place. [2021-06-10 11:45:45,856 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/944 dead transitions. [2021-06-10 11:45:45,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 944 transitions, 2117 flow [2021-06-10 11:45:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:45,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:45,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:45,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:45,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:45,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:45,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,860 INFO L185 Difference]: Start difference. First operand has 931 places, 947 transitions, 2120 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:45,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 944 transitions, 2117 flow [2021-06-10 11:45:45,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 944 transitions, 2109 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:45,869 INFO L241 Difference]: Finished difference. Result has 930 places, 944 transitions, 2099 flow [2021-06-10 11:45:45,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2099, PETRI_PLACES=930, PETRI_TRANSITIONS=944} [2021-06-10 11:45:45,869 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -27 predicate places. [2021-06-10 11:45:45,869 INFO L480 AbstractCegarLoop]: Abstraction has has 930 places, 944 transitions, 2099 flow [2021-06-10 11:45:45,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:45,870 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:45,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2030 [2021-06-10 11:45:45,870 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:45,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1627932823, now seen corresponding path program 1 times [2021-06-10 11:45:45,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:45,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440396095] [2021-06-10 11:45:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:45,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:45,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:45,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:45,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:45:45,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440396095] [2021-06-10 11:45:45,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:45,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:45,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276465547] [2021-06-10 11:45:45,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:45,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:45,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 944 transitions, 2099 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:45,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:45,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:45,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:46,273 INFO L129 PetriNetUnfolder]: 99/1058 cut-off events. [2021-06-10 11:45:46,274 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:46,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1058 events. 99/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4299 event pairs, 0 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1185. Up to 37 conditions per place. [2021-06-10 11:45:46,351 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/942 dead transitions. [2021-06-10 11:45:46,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 942 transitions, 2112 flow [2021-06-10 11:45:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:46,353 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:46,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:46,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:46,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:46,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:46,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,356 INFO L185 Difference]: Start difference. First operand has 930 places, 944 transitions, 2099 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 942 transitions, 2112 flow [2021-06-10 11:45:46,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 942 transitions, 2111 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:46,364 INFO L241 Difference]: Finished difference. Result has 929 places, 942 transitions, 2095 flow [2021-06-10 11:45:46,365 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2095, PETRI_PLACES=929, PETRI_TRANSITIONS=942} [2021-06-10 11:45:46,365 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -28 predicate places. [2021-06-10 11:45:46,365 INFO L480 AbstractCegarLoop]: Abstraction has has 929 places, 942 transitions, 2095 flow [2021-06-10 11:45:46,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,365 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:46,365 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:46,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2031 [2021-06-10 11:45:46,365 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash -805998045, now seen corresponding path program 1 times [2021-06-10 11:45:46,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:46,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604516475] [2021-06-10 11:45:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:46,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:46,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:46,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:45:46,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604516475] [2021-06-10 11:45:46,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:46,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:46,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032604180] [2021-06-10 11:45:46,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:46,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:46,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:46,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:46,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 942 transitions, 2095 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:46,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:46,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:46,815 INFO L129 PetriNetUnfolder]: 98/1066 cut-off events. [2021-06-10 11:45:46,816 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:46,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 1066 events. 98/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4366 event pairs, 0 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1197. Up to 37 conditions per place. [2021-06-10 11:45:46,897 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/944 dead transitions. [2021-06-10 11:45:46,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 944 transitions, 2125 flow [2021-06-10 11:45:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:45:46,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:45:46,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:45:46,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:45:46,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:46,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:45:46,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,901 INFO L185 Difference]: Start difference. First operand has 929 places, 942 transitions, 2095 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:45:46,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 944 transitions, 2125 flow [2021-06-10 11:45:46,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 944 transitions, 2124 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:46,910 INFO L241 Difference]: Finished difference. Result has 932 places, 944 transitions, 2118 flow [2021-06-10 11:45:46,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=932, PETRI_TRANSITIONS=944} [2021-06-10 11:45:46,910 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -25 predicate places. [2021-06-10 11:45:46,910 INFO L480 AbstractCegarLoop]: Abstraction has has 932 places, 944 transitions, 2118 flow [2021-06-10 11:45:46,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:46,911 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:46,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2032 [2021-06-10 11:45:46,911 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -805999068, now seen corresponding path program 1 times [2021-06-10 11:45:46,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:46,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32336010] [2021-06-10 11:45:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:46,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:46,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:46,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:46,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:45:46,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32336010] [2021-06-10 11:45:46,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:46,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:46,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371307989] [2021-06-10 11:45:46,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:46,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:46,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:46,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 944 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:46,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:46,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:46,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:47,328 INFO L129 PetriNetUnfolder]: 96/1067 cut-off events. [2021-06-10 11:45:47,328 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:47,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 1067 events. 96/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4392 event pairs, 0 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1197. Up to 37 conditions per place. [2021-06-10 11:45:47,405 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/944 dead transitions. [2021-06-10 11:45:47,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 944 transitions, 2130 flow [2021-06-10 11:45:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:47,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:47,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:47,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:47,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:47,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:47,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,410 INFO L185 Difference]: Start difference. First operand has 932 places, 944 transitions, 2118 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:47,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 944 transitions, 2130 flow [2021-06-10 11:45:47,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 944 transitions, 2125 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:47,419 INFO L241 Difference]: Finished difference. Result has 934 places, 943 transitions, 2114 flow [2021-06-10 11:45:47,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=934, PETRI_TRANSITIONS=943} [2021-06-10 11:45:47,419 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -23 predicate places. [2021-06-10 11:45:47,419 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 2114 flow [2021-06-10 11:45:47,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:47,420 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:47,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2033 [2021-06-10 11:45:47,420 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash -806951357, now seen corresponding path program 1 times [2021-06-10 11:45:47,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:47,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909847317] [2021-06-10 11:45:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:47,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:47,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:47,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:45:47,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909847317] [2021-06-10 11:45:47,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:47,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:47,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523226455] [2021-06-10 11:45:47,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:47,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:47,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:47,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:47,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:47,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:47,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:47,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:47,822 INFO L129 PetriNetUnfolder]: 96/1060 cut-off events. [2021-06-10 11:45:47,822 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:47,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1060 events. 96/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4330 event pairs, 0 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 1191. Up to 37 conditions per place. [2021-06-10 11:45:47,900 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/941 dead transitions. [2021-06-10 11:45:47,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 941 transitions, 2117 flow [2021-06-10 11:45:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:47,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:47,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:47,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:47,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:47,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,905 INFO L185 Difference]: Start difference. First operand has 934 places, 943 transitions, 2114 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 941 transitions, 2117 flow [2021-06-10 11:45:47,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 941 transitions, 2110 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:47,913 INFO L241 Difference]: Finished difference. Result has 934 places, 941 transitions, 2103 flow [2021-06-10 11:45:47,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2103, PETRI_PLACES=934, PETRI_TRANSITIONS=941} [2021-06-10 11:45:47,914 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -23 predicate places. [2021-06-10 11:45:47,914 INFO L480 AbstractCegarLoop]: Abstraction has has 934 places, 941 transitions, 2103 flow [2021-06-10 11:45:47,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:47,914 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:47,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2034 [2021-06-10 11:45:47,914 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash -806952380, now seen corresponding path program 1 times [2021-06-10 11:45:47,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:47,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937418528] [2021-06-10 11:45:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:47,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:47,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:47,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:47,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:45:47,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937418528] [2021-06-10 11:45:47,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:47,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:47,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724813620] [2021-06-10 11:45:47,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:47,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:47,936 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:47,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 941 transitions, 2103 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:47,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:47,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:47,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:48,318 INFO L129 PetriNetUnfolder]: 96/1058 cut-off events. [2021-06-10 11:45:48,318 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:48,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 1058 events. 96/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4316 event pairs, 0 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1191. Up to 37 conditions per place. [2021-06-10 11:45:48,394 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/939 dead transitions. [2021-06-10 11:45:48,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 939 transitions, 2116 flow [2021-06-10 11:45:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:48,396 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:48,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:48,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:48,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:48,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:48,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,399 INFO L185 Difference]: Start difference. First operand has 934 places, 941 transitions, 2103 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:48,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 939 transitions, 2116 flow [2021-06-10 11:45:48,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 939 transitions, 2115 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:48,407 INFO L241 Difference]: Finished difference. Result has 933 places, 939 transitions, 2099 flow [2021-06-10 11:45:48,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2099, PETRI_PLACES=933, PETRI_TRANSITIONS=939} [2021-06-10 11:45:48,407 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -24 predicate places. [2021-06-10 11:45:48,408 INFO L480 AbstractCegarLoop]: Abstraction has has 933 places, 939 transitions, 2099 flow [2021-06-10 11:45:48,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:48,408 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:48,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2035 [2021-06-10 11:45:48,408 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1101108048, now seen corresponding path program 1 times [2021-06-10 11:45:48,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:48,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450553202] [2021-06-10 11:45:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:48,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:48,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:48,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:45:48,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450553202] [2021-06-10 11:45:48,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:48,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:48,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070512910] [2021-06-10 11:45:48,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:48,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:48,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:48,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:48,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:48,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 939 transitions, 2099 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:48,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:48,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:48,814 INFO L129 PetriNetUnfolder]: 95/1066 cut-off events. [2021-06-10 11:45:48,815 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:48,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 1066 events. 95/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4384 event pairs, 0 based on Foata normal form. 0/934 useless extension candidates. Maximal degree in co-relation 1203. Up to 37 conditions per place. [2021-06-10 11:45:48,881 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/941 dead transitions. [2021-06-10 11:45:48,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 941 transitions, 2129 flow [2021-06-10 11:45:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:45:48,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:45:48,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:45:48,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:45:48,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:48,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:45:48,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,885 INFO L185 Difference]: Start difference. First operand has 933 places, 939 transitions, 2099 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:45:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 941 transitions, 2129 flow [2021-06-10 11:45:48,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 941 transitions, 2128 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:48,893 INFO L241 Difference]: Finished difference. Result has 936 places, 941 transitions, 2122 flow [2021-06-10 11:45:48,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=936, PETRI_TRANSITIONS=941} [2021-06-10 11:45:48,894 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -21 predicate places. [2021-06-10 11:45:48,894 INFO L480 AbstractCegarLoop]: Abstraction has has 936 places, 941 transitions, 2122 flow [2021-06-10 11:45:48,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:48,894 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:48,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2036 [2021-06-10 11:45:48,894 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1101109071, now seen corresponding path program 1 times [2021-06-10 11:45:48,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:48,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756728598] [2021-06-10 11:45:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:48,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:48,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:48,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:48,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:45:48,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756728598] [2021-06-10 11:45:48,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:48,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:48,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140478092] [2021-06-10 11:45:48,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:48,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:48,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:48,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 941 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:48,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:48,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:48,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:49,298 INFO L129 PetriNetUnfolder]: 93/1067 cut-off events. [2021-06-10 11:45:49,298 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:49,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1067 events. 93/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4406 event pairs, 0 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1203. Up to 37 conditions per place. [2021-06-10 11:45:49,377 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/941 dead transitions. [2021-06-10 11:45:49,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 941 transitions, 2134 flow [2021-06-10 11:45:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:49,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:49,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:49,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:49,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:49,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:49,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,382 INFO L185 Difference]: Start difference. First operand has 936 places, 941 transitions, 2122 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:49,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 941 transitions, 2134 flow [2021-06-10 11:45:49,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 941 transitions, 2129 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:49,391 INFO L241 Difference]: Finished difference. Result has 938 places, 940 transitions, 2118 flow [2021-06-10 11:45:49,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=938, PETRI_TRANSITIONS=940} [2021-06-10 11:45:49,391 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -19 predicate places. [2021-06-10 11:45:49,391 INFO L480 AbstractCegarLoop]: Abstraction has has 938 places, 940 transitions, 2118 flow [2021-06-10 11:45:49,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,392 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:49,392 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:49,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2037 [2021-06-10 11:45:49,392 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1102061360, now seen corresponding path program 1 times [2021-06-10 11:45:49,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:49,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380573460] [2021-06-10 11:45:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:49,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:49,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:49,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:45:49,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380573460] [2021-06-10 11:45:49,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:49,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:49,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248656996] [2021-06-10 11:45:49,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:49,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:49,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:49,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:49,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 940 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:49,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:49,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:49,811 INFO L129 PetriNetUnfolder]: 93/1060 cut-off events. [2021-06-10 11:45:49,811 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:49,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1060 events. 93/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4346 event pairs, 0 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 1197. Up to 37 conditions per place. [2021-06-10 11:45:49,887 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/938 dead transitions. [2021-06-10 11:45:49,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 938 transitions, 2121 flow [2021-06-10 11:45:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:49,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:49,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:49,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:49,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:49,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:49,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,892 INFO L185 Difference]: Start difference. First operand has 938 places, 940 transitions, 2118 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 938 transitions, 2121 flow [2021-06-10 11:45:49,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 938 transitions, 2114 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:49,901 INFO L241 Difference]: Finished difference. Result has 938 places, 938 transitions, 2107 flow [2021-06-10 11:45:49,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=938, PETRI_TRANSITIONS=938} [2021-06-10 11:45:49,901 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -19 predicate places. [2021-06-10 11:45:49,901 INFO L480 AbstractCegarLoop]: Abstraction has has 938 places, 938 transitions, 2107 flow [2021-06-10 11:45:49,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:49,902 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:49,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2038 [2021-06-10 11:45:49,902 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1102062383, now seen corresponding path program 1 times [2021-06-10 11:45:49,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:49,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446541498] [2021-06-10 11:45:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:49,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:49,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:49,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:49,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:45:49,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446541498] [2021-06-10 11:45:49,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:49,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:49,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769856138] [2021-06-10 11:45:49,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:49,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:49,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:49,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 938 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:49,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:49,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:49,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:50,307 INFO L129 PetriNetUnfolder]: 93/1058 cut-off events. [2021-06-10 11:45:50,307 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:50,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 1058 events. 93/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4330 event pairs, 0 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1197. Up to 37 conditions per place. [2021-06-10 11:45:50,389 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2021-06-10 11:45:50,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 936 transitions, 2120 flow [2021-06-10 11:45:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:50,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:50,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:50,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:50,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:50,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:50,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,394 INFO L185 Difference]: Start difference. First operand has 938 places, 938 transitions, 2107 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 936 transitions, 2120 flow [2021-06-10 11:45:50,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 936 transitions, 2119 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:50,402 INFO L241 Difference]: Finished difference. Result has 937 places, 936 transitions, 2103 flow [2021-06-10 11:45:50,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2103, PETRI_PLACES=937, PETRI_TRANSITIONS=936} [2021-06-10 11:45:50,403 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -20 predicate places. [2021-06-10 11:45:50,403 INFO L480 AbstractCegarLoop]: Abstraction has has 937 places, 936 transitions, 2103 flow [2021-06-10 11:45:50,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:50,403 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:50,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2039 [2021-06-10 11:45:50,403 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1334725953, now seen corresponding path program 1 times [2021-06-10 11:45:50,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:50,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724674146] [2021-06-10 11:45:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:50,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:50,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:50,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:45:50,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724674146] [2021-06-10 11:45:50,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:50,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:50,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998948897] [2021-06-10 11:45:50,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:50,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:50,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:50,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 936 transitions, 2103 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:50,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:50,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:50,810 INFO L129 PetriNetUnfolder]: 92/1065 cut-off events. [2021-06-10 11:45:50,810 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:50,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 1065 events. 92/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4390 event pairs, 0 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1202. Up to 37 conditions per place. [2021-06-10 11:45:50,866 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/937 dead transitions. [2021-06-10 11:45:50,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 937 transitions, 2119 flow [2021-06-10 11:45:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:50,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:50,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:50,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:50,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:50,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:50,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,871 INFO L185 Difference]: Start difference. First operand has 937 places, 936 transitions, 2103 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:50,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 937 transitions, 2119 flow [2021-06-10 11:45:50,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 937 transitions, 2118 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:50,879 INFO L241 Difference]: Finished difference. Result has 939 places, 936 transitions, 2107 flow [2021-06-10 11:45:50,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=939, PETRI_TRANSITIONS=936} [2021-06-10 11:45:50,879 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -18 predicate places. [2021-06-10 11:45:50,879 INFO L480 AbstractCegarLoop]: Abstraction has has 939 places, 936 transitions, 2107 flow [2021-06-10 11:45:50,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:50,880 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:50,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2040 [2021-06-10 11:45:50,880 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1334724930, now seen corresponding path program 1 times [2021-06-10 11:45:50,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:50,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797215452] [2021-06-10 11:45:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:50,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:50,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:50,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:50,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:45:50,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797215452] [2021-06-10 11:45:50,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:50,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:50,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549773331] [2021-06-10 11:45:50,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:50,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:50,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:50,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 936 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:50,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:50,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:50,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:51,296 INFO L129 PetriNetUnfolder]: 90/1067 cut-off events. [2021-06-10 11:45:51,296 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:51,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1067 events. 90/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4425 event pairs, 0 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1213. Up to 37 conditions per place. [2021-06-10 11:45:51,373 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/937 dead transitions. [2021-06-10 11:45:51,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 937 transitions, 2133 flow [2021-06-10 11:45:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:45:51,375 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:45:51,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:45:51,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:45:51,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:51,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:45:51,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,378 INFO L185 Difference]: Start difference. First operand has 939 places, 936 transitions, 2107 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:45:51,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 937 transitions, 2133 flow [2021-06-10 11:45:51,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 937 transitions, 2132 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:51,387 INFO L241 Difference]: Finished difference. Result has 942 places, 937 transitions, 2124 flow [2021-06-10 11:45:51,387 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=942, PETRI_TRANSITIONS=937} [2021-06-10 11:45:51,387 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -15 predicate places. [2021-06-10 11:45:51,387 INFO L480 AbstractCegarLoop]: Abstraction has has 942 places, 937 transitions, 2124 flow [2021-06-10 11:45:51,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:51,388 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:51,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2041 [2021-06-10 11:45:51,388 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:51,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1335678242, now seen corresponding path program 1 times [2021-06-10 11:45:51,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:51,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387781831] [2021-06-10 11:45:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:51,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:51,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:51,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:45:51,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387781831] [2021-06-10 11:45:51,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:51,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:51,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275713278] [2021-06-10 11:45:51,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:51,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:51,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:51,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:51,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 937 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:51,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:51,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:51,794 INFO L129 PetriNetUnfolder]: 90/1060 cut-off events. [2021-06-10 11:45:51,794 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:51,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 1060 events. 90/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4366 event pairs, 0 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 1199. Up to 37 conditions per place. [2021-06-10 11:45:51,876 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/935 dead transitions. [2021-06-10 11:45:51,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 935 transitions, 2126 flow [2021-06-10 11:45:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:51,877 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:51,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:51,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:51,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:51,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:51,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,880 INFO L185 Difference]: Start difference. First operand has 942 places, 937 transitions, 2124 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:51,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 935 transitions, 2126 flow [2021-06-10 11:45:51,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 935 transitions, 2118 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:51,889 INFO L241 Difference]: Finished difference. Result has 942 places, 935 transitions, 2111 flow [2021-06-10 11:45:51,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=942, PETRI_TRANSITIONS=935} [2021-06-10 11:45:51,889 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -15 predicate places. [2021-06-10 11:45:51,889 INFO L480 AbstractCegarLoop]: Abstraction has has 942 places, 935 transitions, 2111 flow [2021-06-10 11:45:51,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:51,890 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:51,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2042 [2021-06-10 11:45:51,890 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1335679265, now seen corresponding path program 1 times [2021-06-10 11:45:51,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:51,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215044567] [2021-06-10 11:45:51,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:51,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:51,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:51,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:51,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:45:51,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215044567] [2021-06-10 11:45:51,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:51,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:51,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90909115] [2021-06-10 11:45:51,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:51,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:51,912 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:51,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 935 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:51,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:51,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:51,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:52,310 INFO L129 PetriNetUnfolder]: 90/1058 cut-off events. [2021-06-10 11:45:52,310 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:52,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 1058 events. 90/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4351 event pairs, 0 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1203. Up to 37 conditions per place. [2021-06-10 11:45:52,388 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/933 dead transitions. [2021-06-10 11:45:52,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 933 transitions, 2124 flow [2021-06-10 11:45:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:52,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:52,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:52,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:52,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:52,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:52,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,392 INFO L185 Difference]: Start difference. First operand has 942 places, 935 transitions, 2111 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 933 transitions, 2124 flow [2021-06-10 11:45:52,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 933 transitions, 2123 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:52,401 INFO L241 Difference]: Finished difference. Result has 941 places, 933 transitions, 2107 flow [2021-06-10 11:45:52,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=941, PETRI_TRANSITIONS=933} [2021-06-10 11:45:52,402 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -16 predicate places. [2021-06-10 11:45:52,402 INFO L480 AbstractCegarLoop]: Abstraction has has 941 places, 933 transitions, 2107 flow [2021-06-10 11:45:52,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:52,402 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:52,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2043 [2021-06-10 11:45:52,402 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1733219346, now seen corresponding path program 1 times [2021-06-10 11:45:52,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:52,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104112373] [2021-06-10 11:45:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:52,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:52,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:52,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:45:52,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104112373] [2021-06-10 11:45:52,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:52,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:52,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40740809] [2021-06-10 11:45:52,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:52,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:52,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:52,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 933 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:52,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:52,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:52,854 INFO L129 PetriNetUnfolder]: 89/1066 cut-off events. [2021-06-10 11:45:52,854 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:52,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1066 events. 89/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4419 event pairs, 0 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1215. Up to 37 conditions per place. [2021-06-10 11:45:52,907 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/935 dead transitions. [2021-06-10 11:45:52,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 935 transitions, 2137 flow [2021-06-10 11:45:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:45:52,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:45:52,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:45:52,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:45:52,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:52,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:45:52,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,911 INFO L185 Difference]: Start difference. First operand has 941 places, 933 transitions, 2107 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:45:52,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 935 transitions, 2137 flow [2021-06-10 11:45:52,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 935 transitions, 2136 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:52,920 INFO L241 Difference]: Finished difference. Result has 944 places, 935 transitions, 2130 flow [2021-06-10 11:45:52,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=944, PETRI_TRANSITIONS=935} [2021-06-10 11:45:52,920 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -13 predicate places. [2021-06-10 11:45:52,920 INFO L480 AbstractCegarLoop]: Abstraction has has 944 places, 935 transitions, 2130 flow [2021-06-10 11:45:52,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:52,920 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:52,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2044 [2021-06-10 11:45:52,920 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1733218323, now seen corresponding path program 1 times [2021-06-10 11:45:52,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:52,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45552654] [2021-06-10 11:45:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:52,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:52,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:52,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:52,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:45:52,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45552654] [2021-06-10 11:45:52,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:52,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:52,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597870291] [2021-06-10 11:45:52,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:52,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:52,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:52,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 935 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:52,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:52,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:52,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:53,333 INFO L129 PetriNetUnfolder]: 88/1064 cut-off events. [2021-06-10 11:45:53,333 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:53,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1064 events. 88/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4409 event pairs, 0 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1212. Up to 37 conditions per place. [2021-06-10 11:45:53,409 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/935 dead transitions. [2021-06-10 11:45:53,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 935 transitions, 2142 flow [2021-06-10 11:45:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:53,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:53,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:53,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:53,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:53,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:53,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,413 INFO L185 Difference]: Start difference. First operand has 944 places, 935 transitions, 2130 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:53,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 935 transitions, 2142 flow [2021-06-10 11:45:53,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 935 transitions, 2137 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:53,422 INFO L241 Difference]: Finished difference. Result has 947 places, 935 transitions, 2135 flow [2021-06-10 11:45:53,422 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=947, PETRI_TRANSITIONS=935} [2021-06-10 11:45:53,422 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -10 predicate places. [2021-06-10 11:45:53,422 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 935 transitions, 2135 flow [2021-06-10 11:45:53,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:53,422 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:53,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2045 [2021-06-10 11:45:53,423 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1732266034, now seen corresponding path program 1 times [2021-06-10 11:45:53,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:53,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060999638] [2021-06-10 11:45:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:53,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:53,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:53,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:45:53,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060999638] [2021-06-10 11:45:53,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:53,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:53,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755729249] [2021-06-10 11:45:53,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:53,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:53,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:53,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:53,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:53,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 935 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:53,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:53,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:53,830 INFO L129 PetriNetUnfolder]: 87/1060 cut-off events. [2021-06-10 11:45:53,831 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:45:53,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1060 events. 87/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4382 event pairs, 0 based on Foata normal form. 1/939 useless extension candidates. Maximal degree in co-relation 1209. Up to 37 conditions per place. [2021-06-10 11:45:53,905 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/932 dead transitions. [2021-06-10 11:45:53,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 932 transitions, 2132 flow [2021-06-10 11:45:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:53,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:53,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:53,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:53,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:53,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:53,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,910 INFO L185 Difference]: Start difference. First operand has 947 places, 935 transitions, 2135 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:53,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 932 transitions, 2132 flow [2021-06-10 11:45:53,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 932 transitions, 2125 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:53,919 INFO L241 Difference]: Finished difference. Result has 946 places, 932 transitions, 2115 flow [2021-06-10 11:45:53,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=946, PETRI_TRANSITIONS=932} [2021-06-10 11:45:53,920 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -11 predicate places. [2021-06-10 11:45:53,920 INFO L480 AbstractCegarLoop]: Abstraction has has 946 places, 932 transitions, 2115 flow [2021-06-10 11:45:53,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:53,920 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:53,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2046 [2021-06-10 11:45:53,920 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1732265011, now seen corresponding path program 1 times [2021-06-10 11:45:53,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:53,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163650948] [2021-06-10 11:45:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:53,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:53,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:53,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:53,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:45:53,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163650948] [2021-06-10 11:45:53,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:53,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:53,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651331355] [2021-06-10 11:45:53,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:53,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:53,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:53,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 932 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:53,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:53,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:53,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:54,335 INFO L129 PetriNetUnfolder]: 87/1058 cut-off events. [2021-06-10 11:45:54,335 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:54,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 1058 events. 87/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4369 event pairs, 0 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1210. Up to 37 conditions per place. [2021-06-10 11:45:54,410 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/930 dead transitions. [2021-06-10 11:45:54,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 930 transitions, 2128 flow [2021-06-10 11:45:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:54,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:54,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:54,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:54,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:54,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:54,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,415 INFO L185 Difference]: Start difference. First operand has 946 places, 932 transitions, 2115 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:54,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 930 transitions, 2128 flow [2021-06-10 11:45:54,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 930 transitions, 2127 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:54,424 INFO L241 Difference]: Finished difference. Result has 945 places, 930 transitions, 2111 flow [2021-06-10 11:45:54,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=945, PETRI_TRANSITIONS=930} [2021-06-10 11:45:54,424 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -12 predicate places. [2021-06-10 11:45:54,424 INFO L480 AbstractCegarLoop]: Abstraction has has 945 places, 930 transitions, 2111 flow [2021-06-10 11:45:54,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:54,424 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:54,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2047 [2021-06-10 11:45:54,425 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1554242910, now seen corresponding path program 1 times [2021-06-10 11:45:54,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:54,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195107499] [2021-06-10 11:45:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:54,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:54,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:54,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:45:54,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195107499] [2021-06-10 11:45:54,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:54,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:54,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537766911] [2021-06-10 11:45:54,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:54,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:54,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:54,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:54,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 945 places, 930 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:54,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:54,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:54,888 INFO L129 PetriNetUnfolder]: 86/1065 cut-off events. [2021-06-10 11:45:54,889 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:54,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1065 events. 86/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4430 event pairs, 0 based on Foata normal form. 0/942 useless extension candidates. Maximal degree in co-relation 1215. Up to 37 conditions per place. [2021-06-10 11:45:54,936 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/931 dead transitions. [2021-06-10 11:45:54,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 931 transitions, 2127 flow [2021-06-10 11:45:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:54,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:54,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:54,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:54,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,941 INFO L185 Difference]: Start difference. First operand has 945 places, 930 transitions, 2111 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 931 transitions, 2127 flow [2021-06-10 11:45:54,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 931 transitions, 2126 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:54,949 INFO L241 Difference]: Finished difference. Result has 947 places, 930 transitions, 2115 flow [2021-06-10 11:45:54,950 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=947, PETRI_TRANSITIONS=930} [2021-06-10 11:45:54,950 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -10 predicate places. [2021-06-10 11:45:54,950 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 930 transitions, 2115 flow [2021-06-10 11:45:54,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:54,950 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:54,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2048 [2021-06-10 11:45:54,950 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1554243933, now seen corresponding path program 1 times [2021-06-10 11:45:54,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:54,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039491357] [2021-06-10 11:45:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:54,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:54,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:54,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:54,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:45:54,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039491357] [2021-06-10 11:45:54,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:54,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:54,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685631395] [2021-06-10 11:45:54,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:54,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:54,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:54,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:54,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 930 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:54,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:54,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:54,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:55,384 INFO L129 PetriNetUnfolder]: 84/1067 cut-off events. [2021-06-10 11:45:55,384 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:55,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1067 events. 84/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4465 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1226. Up to 37 conditions per place. [2021-06-10 11:45:55,462 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/931 dead transitions. [2021-06-10 11:45:55,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 931 transitions, 2141 flow [2021-06-10 11:45:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:45:55,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:45:55,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:45:55,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:45:55,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:55,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:45:55,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,466 INFO L185 Difference]: Start difference. First operand has 947 places, 930 transitions, 2115 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:45:55,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 931 transitions, 2141 flow [2021-06-10 11:45:55,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 931 transitions, 2140 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:55,475 INFO L241 Difference]: Finished difference. Result has 950 places, 931 transitions, 2132 flow [2021-06-10 11:45:55,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=950, PETRI_TRANSITIONS=931} [2021-06-10 11:45:55,476 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -7 predicate places. [2021-06-10 11:45:55,476 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 931 transitions, 2132 flow [2021-06-10 11:45:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:55,476 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:55,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2049 [2021-06-10 11:45:55,476 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1553290621, now seen corresponding path program 1 times [2021-06-10 11:45:55,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:55,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040581370] [2021-06-10 11:45:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:55,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:55,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:55,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:55,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:55,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:55,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:45:55,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040581370] [2021-06-10 11:45:55,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:55,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:55,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773476129] [2021-06-10 11:45:55,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:55,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:55,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:55,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 931 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:55,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:55,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:55,891 INFO L129 PetriNetUnfolder]: 84/1060 cut-off events. [2021-06-10 11:45:55,891 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:55,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1060 events. 84/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4402 event pairs, 0 based on Foata normal form. 1/942 useless extension candidates. Maximal degree in co-relation 1212. Up to 37 conditions per place. [2021-06-10 11:45:55,966 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/929 dead transitions. [2021-06-10 11:45:55,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 929 transitions, 2134 flow [2021-06-10 11:45:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:55,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:55,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:55,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:55,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:55,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:55,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,970 INFO L185 Difference]: Start difference. First operand has 950 places, 931 transitions, 2132 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:55,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 929 transitions, 2134 flow [2021-06-10 11:45:55,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 949 places, 929 transitions, 2126 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:55,979 INFO L241 Difference]: Finished difference. Result has 950 places, 929 transitions, 2119 flow [2021-06-10 11:45:55,979 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=947, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2119, PETRI_PLACES=950, PETRI_TRANSITIONS=929} [2021-06-10 11:45:55,979 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -7 predicate places. [2021-06-10 11:45:55,979 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 929 transitions, 2119 flow [2021-06-10 11:45:55,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:55,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:55,980 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:55,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2050 [2021-06-10 11:45:55,980 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1553289598, now seen corresponding path program 1 times [2021-06-10 11:45:55,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:55,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956644181] [2021-06-10 11:45:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:55,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:55,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:55,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:55,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:56,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:56,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:45:56,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956644181] [2021-06-10 11:45:56,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:56,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:56,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115106271] [2021-06-10 11:45:56,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:56,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:56,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:56,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 929 transitions, 2119 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:56,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:56,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:56,396 INFO L129 PetriNetUnfolder]: 84/1058 cut-off events. [2021-06-10 11:45:56,396 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:56,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1058 events. 84/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4387 event pairs, 0 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1216. Up to 37 conditions per place. [2021-06-10 11:45:56,470 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/927 dead transitions. [2021-06-10 11:45:56,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 927 transitions, 2132 flow [2021-06-10 11:45:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:56,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:56,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:56,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:56,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:56,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:56,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,475 INFO L185 Difference]: Start difference. First operand has 950 places, 929 transitions, 2119 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:56,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 927 transitions, 2132 flow [2021-06-10 11:45:56,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 949 places, 927 transitions, 2131 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:56,484 INFO L241 Difference]: Finished difference. Result has 949 places, 927 transitions, 2115 flow [2021-06-10 11:45:56,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=947, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=949, PETRI_TRANSITIONS=927} [2021-06-10 11:45:56,484 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -8 predicate places. [2021-06-10 11:45:56,484 INFO L480 AbstractCegarLoop]: Abstraction has has 949 places, 927 transitions, 2115 flow [2021-06-10 11:45:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:56,485 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:56,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2051 [2021-06-10 11:45:56,485 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1191918318, now seen corresponding path program 1 times [2021-06-10 11:45:56,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:56,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527468216] [2021-06-10 11:45:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:56,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:56,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:56,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:56,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:45:56,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:56,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:45:56,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527468216] [2021-06-10 11:45:56,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:56,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:56,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269433125] [2021-06-10 11:45:56,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:56,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:56,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:56,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 927 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:56,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:56,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:56,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:56,955 INFO L129 PetriNetUnfolder]: 83/1066 cut-off events. [2021-06-10 11:45:56,955 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:56,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1066 events. 83/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4456 event pairs, 0 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 1228. Up to 37 conditions per place. [2021-06-10 11:45:57,002 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/929 dead transitions. [2021-06-10 11:45:57,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 929 transitions, 2145 flow [2021-06-10 11:45:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:45:57,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:45:57,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:45:57,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:45:57,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:57,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:45:57,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,006 INFO L185 Difference]: Start difference. First operand has 949 places, 927 transitions, 2115 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:45:57,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 929 transitions, 2145 flow [2021-06-10 11:45:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 929 transitions, 2144 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:57,014 INFO L241 Difference]: Finished difference. Result has 952 places, 929 transitions, 2138 flow [2021-06-10 11:45:57,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=952, PETRI_TRANSITIONS=929} [2021-06-10 11:45:57,014 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -5 predicate places. [2021-06-10 11:45:57,014 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 929 transitions, 2138 flow [2021-06-10 11:45:57,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:57,015 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:57,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2052 [2021-06-10 11:45:57,015 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1191917295, now seen corresponding path program 1 times [2021-06-10 11:45:57,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:57,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541615622] [2021-06-10 11:45:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:57,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:57,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:57,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:45:57,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541615622] [2021-06-10 11:45:57,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:57,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:57,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542687638] [2021-06-10 11:45:57,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:57,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:57,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:57,037 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:57,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 929 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:57,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:57,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:57,437 INFO L129 PetriNetUnfolder]: 81/1067 cut-off events. [2021-06-10 11:45:57,438 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:57,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 1067 events. 81/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4481 event pairs, 0 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1228. Up to 37 conditions per place. [2021-06-10 11:45:57,512 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/929 dead transitions. [2021-06-10 11:45:57,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 929 transitions, 2150 flow [2021-06-10 11:45:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:57,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:57,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:57,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:57,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:57,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:57,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,517 INFO L185 Difference]: Start difference. First operand has 952 places, 929 transitions, 2138 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:57,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 929 transitions, 2150 flow [2021-06-10 11:45:57,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 929 transitions, 2145 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:57,526 INFO L241 Difference]: Finished difference. Result has 954 places, 928 transitions, 2134 flow [2021-06-10 11:45:57,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=954, PETRI_TRANSITIONS=928} [2021-06-10 11:45:57,526 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -3 predicate places. [2021-06-10 11:45:57,527 INFO L480 AbstractCegarLoop]: Abstraction has has 954 places, 928 transitions, 2134 flow [2021-06-10 11:45:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:57,527 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:57,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2053 [2021-06-10 11:45:57,527 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1190965006, now seen corresponding path program 1 times [2021-06-10 11:45:57,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:57,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813650373] [2021-06-10 11:45:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:57,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:57,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:57,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:57,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:45:57,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813650373] [2021-06-10 11:45:57,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:57,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:57,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312878203] [2021-06-10 11:45:57,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:57,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:57,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:57,550 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:57,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 928 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:57,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:57,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:57,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:57,953 INFO L129 PetriNetUnfolder]: 81/1060 cut-off events. [2021-06-10 11:45:57,953 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:58,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 1060 events. 81/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4419 event pairs, 0 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 1222. Up to 37 conditions per place. [2021-06-10 11:45:58,028 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/926 dead transitions. [2021-06-10 11:45:58,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 926 transitions, 2137 flow [2021-06-10 11:45:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:45:58,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:45:58,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:45:58,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:45:58,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:58,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:45:58,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,033 INFO L185 Difference]: Start difference. First operand has 954 places, 928 transitions, 2134 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:45:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 926 transitions, 2137 flow [2021-06-10 11:45:58,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 926 transitions, 2130 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:45:58,042 INFO L241 Difference]: Finished difference. Result has 954 places, 926 transitions, 2123 flow [2021-06-10 11:45:58,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=954, PETRI_TRANSITIONS=926} [2021-06-10 11:45:58,042 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -3 predicate places. [2021-06-10 11:45:58,042 INFO L480 AbstractCegarLoop]: Abstraction has has 954 places, 926 transitions, 2123 flow [2021-06-10 11:45:58,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:58,043 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:58,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2054 [2021-06-10 11:45:58,043 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1190963983, now seen corresponding path program 1 times [2021-06-10 11:45:58,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:58,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713516368] [2021-06-10 11:45:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:58,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:58,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:58,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:45:58,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713516368] [2021-06-10 11:45:58,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:58,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:58,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770146302] [2021-06-10 11:45:58,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:58,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:58,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:58,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 926 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:58,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:58,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:58,464 INFO L129 PetriNetUnfolder]: 81/1058 cut-off events. [2021-06-10 11:45:58,465 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:45:58,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1058 events. 81/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4404 event pairs, 0 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1222. Up to 37 conditions per place. [2021-06-10 11:45:58,538 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/924 dead transitions. [2021-06-10 11:45:58,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 924 transitions, 2136 flow [2021-06-10 11:45:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:45:58,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:45:58,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:45:58,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:45:58,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:58,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:45:58,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,542 INFO L185 Difference]: Start difference. First operand has 954 places, 926 transitions, 2123 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:45:58,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 924 transitions, 2136 flow [2021-06-10 11:45:58,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 924 transitions, 2135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:58,551 INFO L241 Difference]: Finished difference. Result has 953 places, 924 transitions, 2119 flow [2021-06-10 11:45:58,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2117, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2119, PETRI_PLACES=953, PETRI_TRANSITIONS=924} [2021-06-10 11:45:58,551 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -4 predicate places. [2021-06-10 11:45:58,551 INFO L480 AbstractCegarLoop]: Abstraction has has 953 places, 924 transitions, 2119 flow [2021-06-10 11:45:58,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:58,552 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:58,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2055 [2021-06-10 11:45:58,552 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -11004895, now seen corresponding path program 1 times [2021-06-10 11:45:58,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:58,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178364078] [2021-06-10 11:45:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:58,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:58,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:45:58,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:58,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:45:58,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178364078] [2021-06-10 11:45:58,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:58,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:58,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319447761] [2021-06-10 11:45:58,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:58,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:58,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:45:58,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 924 transitions, 2119 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:58,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:58,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:45:58,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:59,029 INFO L129 PetriNetUnfolder]: 80/1066 cut-off events. [2021-06-10 11:45:59,029 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:45:59,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 1066 events. 80/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4475 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1234. Up to 37 conditions per place. [2021-06-10 11:45:59,079 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/926 dead transitions. [2021-06-10 11:45:59,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 926 transitions, 2149 flow [2021-06-10 11:45:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:45:59,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:45:59,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:45:59,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:45:59,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:59,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:45:59,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,084 INFO L185 Difference]: Start difference. First operand has 953 places, 924 transitions, 2119 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:45:59,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 926 transitions, 2149 flow [2021-06-10 11:45:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 926 transitions, 2148 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:59,092 INFO L241 Difference]: Finished difference. Result has 956 places, 926 transitions, 2142 flow [2021-06-10 11:45:59,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2142, PETRI_PLACES=956, PETRI_TRANSITIONS=926} [2021-06-10 11:45:59,092 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, -1 predicate places. [2021-06-10 11:45:59,092 INFO L480 AbstractCegarLoop]: Abstraction has has 956 places, 926 transitions, 2142 flow [2021-06-10 11:45:59,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:59,092 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:59,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2056 [2021-06-10 11:45:59,092 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -11003872, now seen corresponding path program 1 times [2021-06-10 11:45:59,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:59,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577657033] [2021-06-10 11:45:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:59,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:59,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:59,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:45:59,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577657033] [2021-06-10 11:45:59,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:59,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:59,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786987032] [2021-06-10 11:45:59,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:59,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:59,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:59,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 926 transitions, 2142 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:59,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:59,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:45:59,513 INFO L129 PetriNetUnfolder]: 79/1064 cut-off events. [2021-06-10 11:45:59,514 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:45:59,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 1064 events. 79/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4466 event pairs, 0 based on Foata normal form. 0/950 useless extension candidates. Maximal degree in co-relation 1231. Up to 37 conditions per place. [2021-06-10 11:45:59,588 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2021-06-10 11:45:59,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 926 transitions, 2154 flow [2021-06-10 11:45:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:45:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:45:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:45:59,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:45:59,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:45:59,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:45:59,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:45:59,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:45:59,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,592 INFO L185 Difference]: Start difference. First operand has 956 places, 926 transitions, 2142 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:45:59,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 926 transitions, 2154 flow [2021-06-10 11:45:59,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 926 transitions, 2149 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:45:59,601 INFO L241 Difference]: Finished difference. Result has 959 places, 926 transitions, 2147 flow [2021-06-10 11:45:59,602 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=959, PETRI_TRANSITIONS=926} [2021-06-10 11:45:59,602 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 2 predicate places. [2021-06-10 11:45:59,602 INFO L480 AbstractCegarLoop]: Abstraction has has 959 places, 926 transitions, 2147 flow [2021-06-10 11:45:59,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:45:59,602 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:45:59,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2057 [2021-06-10 11:45:59,602 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:45:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:45:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -10051583, now seen corresponding path program 1 times [2021-06-10 11:45:59,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:45:59,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084776618] [2021-06-10 11:45:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:45:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:45:59,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:59,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:45:59,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:45:59,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:45:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:45:59,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084776618] [2021-06-10 11:45:59,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:45:59,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:45:59,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942360678] [2021-06-10 11:45:59,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:45:59,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:45:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:45:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:45:59,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:45:59,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 926 transitions, 2147 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:45:59,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:45:59,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:45:59,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:00,017 INFO L129 PetriNetUnfolder]: 78/1060 cut-off events. [2021-06-10 11:46:00,017 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:00,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1060 events. 78/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4439 event pairs, 0 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 1228. Up to 37 conditions per place. [2021-06-10 11:46:00,090 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/923 dead transitions. [2021-06-10 11:46:00,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 923 transitions, 2144 flow [2021-06-10 11:46:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:00,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:00,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:00,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:00,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:00,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:00,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,094 INFO L185 Difference]: Start difference. First operand has 959 places, 926 transitions, 2147 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:00,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 923 transitions, 2144 flow [2021-06-10 11:46:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 923 transitions, 2137 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:00,103 INFO L241 Difference]: Finished difference. Result has 958 places, 923 transitions, 2127 flow [2021-06-10 11:46:00,103 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=958, PETRI_TRANSITIONS=923} [2021-06-10 11:46:00,103 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 1 predicate places. [2021-06-10 11:46:00,103 INFO L480 AbstractCegarLoop]: Abstraction has has 958 places, 923 transitions, 2127 flow [2021-06-10 11:46:00,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:00,104 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:00,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2058 [2021-06-10 11:46:00,104 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -10050560, now seen corresponding path program 1 times [2021-06-10 11:46:00,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:00,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192172910] [2021-06-10 11:46:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:00,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:00,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:00,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:46:00,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192172910] [2021-06-10 11:46:00,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:00,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:00,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824671896] [2021-06-10 11:46:00,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:00,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:00,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:00,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 923 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:00,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:00,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:00,529 INFO L129 PetriNetUnfolder]: 78/1058 cut-off events. [2021-06-10 11:46:00,529 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:00,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1058 events. 78/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4423 event pairs, 0 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 1229. Up to 37 conditions per place. [2021-06-10 11:46:00,609 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/921 dead transitions. [2021-06-10 11:46:00,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 921 transitions, 2140 flow [2021-06-10 11:46:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:00,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:00,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:00,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:00,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:00,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:00,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,614 INFO L185 Difference]: Start difference. First operand has 958 places, 923 transitions, 2127 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:00,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 921 transitions, 2140 flow [2021-06-10 11:46:00,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 921 transitions, 2139 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:00,623 INFO L241 Difference]: Finished difference. Result has 957 places, 921 transitions, 2123 flow [2021-06-10 11:46:00,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=957, PETRI_TRANSITIONS=921} [2021-06-10 11:46:00,623 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 0 predicate places. [2021-06-10 11:46:00,623 INFO L480 AbstractCegarLoop]: Abstraction has has 957 places, 921 transitions, 2123 flow [2021-06-10 11:46:00,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:00,624 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:00,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2059 [2021-06-10 11:46:00,624 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2112638957, now seen corresponding path program 1 times [2021-06-10 11:46:00,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:00,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154946035] [2021-06-10 11:46:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:00,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:00,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:00,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:00,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:46:00,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154946035] [2021-06-10 11:46:00,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:00,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:00,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52667055] [2021-06-10 11:46:00,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:00,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:00,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:00,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 921 transitions, 2123 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:00,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:00,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:00,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:01,114 INFO L129 PetriNetUnfolder]: 77/1066 cut-off events. [2021-06-10 11:46:01,114 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:01,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 1066 events. 77/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4492 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1241. Up to 37 conditions per place. [2021-06-10 11:46:01,163 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/923 dead transitions. [2021-06-10 11:46:01,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 923 transitions, 2153 flow [2021-06-10 11:46:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:01,165 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:01,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:01,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:01,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:01,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:01,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,168 INFO L185 Difference]: Start difference. First operand has 957 places, 921 transitions, 2123 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:01,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 923 transitions, 2153 flow [2021-06-10 11:46:01,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 923 transitions, 2152 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:01,176 INFO L241 Difference]: Finished difference. Result has 960 places, 923 transitions, 2146 flow [2021-06-10 11:46:01,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2146, PETRI_PLACES=960, PETRI_TRANSITIONS=923} [2021-06-10 11:46:01,176 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 3 predicate places. [2021-06-10 11:46:01,176 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 923 transitions, 2146 flow [2021-06-10 11:46:01,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:01,176 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:01,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2060 [2021-06-10 11:46:01,177 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2112639980, now seen corresponding path program 1 times [2021-06-10 11:46:01,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:01,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693846334] [2021-06-10 11:46:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:01,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:01,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:01,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:46:01,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693846334] [2021-06-10 11:46:01,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:01,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:01,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855424241] [2021-06-10 11:46:01,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:01,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:01,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:01,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 923 transitions, 2146 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:01,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:01,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:01,604 INFO L129 PetriNetUnfolder]: 75/1067 cut-off events. [2021-06-10 11:46:01,604 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:01,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1067 events. 75/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4517 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1241. Up to 37 conditions per place. [2021-06-10 11:46:01,678 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/923 dead transitions. [2021-06-10 11:46:01,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 923 transitions, 2158 flow [2021-06-10 11:46:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:01,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:01,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:01,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:01,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:01,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:01,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,682 INFO L185 Difference]: Start difference. First operand has 960 places, 923 transitions, 2146 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:01,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 923 transitions, 2158 flow [2021-06-10 11:46:01,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 923 transitions, 2153 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:01,691 INFO L241 Difference]: Finished difference. Result has 962 places, 922 transitions, 2142 flow [2021-06-10 11:46:01,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2142, PETRI_PLACES=962, PETRI_TRANSITIONS=922} [2021-06-10 11:46:01,691 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 5 predicate places. [2021-06-10 11:46:01,692 INFO L480 AbstractCegarLoop]: Abstraction has has 962 places, 922 transitions, 2142 flow [2021-06-10 11:46:01,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:01,692 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:01,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2061 [2021-06-10 11:46:01,692 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:01,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2113592269, now seen corresponding path program 1 times [2021-06-10 11:46:01,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:01,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912102900] [2021-06-10 11:46:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:01,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:01,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:01,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:01,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:46:01,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912102900] [2021-06-10 11:46:01,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:01,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:01,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209687597] [2021-06-10 11:46:01,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:01,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:01,715 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:01,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 922 transitions, 2142 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:01,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:01,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:01,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:02,117 INFO L129 PetriNetUnfolder]: 75/1060 cut-off events. [2021-06-10 11:46:02,117 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:02,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1060 events. 75/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4455 event pairs, 0 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 1235. Up to 37 conditions per place. [2021-06-10 11:46:02,191 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/920 dead transitions. [2021-06-10 11:46:02,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 920 transitions, 2145 flow [2021-06-10 11:46:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:02,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:02,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:02,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:02,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:02,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:02,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,195 INFO L185 Difference]: Start difference. First operand has 962 places, 922 transitions, 2142 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:02,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 920 transitions, 2145 flow [2021-06-10 11:46:02,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 920 transitions, 2138 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:02,204 INFO L241 Difference]: Finished difference. Result has 962 places, 920 transitions, 2131 flow [2021-06-10 11:46:02,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2131, PETRI_PLACES=962, PETRI_TRANSITIONS=920} [2021-06-10 11:46:02,205 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 5 predicate places. [2021-06-10 11:46:02,205 INFO L480 AbstractCegarLoop]: Abstraction has has 962 places, 920 transitions, 2131 flow [2021-06-10 11:46:02,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:02,205 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:02,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2062 [2021-06-10 11:46:02,205 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2113593292, now seen corresponding path program 1 times [2021-06-10 11:46:02,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:02,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876290603] [2021-06-10 11:46:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:02,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:02,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:02,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:46:02,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876290603] [2021-06-10 11:46:02,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:02,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:02,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301634772] [2021-06-10 11:46:02,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:02,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:02,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:02,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 920 transitions, 2131 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:02,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:02,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:02,638 INFO L129 PetriNetUnfolder]: 75/1058 cut-off events. [2021-06-10 11:46:02,638 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:02,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 1058 events. 75/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4440 event pairs, 0 based on Foata normal form. 0/947 useless extension candidates. Maximal degree in co-relation 1235. Up to 37 conditions per place. [2021-06-10 11:46:02,712 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/918 dead transitions. [2021-06-10 11:46:02,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 918 transitions, 2144 flow [2021-06-10 11:46:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:02,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:02,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:02,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:02,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:02,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:02,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,716 INFO L185 Difference]: Start difference. First operand has 962 places, 920 transitions, 2131 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 918 transitions, 2144 flow [2021-06-10 11:46:02,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 918 transitions, 2143 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:02,725 INFO L241 Difference]: Finished difference. Result has 961 places, 918 transitions, 2127 flow [2021-06-10 11:46:02,726 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=961, PETRI_TRANSITIONS=918} [2021-06-10 11:46:02,726 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 4 predicate places. [2021-06-10 11:46:02,726 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 918 transitions, 2127 flow [2021-06-10 11:46:02,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,726 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:02,726 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:02,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2063 [2021-06-10 11:46:02,726 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash -367963448, now seen corresponding path program 1 times [2021-06-10 11:46:02,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:02,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232068655] [2021-06-10 11:46:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:02,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:02,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:02,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:02,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:46:02,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232068655] [2021-06-10 11:46:02,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:02,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:02,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115563628] [2021-06-10 11:46:02,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:02,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:02,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:02,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 918 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:02,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:02,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:02,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:03,193 INFO L129 PetriNetUnfolder]: 74/1066 cut-off events. [2021-06-10 11:46:03,194 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:03,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 1066 events. 74/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4509 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1247. Up to 37 conditions per place. [2021-06-10 11:46:03,243 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/920 dead transitions. [2021-06-10 11:46:03,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 920 transitions, 2157 flow [2021-06-10 11:46:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:03,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:03,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:03,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:03,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:03,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:03,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,248 INFO L185 Difference]: Start difference. First operand has 961 places, 918 transitions, 2127 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:03,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 920 transitions, 2157 flow [2021-06-10 11:46:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 920 transitions, 2156 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:03,256 INFO L241 Difference]: Finished difference. Result has 964 places, 920 transitions, 2150 flow [2021-06-10 11:46:03,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=964, PETRI_TRANSITIONS=920} [2021-06-10 11:46:03,257 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 7 predicate places. [2021-06-10 11:46:03,257 INFO L480 AbstractCegarLoop]: Abstraction has has 964 places, 920 transitions, 2150 flow [2021-06-10 11:46:03,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,257 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:03,257 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:03,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2064 [2021-06-10 11:46:03,257 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -367962425, now seen corresponding path program 1 times [2021-06-10 11:46:03,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:03,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092621490] [2021-06-10 11:46:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:03,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:03,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:03,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:46:03,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092621490] [2021-06-10 11:46:03,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:03,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:03,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144499982] [2021-06-10 11:46:03,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:03,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:03,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:03,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:03,280 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:03,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 920 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:03,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:03,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:03,701 INFO L129 PetriNetUnfolder]: 73/1064 cut-off events. [2021-06-10 11:46:03,701 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:03,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 1064 events. 73/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4499 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1244. Up to 37 conditions per place. [2021-06-10 11:46:03,778 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/920 dead transitions. [2021-06-10 11:46:03,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 966 places, 920 transitions, 2162 flow [2021-06-10 11:46:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:03,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:03,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:03,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:03,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:03,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:03,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,782 INFO L185 Difference]: Start difference. First operand has 964 places, 920 transitions, 2150 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:03,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 966 places, 920 transitions, 2162 flow [2021-06-10 11:46:03,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 920 transitions, 2157 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:03,792 INFO L241 Difference]: Finished difference. Result has 967 places, 920 transitions, 2155 flow [2021-06-10 11:46:03,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=963, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=967, PETRI_TRANSITIONS=920} [2021-06-10 11:46:03,793 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 10 predicate places. [2021-06-10 11:46:03,793 INFO L480 AbstractCegarLoop]: Abstraction has has 967 places, 920 transitions, 2155 flow [2021-06-10 11:46:03,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:03,793 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:03,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2065 [2021-06-10 11:46:03,793 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:03,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -367009113, now seen corresponding path program 1 times [2021-06-10 11:46:03,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:03,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968045191] [2021-06-10 11:46:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:03,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:03,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:03,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:03,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:46:03,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968045191] [2021-06-10 11:46:03,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:03,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:03,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693213452] [2021-06-10 11:46:03,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:03,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:03,818 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:03,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 920 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:03,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:03,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:03,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:04,237 INFO L129 PetriNetUnfolder]: 72/1061 cut-off events. [2021-06-10 11:46:04,237 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:46:04,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 1061 events. 72/1061 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4480 event pairs, 0 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 1245. Up to 37 conditions per place. [2021-06-10 11:46:04,313 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 9 selfloop transitions, 1 changer transitions 0/918 dead transitions. [2021-06-10 11:46:04,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 918 transitions, 2165 flow [2021-06-10 11:46:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2021-06-10 11:46:04,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212827988338192 [2021-06-10 11:46:04,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2844 transitions. [2021-06-10 11:46:04,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2844 transitions. [2021-06-10 11:46:04,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:04,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2844 transitions. [2021-06-10 11:46:04,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.0) internal successors, (2844), 3 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,318 INFO L185 Difference]: Start difference. First operand has 967 places, 920 transitions, 2155 flow. Second operand 3 states and 2844 transitions. [2021-06-10 11:46:04,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 918 transitions, 2165 flow [2021-06-10 11:46:04,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 918 transitions, 2163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:04,327 INFO L241 Difference]: Finished difference. Result has 968 places, 918 transitions, 2145 flow [2021-06-10 11:46:04,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2145, PETRI_PLACES=968, PETRI_TRANSITIONS=918} [2021-06-10 11:46:04,327 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 11 predicate places. [2021-06-10 11:46:04,327 INFO L480 AbstractCegarLoop]: Abstraction has has 968 places, 918 transitions, 2145 flow [2021-06-10 11:46:04,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:04,328 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:04,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2066 [2021-06-10 11:46:04,328 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash -367010136, now seen corresponding path program 1 times [2021-06-10 11:46:04,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:04,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940806870] [2021-06-10 11:46:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:04,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:04,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:04,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:46:04,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940806870] [2021-06-10 11:46:04,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:04,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:04,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227051306] [2021-06-10 11:46:04,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:04,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:04,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:04,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 918 transitions, 2145 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:04,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:04,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:04,758 INFO L129 PetriNetUnfolder]: 72/1058 cut-off events. [2021-06-10 11:46:04,758 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:04,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 1058 events. 72/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4457 event pairs, 0 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1239. Up to 37 conditions per place. [2021-06-10 11:46:04,831 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/915 dead transitions. [2021-06-10 11:46:04,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 915 transitions, 2146 flow [2021-06-10 11:46:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:04,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:04,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:04,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:04,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:04,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:04,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,835 INFO L185 Difference]: Start difference. First operand has 968 places, 918 transitions, 2145 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 915 transitions, 2146 flow [2021-06-10 11:46:04,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 965 places, 915 transitions, 2141 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:04,844 INFO L241 Difference]: Finished difference. Result has 965 places, 915 transitions, 2131 flow [2021-06-10 11:46:04,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=963, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2131, PETRI_PLACES=965, PETRI_TRANSITIONS=915} [2021-06-10 11:46:04,845 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 8 predicate places. [2021-06-10 11:46:04,845 INFO L480 AbstractCegarLoop]: Abstraction has has 965 places, 915 transitions, 2131 flow [2021-06-10 11:46:04,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:04,845 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:04,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2067 [2021-06-10 11:46:04,845 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1306202532, now seen corresponding path program 1 times [2021-06-10 11:46:04,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:04,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630254127] [2021-06-10 11:46:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:04,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:04,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:04,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:04,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:46:04,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630254127] [2021-06-10 11:46:04,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:04,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:04,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629962093] [2021-06-10 11:46:04,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:04,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:04,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:04,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 965 places, 915 transitions, 2131 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:04,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:04,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:04,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:05,282 INFO L129 PetriNetUnfolder]: 70/1063 cut-off events. [2021-06-10 11:46:05,282 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:05,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1063 events. 70/1063 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4507 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1247. Up to 37 conditions per place. [2021-06-10 11:46:05,334 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/916 dead transitions. [2021-06-10 11:46:05,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 916 transitions, 2147 flow [2021-06-10 11:46:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:05,336 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:05,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:05,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:05,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:05,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:05,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,338 INFO L185 Difference]: Start difference. First operand has 965 places, 915 transitions, 2131 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:05,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 967 places, 916 transitions, 2147 flow [2021-06-10 11:46:05,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 916 transitions, 2146 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:05,347 INFO L241 Difference]: Finished difference. Result has 968 places, 916 transitions, 2144 flow [2021-06-10 11:46:05,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=964, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=968, PETRI_TRANSITIONS=916} [2021-06-10 11:46:05,347 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 11 predicate places. [2021-06-10 11:46:05,347 INFO L480 AbstractCegarLoop]: Abstraction has has 968 places, 916 transitions, 2144 flow [2021-06-10 11:46:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:05,347 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:05,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2068 [2021-06-10 11:46:05,348 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1306203555, now seen corresponding path program 1 times [2021-06-10 11:46:05,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:05,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445877327] [2021-06-10 11:46:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:05,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:05,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:05,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:46:05,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445877327] [2021-06-10 11:46:05,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:05,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:05,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107212762] [2021-06-10 11:46:05,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:05,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:05,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:05,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 916 transitions, 2144 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:05,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:05,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:05,804 INFO L129 PetriNetUnfolder]: 70/1064 cut-off events. [2021-06-10 11:46:05,804 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:05,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1064 events. 70/1064 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4518 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1253. Up to 37 conditions per place. [2021-06-10 11:46:05,881 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/917 dead transitions. [2021-06-10 11:46:05,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 917 transitions, 2170 flow [2021-06-10 11:46:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:05,882 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:05,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:05,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:05,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:05,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:05,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,885 INFO L185 Difference]: Start difference. First operand has 968 places, 916 transitions, 2144 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:05,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 970 places, 917 transitions, 2170 flow [2021-06-10 11:46:05,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 917 transitions, 2168 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:05,894 INFO L241 Difference]: Finished difference. Result has 971 places, 917 transitions, 2160 flow [2021-06-10 11:46:05,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2160, PETRI_PLACES=971, PETRI_TRANSITIONS=917} [2021-06-10 11:46:05,894 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 14 predicate places. [2021-06-10 11:46:05,894 INFO L480 AbstractCegarLoop]: Abstraction has has 971 places, 917 transitions, 2160 flow [2021-06-10 11:46:05,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:05,895 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:05,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2069 [2021-06-10 11:46:05,895 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1305249220, now seen corresponding path program 1 times [2021-06-10 11:46:05,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:05,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012454048] [2021-06-10 11:46:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:05,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:05,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:05,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:05,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:46:05,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012454048] [2021-06-10 11:46:05,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:05,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:05,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665553119] [2021-06-10 11:46:05,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:05,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:05,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:05,919 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:05,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 917 transitions, 2160 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:05,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:05,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:05,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:06,341 INFO L129 PetriNetUnfolder]: 69/1061 cut-off events. [2021-06-10 11:46:06,341 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-06-10 11:46:06,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1061 events. 69/1061 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4495 event pairs, 0 based on Foata normal form. 2/958 useless extension candidates. Maximal degree in co-relation 1252. Up to 37 conditions per place. [2021-06-10 11:46:06,419 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 9 selfloop transitions, 1 changer transitions 0/915 dead transitions. [2021-06-10 11:46:06,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 973 places, 915 transitions, 2168 flow [2021-06-10 11:46:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2021-06-10 11:46:06,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212827988338192 [2021-06-10 11:46:06,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2844 transitions. [2021-06-10 11:46:06,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2844 transitions. [2021-06-10 11:46:06,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:06,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2844 transitions. [2021-06-10 11:46:06,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.0) internal successors, (2844), 3 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,423 INFO L185 Difference]: Start difference. First operand has 971 places, 917 transitions, 2160 flow. Second operand 3 states and 2844 transitions. [2021-06-10 11:46:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 973 places, 915 transitions, 2168 flow [2021-06-10 11:46:06,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 915 transitions, 2167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:06,433 INFO L241 Difference]: Finished difference. Result has 972 places, 915 transitions, 2149 flow [2021-06-10 11:46:06,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2149, PETRI_PLACES=972, PETRI_TRANSITIONS=915} [2021-06-10 11:46:06,433 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 15 predicate places. [2021-06-10 11:46:06,433 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 915 transitions, 2149 flow [2021-06-10 11:46:06,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,433 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:06,433 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:06,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2070 [2021-06-10 11:46:06,433 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1305250243, now seen corresponding path program 1 times [2021-06-10 11:46:06,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:06,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085952528] [2021-06-10 11:46:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:06,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:06,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:06,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:46:06,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085952528] [2021-06-10 11:46:06,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:06,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:06,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861742860] [2021-06-10 11:46:06,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:06,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:06,458 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:06,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 915 transitions, 2149 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:06,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:06,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:06,879 INFO L129 PetriNetUnfolder]: 69/1058 cut-off events. [2021-06-10 11:46:06,879 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:06,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 1058 events. 69/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4475 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1246. Up to 37 conditions per place. [2021-06-10 11:46:06,954 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/912 dead transitions. [2021-06-10 11:46:06,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 912 transitions, 2150 flow [2021-06-10 11:46:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:06,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:06,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:06,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:06,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:06,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:06,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,959 INFO L185 Difference]: Start difference. First operand has 972 places, 915 transitions, 2149 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 912 transitions, 2150 flow [2021-06-10 11:46:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 912 transitions, 2145 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:06,968 INFO L241 Difference]: Finished difference. Result has 969 places, 912 transitions, 2135 flow [2021-06-10 11:46:06,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=967, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=969, PETRI_TRANSITIONS=912} [2021-06-10 11:46:06,968 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 12 predicate places. [2021-06-10 11:46:06,969 INFO L480 AbstractCegarLoop]: Abstraction has has 969 places, 912 transitions, 2135 flow [2021-06-10 11:46:06,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:06,969 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:06,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2071 [2021-06-10 11:46:06,969 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash 885984370, now seen corresponding path program 1 times [2021-06-10 11:46:06,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:06,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234325412] [2021-06-10 11:46:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:06,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:06,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:06,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:06,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:46:06,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234325412] [2021-06-10 11:46:06,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:06,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:06,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506632593] [2021-06-10 11:46:06,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:06,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:06,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:06,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 912 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:06,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:06,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:06,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:07,400 INFO L129 PetriNetUnfolder]: 67/1063 cut-off events. [2021-06-10 11:46:07,400 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:07,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1063 events. 67/1063 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4525 event pairs, 0 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 1254. Up to 37 conditions per place. [2021-06-10 11:46:07,457 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/913 dead transitions. [2021-06-10 11:46:07,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 913 transitions, 2151 flow [2021-06-10 11:46:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:07,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:07,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:07,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:07,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:07,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:07,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,461 INFO L185 Difference]: Start difference. First operand has 969 places, 912 transitions, 2135 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:07,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 913 transitions, 2151 flow [2021-06-10 11:46:07,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 913 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:07,470 INFO L241 Difference]: Finished difference. Result has 972 places, 913 transitions, 2148 flow [2021-06-10 11:46:07,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=972, PETRI_TRANSITIONS=913} [2021-06-10 11:46:07,470 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 15 predicate places. [2021-06-10 11:46:07,470 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 913 transitions, 2148 flow [2021-06-10 11:46:07,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:07,470 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:07,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2072 [2021-06-10 11:46:07,471 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash 885983347, now seen corresponding path program 1 times [2021-06-10 11:46:07,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:07,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418153647] [2021-06-10 11:46:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:07,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:07,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:07,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:07,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:07,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:07,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:46:07,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418153647] [2021-06-10 11:46:07,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:07,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:07,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751397533] [2021-06-10 11:46:07,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:07,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:07,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:07,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 913 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:07,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:07,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:07,918 INFO L129 PetriNetUnfolder]: 67/1064 cut-off events. [2021-06-10 11:46:07,918 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:07,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 1064 events. 67/1064 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4536 event pairs, 0 based on Foata normal form. 0/960 useless extension candidates. Maximal degree in co-relation 1260. Up to 37 conditions per place. [2021-06-10 11:46:07,990 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/914 dead transitions. [2021-06-10 11:46:07,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 914 transitions, 2174 flow [2021-06-10 11:46:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:07,991 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:07,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:07,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:07,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:07,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:07,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:07,994 INFO L185 Difference]: Start difference. First operand has 972 places, 913 transitions, 2148 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:07,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 914 transitions, 2174 flow [2021-06-10 11:46:07,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 914 transitions, 2172 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:08,003 INFO L241 Difference]: Finished difference. Result has 975 places, 914 transitions, 2164 flow [2021-06-10 11:46:08,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2164, PETRI_PLACES=975, PETRI_TRANSITIONS=914} [2021-06-10 11:46:08,003 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 18 predicate places. [2021-06-10 11:46:08,003 INFO L480 AbstractCegarLoop]: Abstraction has has 975 places, 914 transitions, 2164 flow [2021-06-10 11:46:08,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,004 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:08,004 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:08,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2073 [2021-06-10 11:46:08,004 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash 886936659, now seen corresponding path program 1 times [2021-06-10 11:46:08,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:08,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642724865] [2021-06-10 11:46:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:08,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:08,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:08,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:46:08,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642724865] [2021-06-10 11:46:08,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:08,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:08,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612606852] [2021-06-10 11:46:08,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:08,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:08,027 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:08,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 914 transitions, 2164 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:08,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:08,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:08,432 INFO L129 PetriNetUnfolder]: 66/1060 cut-off events. [2021-06-10 11:46:08,433 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:08,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1060 events. 66/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4508 event pairs, 0 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1253. Up to 37 conditions per place. [2021-06-10 11:46:08,503 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/911 dead transitions. [2021-06-10 11:46:08,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 911 transitions, 2161 flow [2021-06-10 11:46:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:08,505 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:08,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:08,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:08,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:08,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:08,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,508 INFO L185 Difference]: Start difference. First operand has 975 places, 914 transitions, 2164 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:08,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 911 transitions, 2161 flow [2021-06-10 11:46:08,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 974 places, 911 transitions, 2153 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:08,516 INFO L241 Difference]: Finished difference. Result has 974 places, 911 transitions, 2143 flow [2021-06-10 11:46:08,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=972, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=974, PETRI_TRANSITIONS=911} [2021-06-10 11:46:08,517 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 17 predicate places. [2021-06-10 11:46:08,517 INFO L480 AbstractCegarLoop]: Abstraction has has 974 places, 911 transitions, 2143 flow [2021-06-10 11:46:08,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,517 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:08,517 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:08,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2074 [2021-06-10 11:46:08,517 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 886937682, now seen corresponding path program 1 times [2021-06-10 11:46:08,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:08,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138579621] [2021-06-10 11:46:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:08,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:08,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:08,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:08,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:46:08,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138579621] [2021-06-10 11:46:08,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:08,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:08,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562231960] [2021-06-10 11:46:08,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:08,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:08,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:08,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 911 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:08,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:08,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:08,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:08,951 INFO L129 PetriNetUnfolder]: 66/1058 cut-off events. [2021-06-10 11:46:08,951 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:09,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1058 events. 66/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4493 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1256. Up to 37 conditions per place. [2021-06-10 11:46:09,022 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/909 dead transitions. [2021-06-10 11:46:09,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 909 transitions, 2156 flow [2021-06-10 11:46:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:09,023 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:09,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:09,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:09,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:09,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:09,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,026 INFO L185 Difference]: Start difference. First operand has 974 places, 911 transitions, 2143 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:09,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 909 transitions, 2156 flow [2021-06-10 11:46:09,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 909 transitions, 2155 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:09,035 INFO L241 Difference]: Finished difference. Result has 973 places, 909 transitions, 2139 flow [2021-06-10 11:46:09,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2139, PETRI_PLACES=973, PETRI_TRANSITIONS=909} [2021-06-10 11:46:09,035 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 16 predicate places. [2021-06-10 11:46:09,035 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 909 transitions, 2139 flow [2021-06-10 11:46:09,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,036 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:09,036 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:09,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2075 [2021-06-10 11:46:09,036 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2005179254, now seen corresponding path program 1 times [2021-06-10 11:46:09,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:09,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737946323] [2021-06-10 11:46:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:09,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:09,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:09,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:46:09,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737946323] [2021-06-10 11:46:09,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:09,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:09,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474772490] [2021-06-10 11:46:09,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:09,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:09,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:09,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 909 transitions, 2139 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:09,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:09,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:09,479 INFO L129 PetriNetUnfolder]: 65/1066 cut-off events. [2021-06-10 11:46:09,479 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:09,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1066 events. 65/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4561 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1268. Up to 37 conditions per place. [2021-06-10 11:46:09,538 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/911 dead transitions. [2021-06-10 11:46:09,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 911 transitions, 2169 flow [2021-06-10 11:46:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:09,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:09,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:09,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:09,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:09,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:09,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,543 INFO L185 Difference]: Start difference. First operand has 973 places, 909 transitions, 2139 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:09,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 911 transitions, 2169 flow [2021-06-10 11:46:09,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 974 places, 911 transitions, 2168 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:09,551 INFO L241 Difference]: Finished difference. Result has 976 places, 911 transitions, 2162 flow [2021-06-10 11:46:09,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=972, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2162, PETRI_PLACES=976, PETRI_TRANSITIONS=911} [2021-06-10 11:46:09,551 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 19 predicate places. [2021-06-10 11:46:09,551 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 911 transitions, 2162 flow [2021-06-10 11:46:09,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:09,552 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:09,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2076 [2021-06-10 11:46:09,552 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2005178231, now seen corresponding path program 1 times [2021-06-10 11:46:09,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:09,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133737241] [2021-06-10 11:46:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:09,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:09,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:09,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:09,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:46:09,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133737241] [2021-06-10 11:46:09,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:09,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:09,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126390359] [2021-06-10 11:46:09,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:09,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:09,575 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:09,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 911 transitions, 2162 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:09,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:09,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:09,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:09,997 INFO L129 PetriNetUnfolder]: 64/1064 cut-off events. [2021-06-10 11:46:09,998 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:10,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1064 events. 64/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4549 event pairs, 0 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1265. Up to 37 conditions per place. [2021-06-10 11:46:10,069 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/911 dead transitions. [2021-06-10 11:46:10,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 911 transitions, 2174 flow [2021-06-10 11:46:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:10,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:10,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:10,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:10,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:10,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:10,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,074 INFO L185 Difference]: Start difference. First operand has 976 places, 911 transitions, 2162 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:10,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 911 transitions, 2174 flow [2021-06-10 11:46:10,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 911 transitions, 2169 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:10,083 INFO L241 Difference]: Finished difference. Result has 979 places, 911 transitions, 2167 flow [2021-06-10 11:46:10,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2167, PETRI_PLACES=979, PETRI_TRANSITIONS=911} [2021-06-10 11:46:10,084 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 22 predicate places. [2021-06-10 11:46:10,084 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 911 transitions, 2167 flow [2021-06-10 11:46:10,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:10,084 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:10,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2077 [2021-06-10 11:46:10,084 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2004225942, now seen corresponding path program 1 times [2021-06-10 11:46:10,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:10,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476437452] [2021-06-10 11:46:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:10,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:10,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:10,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:46:10,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476437452] [2021-06-10 11:46:10,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:10,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:10,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606100427] [2021-06-10 11:46:10,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:10,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:10,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:10,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 911 transitions, 2167 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:10,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:10,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:10,518 INFO L129 PetriNetUnfolder]: 63/1060 cut-off events. [2021-06-10 11:46:10,518 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:10,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1060 events. 63/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4524 event pairs, 0 based on Foata normal form. 1/963 useless extension candidates. Maximal degree in co-relation 1262. Up to 37 conditions per place. [2021-06-10 11:46:10,588 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/908 dead transitions. [2021-06-10 11:46:10,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 908 transitions, 2164 flow [2021-06-10 11:46:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:10,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:10,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:10,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:10,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:10,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:10,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,592 INFO L185 Difference]: Start difference. First operand has 979 places, 911 transitions, 2167 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:10,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 908 transitions, 2164 flow [2021-06-10 11:46:10,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 908 transitions, 2157 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:10,601 INFO L241 Difference]: Finished difference. Result has 978 places, 908 transitions, 2147 flow [2021-06-10 11:46:10,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=978, PETRI_TRANSITIONS=908} [2021-06-10 11:46:10,601 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 21 predicate places. [2021-06-10 11:46:10,601 INFO L480 AbstractCegarLoop]: Abstraction has has 978 places, 908 transitions, 2147 flow [2021-06-10 11:46:10,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,602 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:10,602 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:10,602 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2078 [2021-06-10 11:46:10,602 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:10,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2004224919, now seen corresponding path program 1 times [2021-06-10 11:46:10,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:10,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412686846] [2021-06-10 11:46:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:10,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:10,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:10,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:10,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:46:10,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412686846] [2021-06-10 11:46:10,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:10,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315394554] [2021-06-10 11:46:10,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:10,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:10,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:10,625 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:10,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 908 transitions, 2147 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:10,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:10,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:10,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:11,041 INFO L129 PetriNetUnfolder]: 63/1058 cut-off events. [2021-06-10 11:46:11,041 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:11,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1058 events. 63/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4509 event pairs, 0 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1263. Up to 37 conditions per place. [2021-06-10 11:46:11,112 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/906 dead transitions. [2021-06-10 11:46:11,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 906 transitions, 2160 flow [2021-06-10 11:46:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:11,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:11,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:11,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:11,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:11,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:11,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,117 INFO L185 Difference]: Start difference. First operand has 978 places, 908 transitions, 2147 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:11,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 906 transitions, 2160 flow [2021-06-10 11:46:11,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 906 transitions, 2159 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:11,126 INFO L241 Difference]: Finished difference. Result has 977 places, 906 transitions, 2143 flow [2021-06-10 11:46:11,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=977, PETRI_TRANSITIONS=906} [2021-06-10 11:46:11,126 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 20 predicate places. [2021-06-10 11:46:11,126 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 906 transitions, 2143 flow [2021-06-10 11:46:11,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:11,127 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:11,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2079 [2021-06-10 11:46:11,127 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:11,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 724433698, now seen corresponding path program 1 times [2021-06-10 11:46:11,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:11,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684214989] [2021-06-10 11:46:11,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:11,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:11,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:11,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:46:11,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684214989] [2021-06-10 11:46:11,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:11,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:11,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27171179] [2021-06-10 11:46:11,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:11,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:11,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:11,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:11,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 906 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:11,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:11,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:11,580 INFO L129 PetriNetUnfolder]: 62/1066 cut-off events. [2021-06-10 11:46:11,581 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:11,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 1066 events. 62/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4580 event pairs, 0 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1275. Up to 37 conditions per place. [2021-06-10 11:46:11,646 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/908 dead transitions. [2021-06-10 11:46:11,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 908 transitions, 2173 flow [2021-06-10 11:46:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:11,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:11,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:11,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:11,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:11,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:11,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,651 INFO L185 Difference]: Start difference. First operand has 977 places, 906 transitions, 2143 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:11,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 908 transitions, 2173 flow [2021-06-10 11:46:11,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 908 transitions, 2172 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:11,659 INFO L241 Difference]: Finished difference. Result has 980 places, 908 transitions, 2166 flow [2021-06-10 11:46:11,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2166, PETRI_PLACES=980, PETRI_TRANSITIONS=908} [2021-06-10 11:46:11,659 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 23 predicate places. [2021-06-10 11:46:11,659 INFO L480 AbstractCegarLoop]: Abstraction has has 980 places, 908 transitions, 2166 flow [2021-06-10 11:46:11,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:11,660 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:11,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2080 [2021-06-10 11:46:11,660 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 724434721, now seen corresponding path program 1 times [2021-06-10 11:46:11,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:11,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190481209] [2021-06-10 11:46:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:11,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:11,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:11,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:11,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:46:11,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190481209] [2021-06-10 11:46:11,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:11,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:11,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004231761] [2021-06-10 11:46:11,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:11,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:11,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:11,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:11,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 908 transitions, 2166 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:11,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:11,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:11,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:12,102 INFO L129 PetriNetUnfolder]: 61/1064 cut-off events. [2021-06-10 11:46:12,102 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:12,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1064 events. 61/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4571 event pairs, 0 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1272. Up to 37 conditions per place. [2021-06-10 11:46:12,174 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/908 dead transitions. [2021-06-10 11:46:12,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 908 transitions, 2178 flow [2021-06-10 11:46:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:12,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:12,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:12,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:12,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:12,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,178 INFO L185 Difference]: Start difference. First operand has 980 places, 908 transitions, 2166 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:12,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 908 transitions, 2178 flow [2021-06-10 11:46:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 908 transitions, 2173 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:12,187 INFO L241 Difference]: Finished difference. Result has 983 places, 908 transitions, 2171 flow [2021-06-10 11:46:12,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2171, PETRI_PLACES=983, PETRI_TRANSITIONS=908} [2021-06-10 11:46:12,187 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 26 predicate places. [2021-06-10 11:46:12,187 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 908 transitions, 2171 flow [2021-06-10 11:46:12,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:12,188 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:12,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2081 [2021-06-10 11:46:12,188 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:12,188 INFO L82 PathProgramCache]: Analyzing trace with hash 725387010, now seen corresponding path program 1 times [2021-06-10 11:46:12,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:12,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339920667] [2021-06-10 11:46:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:12,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:12,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:12,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:46:12,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339920667] [2021-06-10 11:46:12,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:12,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:12,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039537013] [2021-06-10 11:46:12,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:12,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:12,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:12,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:12,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 908 transitions, 2171 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:12,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:12,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:12,631 INFO L129 PetriNetUnfolder]: 60/1060 cut-off events. [2021-06-10 11:46:12,631 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:12,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 1060 events. 60/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4543 event pairs, 0 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 1269. Up to 37 conditions per place. [2021-06-10 11:46:12,703 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/905 dead transitions. [2021-06-10 11:46:12,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 905 transitions, 2168 flow [2021-06-10 11:46:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:12,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:12,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:12,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:12,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:12,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:12,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,708 INFO L185 Difference]: Start difference. First operand has 983 places, 908 transitions, 2171 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:12,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 905 transitions, 2168 flow [2021-06-10 11:46:12,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 905 transitions, 2161 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:12,718 INFO L241 Difference]: Finished difference. Result has 982 places, 905 transitions, 2151 flow [2021-06-10 11:46:12,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=982, PETRI_TRANSITIONS=905} [2021-06-10 11:46:12,718 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 25 predicate places. [2021-06-10 11:46:12,718 INFO L480 AbstractCegarLoop]: Abstraction has has 982 places, 905 transitions, 2151 flow [2021-06-10 11:46:12,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:12,718 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:12,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2082 [2021-06-10 11:46:12,719 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 725388033, now seen corresponding path program 1 times [2021-06-10 11:46:12,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:12,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344411115] [2021-06-10 11:46:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:12,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:12,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:12,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:12,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:46:12,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344411115] [2021-06-10 11:46:12,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:12,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:12,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059823646] [2021-06-10 11:46:12,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:12,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:12,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:12,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 905 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:12,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:12,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:12,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:13,178 INFO L129 PetriNetUnfolder]: 60/1058 cut-off events. [2021-06-10 11:46:13,178 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:13,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1058 events. 60/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4528 event pairs, 0 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 1270. Up to 37 conditions per place. [2021-06-10 11:46:13,248 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/903 dead transitions. [2021-06-10 11:46:13,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 903 transitions, 2164 flow [2021-06-10 11:46:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:13,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:13,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:13,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:13,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:13,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:13,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,253 INFO L185 Difference]: Start difference. First operand has 982 places, 905 transitions, 2151 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:13,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 903 transitions, 2164 flow [2021-06-10 11:46:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 903 transitions, 2163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:13,262 INFO L241 Difference]: Finished difference. Result has 981 places, 903 transitions, 2147 flow [2021-06-10 11:46:13,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2147, PETRI_PLACES=981, PETRI_TRANSITIONS=903} [2021-06-10 11:46:13,262 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 24 predicate places. [2021-06-10 11:46:13,262 INFO L480 AbstractCegarLoop]: Abstraction has has 981 places, 903 transitions, 2147 flow [2021-06-10 11:46:13,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:13,263 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:13,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2083 [2021-06-10 11:46:13,263 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 501817754, now seen corresponding path program 1 times [2021-06-10 11:46:13,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:13,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127999395] [2021-06-10 11:46:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:13,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:13,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:13,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:46:13,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127999395] [2021-06-10 11:46:13,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:13,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:13,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40778864] [2021-06-10 11:46:13,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:13,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:13,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:13,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 903 transitions, 2147 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:13,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:13,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:13,703 INFO L129 PetriNetUnfolder]: 59/1066 cut-off events. [2021-06-10 11:46:13,704 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:13,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1066 events. 59/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4597 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1282. Up to 37 conditions per place. [2021-06-10 11:46:13,769 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/905 dead transitions. [2021-06-10 11:46:13,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 905 transitions, 2177 flow [2021-06-10 11:46:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:13,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:13,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:13,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:13,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:13,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:13,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,774 INFO L185 Difference]: Start difference. First operand has 981 places, 903 transitions, 2147 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:13,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 905 transitions, 2177 flow [2021-06-10 11:46:13,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 905 transitions, 2176 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:13,783 INFO L241 Difference]: Finished difference. Result has 984 places, 905 transitions, 2170 flow [2021-06-10 11:46:13,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2170, PETRI_PLACES=984, PETRI_TRANSITIONS=905} [2021-06-10 11:46:13,783 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 27 predicate places. [2021-06-10 11:46:13,783 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 905 transitions, 2170 flow [2021-06-10 11:46:13,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,783 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:13,783 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:13,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2084 [2021-06-10 11:46:13,783 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:13,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash 501816731, now seen corresponding path program 1 times [2021-06-10 11:46:13,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:13,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671015806] [2021-06-10 11:46:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:13,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:13,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:13,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:13,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:46:13,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671015806] [2021-06-10 11:46:13,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:13,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:13,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974352351] [2021-06-10 11:46:13,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:13,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:13,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:13,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 905 transitions, 2170 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:13,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:13,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:13,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:14,228 INFO L129 PetriNetUnfolder]: 57/1067 cut-off events. [2021-06-10 11:46:14,228 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:14,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1067 events. 57/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4619 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1282. Up to 37 conditions per place. [2021-06-10 11:46:14,300 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/905 dead transitions. [2021-06-10 11:46:14,300 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 905 transitions, 2182 flow [2021-06-10 11:46:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:14,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:14,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:14,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:14,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:14,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:14,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,304 INFO L185 Difference]: Start difference. First operand has 984 places, 905 transitions, 2170 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:14,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 905 transitions, 2182 flow [2021-06-10 11:46:14,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 905 transitions, 2177 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:14,313 INFO L241 Difference]: Finished difference. Result has 986 places, 904 transitions, 2166 flow [2021-06-10 11:46:14,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2166, PETRI_PLACES=986, PETRI_TRANSITIONS=904} [2021-06-10 11:46:14,313 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 29 predicate places. [2021-06-10 11:46:14,314 INFO L480 AbstractCegarLoop]: Abstraction has has 986 places, 904 transitions, 2166 flow [2021-06-10 11:46:14,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:14,314 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:14,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2085 [2021-06-10 11:46:14,314 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash 500864442, now seen corresponding path program 1 times [2021-06-10 11:46:14,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:14,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028943322] [2021-06-10 11:46:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:14,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:14,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:14,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:46:14,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028943322] [2021-06-10 11:46:14,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:14,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:14,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784838548] [2021-06-10 11:46:14,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:14,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:14,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:14,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 904 transitions, 2166 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:14,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:14,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:14,756 INFO L129 PetriNetUnfolder]: 57/1060 cut-off events. [2021-06-10 11:46:14,756 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:14,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1060 events. 57/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4559 event pairs, 0 based on Foata normal form. 1/969 useless extension candidates. Maximal degree in co-relation 1276. Up to 37 conditions per place. [2021-06-10 11:46:14,826 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/902 dead transitions. [2021-06-10 11:46:14,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 902 transitions, 2169 flow [2021-06-10 11:46:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:14,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:14,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:14,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:14,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:14,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:14,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,831 INFO L185 Difference]: Start difference. First operand has 986 places, 904 transitions, 2166 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:14,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 902 transitions, 2169 flow [2021-06-10 11:46:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 902 transitions, 2162 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:14,840 INFO L241 Difference]: Finished difference. Result has 986 places, 902 transitions, 2155 flow [2021-06-10 11:46:14,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=986, PETRI_TRANSITIONS=902} [2021-06-10 11:46:14,840 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 29 predicate places. [2021-06-10 11:46:14,840 INFO L480 AbstractCegarLoop]: Abstraction has has 986 places, 902 transitions, 2155 flow [2021-06-10 11:46:14,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:14,841 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:14,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2086 [2021-06-10 11:46:14,841 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash 500863419, now seen corresponding path program 1 times [2021-06-10 11:46:14,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:14,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112074255] [2021-06-10 11:46:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:14,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:14,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:14,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:14,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:46:14,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112074255] [2021-06-10 11:46:14,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:14,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:14,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811226064] [2021-06-10 11:46:14,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:14,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:14,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:14,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 902 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:14,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:14,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:14,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:15,289 INFO L129 PetriNetUnfolder]: 57/1058 cut-off events. [2021-06-10 11:46:15,289 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:15,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 1058 events. 57/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4545 event pairs, 0 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1276. Up to 37 conditions per place. [2021-06-10 11:46:15,360 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/900 dead transitions. [2021-06-10 11:46:15,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 900 transitions, 2168 flow [2021-06-10 11:46:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:15,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:15,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:15,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:15,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:15,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:15,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,365 INFO L185 Difference]: Start difference. First operand has 986 places, 902 transitions, 2155 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:15,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 900 transitions, 2168 flow [2021-06-10 11:46:15,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 900 transitions, 2167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:15,374 INFO L241 Difference]: Finished difference. Result has 985 places, 900 transitions, 2151 flow [2021-06-10 11:46:15,374 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=899, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=985, PETRI_TRANSITIONS=900} [2021-06-10 11:46:15,375 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 28 predicate places. [2021-06-10 11:46:15,375 INFO L480 AbstractCegarLoop]: Abstraction has has 985 places, 900 transitions, 2151 flow [2021-06-10 11:46:15,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,375 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:15,375 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:15,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2087 [2021-06-10 11:46:15,375 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -622671659, now seen corresponding path program 1 times [2021-06-10 11:46:15,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:15,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326501335] [2021-06-10 11:46:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:15,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:15,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:15,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:46:15,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326501335] [2021-06-10 11:46:15,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:15,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:15,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549803330] [2021-06-10 11:46:15,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:15,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:15,400 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:15,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 900 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:15,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:15,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:15,829 INFO L129 PetriNetUnfolder]: 56/1066 cut-off events. [2021-06-10 11:46:15,830 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:15,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1066 events. 56/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4614 event pairs, 0 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1288. Up to 37 conditions per place. [2021-06-10 11:46:15,901 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/902 dead transitions. [2021-06-10 11:46:15,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 902 transitions, 2181 flow [2021-06-10 11:46:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:15,903 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:15,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:15,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:15,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:15,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:15,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,906 INFO L185 Difference]: Start difference. First operand has 985 places, 900 transitions, 2151 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:15,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 902 transitions, 2181 flow [2021-06-10 11:46:15,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 902 transitions, 2180 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:15,916 INFO L241 Difference]: Finished difference. Result has 988 places, 902 transitions, 2174 flow [2021-06-10 11:46:15,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2174, PETRI_PLACES=988, PETRI_TRANSITIONS=902} [2021-06-10 11:46:15,916 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 31 predicate places. [2021-06-10 11:46:15,916 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 902 transitions, 2174 flow [2021-06-10 11:46:15,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:15,917 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:15,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2088 [2021-06-10 11:46:15,917 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash -622670636, now seen corresponding path program 1 times [2021-06-10 11:46:15,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:15,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504994678] [2021-06-10 11:46:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:15,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:15,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:15,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:15,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:46:15,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504994678] [2021-06-10 11:46:15,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:15,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:15,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562346355] [2021-06-10 11:46:15,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:15,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:15,946 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:15,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 902 transitions, 2174 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:15,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:15,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:15,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:16,377 INFO L129 PetriNetUnfolder]: 55/1064 cut-off events. [2021-06-10 11:46:16,377 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:16,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1064 events. 55/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4606 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1285. Up to 37 conditions per place. [2021-06-10 11:46:16,448 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/902 dead transitions. [2021-06-10 11:46:16,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 902 transitions, 2186 flow [2021-06-10 11:46:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:16,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:16,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:16,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:16,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:16,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:16,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,452 INFO L185 Difference]: Start difference. First operand has 988 places, 902 transitions, 2174 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:16,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 902 transitions, 2186 flow [2021-06-10 11:46:16,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 902 transitions, 2181 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:16,461 INFO L241 Difference]: Finished difference. Result has 991 places, 902 transitions, 2179 flow [2021-06-10 11:46:16,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=899, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2179, PETRI_PLACES=991, PETRI_TRANSITIONS=902} [2021-06-10 11:46:16,462 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 34 predicate places. [2021-06-10 11:46:16,462 INFO L480 AbstractCegarLoop]: Abstraction has has 991 places, 902 transitions, 2179 flow [2021-06-10 11:46:16,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:16,462 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:16,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2089 [2021-06-10 11:46:16,462 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash -621718347, now seen corresponding path program 1 times [2021-06-10 11:46:16,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:16,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789755556] [2021-06-10 11:46:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:16,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:16,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:16,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:16,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:16,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:16,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:46:16,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789755556] [2021-06-10 11:46:16,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:16,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:16,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432797568] [2021-06-10 11:46:16,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:16,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:16,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:16,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 902 transitions, 2179 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:16,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:16,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:16,906 INFO L129 PetriNetUnfolder]: 54/1060 cut-off events. [2021-06-10 11:46:16,906 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:16,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1060 events. 54/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4577 event pairs, 0 based on Foata normal form. 1/972 useless extension candidates. Maximal degree in co-relation 1282. Up to 37 conditions per place. [2021-06-10 11:46:16,976 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/899 dead transitions. [2021-06-10 11:46:16,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 899 transitions, 2176 flow [2021-06-10 11:46:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:16,978 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:16,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:16,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:16,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:16,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:16,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,980 INFO L185 Difference]: Start difference. First operand has 991 places, 902 transitions, 2179 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:16,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 899 transitions, 2176 flow [2021-06-10 11:46:16,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 899 transitions, 2169 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:16,989 INFO L241 Difference]: Finished difference. Result has 990 places, 899 transitions, 2159 flow [2021-06-10 11:46:16,990 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2159, PETRI_PLACES=990, PETRI_TRANSITIONS=899} [2021-06-10 11:46:16,990 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 33 predicate places. [2021-06-10 11:46:16,990 INFO L480 AbstractCegarLoop]: Abstraction has has 990 places, 899 transitions, 2159 flow [2021-06-10 11:46:16,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:16,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:16,990 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:16,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2090 [2021-06-10 11:46:16,990 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash -621717324, now seen corresponding path program 1 times [2021-06-10 11:46:16,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:16,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79102471] [2021-06-10 11:46:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:17,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:17,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:17,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:46:17,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79102471] [2021-06-10 11:46:17,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:17,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:17,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456205654] [2021-06-10 11:46:17,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:17,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:17,015 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:17,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 899 transitions, 2159 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:17,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:17,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:17,442 INFO L129 PetriNetUnfolder]: 54/1058 cut-off events. [2021-06-10 11:46:17,442 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:17,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 1058 events. 54/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4560 event pairs, 0 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1283. Up to 37 conditions per place. [2021-06-10 11:46:17,513 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/897 dead transitions. [2021-06-10 11:46:17,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 897 transitions, 2172 flow [2021-06-10 11:46:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:17,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:17,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:17,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:17,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:17,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:17,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,517 INFO L185 Difference]: Start difference. First operand has 990 places, 899 transitions, 2159 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:17,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 897 transitions, 2172 flow [2021-06-10 11:46:17,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 897 transitions, 2171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:17,526 INFO L241 Difference]: Finished difference. Result has 989 places, 897 transitions, 2155 flow [2021-06-10 11:46:17,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=989, PETRI_TRANSITIONS=897} [2021-06-10 11:46:17,526 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 32 predicate places. [2021-06-10 11:46:17,526 INFO L480 AbstractCegarLoop]: Abstraction has has 989 places, 897 transitions, 2155 flow [2021-06-10 11:46:17,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:17,535 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:17,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2091 [2021-06-10 11:46:17,535 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1195994096, now seen corresponding path program 1 times [2021-06-10 11:46:17,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:17,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621433299] [2021-06-10 11:46:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:17,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:17,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:17,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:17,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:46:17,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621433299] [2021-06-10 11:46:17,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:17,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:17,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387097646] [2021-06-10 11:46:17,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:17,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:17,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:17,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 897 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:17,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:17,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:17,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:18,000 INFO L129 PetriNetUnfolder]: 53/1066 cut-off events. [2021-06-10 11:46:18,000 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:18,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1066 events. 53/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4633 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1295. Up to 37 conditions per place. [2021-06-10 11:46:18,072 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/899 dead transitions. [2021-06-10 11:46:18,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 899 transitions, 2185 flow [2021-06-10 11:46:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:18,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:18,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:18,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:18,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:18,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:18,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,076 INFO L185 Difference]: Start difference. First operand has 989 places, 897 transitions, 2155 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:18,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 899 transitions, 2185 flow [2021-06-10 11:46:18,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 899 transitions, 2184 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:18,085 INFO L241 Difference]: Finished difference. Result has 992 places, 899 transitions, 2178 flow [2021-06-10 11:46:18,086 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2178, PETRI_PLACES=992, PETRI_TRANSITIONS=899} [2021-06-10 11:46:18,086 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 35 predicate places. [2021-06-10 11:46:18,086 INFO L480 AbstractCegarLoop]: Abstraction has has 992 places, 899 transitions, 2178 flow [2021-06-10 11:46:18,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:18,086 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:18,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2092 [2021-06-10 11:46:18,086 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1195995119, now seen corresponding path program 1 times [2021-06-10 11:46:18,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:18,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937567247] [2021-06-10 11:46:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:18,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:18,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:18,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:46:18,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937567247] [2021-06-10 11:46:18,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:18,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:18,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837218468] [2021-06-10 11:46:18,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:18,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:18,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:18,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:18,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:18,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 899 transitions, 2178 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:18,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:18,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:18,537 INFO L129 PetriNetUnfolder]: 52/1064 cut-off events. [2021-06-10 11:46:18,538 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:18,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 1064 events. 52/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4619 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1292. Up to 37 conditions per place. [2021-06-10 11:46:18,608 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/899 dead transitions. [2021-06-10 11:46:18,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 899 transitions, 2190 flow [2021-06-10 11:46:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:18,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:18,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:18,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:18,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:18,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:18,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,613 INFO L185 Difference]: Start difference. First operand has 992 places, 899 transitions, 2178 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:18,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 899 transitions, 2190 flow [2021-06-10 11:46:18,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 899 transitions, 2185 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:18,623 INFO L241 Difference]: Finished difference. Result has 995 places, 899 transitions, 2183 flow [2021-06-10 11:46:18,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=995, PETRI_TRANSITIONS=899} [2021-06-10 11:46:18,623 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 38 predicate places. [2021-06-10 11:46:18,623 INFO L480 AbstractCegarLoop]: Abstraction has has 995 places, 899 transitions, 2183 flow [2021-06-10 11:46:18,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:18,623 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:18,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2093 [2021-06-10 11:46:18,624 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1196947408, now seen corresponding path program 1 times [2021-06-10 11:46:18,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:18,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106361786] [2021-06-10 11:46:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:18,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:18,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:18,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:18,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:46:18,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106361786] [2021-06-10 11:46:18,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:18,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:18,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353249394] [2021-06-10 11:46:18,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:18,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:18,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:18,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 899 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:18,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:18,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:18,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:19,087 INFO L129 PetriNetUnfolder]: 51/1060 cut-off events. [2021-06-10 11:46:19,087 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:19,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1060 events. 51/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4594 event pairs, 0 based on Foata normal form. 1/975 useless extension candidates. Maximal degree in co-relation 1289. Up to 37 conditions per place. [2021-06-10 11:46:19,156 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2021-06-10 11:46:19,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 896 transitions, 2180 flow [2021-06-10 11:46:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:19,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:19,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:19,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:19,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:19,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,160 INFO L185 Difference]: Start difference. First operand has 995 places, 899 transitions, 2183 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:19,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 896 transitions, 2180 flow [2021-06-10 11:46:19,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 896 transitions, 2173 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:19,169 INFO L241 Difference]: Finished difference. Result has 994 places, 896 transitions, 2163 flow [2021-06-10 11:46:19,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=994, PETRI_TRANSITIONS=896} [2021-06-10 11:46:19,170 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 37 predicate places. [2021-06-10 11:46:19,170 INFO L480 AbstractCegarLoop]: Abstraction has has 994 places, 896 transitions, 2163 flow [2021-06-10 11:46:19,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,170 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:19,170 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:19,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2094 [2021-06-10 11:46:19,170 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:19,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1196948431, now seen corresponding path program 1 times [2021-06-10 11:46:19,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:19,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537801381] [2021-06-10 11:46:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:19,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:19,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:19,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:46:19,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537801381] [2021-06-10 11:46:19,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:19,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:19,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570643764] [2021-06-10 11:46:19,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:19,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:19,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:19,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:19,196 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 896 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:19,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:19,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:19,664 INFO L129 PetriNetUnfolder]: 51/1058 cut-off events. [2021-06-10 11:46:19,664 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:19,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1058 events. 51/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4580 event pairs, 0 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 1290. Up to 37 conditions per place. [2021-06-10 11:46:19,706 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/894 dead transitions. [2021-06-10 11:46:19,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 894 transitions, 2176 flow [2021-06-10 11:46:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:19,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:19,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:19,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:19,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:19,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:19,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,711 INFO L185 Difference]: Start difference. First operand has 994 places, 896 transitions, 2163 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 894 transitions, 2176 flow [2021-06-10 11:46:19,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 894 transitions, 2175 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:19,719 INFO L241 Difference]: Finished difference. Result has 993 places, 894 transitions, 2159 flow [2021-06-10 11:46:19,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2159, PETRI_PLACES=993, PETRI_TRANSITIONS=894} [2021-06-10 11:46:19,719 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 36 predicate places. [2021-06-10 11:46:19,719 INFO L480 AbstractCegarLoop]: Abstraction has has 993 places, 894 transitions, 2159 flow [2021-06-10 11:46:19,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:19,720 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:19,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2095 [2021-06-10 11:46:19,720 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1043635052, now seen corresponding path program 1 times [2021-06-10 11:46:19,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:19,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995917550] [2021-06-10 11:46:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:19,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:19,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:19,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:19,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:46:19,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995917550] [2021-06-10 11:46:19,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:19,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:19,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163458085] [2021-06-10 11:46:19,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:19,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:19,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:19,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 894 transitions, 2159 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:19,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:19,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:19,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:20,172 INFO L129 PetriNetUnfolder]: 50/1065 cut-off events. [2021-06-10 11:46:20,173 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:20,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1065 events. 50/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4638 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 1295. Up to 37 conditions per place. [2021-06-10 11:46:20,242 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/895 dead transitions. [2021-06-10 11:46:20,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 895 transitions, 2175 flow [2021-06-10 11:46:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:20,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:20,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:20,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:20,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:20,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:20,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,247 INFO L185 Difference]: Start difference. First operand has 993 places, 894 transitions, 2159 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:20,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 895 transitions, 2175 flow [2021-06-10 11:46:20,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 895 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:20,256 INFO L241 Difference]: Finished difference. Result has 995 places, 894 transitions, 2163 flow [2021-06-10 11:46:20,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=995, PETRI_TRANSITIONS=894} [2021-06-10 11:46:20,256 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 38 predicate places. [2021-06-10 11:46:20,256 INFO L480 AbstractCegarLoop]: Abstraction has has 995 places, 894 transitions, 2163 flow [2021-06-10 11:46:20,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:20,256 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:20,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2096 [2021-06-10 11:46:20,257 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1043636075, now seen corresponding path program 1 times [2021-06-10 11:46:20,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:20,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665512495] [2021-06-10 11:46:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:20,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:20,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:20,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:46:20,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665512495] [2021-06-10 11:46:20,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:20,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:20,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585630363] [2021-06-10 11:46:20,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:20,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:20,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:20,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:20,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 894 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:20,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:20,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:20,718 INFO L129 PetriNetUnfolder]: 48/1067 cut-off events. [2021-06-10 11:46:20,718 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:20,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1067 events. 48/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4673 event pairs, 0 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1306. Up to 37 conditions per place. [2021-06-10 11:46:20,788 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/895 dead transitions. [2021-06-10 11:46:20,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 895 transitions, 2189 flow [2021-06-10 11:46:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:20,789 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:20,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:20,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:20,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:20,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:20,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,792 INFO L185 Difference]: Start difference. First operand has 995 places, 894 transitions, 2163 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:20,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 895 transitions, 2189 flow [2021-06-10 11:46:20,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 895 transitions, 2188 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:20,801 INFO L241 Difference]: Finished difference. Result has 998 places, 895 transitions, 2180 flow [2021-06-10 11:46:20,801 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2180, PETRI_PLACES=998, PETRI_TRANSITIONS=895} [2021-06-10 11:46:20,801 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 41 predicate places. [2021-06-10 11:46:20,801 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 895 transitions, 2180 flow [2021-06-10 11:46:20,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:20,802 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:20,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2097 [2021-06-10 11:46:20,802 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1042682763, now seen corresponding path program 1 times [2021-06-10 11:46:20,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:20,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885815495] [2021-06-10 11:46:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:20,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:20,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:20,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:20,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:46:20,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885815495] [2021-06-10 11:46:20,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:20,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:20,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375954021] [2021-06-10 11:46:20,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:20,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:20,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:20,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:20,827 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:20,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 895 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:20,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:20,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:20,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:21,259 INFO L129 PetriNetUnfolder]: 48/1060 cut-off events. [2021-06-10 11:46:21,259 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:21,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1060 events. 48/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4610 event pairs, 0 based on Foata normal form. 1/978 useless extension candidates. Maximal degree in co-relation 1292. Up to 37 conditions per place. [2021-06-10 11:46:21,329 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/893 dead transitions. [2021-06-10 11:46:21,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 893 transitions, 2182 flow [2021-06-10 11:46:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:21,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:21,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:21,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:21,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:21,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:21,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,334 INFO L185 Difference]: Start difference. First operand has 998 places, 895 transitions, 2180 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:21,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 893 transitions, 2182 flow [2021-06-10 11:46:21,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 893 transitions, 2174 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:21,343 INFO L241 Difference]: Finished difference. Result has 998 places, 893 transitions, 2167 flow [2021-06-10 11:46:21,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2167, PETRI_PLACES=998, PETRI_TRANSITIONS=893} [2021-06-10 11:46:21,343 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 41 predicate places. [2021-06-10 11:46:21,343 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 893 transitions, 2167 flow [2021-06-10 11:46:21,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:21,344 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:21,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098 [2021-06-10 11:46:21,344 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1042681740, now seen corresponding path program 1 times [2021-06-10 11:46:21,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:21,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20659964] [2021-06-10 11:46:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:21,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:21,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:21,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:46:21,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20659964] [2021-06-10 11:46:21,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:21,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:21,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537670328] [2021-06-10 11:46:21,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:21,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:21,369 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:21,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 893 transitions, 2167 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:21,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:21,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:21,788 INFO L129 PetriNetUnfolder]: 48/1058 cut-off events. [2021-06-10 11:46:21,788 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:21,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1058 events. 48/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4593 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1296. Up to 37 conditions per place. [2021-06-10 11:46:21,844 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/891 dead transitions. [2021-06-10 11:46:21,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 891 transitions, 2180 flow [2021-06-10 11:46:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:21,846 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:21,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:21,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:21,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:21,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:21,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,849 INFO L185 Difference]: Start difference. First operand has 998 places, 893 transitions, 2167 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:21,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 891 transitions, 2180 flow [2021-06-10 11:46:21,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 891 transitions, 2179 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:21,858 INFO L241 Difference]: Finished difference. Result has 997 places, 891 transitions, 2163 flow [2021-06-10 11:46:21,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=997, PETRI_TRANSITIONS=891} [2021-06-10 11:46:21,858 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 40 predicate places. [2021-06-10 11:46:21,858 INFO L480 AbstractCegarLoop]: Abstraction has has 997 places, 891 transitions, 2163 flow [2021-06-10 11:46:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:21,859 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:21,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2099 [2021-06-10 11:46:21,859 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1817359145, now seen corresponding path program 1 times [2021-06-10 11:46:21,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:21,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753153563] [2021-06-10 11:46:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:21,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:21,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:21,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:21,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:46:21,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753153563] [2021-06-10 11:46:21,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:21,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:21,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985585753] [2021-06-10 11:46:21,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:21,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:21,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:21,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:21,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 891 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:21,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:21,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:21,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:22,349 INFO L129 PetriNetUnfolder]: 47/1066 cut-off events. [2021-06-10 11:46:22,349 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:22,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 1066 events. 47/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4668 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1308. Up to 37 conditions per place. [2021-06-10 11:46:22,420 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/893 dead transitions. [2021-06-10 11:46:22,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 999 places, 893 transitions, 2193 flow [2021-06-10 11:46:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:22,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:22,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:22,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:22,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:22,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:22,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,425 INFO L185 Difference]: Start difference. First operand has 997 places, 891 transitions, 2163 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:22,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 999 places, 893 transitions, 2193 flow [2021-06-10 11:46:22,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 893 transitions, 2192 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:22,434 INFO L241 Difference]: Finished difference. Result has 1000 places, 893 transitions, 2186 flow [2021-06-10 11:46:22,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2186, PETRI_PLACES=1000, PETRI_TRANSITIONS=893} [2021-06-10 11:46:22,434 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 43 predicate places. [2021-06-10 11:46:22,434 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 893 transitions, 2186 flow [2021-06-10 11:46:22,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:22,435 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:22,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2100 [2021-06-10 11:46:22,435 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1817360168, now seen corresponding path program 1 times [2021-06-10 11:46:22,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:22,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316219471] [2021-06-10 11:46:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:22,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:22,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:22,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:22,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:22,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:22,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:46:22,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316219471] [2021-06-10 11:46:22,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:22,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:22,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645879501] [2021-06-10 11:46:22,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:22,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:22,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:22,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 893 transitions, 2186 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:22,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:22,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:22,899 INFO L129 PetriNetUnfolder]: 46/1064 cut-off events. [2021-06-10 11:46:22,899 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:22,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1064 events. 46/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4653 event pairs, 0 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1305. Up to 37 conditions per place. [2021-06-10 11:46:22,974 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/893 dead transitions. [2021-06-10 11:46:22,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 893 transitions, 2198 flow [2021-06-10 11:46:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:22,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:22,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:22,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:22,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:22,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:22,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,978 INFO L185 Difference]: Start difference. First operand has 1000 places, 893 transitions, 2186 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:22,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 893 transitions, 2198 flow [2021-06-10 11:46:22,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 893 transitions, 2193 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:22,988 INFO L241 Difference]: Finished difference. Result has 1003 places, 893 transitions, 2191 flow [2021-06-10 11:46:22,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=1003, PETRI_TRANSITIONS=893} [2021-06-10 11:46:22,988 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 46 predicate places. [2021-06-10 11:46:22,988 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 893 transitions, 2191 flow [2021-06-10 11:46:22,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:22,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:22,988 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:22,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2101 [2021-06-10 11:46:22,988 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1818312457, now seen corresponding path program 1 times [2021-06-10 11:46:22,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:22,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610784186] [2021-06-10 11:46:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:23,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:23,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:23,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:46:23,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610784186] [2021-06-10 11:46:23,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:23,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:23,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965340598] [2021-06-10 11:46:23,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:23,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:23,014 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:23,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 893 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:23,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:23,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:23,451 INFO L129 PetriNetUnfolder]: 45/1060 cut-off events. [2021-06-10 11:46:23,451 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:23,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1060 events. 45/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4627 event pairs, 0 based on Foata normal form. 1/981 useless extension candidates. Maximal degree in co-relation 1302. Up to 37 conditions per place. [2021-06-10 11:46:23,522 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/890 dead transitions. [2021-06-10 11:46:23,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 890 transitions, 2188 flow [2021-06-10 11:46:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:23,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:23,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:23,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:23,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:23,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:23,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,526 INFO L185 Difference]: Start difference. First operand has 1003 places, 893 transitions, 2191 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:23,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 890 transitions, 2188 flow [2021-06-10 11:46:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 890 transitions, 2181 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:23,535 INFO L241 Difference]: Finished difference. Result has 1002 places, 890 transitions, 2171 flow [2021-06-10 11:46:23,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2171, PETRI_PLACES=1002, PETRI_TRANSITIONS=890} [2021-06-10 11:46:23,536 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 45 predicate places. [2021-06-10 11:46:23,536 INFO L480 AbstractCegarLoop]: Abstraction has has 1002 places, 890 transitions, 2171 flow [2021-06-10 11:46:23,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,536 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:23,536 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:23,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2102 [2021-06-10 11:46:23,536 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1818313480, now seen corresponding path program 1 times [2021-06-10 11:46:23,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:23,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115183031] [2021-06-10 11:46:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:23,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:23,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:23,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:23,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:46:23,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115183031] [2021-06-10 11:46:23,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:23,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:23,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768082168] [2021-06-10 11:46:23,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:23,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:23,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:23,562 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:23,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 890 transitions, 2171 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:23,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:23,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:23,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:24,004 INFO L129 PetriNetUnfolder]: 45/1058 cut-off events. [2021-06-10 11:46:24,004 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:24,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1058 events. 45/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4615 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1303. Up to 37 conditions per place. [2021-06-10 11:46:24,065 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/888 dead transitions. [2021-06-10 11:46:24,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 888 transitions, 2184 flow [2021-06-10 11:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:24,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:24,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:24,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:24,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:24,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:24,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,069 INFO L185 Difference]: Start difference. First operand has 1002 places, 890 transitions, 2171 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:24,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 888 transitions, 2184 flow [2021-06-10 11:46:24,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 888 transitions, 2183 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:24,078 INFO L241 Difference]: Finished difference. Result has 1001 places, 888 transitions, 2167 flow [2021-06-10 11:46:24,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2167, PETRI_PLACES=1001, PETRI_TRANSITIONS=888} [2021-06-10 11:46:24,079 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 44 predicate places. [2021-06-10 11:46:24,079 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 888 transitions, 2167 flow [2021-06-10 11:46:24,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:24,079 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:24,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2103 [2021-06-10 11:46:24,079 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash -760160473, now seen corresponding path program 1 times [2021-06-10 11:46:24,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:24,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997488849] [2021-06-10 11:46:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:24,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:24,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:24,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:46:24,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997488849] [2021-06-10 11:46:24,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:24,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:24,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336771849] [2021-06-10 11:46:24,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:24,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:24,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:24,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 888 transitions, 2167 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:24,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:24,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:24,550 INFO L129 PetriNetUnfolder]: 44/1065 cut-off events. [2021-06-10 11:46:24,550 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:24,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1065 events. 44/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4672 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1308. Up to 37 conditions per place. [2021-06-10 11:46:24,621 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/889 dead transitions. [2021-06-10 11:46:24,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 889 transitions, 2183 flow [2021-06-10 11:46:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:24,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:24,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:24,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:24,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:24,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:24,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,626 INFO L185 Difference]: Start difference. First operand has 1001 places, 888 transitions, 2167 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:24,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 889 transitions, 2183 flow [2021-06-10 11:46:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 889 transitions, 2182 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:24,635 INFO L241 Difference]: Finished difference. Result has 1003 places, 888 transitions, 2171 flow [2021-06-10 11:46:24,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2171, PETRI_PLACES=1003, PETRI_TRANSITIONS=888} [2021-06-10 11:46:24,636 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 46 predicate places. [2021-06-10 11:46:24,636 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 888 transitions, 2171 flow [2021-06-10 11:46:24,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:24,636 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:24,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2104 [2021-06-10 11:46:24,636 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash -760159450, now seen corresponding path program 1 times [2021-06-10 11:46:24,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:24,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165057295] [2021-06-10 11:46:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:24,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:24,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:24,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:24,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:46:24,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165057295] [2021-06-10 11:46:24,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:24,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:24,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992555714] [2021-06-10 11:46:24,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:24,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:24,664 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:24,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 888 transitions, 2171 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:24,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:24,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:24,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:25,120 INFO L129 PetriNetUnfolder]: 42/1067 cut-off events. [2021-06-10 11:46:25,120 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:25,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1067 events. 42/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4705 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1319. Up to 37 conditions per place. [2021-06-10 11:46:25,191 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/889 dead transitions. [2021-06-10 11:46:25,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 889 transitions, 2197 flow [2021-06-10 11:46:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:25,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:25,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:25,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:25,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:25,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:25,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,196 INFO L185 Difference]: Start difference. First operand has 1003 places, 888 transitions, 2171 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:25,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 889 transitions, 2197 flow [2021-06-10 11:46:25,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 889 transitions, 2196 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:25,206 INFO L241 Difference]: Finished difference. Result has 1006 places, 889 transitions, 2188 flow [2021-06-10 11:46:25,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2188, PETRI_PLACES=1006, PETRI_TRANSITIONS=889} [2021-06-10 11:46:25,207 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 49 predicate places. [2021-06-10 11:46:25,207 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 889 transitions, 2188 flow [2021-06-10 11:46:25,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,207 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:25,207 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:25,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2105 [2021-06-10 11:46:25,207 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash -761112762, now seen corresponding path program 1 times [2021-06-10 11:46:25,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:25,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165245752] [2021-06-10 11:46:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:25,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:25,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:25,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:46:25,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165245752] [2021-06-10 11:46:25,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:25,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:25,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826393029] [2021-06-10 11:46:25,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:25,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:25,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:25,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 889 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:25,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:25,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:25,676 INFO L129 PetriNetUnfolder]: 42/1060 cut-off events. [2021-06-10 11:46:25,676 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:25,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1060 events. 42/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4645 event pairs, 0 based on Foata normal form. 1/984 useless extension candidates. Maximal degree in co-relation 1305. Up to 37 conditions per place. [2021-06-10 11:46:25,745 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/887 dead transitions. [2021-06-10 11:46:25,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 887 transitions, 2190 flow [2021-06-10 11:46:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:25,746 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:25,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:25,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:25,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:25,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:25,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,749 INFO L185 Difference]: Start difference. First operand has 1006 places, 889 transitions, 2188 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:25,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 887 transitions, 2190 flow [2021-06-10 11:46:25,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 887 transitions, 2182 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:25,758 INFO L241 Difference]: Finished difference. Result has 1006 places, 887 transitions, 2175 flow [2021-06-10 11:46:25,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=1006, PETRI_TRANSITIONS=887} [2021-06-10 11:46:25,759 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 49 predicate places. [2021-06-10 11:46:25,759 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 887 transitions, 2175 flow [2021-06-10 11:46:25,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,759 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:25,759 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:25,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2106 [2021-06-10 11:46:25,759 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:25,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash -761113785, now seen corresponding path program 1 times [2021-06-10 11:46:25,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:25,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974856502] [2021-06-10 11:46:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:25,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:25,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:25,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:25,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:46:25,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974856502] [2021-06-10 11:46:25,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:25,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:25,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551252893] [2021-06-10 11:46:25,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:25,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:25,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:25,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 887 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:25,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:25,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:25,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:26,231 INFO L129 PetriNetUnfolder]: 42/1058 cut-off events. [2021-06-10 11:46:26,231 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:26,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 1058 events. 42/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4631 event pairs, 0 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1309. Up to 37 conditions per place. [2021-06-10 11:46:26,299 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/885 dead transitions. [2021-06-10 11:46:26,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 885 transitions, 2188 flow [2021-06-10 11:46:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:26,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:26,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:26,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:26,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:26,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:26,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,303 INFO L185 Difference]: Start difference. First operand has 1006 places, 887 transitions, 2175 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:26,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 885 transitions, 2188 flow [2021-06-10 11:46:26,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 885 transitions, 2187 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:26,312 INFO L241 Difference]: Finished difference. Result has 1005 places, 885 transitions, 2171 flow [2021-06-10 11:46:26,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2171, PETRI_PLACES=1005, PETRI_TRANSITIONS=885} [2021-06-10 11:46:26,312 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 48 predicate places. [2021-06-10 11:46:26,312 INFO L480 AbstractCegarLoop]: Abstraction has has 1005 places, 885 transitions, 2171 flow [2021-06-10 11:46:26,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:26,313 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:26,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2107 [2021-06-10 11:46:26,313 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -650656923, now seen corresponding path program 1 times [2021-06-10 11:46:26,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:26,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978724932] [2021-06-10 11:46:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:26,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:26,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:26,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:46:26,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978724932] [2021-06-10 11:46:26,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:26,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:26,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222194798] [2021-06-10 11:46:26,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:26,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:26,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:26,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:26,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 885 transitions, 2171 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:26,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:26,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:26,776 INFO L129 PetriNetUnfolder]: 40/1063 cut-off events. [2021-06-10 11:46:26,777 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:26,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1063 events. 40/1063 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4683 event pairs, 0 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 1312. Up to 37 conditions per place. [2021-06-10 11:46:26,846 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/886 dead transitions. [2021-06-10 11:46:26,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 886 transitions, 2187 flow [2021-06-10 11:46:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:26,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:26,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:26,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:26,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:26,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:26,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,851 INFO L185 Difference]: Start difference. First operand has 1005 places, 885 transitions, 2171 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:26,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 886 transitions, 2187 flow [2021-06-10 11:46:26,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1006 places, 886 transitions, 2186 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:26,860 INFO L241 Difference]: Finished difference. Result has 1008 places, 886 transitions, 2184 flow [2021-06-10 11:46:26,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2184, PETRI_PLACES=1008, PETRI_TRANSITIONS=886} [2021-06-10 11:46:26,861 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 51 predicate places. [2021-06-10 11:46:26,861 INFO L480 AbstractCegarLoop]: Abstraction has has 1008 places, 886 transitions, 2184 flow [2021-06-10 11:46:26,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:26,861 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:26,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2108 [2021-06-10 11:46:26,861 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash -650657946, now seen corresponding path program 1 times [2021-06-10 11:46:26,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:26,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22149618] [2021-06-10 11:46:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:26,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:26,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:26,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:26,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:46:26,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22149618] [2021-06-10 11:46:26,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:26,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:26,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022386993] [2021-06-10 11:46:26,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:26,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:26,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:26,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:26,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 886 transitions, 2184 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:26,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:26,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:26,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:27,337 INFO L129 PetriNetUnfolder]: 40/1064 cut-off events. [2021-06-10 11:46:27,337 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:27,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1064 events. 40/1064 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4689 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1320. Up to 37 conditions per place. [2021-06-10 11:46:27,407 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/887 dead transitions. [2021-06-10 11:46:27,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 887 transitions, 2210 flow [2021-06-10 11:46:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:27,409 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:27,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:27,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:27,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:27,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:27,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,412 INFO L185 Difference]: Start difference. First operand has 1008 places, 886 transitions, 2184 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:27,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 887 transitions, 2210 flow [2021-06-10 11:46:27,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 887 transitions, 2208 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:27,421 INFO L241 Difference]: Finished difference. Result has 1011 places, 887 transitions, 2200 flow [2021-06-10 11:46:27,422 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2200, PETRI_PLACES=1011, PETRI_TRANSITIONS=887} [2021-06-10 11:46:27,422 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 54 predicate places. [2021-06-10 11:46:27,422 INFO L480 AbstractCegarLoop]: Abstraction has has 1011 places, 887 transitions, 2200 flow [2021-06-10 11:46:27,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:27,422 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:27,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2109 [2021-06-10 11:46:27,422 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash -649703611, now seen corresponding path program 1 times [2021-06-10 11:46:27,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:27,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007345456] [2021-06-10 11:46:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:27,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:27,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:27,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:27,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:27,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:27,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:46:27,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007345456] [2021-06-10 11:46:27,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:27,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:27,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333460981] [2021-06-10 11:46:27,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:27,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:27,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:27,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 887 transitions, 2200 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:27,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:27,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:27,928 INFO L129 PetriNetUnfolder]: 39/1061 cut-off events. [2021-06-10 11:46:27,928 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-06-10 11:46:27,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1061 events. 39/1061 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4673 event pairs, 0 based on Foata normal form. 2/988 useless extension candidates. Maximal degree in co-relation 1319. Up to 37 conditions per place. [2021-06-10 11:46:27,972 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 9 selfloop transitions, 1 changer transitions 0/885 dead transitions. [2021-06-10 11:46:27,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 885 transitions, 2208 flow [2021-06-10 11:46:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2021-06-10 11:46:27,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212827988338192 [2021-06-10 11:46:27,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2844 transitions. [2021-06-10 11:46:27,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2844 transitions. [2021-06-10 11:46:27,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:27,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2844 transitions. [2021-06-10 11:46:27,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.0) internal successors, (2844), 3 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,976 INFO L185 Difference]: Start difference. First operand has 1011 places, 887 transitions, 2200 flow. Second operand 3 states and 2844 transitions. [2021-06-10 11:46:27,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 885 transitions, 2208 flow [2021-06-10 11:46:27,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 885 transitions, 2207 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:27,985 INFO L241 Difference]: Finished difference. Result has 1012 places, 885 transitions, 2189 flow [2021-06-10 11:46:27,985 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2189, PETRI_PLACES=1012, PETRI_TRANSITIONS=885} [2021-06-10 11:46:27,985 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 55 predicate places. [2021-06-10 11:46:27,985 INFO L480 AbstractCegarLoop]: Abstraction has has 1012 places, 885 transitions, 2189 flow [2021-06-10 11:46:27,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:27,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:27,986 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:27,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2110 [2021-06-10 11:46:27,986 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -649704634, now seen corresponding path program 1 times [2021-06-10 11:46:27,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:27,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334240926] [2021-06-10 11:46:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:28,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:28,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:28,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:46:28,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334240926] [2021-06-10 11:46:28,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:28,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:28,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142306964] [2021-06-10 11:46:28,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:28,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:28,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:28,012 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:28,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 885 transitions, 2189 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:28,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:28,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:28,457 INFO L129 PetriNetUnfolder]: 39/1058 cut-off events. [2021-06-10 11:46:28,458 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:28,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1058 events. 39/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4647 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1313. Up to 37 conditions per place. [2021-06-10 11:46:28,525 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/882 dead transitions. [2021-06-10 11:46:28,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 882 transitions, 2190 flow [2021-06-10 11:46:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:28,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:28,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:28,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:28,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:28,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:28,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,530 INFO L185 Difference]: Start difference. First operand has 1012 places, 885 transitions, 2189 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 882 transitions, 2190 flow [2021-06-10 11:46:28,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 882 transitions, 2185 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:28,540 INFO L241 Difference]: Finished difference. Result has 1009 places, 882 transitions, 2175 flow [2021-06-10 11:46:28,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2173, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=1009, PETRI_TRANSITIONS=882} [2021-06-10 11:46:28,540 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 52 predicate places. [2021-06-10 11:46:28,540 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 882 transitions, 2175 flow [2021-06-10 11:46:28,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:28,540 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:28,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2111 [2021-06-10 11:46:28,540 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:28,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1674117914, now seen corresponding path program 1 times [2021-06-10 11:46:28,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:28,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945130659] [2021-06-10 11:46:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:28,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:28,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:28,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:28,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:46:28,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945130659] [2021-06-10 11:46:28,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:28,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:28,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728397179] [2021-06-10 11:46:28,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:28,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:28,566 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:28,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 882 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:28,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:28,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:28,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:29,004 INFO L129 PetriNetUnfolder]: 38/1065 cut-off events. [2021-06-10 11:46:29,004 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:29,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1065 events. 38/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4710 event pairs, 0 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1323. Up to 37 conditions per place. [2021-06-10 11:46:29,072 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/883 dead transitions. [2021-06-10 11:46:29,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 883 transitions, 2191 flow [2021-06-10 11:46:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:29,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:29,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:29,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:29,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:29,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:29,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,076 INFO L185 Difference]: Start difference. First operand has 1009 places, 882 transitions, 2175 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:29,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 883 transitions, 2191 flow [2021-06-10 11:46:29,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 883 transitions, 2190 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:29,085 INFO L241 Difference]: Finished difference. Result has 1011 places, 882 transitions, 2179 flow [2021-06-10 11:46:29,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2179, PETRI_PLACES=1011, PETRI_TRANSITIONS=882} [2021-06-10 11:46:29,085 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 54 predicate places. [2021-06-10 11:46:29,086 INFO L480 AbstractCegarLoop]: Abstraction has has 1011 places, 882 transitions, 2179 flow [2021-06-10 11:46:29,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:29,086 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:29,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2112 [2021-06-10 11:46:29,086 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1674116891, now seen corresponding path program 1 times [2021-06-10 11:46:29,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:29,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396180423] [2021-06-10 11:46:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:29,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:29,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:29,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:46:29,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396180423] [2021-06-10 11:46:29,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:29,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:29,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244557053] [2021-06-10 11:46:29,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:29,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:29,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:29,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 882 transitions, 2179 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:29,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:29,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:29,560 INFO L129 PetriNetUnfolder]: 36/1067 cut-off events. [2021-06-10 11:46:29,560 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:29,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1067 events. 36/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4742 event pairs, 0 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 1332. Up to 37 conditions per place. [2021-06-10 11:46:29,627 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/883 dead transitions. [2021-06-10 11:46:29,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 883 transitions, 2205 flow [2021-06-10 11:46:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:29,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:29,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:29,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:29,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:29,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:29,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,632 INFO L185 Difference]: Start difference. First operand has 1011 places, 882 transitions, 2179 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:29,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 883 transitions, 2205 flow [2021-06-10 11:46:29,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 883 transitions, 2204 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:29,641 INFO L241 Difference]: Finished difference. Result has 1014 places, 883 transitions, 2196 flow [2021-06-10 11:46:29,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2196, PETRI_PLACES=1014, PETRI_TRANSITIONS=883} [2021-06-10 11:46:29,641 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 57 predicate places. [2021-06-10 11:46:29,641 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 883 transitions, 2196 flow [2021-06-10 11:46:29,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:29,642 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:29,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2113 [2021-06-10 11:46:29,642 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1675070203, now seen corresponding path program 1 times [2021-06-10 11:46:29,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:29,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110890073] [2021-06-10 11:46:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:29,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:29,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:29,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:29,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:46:29,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110890073] [2021-06-10 11:46:29,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:29,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:29,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940606291] [2021-06-10 11:46:29,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:29,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:29,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:29,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 883 transitions, 2196 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:29,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:29,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:29,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:30,085 INFO L129 PetriNetUnfolder]: 36/1060 cut-off events. [2021-06-10 11:46:30,085 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:30,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1060 events. 36/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4683 event pairs, 0 based on Foata normal form. 1/990 useless extension candidates. Maximal degree in co-relation 1318. Up to 37 conditions per place. [2021-06-10 11:46:30,139 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/881 dead transitions. [2021-06-10 11:46:30,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 881 transitions, 2198 flow [2021-06-10 11:46:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:30,141 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:30,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:30,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:30,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:30,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:30,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,144 INFO L185 Difference]: Start difference. First operand has 1014 places, 883 transitions, 2196 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:30,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 881 transitions, 2198 flow [2021-06-10 11:46:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 881 transitions, 2190 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:30,152 INFO L241 Difference]: Finished difference. Result has 1014 places, 881 transitions, 2183 flow [2021-06-10 11:46:30,152 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=1014, PETRI_TRANSITIONS=881} [2021-06-10 11:46:30,152 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 57 predicate places. [2021-06-10 11:46:30,152 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 881 transitions, 2183 flow [2021-06-10 11:46:30,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:30,153 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:30,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2114 [2021-06-10 11:46:30,153 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1675071226, now seen corresponding path program 1 times [2021-06-10 11:46:30,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:30,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171903191] [2021-06-10 11:46:30,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:30,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:30,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:30,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:46:30,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171903191] [2021-06-10 11:46:30,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:30,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:30,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730098077] [2021-06-10 11:46:30,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:30,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:30,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:30,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 881 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:30,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:30,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:30,611 INFO L129 PetriNetUnfolder]: 36/1058 cut-off events. [2021-06-10 11:46:30,611 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:30,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1058 events. 36/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4668 event pairs, 0 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 1322. Up to 37 conditions per place. [2021-06-10 11:46:30,677 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/879 dead transitions. [2021-06-10 11:46:30,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 879 transitions, 2196 flow [2021-06-10 11:46:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:30,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:30,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:30,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:30,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:30,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:30,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,682 INFO L185 Difference]: Start difference. First operand has 1014 places, 881 transitions, 2183 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:30,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 879 transitions, 2196 flow [2021-06-10 11:46:30,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 879 transitions, 2195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:30,691 INFO L241 Difference]: Finished difference. Result has 1013 places, 879 transitions, 2179 flow [2021-06-10 11:46:30,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2179, PETRI_PLACES=1013, PETRI_TRANSITIONS=879} [2021-06-10 11:46:30,691 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 56 predicate places. [2021-06-10 11:46:30,691 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 879 transitions, 2179 flow [2021-06-10 11:46:30,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:30,692 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:30,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2115 [2021-06-10 11:46:30,692 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash 82394247, now seen corresponding path program 1 times [2021-06-10 11:46:30,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:30,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203995922] [2021-06-10 11:46:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:30,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:30,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:30,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:30,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:46:30,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203995922] [2021-06-10 11:46:30,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:30,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:30,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664518749] [2021-06-10 11:46:30,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:30,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:30,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:30,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 879 transitions, 2179 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:30,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:30,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:30,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:31,154 INFO L129 PetriNetUnfolder]: 35/1065 cut-off events. [2021-06-10 11:46:31,155 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:31,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1065 events. 35/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4725 event pairs, 0 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 1327. Up to 37 conditions per place. [2021-06-10 11:46:31,222 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/880 dead transitions. [2021-06-10 11:46:31,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 880 transitions, 2195 flow [2021-06-10 11:46:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:31,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:31,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:31,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:31,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:31,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:31,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,227 INFO L185 Difference]: Start difference. First operand has 1013 places, 879 transitions, 2179 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:31,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 880 transitions, 2195 flow [2021-06-10 11:46:31,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 880 transitions, 2194 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:31,236 INFO L241 Difference]: Finished difference. Result has 1015 places, 879 transitions, 2183 flow [2021-06-10 11:46:31,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=1015, PETRI_TRANSITIONS=879} [2021-06-10 11:46:31,236 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 58 predicate places. [2021-06-10 11:46:31,237 INFO L480 AbstractCegarLoop]: Abstraction has has 1015 places, 879 transitions, 2183 flow [2021-06-10 11:46:31,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,237 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:31,237 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:31,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2116 [2021-06-10 11:46:31,237 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash 82395270, now seen corresponding path program 1 times [2021-06-10 11:46:31,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:31,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926349201] [2021-06-10 11:46:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:31,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:31,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:31,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:46:31,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926349201] [2021-06-10 11:46:31,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:31,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:31,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59190856] [2021-06-10 11:46:31,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:31,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:31,265 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:31,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 879 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:31,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:31,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:31,740 INFO L129 PetriNetUnfolder]: 33/1067 cut-off events. [2021-06-10 11:46:31,740 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:31,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 1067 events. 33/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4761 event pairs, 0 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1338. Up to 37 conditions per place. [2021-06-10 11:46:31,807 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/880 dead transitions. [2021-06-10 11:46:31,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 880 transitions, 2209 flow [2021-06-10 11:46:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:31,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:31,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:31,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:31,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:31,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:31,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,812 INFO L185 Difference]: Start difference. First operand has 1015 places, 879 transitions, 2183 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:31,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 880 transitions, 2209 flow [2021-06-10 11:46:31,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 880 transitions, 2208 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:31,821 INFO L241 Difference]: Finished difference. Result has 1018 places, 880 transitions, 2200 flow [2021-06-10 11:46:31,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2200, PETRI_PLACES=1018, PETRI_TRANSITIONS=880} [2021-06-10 11:46:31,821 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 61 predicate places. [2021-06-10 11:46:31,821 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 880 transitions, 2200 flow [2021-06-10 11:46:31,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:31,822 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:31,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2117 [2021-06-10 11:46:31,822 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash 81441958, now seen corresponding path program 1 times [2021-06-10 11:46:31,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:31,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630696243] [2021-06-10 11:46:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:31,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:31,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:31,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:31,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:46:31,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630696243] [2021-06-10 11:46:31,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:31,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:31,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388179713] [2021-06-10 11:46:31,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:31,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:31,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:31,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 880 transitions, 2200 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:31,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:31,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:31,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:32,296 INFO L129 PetriNetUnfolder]: 33/1060 cut-off events. [2021-06-10 11:46:32,296 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:32,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1060 events. 33/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4699 event pairs, 0 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 1324. Up to 37 conditions per place. [2021-06-10 11:46:32,363 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/878 dead transitions. [2021-06-10 11:46:32,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 878 transitions, 2202 flow [2021-06-10 11:46:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:32,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:32,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:32,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:32,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:32,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:32,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,367 INFO L185 Difference]: Start difference. First operand has 1018 places, 880 transitions, 2200 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:32,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 878 transitions, 2202 flow [2021-06-10 11:46:32,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 878 transitions, 2194 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:32,377 INFO L241 Difference]: Finished difference. Result has 1018 places, 878 transitions, 2187 flow [2021-06-10 11:46:32,377 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2187, PETRI_PLACES=1018, PETRI_TRANSITIONS=878} [2021-06-10 11:46:32,377 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 61 predicate places. [2021-06-10 11:46:32,377 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 878 transitions, 2187 flow [2021-06-10 11:46:32,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:32,377 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:32,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2118 [2021-06-10 11:46:32,377 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash 81440935, now seen corresponding path program 1 times [2021-06-10 11:46:32,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:32,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819376240] [2021-06-10 11:46:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:32,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:32,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:32,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:46:32,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819376240] [2021-06-10 11:46:32,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:32,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:32,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288899797] [2021-06-10 11:46:32,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:32,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:32,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:32,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:32,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:32,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 878 transitions, 2187 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:32,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:32,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:32,849 INFO L129 PetriNetUnfolder]: 33/1058 cut-off events. [2021-06-10 11:46:32,849 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:32,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1058 events. 33/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4683 event pairs, 0 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1328. Up to 37 conditions per place. [2021-06-10 11:46:32,916 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/876 dead transitions. [2021-06-10 11:46:32,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 876 transitions, 2200 flow [2021-06-10 11:46:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:32,918 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:32,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:32,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:32,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,920 INFO L185 Difference]: Start difference. First operand has 1018 places, 878 transitions, 2187 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:32,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 876 transitions, 2200 flow [2021-06-10 11:46:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 876 transitions, 2199 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:32,930 INFO L241 Difference]: Finished difference. Result has 1017 places, 876 transitions, 2183 flow [2021-06-10 11:46:32,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=1017, PETRI_TRANSITIONS=876} [2021-06-10 11:46:32,930 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 60 predicate places. [2021-06-10 11:46:32,930 INFO L480 AbstractCegarLoop]: Abstraction has has 1017 places, 876 transitions, 2183 flow [2021-06-10 11:46:32,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:32,930 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:32,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2119 [2021-06-10 11:46:32,930 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1942539721, now seen corresponding path program 1 times [2021-06-10 11:46:32,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:32,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740927125] [2021-06-10 11:46:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:32,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:32,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:32,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:32,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:46:32,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740927125] [2021-06-10 11:46:32,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:32,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:32,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170495191] [2021-06-10 11:46:32,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:32,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:32,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:32,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 876 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:32,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:32,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:32,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:33,421 INFO L129 PetriNetUnfolder]: 32/1066 cut-off events. [2021-06-10 11:46:33,421 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:33,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1066 events. 32/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4757 event pairs, 0 based on Foata normal form. 0/997 useless extension candidates. Maximal degree in co-relation 1340. Up to 37 conditions per place. [2021-06-10 11:46:33,491 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/878 dead transitions. [2021-06-10 11:46:33,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 878 transitions, 2213 flow [2021-06-10 11:46:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:33,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:33,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:33,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:33,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:33,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:33,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:33,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:33,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:33,496 INFO L185 Difference]: Start difference. First operand has 1017 places, 876 transitions, 2183 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:33,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 878 transitions, 2213 flow [2021-06-10 11:46:33,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 878 transitions, 2212 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:33,505 INFO L241 Difference]: Finished difference. Result has 1020 places, 878 transitions, 2206 flow [2021-06-10 11:46:33,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=873, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2206, PETRI_PLACES=1020, PETRI_TRANSITIONS=878} [2021-06-10 11:46:33,506 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 63 predicate places. [2021-06-10 11:46:33,506 INFO L480 AbstractCegarLoop]: Abstraction has has 1020 places, 878 transitions, 2206 flow [2021-06-10 11:46:33,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:33,506 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:33,506 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:33,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2120 [2021-06-10 11:46:33,506 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:33,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1942540744, now seen corresponding path program 1 times [2021-06-10 11:46:33,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:33,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566633640] [2021-06-10 11:46:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:33,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:33,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:33,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:33,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:33,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:33,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:46:33,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566633640] [2021-06-10 11:46:33,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:33,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:33,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221416114] [2021-06-10 11:46:33,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:33,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:33,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:33,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 878 transitions, 2206 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:33,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:33,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:33,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:34,009 INFO L129 PetriNetUnfolder]: 31/1064 cut-off events. [2021-06-10 11:46:34,010 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:34,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1064 events. 31/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4745 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1337. Up to 37 conditions per place. [2021-06-10 11:46:34,056 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/878 dead transitions. [2021-06-10 11:46:34,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 878 transitions, 2218 flow [2021-06-10 11:46:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:34,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:34,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:34,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:34,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:34,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:34,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,061 INFO L185 Difference]: Start difference. First operand has 1020 places, 878 transitions, 2206 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:34,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 878 transitions, 2218 flow [2021-06-10 11:46:34,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 878 transitions, 2213 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:34,070 INFO L241 Difference]: Finished difference. Result has 1023 places, 878 transitions, 2211 flow [2021-06-10 11:46:34,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2211, PETRI_PLACES=1023, PETRI_TRANSITIONS=878} [2021-06-10 11:46:34,070 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 66 predicate places. [2021-06-10 11:46:34,070 INFO L480 AbstractCegarLoop]: Abstraction has has 1023 places, 878 transitions, 2211 flow [2021-06-10 11:46:34,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:34,070 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:34,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2121 [2021-06-10 11:46:34,070 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1943493033, now seen corresponding path program 1 times [2021-06-10 11:46:34,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:34,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470537968] [2021-06-10 11:46:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:34,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:34,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:34,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:46:34,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470537968] [2021-06-10 11:46:34,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:34,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:34,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646816656] [2021-06-10 11:46:34,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:34,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:34,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:34,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 878 transitions, 2211 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:34,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:34,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:34,542 INFO L129 PetriNetUnfolder]: 30/1060 cut-off events. [2021-06-10 11:46:34,542 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:34,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1060 events. 30/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4720 event pairs, 0 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 1334. Up to 37 conditions per place. [2021-06-10 11:46:34,610 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/875 dead transitions. [2021-06-10 11:46:34,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 875 transitions, 2208 flow [2021-06-10 11:46:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:34,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:34,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:34,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:34,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:34,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:34,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,620 INFO L185 Difference]: Start difference. First operand has 1023 places, 878 transitions, 2211 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 875 transitions, 2208 flow [2021-06-10 11:46:34,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 875 transitions, 2201 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:34,630 INFO L241 Difference]: Finished difference. Result has 1022 places, 875 transitions, 2191 flow [2021-06-10 11:46:34,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=1022, PETRI_TRANSITIONS=875} [2021-06-10 11:46:34,631 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 65 predicate places. [2021-06-10 11:46:34,631 INFO L480 AbstractCegarLoop]: Abstraction has has 1022 places, 875 transitions, 2191 flow [2021-06-10 11:46:34,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:34,631 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:34,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2122 [2021-06-10 11:46:34,631 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1943494056, now seen corresponding path program 1 times [2021-06-10 11:46:34,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:34,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894118934] [2021-06-10 11:46:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:34,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:34,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:34,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:34,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:46:34,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894118934] [2021-06-10 11:46:34,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:34,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:34,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657766267] [2021-06-10 11:46:34,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:34,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:34,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:34,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:34,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 875 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:34,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:34,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:34,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:35,128 INFO L129 PetriNetUnfolder]: 30/1058 cut-off events. [2021-06-10 11:46:35,129 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:35,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 1058 events. 30/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4705 event pairs, 0 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1335. Up to 37 conditions per place. [2021-06-10 11:46:35,195 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/873 dead transitions. [2021-06-10 11:46:35,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 873 transitions, 2204 flow [2021-06-10 11:46:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:35,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:35,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:35,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:35,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:35,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:35,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,199 INFO L185 Difference]: Start difference. First operand has 1022 places, 875 transitions, 2191 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:35,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 873 transitions, 2204 flow [2021-06-10 11:46:35,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 873 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:35,208 INFO L241 Difference]: Finished difference. Result has 1021 places, 873 transitions, 2187 flow [2021-06-10 11:46:35,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2187, PETRI_PLACES=1021, PETRI_TRANSITIONS=873} [2021-06-10 11:46:35,208 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 64 predicate places. [2021-06-10 11:46:35,208 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 873 transitions, 2187 flow [2021-06-10 11:46:35,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:35,209 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:35,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2123 [2021-06-10 11:46:35,209 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1383967980, now seen corresponding path program 1 times [2021-06-10 11:46:35,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:35,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283976525] [2021-06-10 11:46:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:35,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:35,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:35,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:46:35,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283976525] [2021-06-10 11:46:35,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:35,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:35,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78146655] [2021-06-10 11:46:35,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:35,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:35,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:35,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 873 transitions, 2187 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:35,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:35,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:35,706 INFO L129 PetriNetUnfolder]: 29/1066 cut-off events. [2021-06-10 11:46:35,706 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:35,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1066 events. 29/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4774 event pairs, 0 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 1347. Up to 37 conditions per place. [2021-06-10 11:46:35,774 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/875 dead transitions. [2021-06-10 11:46:35,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 875 transitions, 2217 flow [2021-06-10 11:46:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:35,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:35,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:35,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:35,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:35,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:35,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,778 INFO L185 Difference]: Start difference. First operand has 1021 places, 873 transitions, 2187 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:35,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 875 transitions, 2217 flow [2021-06-10 11:46:35,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 875 transitions, 2216 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:35,788 INFO L241 Difference]: Finished difference. Result has 1024 places, 875 transitions, 2210 flow [2021-06-10 11:46:35,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=870, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2210, PETRI_PLACES=1024, PETRI_TRANSITIONS=875} [2021-06-10 11:46:35,788 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 67 predicate places. [2021-06-10 11:46:35,788 INFO L480 AbstractCegarLoop]: Abstraction has has 1024 places, 875 transitions, 2210 flow [2021-06-10 11:46:35,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:35,788 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:35,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2124 [2021-06-10 11:46:35,788 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1383969003, now seen corresponding path program 1 times [2021-06-10 11:46:35,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:35,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544404780] [2021-06-10 11:46:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:35,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:35,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:35,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:35,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:46:35,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544404780] [2021-06-10 11:46:35,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:35,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:35,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109813503] [2021-06-10 11:46:35,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:35,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:35,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:35,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 875 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:35,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:35,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:35,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:36,256 INFO L129 PetriNetUnfolder]: 28/1064 cut-off events. [2021-06-10 11:46:36,256 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:36,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 1064 events. 28/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4761 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1344. Up to 37 conditions per place. [2021-06-10 11:46:36,317 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/875 dead transitions. [2021-06-10 11:46:36,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 875 transitions, 2222 flow [2021-06-10 11:46:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:36,319 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:36,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:36,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:36,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:36,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:36,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,322 INFO L185 Difference]: Start difference. First operand has 1024 places, 875 transitions, 2210 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 875 transitions, 2222 flow [2021-06-10 11:46:36,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 875 transitions, 2217 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:36,331 INFO L241 Difference]: Finished difference. Result has 1027 places, 875 transitions, 2215 flow [2021-06-10 11:46:36,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2215, PETRI_PLACES=1027, PETRI_TRANSITIONS=875} [2021-06-10 11:46:36,331 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 70 predicate places. [2021-06-10 11:46:36,331 INFO L480 AbstractCegarLoop]: Abstraction has has 1027 places, 875 transitions, 2215 flow [2021-06-10 11:46:36,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:36,332 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:36,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2125 [2021-06-10 11:46:36,332 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1384921292, now seen corresponding path program 1 times [2021-06-10 11:46:36,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:36,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977472426] [2021-06-10 11:46:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:36,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:36,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:36,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:46:36,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977472426] [2021-06-10 11:46:36,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:36,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:36,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212226038] [2021-06-10 11:46:36,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:36,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:36,359 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:36,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 875 transitions, 2215 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:36,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:36,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:36,816 INFO L129 PetriNetUnfolder]: 27/1060 cut-off events. [2021-06-10 11:46:36,816 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:36,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1060 events. 27/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4734 event pairs, 0 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 1341. Up to 37 conditions per place. [2021-06-10 11:46:36,884 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/872 dead transitions. [2021-06-10 11:46:36,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 872 transitions, 2212 flow [2021-06-10 11:46:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:36,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:36,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:36,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:36,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:36,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:36,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,889 INFO L185 Difference]: Start difference. First operand has 1027 places, 875 transitions, 2215 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:36,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 872 transitions, 2212 flow [2021-06-10 11:46:36,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 872 transitions, 2205 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:36,898 INFO L241 Difference]: Finished difference. Result has 1026 places, 872 transitions, 2195 flow [2021-06-10 11:46:36,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2195, PETRI_PLACES=1026, PETRI_TRANSITIONS=872} [2021-06-10 11:46:36,899 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 69 predicate places. [2021-06-10 11:46:36,899 INFO L480 AbstractCegarLoop]: Abstraction has has 1026 places, 872 transitions, 2195 flow [2021-06-10 11:46:36,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:36,899 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:36,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2126 [2021-06-10 11:46:36,899 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1384922315, now seen corresponding path program 1 times [2021-06-10 11:46:36,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:36,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580689442] [2021-06-10 11:46:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:36,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:36,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:36,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:36,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:46:36,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580689442] [2021-06-10 11:46:36,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:36,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:36,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641871003] [2021-06-10 11:46:36,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:36,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:36,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:36,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 872 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:36,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:36,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:36,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:37,387 INFO L129 PetriNetUnfolder]: 27/1058 cut-off events. [2021-06-10 11:46:37,388 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:37,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1058 events. 27/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4718 event pairs, 0 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1342. Up to 37 conditions per place. [2021-06-10 11:46:37,455 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/870 dead transitions. [2021-06-10 11:46:37,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 870 transitions, 2208 flow [2021-06-10 11:46:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:37,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:37,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:37,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:37,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:37,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:37,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:37,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:37,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:37,460 INFO L185 Difference]: Start difference. First operand has 1026 places, 872 transitions, 2195 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:37,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 870 transitions, 2208 flow [2021-06-10 11:46:37,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 870 transitions, 2207 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:37,470 INFO L241 Difference]: Finished difference. Result has 1025 places, 870 transitions, 2191 flow [2021-06-10 11:46:37,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=1025, PETRI_TRANSITIONS=870} [2021-06-10 11:46:37,470 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 68 predicate places. [2021-06-10 11:46:37,470 INFO L480 AbstractCegarLoop]: Abstraction has has 1025 places, 870 transitions, 2191 flow [2021-06-10 11:46:37,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:37,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:37,470 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:37,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2127 [2021-06-10 11:46:37,471 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1330735472, now seen corresponding path program 1 times [2021-06-10 11:46:37,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:37,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622292390] [2021-06-10 11:46:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:37,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:37,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:37,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:37,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:37,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:37,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:46:37,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622292390] [2021-06-10 11:46:37,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:37,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:37,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998919848] [2021-06-10 11:46:37,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:37,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:37,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:37,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 870 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:37,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:37,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:37,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:38,009 INFO L129 PetriNetUnfolder]: 26/1065 cut-off events. [2021-06-10 11:46:38,009 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:38,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1065 events. 26/1065 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4783 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1347. Up to 37 conditions per place. [2021-06-10 11:46:38,050 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/871 dead transitions. [2021-06-10 11:46:38,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 871 transitions, 2207 flow [2021-06-10 11:46:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:38,051 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:38,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:38,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:38,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:38,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:38,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,054 INFO L185 Difference]: Start difference. First operand has 1025 places, 870 transitions, 2191 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:38,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 871 transitions, 2207 flow [2021-06-10 11:46:38,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 871 transitions, 2206 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:38,063 INFO L241 Difference]: Finished difference. Result has 1027 places, 870 transitions, 2195 flow [2021-06-10 11:46:38,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2195, PETRI_PLACES=1027, PETRI_TRANSITIONS=870} [2021-06-10 11:46:38,063 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 70 predicate places. [2021-06-10 11:46:38,063 INFO L480 AbstractCegarLoop]: Abstraction has has 1027 places, 870 transitions, 2195 flow [2021-06-10 11:46:38,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:38,064 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:38,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2128 [2021-06-10 11:46:38,064 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:38,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:38,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1330736495, now seen corresponding path program 1 times [2021-06-10 11:46:38,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:38,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518163281] [2021-06-10 11:46:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:38,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:38,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:38,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:46:38,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518163281] [2021-06-10 11:46:38,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:38,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:38,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775313341] [2021-06-10 11:46:38,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:38,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:38,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:38,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:38,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 870 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:38,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:38,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:38,571 INFO L129 PetriNetUnfolder]: 24/1067 cut-off events. [2021-06-10 11:46:38,572 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:38,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 1067 events. 24/1067 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4819 event pairs, 0 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1358. Up to 37 conditions per place. [2021-06-10 11:46:38,637 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/871 dead transitions. [2021-06-10 11:46:38,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 871 transitions, 2221 flow [2021-06-10 11:46:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:38,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:38,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:38,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:38,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:38,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:38,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,642 INFO L185 Difference]: Start difference. First operand has 1027 places, 870 transitions, 2195 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:38,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 871 transitions, 2221 flow [2021-06-10 11:46:38,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 871 transitions, 2220 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:38,651 INFO L241 Difference]: Finished difference. Result has 1030 places, 871 transitions, 2212 flow [2021-06-10 11:46:38,651 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2212, PETRI_PLACES=1030, PETRI_TRANSITIONS=871} [2021-06-10 11:46:38,651 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 73 predicate places. [2021-06-10 11:46:38,651 INFO L480 AbstractCegarLoop]: Abstraction has has 1030 places, 871 transitions, 2212 flow [2021-06-10 11:46:38,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:38,652 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:38,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2129 [2021-06-10 11:46:38,652 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1329783183, now seen corresponding path program 1 times [2021-06-10 11:46:38,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:38,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710555683] [2021-06-10 11:46:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:38,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:38,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:38,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:38,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:46:38,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710555683] [2021-06-10 11:46:38,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:38,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:38,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007908444] [2021-06-10 11:46:38,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:38,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:38,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:38,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:38,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 871 transitions, 2212 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:38,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:38,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:38,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:39,127 INFO L129 PetriNetUnfolder]: 24/1060 cut-off events. [2021-06-10 11:46:39,128 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:39,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1060 events. 24/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4756 event pairs, 0 based on Foata normal form. 1/1002 useless extension candidates. Maximal degree in co-relation 1344. Up to 37 conditions per place. [2021-06-10 11:46:39,193 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/869 dead transitions. [2021-06-10 11:46:39,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 869 transitions, 2214 flow [2021-06-10 11:46:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:39,194 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:39,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:39,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:39,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:39,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:39,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,197 INFO L185 Difference]: Start difference. First operand has 1030 places, 871 transitions, 2212 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:39,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 869 transitions, 2214 flow [2021-06-10 11:46:39,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 869 transitions, 2206 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:39,206 INFO L241 Difference]: Finished difference. Result has 1030 places, 869 transitions, 2199 flow [2021-06-10 11:46:39,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2199, PETRI_PLACES=1030, PETRI_TRANSITIONS=869} [2021-06-10 11:46:39,207 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 73 predicate places. [2021-06-10 11:46:39,207 INFO L480 AbstractCegarLoop]: Abstraction has has 1030 places, 869 transitions, 2199 flow [2021-06-10 11:46:39,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,207 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:39,207 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:39,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2130 [2021-06-10 11:46:39,207 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1329782160, now seen corresponding path program 1 times [2021-06-10 11:46:39,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:39,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509113877] [2021-06-10 11:46:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:39,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:39,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:39,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:46:39,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509113877] [2021-06-10 11:46:39,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:39,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:39,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642258944] [2021-06-10 11:46:39,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:39,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:39,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:39,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:39,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:39,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 869 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:39,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:39,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:39,688 INFO L129 PetriNetUnfolder]: 24/1058 cut-off events. [2021-06-10 11:46:39,689 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:39,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1058 events. 24/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4741 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1348. Up to 37 conditions per place. [2021-06-10 11:46:39,754 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/867 dead transitions. [2021-06-10 11:46:39,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 867 transitions, 2212 flow [2021-06-10 11:46:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:39,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:39,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:39,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:39,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:39,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:39,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,759 INFO L185 Difference]: Start difference. First operand has 1030 places, 869 transitions, 2199 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:39,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 867 transitions, 2212 flow [2021-06-10 11:46:39,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 867 transitions, 2211 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:39,768 INFO L241 Difference]: Finished difference. Result has 1029 places, 867 transitions, 2195 flow [2021-06-10 11:46:39,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2195, PETRI_PLACES=1029, PETRI_TRANSITIONS=867} [2021-06-10 11:46:39,769 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 72 predicate places. [2021-06-10 11:46:39,769 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 867 transitions, 2195 flow [2021-06-10 11:46:39,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:39,769 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:39,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2131 [2021-06-10 11:46:39,769 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -643429868, now seen corresponding path program 1 times [2021-06-10 11:46:39,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:39,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3738203] [2021-06-10 11:46:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:39,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:39,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:39,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:39,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:46:39,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3738203] [2021-06-10 11:46:39,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:39,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:39,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838713159] [2021-06-10 11:46:39,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:39,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:39,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:39,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 867 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:39,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:39,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:39,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:40,241 INFO L129 PetriNetUnfolder]: 23/1066 cut-off events. [2021-06-10 11:46:40,242 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:40,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 1066 events. 23/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4808 event pairs, 0 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1360. Up to 37 conditions per place. [2021-06-10 11:46:40,297 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/869 dead transitions. [2021-06-10 11:46:40,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 869 transitions, 2225 flow [2021-06-10 11:46:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:40,299 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:40,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:40,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:40,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:40,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:40,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,302 INFO L185 Difference]: Start difference. First operand has 1029 places, 867 transitions, 2195 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:40,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 869 transitions, 2225 flow [2021-06-10 11:46:40,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 869 transitions, 2224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:40,310 INFO L241 Difference]: Finished difference. Result has 1032 places, 869 transitions, 2218 flow [2021-06-10 11:46:40,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2218, PETRI_PLACES=1032, PETRI_TRANSITIONS=869} [2021-06-10 11:46:40,311 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 75 predicate places. [2021-06-10 11:46:40,311 INFO L480 AbstractCegarLoop]: Abstraction has has 1032 places, 869 transitions, 2218 flow [2021-06-10 11:46:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:40,311 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:40,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2132 [2021-06-10 11:46:40,311 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:40,311 INFO L82 PathProgramCache]: Analyzing trace with hash -643430891, now seen corresponding path program 1 times [2021-06-10 11:46:40,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:40,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183784779] [2021-06-10 11:46:40,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:40,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:40,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:40,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:46:40,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183784779] [2021-06-10 11:46:40,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:40,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:40,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270050774] [2021-06-10 11:46:40,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:40,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:40,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:40,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 869 transitions, 2218 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:40,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:40,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:40,794 INFO L129 PetriNetUnfolder]: 21/1067 cut-off events. [2021-06-10 11:46:40,794 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:40,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1067 events. 21/1067 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4832 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1360. Up to 37 conditions per place. [2021-06-10 11:46:40,860 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 6 selfloop transitions, 1 changer transitions 0/869 dead transitions. [2021-06-10 11:46:40,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 869 transitions, 2230 flow [2021-06-10 11:46:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:40,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:40,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:40,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:40,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:40,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:40,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,864 INFO L185 Difference]: Start difference. First operand has 1032 places, 869 transitions, 2218 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:40,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 869 transitions, 2230 flow [2021-06-10 11:46:40,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 869 transitions, 2225 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:40,874 INFO L241 Difference]: Finished difference. Result has 1034 places, 868 transitions, 2214 flow [2021-06-10 11:46:40,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2214, PETRI_PLACES=1034, PETRI_TRANSITIONS=868} [2021-06-10 11:46:40,874 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 77 predicate places. [2021-06-10 11:46:40,874 INFO L480 AbstractCegarLoop]: Abstraction has has 1034 places, 868 transitions, 2214 flow [2021-06-10 11:46:40,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:40,874 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:40,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2133 [2021-06-10 11:46:40,875 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash -644383180, now seen corresponding path program 1 times [2021-06-10 11:46:40,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:40,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314244180] [2021-06-10 11:46:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:40,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:40,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:40,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:40,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:46:40,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314244180] [2021-06-10 11:46:40,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:40,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:40,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893828676] [2021-06-10 11:46:40,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:40,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:40,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:40,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1034 places, 868 transitions, 2214 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:40,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:40,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:40,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:41,359 INFO L129 PetriNetUnfolder]: 21/1060 cut-off events. [2021-06-10 11:46:41,360 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:41,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1060 events. 21/1060 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4768 event pairs, 0 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1354. Up to 37 conditions per place. [2021-06-10 11:46:41,427 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/866 dead transitions. [2021-06-10 11:46:41,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 866 transitions, 2217 flow [2021-06-10 11:46:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:41,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:41,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:41,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:41,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:41,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:41,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:41,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:41,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:41,431 INFO L185 Difference]: Start difference. First operand has 1034 places, 868 transitions, 2214 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:41,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 866 transitions, 2217 flow [2021-06-10 11:46:41,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 866 transitions, 2210 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:41,441 INFO L241 Difference]: Finished difference. Result has 1034 places, 866 transitions, 2203 flow [2021-06-10 11:46:41,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2203, PETRI_PLACES=1034, PETRI_TRANSITIONS=866} [2021-06-10 11:46:41,442 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 77 predicate places. [2021-06-10 11:46:41,442 INFO L480 AbstractCegarLoop]: Abstraction has has 1034 places, 866 transitions, 2203 flow [2021-06-10 11:46:41,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:41,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:41,442 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:41,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2134 [2021-06-10 11:46:41,442 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash -644384203, now seen corresponding path program 1 times [2021-06-10 11:46:41,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:41,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492349426] [2021-06-10 11:46:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:41,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:41,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:41,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:41,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:41,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:41,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:46:41,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492349426] [2021-06-10 11:46:41,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:41,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:41,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847645105] [2021-06-10 11:46:41,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:41,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:41,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:41,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1034 places, 866 transitions, 2203 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:41,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:41,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:41,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:41,983 INFO L129 PetriNetUnfolder]: 21/1058 cut-off events. [2021-06-10 11:46:41,983 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:42,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 1058 events. 21/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4758 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1354. Up to 37 conditions per place. [2021-06-10 11:46:42,022 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/864 dead transitions. [2021-06-10 11:46:42,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 864 transitions, 2216 flow [2021-06-10 11:46:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:42,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:42,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:42,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:42,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:42,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:42,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,027 INFO L185 Difference]: Start difference. First operand has 1034 places, 866 transitions, 2203 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:42,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 864 transitions, 2216 flow [2021-06-10 11:46:42,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 864 transitions, 2215 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:42,035 INFO L241 Difference]: Finished difference. Result has 1033 places, 864 transitions, 2199 flow [2021-06-10 11:46:42,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2199, PETRI_PLACES=1033, PETRI_TRANSITIONS=864} [2021-06-10 11:46:42,036 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 76 predicate places. [2021-06-10 11:46:42,036 INFO L480 AbstractCegarLoop]: Abstraction has has 1033 places, 864 transitions, 2199 flow [2021-06-10 11:46:42,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,036 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:42,036 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:42,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2135 [2021-06-10 11:46:42,036 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash -581161638, now seen corresponding path program 1 times [2021-06-10 11:46:42,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:42,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147424437] [2021-06-10 11:46:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:42,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:42,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:42,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:46:42,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147424437] [2021-06-10 11:46:42,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:42,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:42,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375737438] [2021-06-10 11:46:42,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:42,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:42,064 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:42,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 864 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:42,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:42,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:42,519 INFO L129 PetriNetUnfolder]: 19/1063 cut-off events. [2021-06-10 11:46:42,519 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:42,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1063 events. 19/1063 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4808 event pairs, 0 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1357. Up to 37 conditions per place. [2021-06-10 11:46:42,586 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/865 dead transitions. [2021-06-10 11:46:42,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 865 transitions, 2215 flow [2021-06-10 11:46:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:42,587 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:42,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:42,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:42,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:42,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:42,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,590 INFO L185 Difference]: Start difference. First operand has 1033 places, 864 transitions, 2199 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:42,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 865 transitions, 2215 flow [2021-06-10 11:46:42,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1034 places, 865 transitions, 2214 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:42,600 INFO L241 Difference]: Finished difference. Result has 1036 places, 865 transitions, 2212 flow [2021-06-10 11:46:42,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=1032, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2212, PETRI_PLACES=1036, PETRI_TRANSITIONS=865} [2021-06-10 11:46:42,600 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 79 predicate places. [2021-06-10 11:46:42,600 INFO L480 AbstractCegarLoop]: Abstraction has has 1036 places, 865 transitions, 2212 flow [2021-06-10 11:46:42,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:42,601 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:42,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2136 [2021-06-10 11:46:42,601 INFO L428 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -581162661, now seen corresponding path program 1 times [2021-06-10 11:46:42,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:42,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419859354] [2021-06-10 11:46:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:42,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:42,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:42,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:42,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:46:42,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419859354] [2021-06-10 11:46:42,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:42,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:42,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020809412] [2021-06-10 11:46:42,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:42,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:42,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:42,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 865 transitions, 2212 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:42,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:42,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:42,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:43,098 INFO L129 PetriNetUnfolder]: 19/1064 cut-off events. [2021-06-10 11:46:43,098 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:43,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1064 events. 19/1064 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4815 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1365. Up to 37 conditions per place. [2021-06-10 11:46:43,165 INFO L132 encePairwiseOnDemand]: 1025/1029 looper letters, 9 selfloop transitions, 3 changer transitions 0/866 dead transitions. [2021-06-10 11:46:43,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 866 transitions, 2238 flow [2021-06-10 11:46:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2845 transitions. [2021-06-10 11:46:43,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216067379332685 [2021-06-10 11:46:43,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2845 transitions. [2021-06-10 11:46:43,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2845 transitions. [2021-06-10 11:46:43,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:43,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2845 transitions. [2021-06-10 11:46:43,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.3333333333334) internal successors, (2845), 3 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,170 INFO L185 Difference]: Start difference. First operand has 1036 places, 865 transitions, 2212 flow. Second operand 3 states and 2845 transitions. [2021-06-10 11:46:43,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 866 transitions, 2238 flow [2021-06-10 11:46:43,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 866 transitions, 2236 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:43,179 INFO L241 Difference]: Finished difference. Result has 1039 places, 866 transitions, 2228 flow [2021-06-10 11:46:43,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2228, PETRI_PLACES=1039, PETRI_TRANSITIONS=866} [2021-06-10 11:46:43,179 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 82 predicate places. [2021-06-10 11:46:43,179 INFO L480 AbstractCegarLoop]: Abstraction has has 1039 places, 866 transitions, 2228 flow [2021-06-10 11:46:43,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:43,180 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:43,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2137 [2021-06-10 11:46:43,180 INFO L428 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -580208326, now seen corresponding path program 1 times [2021-06-10 11:46:43,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:43,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495440113] [2021-06-10 11:46:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:43,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:43,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:43,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:46:43,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495440113] [2021-06-10 11:46:43,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:43,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:43,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849126528] [2021-06-10 11:46:43,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:43,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:43,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:43,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 866 transitions, 2228 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:43,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:43,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:43,684 INFO L129 PetriNetUnfolder]: 18/1061 cut-off events. [2021-06-10 11:46:43,684 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-06-10 11:46:43,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1061 events. 18/1061 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4797 event pairs, 0 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 1364. Up to 37 conditions per place. [2021-06-10 11:46:43,750 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 9 selfloop transitions, 1 changer transitions 0/864 dead transitions. [2021-06-10 11:46:43,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 864 transitions, 2236 flow [2021-06-10 11:46:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2021-06-10 11:46:43,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212827988338192 [2021-06-10 11:46:43,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2844 transitions. [2021-06-10 11:46:43,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2844 transitions. [2021-06-10 11:46:43,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:43,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2844 transitions. [2021-06-10 11:46:43,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 948.0) internal successors, (2844), 3 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,755 INFO L185 Difference]: Start difference. First operand has 1039 places, 866 transitions, 2228 flow. Second operand 3 states and 2844 transitions. [2021-06-10 11:46:43,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 864 transitions, 2236 flow [2021-06-10 11:46:43,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 864 transitions, 2235 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:43,764 INFO L241 Difference]: Finished difference. Result has 1040 places, 864 transitions, 2217 flow [2021-06-10 11:46:43,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2217, PETRI_PLACES=1040, PETRI_TRANSITIONS=864} [2021-06-10 11:46:43,765 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 83 predicate places. [2021-06-10 11:46:43,765 INFO L480 AbstractCegarLoop]: Abstraction has has 1040 places, 864 transitions, 2217 flow [2021-06-10 11:46:43,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:43,765 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:43,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2138 [2021-06-10 11:46:43,765 INFO L428 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash -580209349, now seen corresponding path program 1 times [2021-06-10 11:46:43,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:43,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232210618] [2021-06-10 11:46:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:43,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:43,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:43,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:43,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:46:43,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232210618] [2021-06-10 11:46:43,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:43,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:43,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105098718] [2021-06-10 11:46:43,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:43,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:43,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:43,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:43,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 864 transitions, 2217 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:43,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:43,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:43,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:44,231 INFO L129 PetriNetUnfolder]: 18/1058 cut-off events. [2021-06-10 11:46:44,232 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:44,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1058 events. 18/1058 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4776 event pairs, 0 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1358. Up to 37 conditions per place. [2021-06-10 11:46:44,289 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/861 dead transitions. [2021-06-10 11:46:44,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 861 transitions, 2218 flow [2021-06-10 11:46:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:44,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:44,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:44,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:44,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:44,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:44,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,294 INFO L185 Difference]: Start difference. First operand has 1040 places, 864 transitions, 2217 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:44,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 861 transitions, 2218 flow [2021-06-10 11:46:44,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 861 transitions, 2213 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:44,303 INFO L241 Difference]: Finished difference. Result has 1037 places, 861 transitions, 2203 flow [2021-06-10 11:46:44,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2203, PETRI_PLACES=1037, PETRI_TRANSITIONS=861} [2021-06-10 11:46:44,303 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 80 predicate places. [2021-06-10 11:46:44,303 INFO L480 AbstractCegarLoop]: Abstraction has has 1037 places, 861 transitions, 2203 flow [2021-06-10 11:46:44,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:44,304 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:44,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2139 [2021-06-10 11:46:44,304 INFO L428 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash 9844866, now seen corresponding path program 1 times [2021-06-10 11:46:44,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:44,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407357441] [2021-06-10 11:46:44,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:44,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:44,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:44,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:46:44,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407357441] [2021-06-10 11:46:44,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:44,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:44,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192468924] [2021-06-10 11:46:44,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:44,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:44,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:44,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 861 transitions, 2203 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:44,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:44,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:44,813 INFO L129 PetriNetUnfolder]: 17/1066 cut-off events. [2021-06-10 11:46:44,814 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:44,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1066 events. 17/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4844 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1375. Up to 37 conditions per place. [2021-06-10 11:46:44,882 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/863 dead transitions. [2021-06-10 11:46:44,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 863 transitions, 2233 flow [2021-06-10 11:46:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:44,883 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:44,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:44,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:44,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:44,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:44,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,886 INFO L185 Difference]: Start difference. First operand has 1037 places, 861 transitions, 2203 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:44,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 863 transitions, 2233 flow [2021-06-10 11:46:44,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 863 transitions, 2232 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:44,897 INFO L241 Difference]: Finished difference. Result has 1040 places, 863 transitions, 2226 flow [2021-06-10 11:46:44,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=858, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2226, PETRI_PLACES=1040, PETRI_TRANSITIONS=863} [2021-06-10 11:46:44,897 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 83 predicate places. [2021-06-10 11:46:44,897 INFO L480 AbstractCegarLoop]: Abstraction has has 1040 places, 863 transitions, 2226 flow [2021-06-10 11:46:44,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:44,897 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:44,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2140 [2021-06-10 11:46:44,898 INFO L428 AbstractCegarLoop]: === Iteration 122 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash 9845889, now seen corresponding path program 1 times [2021-06-10 11:46:44,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:44,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843792643] [2021-06-10 11:46:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:44,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:44,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:44,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:44,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:46:44,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843792643] [2021-06-10 11:46:44,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:44,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:44,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868367826] [2021-06-10 11:46:44,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:44,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:44,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:44,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 863 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:44,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:44,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:44,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:45,397 INFO L129 PetriNetUnfolder]: 16/1064 cut-off events. [2021-06-10 11:46:45,398 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:45,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 1064 events. 16/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4832 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1370. Up to 37 conditions per place. [2021-06-10 11:46:45,464 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/863 dead transitions. [2021-06-10 11:46:45,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 863 transitions, 2238 flow [2021-06-10 11:46:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:45,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:45,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:45,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:45,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:45,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:45,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:45,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:45,468 INFO L185 Difference]: Start difference. First operand has 1040 places, 863 transitions, 2226 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:45,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 863 transitions, 2238 flow [2021-06-10 11:46:45,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 863 transitions, 2233 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:45,478 INFO L241 Difference]: Finished difference. Result has 1043 places, 863 transitions, 2231 flow [2021-06-10 11:46:45,478 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=860, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2231, PETRI_PLACES=1043, PETRI_TRANSITIONS=863} [2021-06-10 11:46:45,478 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 86 predicate places. [2021-06-10 11:46:45,478 INFO L480 AbstractCegarLoop]: Abstraction has has 1043 places, 863 transitions, 2231 flow [2021-06-10 11:46:45,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:45,479 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:45,479 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:45,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2141 [2021-06-10 11:46:45,479 INFO L428 AbstractCegarLoop]: === Iteration 123 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:45,479 INFO L82 PathProgramCache]: Analyzing trace with hash 10798178, now seen corresponding path program 1 times [2021-06-10 11:46:45,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:45,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255480599] [2021-06-10 11:46:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:45,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:45,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:45,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:45,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:45,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:45,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:46:45,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255480599] [2021-06-10 11:46:45,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:45,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:45,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213457216] [2021-06-10 11:46:45,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:45,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:45,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:45,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 863 transitions, 2231 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:45,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:45,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:45,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:46,005 INFO L129 PetriNetUnfolder]: 15/1060 cut-off events. [2021-06-10 11:46:46,005 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:46,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1060 events. 15/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4803 event pairs, 0 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 1367. Up to 37 conditions per place. [2021-06-10 11:46:46,047 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/860 dead transitions. [2021-06-10 11:46:46,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 860 transitions, 2228 flow [2021-06-10 11:46:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:46,049 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:46,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:46,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:46,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:46,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:46,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,052 INFO L185 Difference]: Start difference. First operand has 1043 places, 863 transitions, 2231 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:46,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 860 transitions, 2228 flow [2021-06-10 11:46:46,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 860 transitions, 2221 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:46,060 INFO L241 Difference]: Finished difference. Result has 1042 places, 860 transitions, 2211 flow [2021-06-10 11:46:46,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2211, PETRI_PLACES=1042, PETRI_TRANSITIONS=860} [2021-06-10 11:46:46,060 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 85 predicate places. [2021-06-10 11:46:46,061 INFO L480 AbstractCegarLoop]: Abstraction has has 1042 places, 860 transitions, 2211 flow [2021-06-10 11:46:46,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,061 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:46,061 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:46,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2142 [2021-06-10 11:46:46,061 INFO L428 AbstractCegarLoop]: === Iteration 124 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:46,061 INFO L82 PathProgramCache]: Analyzing trace with hash 10799201, now seen corresponding path program 1 times [2021-06-10 11:46:46,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:46,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654356046] [2021-06-10 11:46:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:46,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:46,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:46,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:46:46,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654356046] [2021-06-10 11:46:46,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:46,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:46,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263810473] [2021-06-10 11:46:46,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:46,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:46,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:46,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 860 transitions, 2211 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:46,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:46,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:46,565 INFO L129 PetriNetUnfolder]: 15/1058 cut-off events. [2021-06-10 11:46:46,565 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:46,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 1058 events. 15/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4792 event pairs, 0 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1368. Up to 37 conditions per place. [2021-06-10 11:46:46,631 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/858 dead transitions. [2021-06-10 11:46:46,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 858 transitions, 2224 flow [2021-06-10 11:46:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:46,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:46,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:46,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:46,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:46,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:46,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,637 INFO L185 Difference]: Start difference. First operand has 1042 places, 860 transitions, 2211 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:46,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 858 transitions, 2224 flow [2021-06-10 11:46:46,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 858 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:46,646 INFO L241 Difference]: Finished difference. Result has 1041 places, 858 transitions, 2207 flow [2021-06-10 11:46:46,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2207, PETRI_PLACES=1041, PETRI_TRANSITIONS=858} [2021-06-10 11:46:46,647 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 84 predicate places. [2021-06-10 11:46:46,647 INFO L480 AbstractCegarLoop]: Abstraction has has 1041 places, 858 transitions, 2207 flow [2021-06-10 11:46:46,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:46,647 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:46,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2143 [2021-06-10 11:46:46,647 INFO L428 AbstractCegarLoop]: === Iteration 125 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1453457366, now seen corresponding path program 1 times [2021-06-10 11:46:46,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:46,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236394866] [2021-06-10 11:46:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:46,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:46,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:46,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:46,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:46:46,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236394866] [2021-06-10 11:46:46,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:46,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:46,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077591903] [2021-06-10 11:46:46,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:46,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:46,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:46,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:46,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 858 transitions, 2207 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:46,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:46,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:46,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:47,156 INFO L129 PetriNetUnfolder]: 14/1066 cut-off events. [2021-06-10 11:46:47,156 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:47,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1066 events. 14/1066 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4862 event pairs, 0 based on Foata normal form. 0/1015 useless extension candidates. Maximal degree in co-relation 1380. Up to 37 conditions per place. [2021-06-10 11:46:47,224 INFO L132 encePairwiseOnDemand]: 1024/1029 looper letters, 10 selfloop transitions, 3 changer transitions 0/860 dead transitions. [2021-06-10 11:46:47,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 860 transitions, 2237 flow [2021-06-10 11:46:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2847 transitions. [2021-06-10 11:46:47,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9222546161321672 [2021-06-10 11:46:47,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2847 transitions. [2021-06-10 11:46:47,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2847 transitions. [2021-06-10 11:46:47,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:47,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2847 transitions. [2021-06-10 11:46:47,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 949.0) internal successors, (2847), 3 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,228 INFO L185 Difference]: Start difference. First operand has 1041 places, 858 transitions, 2207 flow. Second operand 3 states and 2847 transitions. [2021-06-10 11:46:47,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 860 transitions, 2237 flow [2021-06-10 11:46:47,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 860 transitions, 2236 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:47,238 INFO L241 Difference]: Finished difference. Result has 1044 places, 860 transitions, 2230 flow [2021-06-10 11:46:47,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2230, PETRI_PLACES=1044, PETRI_TRANSITIONS=860} [2021-06-10 11:46:47,239 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 87 predicate places. [2021-06-10 11:46:47,239 INFO L480 AbstractCegarLoop]: Abstraction has has 1044 places, 860 transitions, 2230 flow [2021-06-10 11:46:47,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:47,239 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:47,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2144 [2021-06-10 11:46:47,239 INFO L428 AbstractCegarLoop]: === Iteration 126 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1453456343, now seen corresponding path program 1 times [2021-06-10 11:46:47,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:47,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788131494] [2021-06-10 11:46:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:47,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:47,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:47,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:46:47,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788131494] [2021-06-10 11:46:47,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:47,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:47,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091732796] [2021-06-10 11:46:47,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:47,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:47,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:47,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 860 transitions, 2230 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:47,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:47,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:47,741 INFO L129 PetriNetUnfolder]: 13/1064 cut-off events. [2021-06-10 11:46:47,741 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:47,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1064 events. 13/1064 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4853 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1377. Up to 37 conditions per place. [2021-06-10 11:46:47,807 INFO L132 encePairwiseOnDemand]: 1026/1029 looper letters, 5 selfloop transitions, 2 changer transitions 0/860 dead transitions. [2021-06-10 11:46:47,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 860 transitions, 2242 flow [2021-06-10 11:46:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2855 transitions. [2021-06-10 11:46:47,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248461289277616 [2021-06-10 11:46:47,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2855 transitions. [2021-06-10 11:46:47,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2855 transitions. [2021-06-10 11:46:47,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:47,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2855 transitions. [2021-06-10 11:46:47,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.6666666666666) internal successors, (2855), 3 states have internal predecessors, (2855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,812 INFO L185 Difference]: Start difference. First operand has 1044 places, 860 transitions, 2230 flow. Second operand 3 states and 2855 transitions. [2021-06-10 11:46:47,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 860 transitions, 2242 flow [2021-06-10 11:46:47,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 860 transitions, 2237 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:47,821 INFO L241 Difference]: Finished difference. Result has 1047 places, 860 transitions, 2235 flow [2021-06-10 11:46:47,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=1047, PETRI_TRANSITIONS=860} [2021-06-10 11:46:47,822 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 90 predicate places. [2021-06-10 11:46:47,822 INFO L480 AbstractCegarLoop]: Abstraction has has 1047 places, 860 transitions, 2235 flow [2021-06-10 11:46:47,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:47,822 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:47,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2145 [2021-06-10 11:46:47,822 INFO L428 AbstractCegarLoop]: === Iteration 127 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1452504054, now seen corresponding path program 1 times [2021-06-10 11:46:47,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:47,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757854613] [2021-06-10 11:46:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:47,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:47,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:47,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:47,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:46:47,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757854613] [2021-06-10 11:46:47,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:47,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:47,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772173964] [2021-06-10 11:46:47,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:47,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:47,850 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 949 out of 1029 [2021-06-10 11:46:47,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 860 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:47,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:47,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 949 of 1029 [2021-06-10 11:46:47,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:48,295 INFO L129 PetriNetUnfolder]: 12/1060 cut-off events. [2021-06-10 11:46:48,295 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:48,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1060 events. 12/1060 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4822 event pairs, 0 based on Foata normal form. 1/1014 useless extension candidates. Maximal degree in co-relation 1374. Up to 37 conditions per place. [2021-06-10 11:46:48,356 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 5 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2021-06-10 11:46:48,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 857 transitions, 2232 flow [2021-06-10 11:46:48,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2854 transitions. [2021-06-10 11:46:48,358 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9245221898283122 [2021-06-10 11:46:48,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2854 transitions. [2021-06-10 11:46:48,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2854 transitions. [2021-06-10 11:46:48,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:48,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2854 transitions. [2021-06-10 11:46:48,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 951.3333333333334) internal successors, (2854), 3 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,361 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,361 INFO L185 Difference]: Start difference. First operand has 1047 places, 860 transitions, 2235 flow. Second operand 3 states and 2854 transitions. [2021-06-10 11:46:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 857 transitions, 2232 flow [2021-06-10 11:46:48,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 857 transitions, 2225 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:48,370 INFO L241 Difference]: Finished difference. Result has 1046 places, 857 transitions, 2215 flow [2021-06-10 11:46:48,371 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=856, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2215, PETRI_PLACES=1046, PETRI_TRANSITIONS=857} [2021-06-10 11:46:48,371 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 89 predicate places. [2021-06-10 11:46:48,371 INFO L480 AbstractCegarLoop]: Abstraction has has 1046 places, 857 transitions, 2215 flow [2021-06-10 11:46:48,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 950.3333333333334) internal successors, (2851), 3 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:48,371 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:48,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2146 [2021-06-10 11:46:48,371 INFO L428 AbstractCegarLoop]: === Iteration 128 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1452503031, now seen corresponding path program 1 times [2021-06-10 11:46:48,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:48,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531984442] [2021-06-10 11:46:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:48,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:48,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:48,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:48,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:48,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:48,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:46:48,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531984442] [2021-06-10 11:46:48,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:48,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:48,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826400144] [2021-06-10 11:46:48,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:48,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:48,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 944 out of 1029 [2021-06-10 11:46:48,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 857 transitions, 2215 flow. Second operand has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:48,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 944 of 1029 [2021-06-10 11:46:48,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:48,871 INFO L129 PetriNetUnfolder]: 12/1058 cut-off events. [2021-06-10 11:46:48,871 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-10 11:46:48,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 1058 events. 12/1058 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4810 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1375. Up to 37 conditions per place. [2021-06-10 11:46:48,935 INFO L132 encePairwiseOnDemand]: 1027/1029 looper letters, 8 selfloop transitions, 1 changer transitions 0/855 dead transitions. [2021-06-10 11:46:48,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 855 transitions, 2228 flow [2021-06-10 11:46:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2842 transitions. [2021-06-10 11:46:48,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2021-06-10 11:46:48,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2842 transitions. [2021-06-10 11:46:48,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2842 transitions. [2021-06-10 11:46:48,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:48,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2842 transitions. [2021-06-10 11:46:48,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 947.3333333333334) internal successors, (2842), 3 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1029.0) internal successors, (4116), 4 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,939 INFO L185 Difference]: Start difference. First operand has 1046 places, 857 transitions, 2215 flow. Second operand 3 states and 2842 transitions. [2021-06-10 11:46:48,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 855 transitions, 2228 flow [2021-06-10 11:46:48,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 855 transitions, 2227 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:48,948 INFO L241 Difference]: Finished difference. Result has 1045 places, 855 transitions, 2211 flow [2021-06-10 11:46:48,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1029, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2211, PETRI_PLACES=1045, PETRI_TRANSITIONS=855} [2021-06-10 11:46:48,949 INFO L343 CegarLoopForPetriNet]: 957 programPoint places, 88 predicate places. [2021-06-10 11:46:48,949 INFO L480 AbstractCegarLoop]: Abstraction has has 1045 places, 855 transitions, 2211 flow [2021-06-10 11:46:48,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 946.3333333333334) internal successors, (2839), 3 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:48,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:48,949 INFO L263 CegarLoopForPetriNet]: trace histogram [37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:48,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2147 [2021-06-10 11:46:48,949 INFO L428 AbstractCegarLoop]: === Iteration 129 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -349440240, now seen corresponding path program 1 times [2021-06-10 11:46:48,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:48,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899965198] [2021-06-10 11:46:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:46:48,969 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:46:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:46:48,975 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:46:48,998 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:46:48,998 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:46:48,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2148 [2021-06-10 11:46:48,998 WARN L342 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:46:48,998 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,059 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,064 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,066 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,071 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,072 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,073 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,074 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,075 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,079 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,080 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,081 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,082 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,083 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,084 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,085 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,086 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,087 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,088 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,091 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,092 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,093 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,094 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,095 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,096 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,113 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,114 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,115 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,117 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,118 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,119 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,120 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,122 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,125 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,126 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,127 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,128 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,129 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,130 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,131 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,132 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,133 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,134 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,135 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,136 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,137 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,138 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,139 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,140 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,150 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,151 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,152 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,153 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,154 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,155 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,156 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,157 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,158 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,159 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,160 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,175 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,176 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,177 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,178 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,179 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of37ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of37ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:46:49,181 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:46:49,181 INFO L253 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-06-10 11:46:49,182 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:46:49,182 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:46:49,182 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:46:49,182 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:46:49,182 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:46:49,182 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:46:49,182 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:46:49,182 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:46:49,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 983 places, 1057 transitions, 3631 flow [2021-06-10 11:46:49,709 INFO L129 PetriNetUnfolder]: 186/1389 cut-off events. [2021-06-10 11:46:49,710 INFO L130 PetriNetUnfolder]: For 9102/9102 co-relation queries the response was YES. [2021-06-10 11:46:49,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1389 events. 186/1389 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6022 event pairs, 0 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2117. Up to 76 conditions per place. [2021-06-10 11:46:49,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 983 places, 1057 transitions, 3631 flow [2021-06-10 11:46:49,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 983 places, 1057 transitions, 3631 flow [2021-06-10 11:46:49,857 INFO L129 PetriNetUnfolder]: 9/101 cut-off events. [2021-06-10 11:46:49,857 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:46:49,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:49,858 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-06-10 11:46:49,858 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash 602775422, now seen corresponding path program 1 times [2021-06-10 11:46:49,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:49,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841084346] [2021-06-10 11:46:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:49,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:49,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:49,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:49,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:49,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:49,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:46:49,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841084346] [2021-06-10 11:46:49,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:49,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:49,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325036149] [2021-06-10 11:46:49,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:49,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:49,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:49,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1057 transitions, 3631 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:49,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:49,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:49,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:50,319 INFO L129 PetriNetUnfolder]: 110/1094 cut-off events. [2021-06-10 11:46:50,320 INFO L130 PetriNetUnfolder]: For 9103/9103 co-relation queries the response was YES. [2021-06-10 11:46:50,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1094 events. 110/1094 cut-off events. For 9103/9103 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4431 event pairs, 0 based on Foata normal form. 151/1096 useless extension candidates. Maximal degree in co-relation 1832. Up to 38 conditions per place. [2021-06-10 11:46:50,402 INFO L132 encePairwiseOnDemand]: 1016/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/978 dead transitions. [2021-06-10 11:46:50,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 978 transitions, 3487 flow [2021-06-10 11:46:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:46:50,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9495427309996847 [2021-06-10 11:46:50,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:46:50,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:46:50,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:50,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:46:50,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,407 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,407 INFO L185 Difference]: Start difference. First operand has 983 places, 1057 transitions, 3631 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:46:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 978 transitions, 3487 flow [2021-06-10 11:46:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 978 transitions, 2155 flow, removed 666 selfloop flow, removed 0 redundant places. [2021-06-10 11:46:50,426 INFO L241 Difference]: Finished difference. Result has 944 places, 977 transitions, 2144 flow [2021-06-10 11:46:50,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=944, PETRI_TRANSITIONS=977} [2021-06-10 11:46:50,427 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -39 predicate places. [2021-06-10 11:46:50,427 INFO L480 AbstractCegarLoop]: Abstraction has has 944 places, 977 transitions, 2144 flow [2021-06-10 11:46:50,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:50,427 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-06-10 11:46:50,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2149 [2021-06-10 11:46:50,427 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash 601823133, now seen corresponding path program 1 times [2021-06-10 11:46:50,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:50,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788223741] [2021-06-10 11:46:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:50,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:50,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:50,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:46:50,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788223741] [2021-06-10 11:46:50,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:50,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:50,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378904889] [2021-06-10 11:46:50,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:50,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:50,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:50,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 977 transitions, 2144 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:50,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:50,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:50,837 INFO L129 PetriNetUnfolder]: 108/1091 cut-off events. [2021-06-10 11:46:50,838 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:50,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 1091 events. 108/1091 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4421 event pairs, 0 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 1199. Up to 38 conditions per place. [2021-06-10 11:46:50,921 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/977 dead transitions. [2021-06-10 11:46:50,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 946 places, 977 transitions, 2156 flow [2021-06-10 11:46:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:46:50,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:46:50,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:46:50,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:46:50,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:50,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:46:50,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,925 INFO L185 Difference]: Start difference. First operand has 944 places, 977 transitions, 2144 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:46:50,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 946 places, 977 transitions, 2156 flow [2021-06-10 11:46:50,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 945 places, 977 transitions, 2155 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:50,934 INFO L241 Difference]: Finished difference. Result has 946 places, 977 transitions, 2148 flow [2021-06-10 11:46:50,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=976, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=946, PETRI_TRANSITIONS=977} [2021-06-10 11:46:50,934 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -37 predicate places. [2021-06-10 11:46:50,935 INFO L480 AbstractCegarLoop]: Abstraction has has 946 places, 977 transitions, 2148 flow [2021-06-10 11:46:50,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,935 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:50,935 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-06-10 11:46:50,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2150 [2021-06-10 11:46:50,935 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 601822110, now seen corresponding path program 1 times [2021-06-10 11:46:50,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:50,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603546581] [2021-06-10 11:46:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:50,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:50,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:50,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:50,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:46:50,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603546581] [2021-06-10 11:46:50,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:50,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:50,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855206984] [2021-06-10 11:46:50,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:50,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:50,956 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:50,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 977 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:50,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:50,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:50,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:51,351 INFO L129 PetriNetUnfolder]: 108/1089 cut-off events. [2021-06-10 11:46:51,351 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:51,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 1089 events. 108/1089 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4406 event pairs, 0 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1205. Up to 38 conditions per place. [2021-06-10 11:46:51,435 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 8 selfloop transitions, 2 changer transitions 0/976 dead transitions. [2021-06-10 11:46:51,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 976 transitions, 2166 flow [2021-06-10 11:46:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2921 transitions. [2021-06-10 11:46:51,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9211605171870072 [2021-06-10 11:46:51,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2921 transitions. [2021-06-10 11:46:51,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2921 transitions. [2021-06-10 11:46:51,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:51,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2921 transitions. [2021-06-10 11:46:51,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.6666666666666) internal successors, (2921), 3 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,440 INFO L185 Difference]: Start difference. First operand has 946 places, 977 transitions, 2148 flow. Second operand 3 states and 2921 transitions. [2021-06-10 11:46:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 976 transitions, 2166 flow [2021-06-10 11:46:51,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 976 transitions, 2165 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:51,448 INFO L241 Difference]: Finished difference. Result has 947 places, 976 transitions, 2149 flow [2021-06-10 11:46:51,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2149, PETRI_PLACES=947, PETRI_TRANSITIONS=976} [2021-06-10 11:46:51,449 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -36 predicate places. [2021-06-10 11:46:51,449 INFO L480 AbstractCegarLoop]: Abstraction has has 947 places, 976 transitions, 2149 flow [2021-06-10 11:46:51,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,449 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:51,449 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-06-10 11:46:51,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2151 [2021-06-10 11:46:51,449 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 602776445, now seen corresponding path program 1 times [2021-06-10 11:46:51,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:51,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136568853] [2021-06-10 11:46:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:51,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:51,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:51,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:46:51,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136568853] [2021-06-10 11:46:51,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:51,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:51,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796361331] [2021-06-10 11:46:51,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:51,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:51,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:51,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 976 transitions, 2149 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:51,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:51,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:51,876 INFO L129 PetriNetUnfolder]: 108/1087 cut-off events. [2021-06-10 11:46:51,876 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:51,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1087 events. 108/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4392 event pairs, 0 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 1200. Up to 38 conditions per place. [2021-06-10 11:46:51,961 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/974 dead transitions. [2021-06-10 11:46:51,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 974 transitions, 2161 flow [2021-06-10 11:46:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:46:51,962 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:46:51,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:46:51,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:46:51,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:51,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:46:51,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,965 INFO L185 Difference]: Start difference. First operand has 947 places, 976 transitions, 2149 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:46:51,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 974 transitions, 2161 flow [2021-06-10 11:46:51,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 974 transitions, 2160 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:51,974 INFO L241 Difference]: Finished difference. Result has 946 places, 974 transitions, 2144 flow [2021-06-10 11:46:51,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=946, PETRI_TRANSITIONS=974} [2021-06-10 11:46:51,975 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -37 predicate places. [2021-06-10 11:46:51,975 INFO L480 AbstractCegarLoop]: Abstraction has has 946 places, 974 transitions, 2144 flow [2021-06-10 11:46:51,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,975 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:51,975 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:51,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2152 [2021-06-10 11:46:51,975 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1678549859, now seen corresponding path program 1 times [2021-06-10 11:46:51,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:51,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326785746] [2021-06-10 11:46:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:51,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:51,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:51,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:51,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:46:51,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326785746] [2021-06-10 11:46:51,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:51,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:51,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748300850] [2021-06-10 11:46:51,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:51,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:51,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:51,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 946 places, 974 transitions, 2144 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:51,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:51,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:51,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:52,389 INFO L129 PetriNetUnfolder]: 107/1094 cut-off events. [2021-06-10 11:46:52,389 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:52,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 1094 events. 107/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4454 event pairs, 0 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1208. Up to 38 conditions per place. [2021-06-10 11:46:52,457 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/975 dead transitions. [2021-06-10 11:46:52,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 975 transitions, 2160 flow [2021-06-10 11:46:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:46:52,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:46:52,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:46:52,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:46:52,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:52,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:46:52,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,462 INFO L185 Difference]: Start difference. First operand has 946 places, 974 transitions, 2144 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:46:52,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 975 transitions, 2160 flow [2021-06-10 11:46:52,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 975 transitions, 2159 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:52,470 INFO L241 Difference]: Finished difference. Result has 948 places, 974 transitions, 2148 flow [2021-06-10 11:46:52,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=948, PETRI_TRANSITIONS=974} [2021-06-10 11:46:52,470 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -35 predicate places. [2021-06-10 11:46:52,470 INFO L480 AbstractCegarLoop]: Abstraction has has 948 places, 974 transitions, 2148 flow [2021-06-10 11:46:52,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:52,471 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:52,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2153 [2021-06-10 11:46:52,471 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1678550882, now seen corresponding path program 1 times [2021-06-10 11:46:52,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:52,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22750413] [2021-06-10 11:46:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:52,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:52,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:52,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:52,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:52,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:52,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:46:52,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22750413] [2021-06-10 11:46:52,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:52,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:52,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204987973] [2021-06-10 11:46:52,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:52,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:52,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:52,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 974 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:52,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:52,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:52,895 INFO L129 PetriNetUnfolder]: 105/1096 cut-off events. [2021-06-10 11:46:52,895 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:52,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 1096 events. 105/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4483 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1219. Up to 38 conditions per place. [2021-06-10 11:46:52,978 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/975 dead transitions. [2021-06-10 11:46:52,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 975 transitions, 2174 flow [2021-06-10 11:46:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:46:52,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:46:52,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:46:52,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:46:52,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:52,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:46:52,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,983 INFO L185 Difference]: Start difference. First operand has 948 places, 974 transitions, 2148 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:46:52,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 950 places, 975 transitions, 2174 flow [2021-06-10 11:46:52,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 949 places, 975 transitions, 2173 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:52,992 INFO L241 Difference]: Finished difference. Result has 951 places, 975 transitions, 2165 flow [2021-06-10 11:46:52,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=947, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=971, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2165, PETRI_PLACES=951, PETRI_TRANSITIONS=975} [2021-06-10 11:46:52,992 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -32 predicate places. [2021-06-10 11:46:52,992 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 975 transitions, 2165 flow [2021-06-10 11:46:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:52,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:52,993 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:52,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2154 [2021-06-10 11:46:52,993 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1677597570, now seen corresponding path program 1 times [2021-06-10 11:46:52,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:52,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911913756] [2021-06-10 11:46:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:53,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:53,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:53,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:46:53,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911913756] [2021-06-10 11:46:53,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:53,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:53,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924719742] [2021-06-10 11:46:53,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:53,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:53,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:53,014 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:53,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 975 transitions, 2165 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:53,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:53,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:53,409 INFO L129 PetriNetUnfolder]: 105/1089 cut-off events. [2021-06-10 11:46:53,409 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:53,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1089 events. 105/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4428 event pairs, 0 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 1205. Up to 38 conditions per place. [2021-06-10 11:46:53,493 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2021-06-10 11:46:53,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 973 transitions, 2167 flow [2021-06-10 11:46:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:46:53,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:46:53,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:46:53,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:46:53,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:53,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:46:53,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,497 INFO L185 Difference]: Start difference. First operand has 951 places, 975 transitions, 2165 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:46:53,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 973 transitions, 2167 flow [2021-06-10 11:46:53,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 973 transitions, 2159 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:53,506 INFO L241 Difference]: Finished difference. Result has 951 places, 973 transitions, 2152 flow [2021-06-10 11:46:53,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2152, PETRI_PLACES=951, PETRI_TRANSITIONS=973} [2021-06-10 11:46:53,507 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -32 predicate places. [2021-06-10 11:46:53,507 INFO L480 AbstractCegarLoop]: Abstraction has has 951 places, 973 transitions, 2152 flow [2021-06-10 11:46:53,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:53,507 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:53,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2155 [2021-06-10 11:46:53,507 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1677596547, now seen corresponding path program 1 times [2021-06-10 11:46:53,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:53,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2921616] [2021-06-10 11:46:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:53,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:53,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:53,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:53,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:46:53,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2921616] [2021-06-10 11:46:53,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:53,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:53,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227738565] [2021-06-10 11:46:53,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:53,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:53,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:53,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 973 transitions, 2152 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:53,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:53,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:53,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:53,945 INFO L129 PetriNetUnfolder]: 105/1087 cut-off events. [2021-06-10 11:46:53,945 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:54,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 1087 events. 105/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4415 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1209. Up to 38 conditions per place. [2021-06-10 11:46:54,028 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/971 dead transitions. [2021-06-10 11:46:54,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 971 transitions, 2165 flow [2021-06-10 11:46:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:46:54,030 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:46:54,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:46:54,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:46:54,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:54,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:46:54,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,033 INFO L185 Difference]: Start difference. First operand has 951 places, 973 transitions, 2152 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:46:54,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 971 transitions, 2165 flow [2021-06-10 11:46:54,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 971 transitions, 2164 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:54,042 INFO L241 Difference]: Finished difference. Result has 950 places, 971 transitions, 2148 flow [2021-06-10 11:46:54,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=950, PETRI_TRANSITIONS=971} [2021-06-10 11:46:54,042 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -33 predicate places. [2021-06-10 11:46:54,042 INFO L480 AbstractCegarLoop]: Abstraction has has 950 places, 971 transitions, 2148 flow [2021-06-10 11:46:54,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:54,043 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:54,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2156 [2021-06-10 11:46:54,043 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1977678391, now seen corresponding path program 1 times [2021-06-10 11:46:54,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:54,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112929781] [2021-06-10 11:46:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:54,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:54,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:54,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:46:54,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112929781] [2021-06-10 11:46:54,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:54,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:54,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830101706] [2021-06-10 11:46:54,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:54,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:54,065 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:54,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 971 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:54,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:54,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:54,457 INFO L129 PetriNetUnfolder]: 104/1094 cut-off events. [2021-06-10 11:46:54,457 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:54,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1094 events. 104/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4470 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1214. Up to 38 conditions per place. [2021-06-10 11:46:54,521 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/972 dead transitions. [2021-06-10 11:46:54,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 972 transitions, 2164 flow [2021-06-10 11:46:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:46:54,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:46:54,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:46:54,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:46:54,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:54,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:46:54,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,525 INFO L185 Difference]: Start difference. First operand has 950 places, 971 transitions, 2148 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:46:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 952 places, 972 transitions, 2164 flow [2021-06-10 11:46:54,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 972 transitions, 2163 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:54,533 INFO L241 Difference]: Finished difference. Result has 952 places, 971 transitions, 2152 flow [2021-06-10 11:46:54,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2147, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2152, PETRI_PLACES=952, PETRI_TRANSITIONS=971} [2021-06-10 11:46:54,533 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -31 predicate places. [2021-06-10 11:46:54,534 INFO L480 AbstractCegarLoop]: Abstraction has has 952 places, 971 transitions, 2152 flow [2021-06-10 11:46:54,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:54,534 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:54,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2157 [2021-06-10 11:46:54,534 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1977677368, now seen corresponding path program 1 times [2021-06-10 11:46:54,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:54,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350573681] [2021-06-10 11:46:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:54,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:54,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:54,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:54,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:46:54,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350573681] [2021-06-10 11:46:54,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:54,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:54,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045394843] [2021-06-10 11:46:54,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:54,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:54,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:54,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 971 transitions, 2152 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:54,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:54,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:54,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:54,963 INFO L129 PetriNetUnfolder]: 102/1096 cut-off events. [2021-06-10 11:46:54,963 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:55,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1096 events. 102/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4506 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1225. Up to 38 conditions per place. [2021-06-10 11:46:55,050 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/972 dead transitions. [2021-06-10 11:46:55,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 972 transitions, 2178 flow [2021-06-10 11:46:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:46:55,051 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:46:55,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:46:55,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:46:55,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:55,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:46:55,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,054 INFO L185 Difference]: Start difference. First operand has 952 places, 971 transitions, 2152 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:46:55,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 972 transitions, 2178 flow [2021-06-10 11:46:55,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 972 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:55,064 INFO L241 Difference]: Finished difference. Result has 955 places, 972 transitions, 2169 flow [2021-06-10 11:46:55,064 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2169, PETRI_PLACES=955, PETRI_TRANSITIONS=972} [2021-06-10 11:46:55,065 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -28 predicate places. [2021-06-10 11:46:55,065 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 972 transitions, 2169 flow [2021-06-10 11:46:55,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:55,065 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:55,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2158 [2021-06-10 11:46:55,065 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:55,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1978630680, now seen corresponding path program 1 times [2021-06-10 11:46:55,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:55,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272403805] [2021-06-10 11:46:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:55,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:55,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:55,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:46:55,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272403805] [2021-06-10 11:46:55,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:55,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:55,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878393470] [2021-06-10 11:46:55,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:55,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:55,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:55,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 972 transitions, 2169 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:55,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:55,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:55,511 INFO L129 PetriNetUnfolder]: 102/1089 cut-off events. [2021-06-10 11:46:55,511 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:55,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 1089 events. 102/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4445 event pairs, 0 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 1211. Up to 38 conditions per place. [2021-06-10 11:46:55,595 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/970 dead transitions. [2021-06-10 11:46:55,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 970 transitions, 2171 flow [2021-06-10 11:46:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:46:55,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:46:55,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:46:55,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:46:55,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:55,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:46:55,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,600 INFO L185 Difference]: Start difference. First operand has 955 places, 972 transitions, 2169 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:46:55,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 970 transitions, 2171 flow [2021-06-10 11:46:55,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 970 transitions, 2163 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:55,609 INFO L241 Difference]: Finished difference. Result has 955 places, 970 transitions, 2156 flow [2021-06-10 11:46:55,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2156, PETRI_PLACES=955, PETRI_TRANSITIONS=970} [2021-06-10 11:46:55,610 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -28 predicate places. [2021-06-10 11:46:55,610 INFO L480 AbstractCegarLoop]: Abstraction has has 955 places, 970 transitions, 2156 flow [2021-06-10 11:46:55,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,610 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:55,610 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:55,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2159 [2021-06-10 11:46:55,610 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1978631703, now seen corresponding path program 1 times [2021-06-10 11:46:55,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:55,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404527261] [2021-06-10 11:46:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:55,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:55,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:55,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:55,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:46:55,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404527261] [2021-06-10 11:46:55,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:55,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:55,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210021028] [2021-06-10 11:46:55,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:55,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:55,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:55,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:55,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 970 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:55,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:55,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:55,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:56,045 INFO L129 PetriNetUnfolder]: 102/1087 cut-off events. [2021-06-10 11:46:56,046 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:56,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 1087 events. 102/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4428 event pairs, 0 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1215. Up to 38 conditions per place. [2021-06-10 11:46:56,132 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/968 dead transitions. [2021-06-10 11:46:56,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 968 transitions, 2169 flow [2021-06-10 11:46:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:46:56,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:46:56,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:46:56,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:46:56,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:56,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:46:56,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,137 INFO L185 Difference]: Start difference. First operand has 955 places, 970 transitions, 2156 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:46:56,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 968 transitions, 2169 flow [2021-06-10 11:46:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 968 transitions, 2168 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:56,146 INFO L241 Difference]: Finished difference. Result has 954 places, 968 transitions, 2152 flow [2021-06-10 11:46:56,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2152, PETRI_PLACES=954, PETRI_TRANSITIONS=968} [2021-06-10 11:46:56,146 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -29 predicate places. [2021-06-10 11:46:56,146 INFO L480 AbstractCegarLoop]: Abstraction has has 954 places, 968 transitions, 2152 flow [2021-06-10 11:46:56,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:56,147 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:56,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2160 [2021-06-10 11:46:56,147 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1287869873, now seen corresponding path program 1 times [2021-06-10 11:46:56,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:56,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989449578] [2021-06-10 11:46:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:56,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:56,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:56,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:46:56,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989449578] [2021-06-10 11:46:56,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:56,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:56,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591151626] [2021-06-10 11:46:56,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:56,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:56,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:56,170 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:56,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 968 transitions, 2152 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:56,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:56,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:56,615 INFO L129 PetriNetUnfolder]: 100/1092 cut-off events. [2021-06-10 11:46:56,615 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:56,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1092 events. 100/1092 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4479 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1218. Up to 38 conditions per place. [2021-06-10 11:46:56,676 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/969 dead transitions. [2021-06-10 11:46:56,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 969 transitions, 2168 flow [2021-06-10 11:46:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:46:56,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:46:56,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:46:56,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:46:56,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:56,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:46:56,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,681 INFO L185 Difference]: Start difference. First operand has 954 places, 968 transitions, 2152 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:46:56,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 969 transitions, 2168 flow [2021-06-10 11:46:56,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 969 transitions, 2167 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:56,689 INFO L241 Difference]: Finished difference. Result has 957 places, 969 transitions, 2165 flow [2021-06-10 11:46:56,690 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2165, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2021-06-10 11:46:56,690 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -26 predicate places. [2021-06-10 11:46:56,690 INFO L480 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 2165 flow [2021-06-10 11:46:56,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:56,690 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:56,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2161 [2021-06-10 11:46:56,690 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1287870896, now seen corresponding path program 1 times [2021-06-10 11:46:56,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:56,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446739689] [2021-06-10 11:46:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:56,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:56,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:56,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:56,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:46:56,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446739689] [2021-06-10 11:46:56,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:56,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:56,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298589957] [2021-06-10 11:46:56,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:56,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:56,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:56,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 2165 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:56,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:56,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:56,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:57,126 INFO L129 PetriNetUnfolder]: 100/1093 cut-off events. [2021-06-10 11:46:57,126 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:57,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 1093 events. 100/1093 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4489 event pairs, 0 based on Foata normal form. 0/955 useless extension candidates. Maximal degree in co-relation 1226. Up to 38 conditions per place. [2021-06-10 11:46:57,210 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/970 dead transitions. [2021-06-10 11:46:57,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 970 transitions, 2191 flow [2021-06-10 11:46:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:46:57,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:46:57,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:46:57,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:46:57,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:57,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:46:57,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,215 INFO L185 Difference]: Start difference. First operand has 957 places, 969 transitions, 2165 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:46:57,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 970 transitions, 2191 flow [2021-06-10 11:46:57,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 970 transitions, 2189 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:57,223 INFO L241 Difference]: Finished difference. Result has 960 places, 970 transitions, 2181 flow [2021-06-10 11:46:57,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2181, PETRI_PLACES=960, PETRI_TRANSITIONS=970} [2021-06-10 11:46:57,224 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -23 predicate places. [2021-06-10 11:46:57,224 INFO L480 AbstractCegarLoop]: Abstraction has has 960 places, 970 transitions, 2181 flow [2021-06-10 11:46:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:57,224 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:57,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2162 [2021-06-10 11:46:57,224 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1286916561, now seen corresponding path program 1 times [2021-06-10 11:46:57,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:57,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438303076] [2021-06-10 11:46:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:57,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:57,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:57,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:46:57,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438303076] [2021-06-10 11:46:57,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:57,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:57,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945402870] [2021-06-10 11:46:57,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:57,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:57,247 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:57,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 970 transitions, 2181 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:57,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:57,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:57,655 INFO L129 PetriNetUnfolder]: 99/1090 cut-off events. [2021-06-10 11:46:57,655 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2021-06-10 11:46:57,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 1090 events. 99/1090 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4470 event pairs, 0 based on Foata normal form. 2/956 useless extension candidates. Maximal degree in co-relation 1225. Up to 38 conditions per place. [2021-06-10 11:46:57,737 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 9 selfloop transitions, 1 changer transitions 0/968 dead transitions. [2021-06-10 11:46:57,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 968 transitions, 2189 flow [2021-06-10 11:46:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2922 transitions. [2021-06-10 11:46:57,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214758751182592 [2021-06-10 11:46:57,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2922 transitions. [2021-06-10 11:46:57,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2922 transitions. [2021-06-10 11:46:57,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:57,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2922 transitions. [2021-06-10 11:46:57,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.0) internal successors, (2922), 3 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,742 INFO L185 Difference]: Start difference. First operand has 960 places, 970 transitions, 2181 flow. Second operand 3 states and 2922 transitions. [2021-06-10 11:46:57,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 968 transitions, 2189 flow [2021-06-10 11:46:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 961 places, 968 transitions, 2188 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:57,751 INFO L241 Difference]: Finished difference. Result has 961 places, 968 transitions, 2170 flow [2021-06-10 11:46:57,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=959, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2170, PETRI_PLACES=961, PETRI_TRANSITIONS=968} [2021-06-10 11:46:57,751 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -22 predicate places. [2021-06-10 11:46:57,751 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 968 transitions, 2170 flow [2021-06-10 11:46:57,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:57,751 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:57,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2163 [2021-06-10 11:46:57,752 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1286917584, now seen corresponding path program 1 times [2021-06-10 11:46:57,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:57,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221117140] [2021-06-10 11:46:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:57,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:57,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:57,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:57,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:46:57,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221117140] [2021-06-10 11:46:57,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:57,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:57,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101630344] [2021-06-10 11:46:57,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:57,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:57,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:57,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 968 transitions, 2170 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:57,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:57,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:57,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:58,179 INFO L129 PetriNetUnfolder]: 99/1087 cut-off events. [2021-06-10 11:46:58,179 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:46:58,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1087 events. 99/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4449 event pairs, 0 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1219. Up to 38 conditions per place. [2021-06-10 11:46:58,258 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/965 dead transitions. [2021-06-10 11:46:58,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 965 transitions, 2171 flow [2021-06-10 11:46:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:46:58,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:46:58,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:46:58,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:46:58,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:58,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:46:58,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,263 INFO L185 Difference]: Start difference. First operand has 961 places, 968 transitions, 2170 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:46:58,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 965 transitions, 2171 flow [2021-06-10 11:46:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 958 places, 965 transitions, 2166 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:58,272 INFO L241 Difference]: Finished difference. Result has 958 places, 965 transitions, 2156 flow [2021-06-10 11:46:58,272 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2156, PETRI_PLACES=958, PETRI_TRANSITIONS=965} [2021-06-10 11:46:58,272 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -25 predicate places. [2021-06-10 11:46:58,272 INFO L480 AbstractCegarLoop]: Abstraction has has 958 places, 965 transitions, 2156 flow [2021-06-10 11:46:58,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,273 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:58,273 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:58,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164 [2021-06-10 11:46:58,273 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash -62341833, now seen corresponding path program 1 times [2021-06-10 11:46:58,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:58,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470572624] [2021-06-10 11:46:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:58,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:58,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:58,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:46:58,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470572624] [2021-06-10 11:46:58,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:58,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:58,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634681863] [2021-06-10 11:46:58,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:58,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:58,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:58,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 965 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:58,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:58,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:58,692 INFO L129 PetriNetUnfolder]: 97/1092 cut-off events. [2021-06-10 11:46:58,692 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:46:58,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 1092 events. 97/1092 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4497 event pairs, 0 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1227. Up to 38 conditions per place. [2021-06-10 11:46:58,754 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/966 dead transitions. [2021-06-10 11:46:58,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 966 transitions, 2172 flow [2021-06-10 11:46:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:46:58,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:46:58,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:46:58,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:46:58,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:58,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:46:58,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,758 INFO L185 Difference]: Start difference. First operand has 958 places, 965 transitions, 2156 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:46:58,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 966 transitions, 2172 flow [2021-06-10 11:46:58,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 966 transitions, 2171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:58,767 INFO L241 Difference]: Finished difference. Result has 961 places, 966 transitions, 2169 flow [2021-06-10 11:46:58,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2169, PETRI_PLACES=961, PETRI_TRANSITIONS=966} [2021-06-10 11:46:58,767 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -22 predicate places. [2021-06-10 11:46:58,767 INFO L480 AbstractCegarLoop]: Abstraction has has 961 places, 966 transitions, 2169 flow [2021-06-10 11:46:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,767 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:58,767 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:58,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2165 [2021-06-10 11:46:58,768 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -62342856, now seen corresponding path program 1 times [2021-06-10 11:46:58,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:58,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092845822] [2021-06-10 11:46:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:58,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:58,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:46:58,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:58,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:46:58,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092845822] [2021-06-10 11:46:58,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:58,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:58,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303079976] [2021-06-10 11:46:58,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:58,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:58,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:58,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 966 transitions, 2169 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:58,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:58,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:58,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:59,207 INFO L129 PetriNetUnfolder]: 97/1093 cut-off events. [2021-06-10 11:46:59,207 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:46:59,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 1093 events. 97/1093 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4504 event pairs, 0 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 1233. Up to 38 conditions per place. [2021-06-10 11:46:59,287 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/967 dead transitions. [2021-06-10 11:46:59,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 967 transitions, 2195 flow [2021-06-10 11:46:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:46:59,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:46:59,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:46:59,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:46:59,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:59,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:46:59,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,292 INFO L185 Difference]: Start difference. First operand has 961 places, 966 transitions, 2169 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:46:59,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 967 transitions, 2195 flow [2021-06-10 11:46:59,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 967 transitions, 2193 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:46:59,301 INFO L241 Difference]: Finished difference. Result has 964 places, 967 transitions, 2185 flow [2021-06-10 11:46:59,301 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=966, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2185, PETRI_PLACES=964, PETRI_TRANSITIONS=967} [2021-06-10 11:46:59,301 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -19 predicate places. [2021-06-10 11:46:59,301 INFO L480 AbstractCegarLoop]: Abstraction has has 964 places, 967 transitions, 2185 flow [2021-06-10 11:46:59,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,301 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:59,301 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:59,302 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2166 [2021-06-10 11:46:59,302 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash -61389544, now seen corresponding path program 1 times [2021-06-10 11:46:59,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:59,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144935906] [2021-06-10 11:46:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:59,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:59,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:46:59,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:46:59,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144935906] [2021-06-10 11:46:59,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:59,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:59,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269535768] [2021-06-10 11:46:59,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:59,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:59,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:59,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:46:59,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 967 transitions, 2185 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:59,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:46:59,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:46:59,721 INFO L129 PetriNetUnfolder]: 96/1089 cut-off events. [2021-06-10 11:46:59,721 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:46:59,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 1089 events. 96/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4477 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1226. Up to 38 conditions per place. [2021-06-10 11:46:59,801 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/964 dead transitions. [2021-06-10 11:46:59,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 966 places, 964 transitions, 2182 flow [2021-06-10 11:46:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:46:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:46:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:46:59,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:46:59,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:46:59,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:46:59,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:46:59,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:46:59,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,806 INFO L185 Difference]: Start difference. First operand has 964 places, 967 transitions, 2185 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:46:59,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 966 places, 964 transitions, 2182 flow [2021-06-10 11:46:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 963 places, 964 transitions, 2174 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:46:59,815 INFO L241 Difference]: Finished difference. Result has 963 places, 964 transitions, 2164 flow [2021-06-10 11:46:59,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=964, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2164, PETRI_PLACES=963, PETRI_TRANSITIONS=964} [2021-06-10 11:46:59,815 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -20 predicate places. [2021-06-10 11:46:59,815 INFO L480 AbstractCegarLoop]: Abstraction has has 963 places, 964 transitions, 2164 flow [2021-06-10 11:46:59,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:46:59,816 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:46:59,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2167 [2021-06-10 11:46:59,816 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:46:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:46:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash -61388521, now seen corresponding path program 1 times [2021-06-10 11:46:59,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:46:59,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987106032] [2021-06-10 11:46:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:46:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:46:59,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:59,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:46:59,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:46:59,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:46:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:46:59,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987106032] [2021-06-10 11:46:59,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:46:59,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:46:59,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910296594] [2021-06-10 11:46:59,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:46:59,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:46:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:46:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:46:59,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:46:59,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 963 places, 964 transitions, 2164 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:46:59,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:46:59,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:46:59,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:00,242 INFO L129 PetriNetUnfolder]: 96/1087 cut-off events. [2021-06-10 11:47:00,242 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:00,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 1087 events. 96/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4466 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1229. Up to 38 conditions per place. [2021-06-10 11:47:00,322 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2021-06-10 11:47:00,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 962 transitions, 2177 flow [2021-06-10 11:47:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:00,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:00,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:00,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:00,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:00,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:00,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,326 INFO L185 Difference]: Start difference. First operand has 963 places, 964 transitions, 2164 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:00,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 962 transitions, 2177 flow [2021-06-10 11:47:00,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 962 transitions, 2176 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:00,335 INFO L241 Difference]: Finished difference. Result has 962 places, 962 transitions, 2160 flow [2021-06-10 11:47:00,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2160, PETRI_PLACES=962, PETRI_TRANSITIONS=962} [2021-06-10 11:47:00,336 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -21 predicate places. [2021-06-10 11:47:00,336 INFO L480 AbstractCegarLoop]: Abstraction has has 962 places, 962 transitions, 2160 flow [2021-06-10 11:47:00,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,336 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:00,336 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:00,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2168 [2021-06-10 11:47:00,336 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1427957760, now seen corresponding path program 1 times [2021-06-10 11:47:00,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:00,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513892426] [2021-06-10 11:47:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:00,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:00,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:00,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:47:00,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513892426] [2021-06-10 11:47:00,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:00,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:00,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345398282] [2021-06-10 11:47:00,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:00,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:00,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:00,359 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:00,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 962 transitions, 2160 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:00,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:00,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:00,768 INFO L129 PetriNetUnfolder]: 95/1095 cut-off events. [2021-06-10 11:47:00,768 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:00,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 1095 events. 95/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4537 event pairs, 0 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 1241. Up to 38 conditions per place. [2021-06-10 11:47:00,831 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/964 dead transitions. [2021-06-10 11:47:00,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 964 transitions, 2190 flow [2021-06-10 11:47:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:00,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:00,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:00,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:00,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:00,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:00,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,835 INFO L185 Difference]: Start difference. First operand has 962 places, 962 transitions, 2160 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:00,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 964 transitions, 2190 flow [2021-06-10 11:47:00,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 963 places, 964 transitions, 2189 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:00,843 INFO L241 Difference]: Finished difference. Result has 965 places, 964 transitions, 2183 flow [2021-06-10 11:47:00,844 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=965, PETRI_TRANSITIONS=964} [2021-06-10 11:47:00,844 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -18 predicate places. [2021-06-10 11:47:00,844 INFO L480 AbstractCegarLoop]: Abstraction has has 965 places, 964 transitions, 2183 flow [2021-06-10 11:47:00,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,844 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:00,844 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:00,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2169 [2021-06-10 11:47:00,844 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:00,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:00,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1427956737, now seen corresponding path program 1 times [2021-06-10 11:47:00,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:00,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184283315] [2021-06-10 11:47:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:00,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:00,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:00,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:00,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:47:00,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184283315] [2021-06-10 11:47:00,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:00,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:00,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823605902] [2021-06-10 11:47:00,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:00,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:00,867 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:00,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 965 places, 964 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:00,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:00,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:00,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:01,274 INFO L129 PetriNetUnfolder]: 93/1096 cut-off events. [2021-06-10 11:47:01,274 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:01,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1096 events. 93/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4558 event pairs, 0 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1241. Up to 38 conditions per place. [2021-06-10 11:47:01,358 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/964 dead transitions. [2021-06-10 11:47:01,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 964 transitions, 2195 flow [2021-06-10 11:47:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:01,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:01,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:01,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:01,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:01,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:01,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,363 INFO L185 Difference]: Start difference. First operand has 965 places, 964 transitions, 2183 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:01,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 967 places, 964 transitions, 2195 flow [2021-06-10 11:47:01,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 964 transitions, 2190 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:01,372 INFO L241 Difference]: Finished difference. Result has 967 places, 963 transitions, 2179 flow [2021-06-10 11:47:01,372 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=964, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2179, PETRI_PLACES=967, PETRI_TRANSITIONS=963} [2021-06-10 11:47:01,373 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -16 predicate places. [2021-06-10 11:47:01,373 INFO L480 AbstractCegarLoop]: Abstraction has has 967 places, 963 transitions, 2179 flow [2021-06-10 11:47:01,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:01,373 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:01,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2170 [2021-06-10 11:47:01,373 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:01,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1427004448, now seen corresponding path program 1 times [2021-06-10 11:47:01,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:01,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525128403] [2021-06-10 11:47:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:01,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:01,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:01,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:47:01,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525128403] [2021-06-10 11:47:01,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:01,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:01,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738130650] [2021-06-10 11:47:01,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:01,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:01,398 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:01,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 963 transitions, 2179 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:01,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:01,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:01,810 INFO L129 PetriNetUnfolder]: 93/1089 cut-off events. [2021-06-10 11:47:01,810 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:01,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 1089 events. 93/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4499 event pairs, 0 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 1235. Up to 38 conditions per place. [2021-06-10 11:47:01,890 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/961 dead transitions. [2021-06-10 11:47:01,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 961 transitions, 2182 flow [2021-06-10 11:47:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:01,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:01,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:01,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:01,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:01,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:01,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,895 INFO L185 Difference]: Start difference. First operand has 967 places, 963 transitions, 2179 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:01,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 961 transitions, 2182 flow [2021-06-10 11:47:01,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 961 transitions, 2175 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:01,904 INFO L241 Difference]: Finished difference. Result has 967 places, 961 transitions, 2168 flow [2021-06-10 11:47:01,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=964, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2168, PETRI_PLACES=967, PETRI_TRANSITIONS=961} [2021-06-10 11:47:01,904 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -16 predicate places. [2021-06-10 11:47:01,904 INFO L480 AbstractCegarLoop]: Abstraction has has 967 places, 961 transitions, 2168 flow [2021-06-10 11:47:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:01,905 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:01,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2171 [2021-06-10 11:47:01,905 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:01,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1427003425, now seen corresponding path program 1 times [2021-06-10 11:47:01,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:01,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603657229] [2021-06-10 11:47:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:01,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:01,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:01,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:01,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:47:01,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603657229] [2021-06-10 11:47:01,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:01,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:01,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801506878] [2021-06-10 11:47:01,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:01,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:01,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:01,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:01,928 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:01,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 961 transitions, 2168 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:01,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:01,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:01,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:02,352 INFO L129 PetriNetUnfolder]: 93/1087 cut-off events. [2021-06-10 11:47:02,353 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:02,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 1087 events. 93/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4485 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1235. Up to 38 conditions per place. [2021-06-10 11:47:02,435 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/959 dead transitions. [2021-06-10 11:47:02,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 967 places, 959 transitions, 2181 flow [2021-06-10 11:47:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:02,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:02,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:02,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:02,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:02,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:02,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,440 INFO L185 Difference]: Start difference. First operand has 967 places, 961 transitions, 2168 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:02,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 967 places, 959 transitions, 2181 flow [2021-06-10 11:47:02,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 966 places, 959 transitions, 2180 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:02,449 INFO L241 Difference]: Finished difference. Result has 966 places, 959 transitions, 2164 flow [2021-06-10 11:47:02,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=964, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=958, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2164, PETRI_PLACES=966, PETRI_TRANSITIONS=959} [2021-06-10 11:47:02,450 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -17 predicate places. [2021-06-10 11:47:02,450 INFO L480 AbstractCegarLoop]: Abstraction has has 966 places, 959 transitions, 2164 flow [2021-06-10 11:47:02,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:02,450 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:02,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2172 [2021-06-10 11:47:02,450 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1997949034, now seen corresponding path program 1 times [2021-06-10 11:47:02,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:02,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184039501] [2021-06-10 11:47:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:02,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:02,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:02,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:47:02,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184039501] [2021-06-10 11:47:02,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:02,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:02,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088744193] [2021-06-10 11:47:02,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:02,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:02,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:02,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:02,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 959 transitions, 2164 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:02,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:02,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:02,887 INFO L129 PetriNetUnfolder]: 92/1095 cut-off events. [2021-06-10 11:47:02,887 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:02,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1095 events. 92/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4552 event pairs, 0 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1247. Up to 38 conditions per place. [2021-06-10 11:47:02,951 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/961 dead transitions. [2021-06-10 11:47:02,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 961 transitions, 2194 flow [2021-06-10 11:47:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:02,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:02,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:02,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:02,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:02,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:02,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,956 INFO L185 Difference]: Start difference. First operand has 966 places, 959 transitions, 2164 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:02,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 961 transitions, 2194 flow [2021-06-10 11:47:02,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 967 places, 961 transitions, 2193 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:02,964 INFO L241 Difference]: Finished difference. Result has 969 places, 961 transitions, 2187 flow [2021-06-10 11:47:02,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=965, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2187, PETRI_PLACES=969, PETRI_TRANSITIONS=961} [2021-06-10 11:47:02,965 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -14 predicate places. [2021-06-10 11:47:02,965 INFO L480 AbstractCegarLoop]: Abstraction has has 969 places, 961 transitions, 2187 flow [2021-06-10 11:47:02,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,965 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:02,965 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:02,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2173 [2021-06-10 11:47:02,965 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1997948011, now seen corresponding path program 1 times [2021-06-10 11:47:02,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:02,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203776510] [2021-06-10 11:47:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:02,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:02,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:47:02,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203776510] [2021-06-10 11:47:02,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:02,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:02,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698714111] [2021-06-10 11:47:02,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:02,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:02,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:02,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 961 transitions, 2187 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:02,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:02,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:02,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:03,397 INFO L129 PetriNetUnfolder]: 90/1096 cut-off events. [2021-06-10 11:47:03,397 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:03,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 1096 events. 90/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4580 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1247. Up to 38 conditions per place. [2021-06-10 11:47:03,480 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/961 dead transitions. [2021-06-10 11:47:03,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 961 transitions, 2199 flow [2021-06-10 11:47:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:03,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:03,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:03,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:03,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:03,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:03,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:03,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:03,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:03,484 INFO L185 Difference]: Start difference. First operand has 969 places, 961 transitions, 2187 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:03,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 961 transitions, 2199 flow [2021-06-10 11:47:03,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 961 transitions, 2194 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:03,494 INFO L241 Difference]: Finished difference. Result has 971 places, 960 transitions, 2183 flow [2021-06-10 11:47:03,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=971, PETRI_TRANSITIONS=960} [2021-06-10 11:47:03,494 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -12 predicate places. [2021-06-10 11:47:03,494 INFO L480 AbstractCegarLoop]: Abstraction has has 971 places, 960 transitions, 2183 flow [2021-06-10 11:47:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:03,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:03,494 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:03,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2174 [2021-06-10 11:47:03,494 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1996995722, now seen corresponding path program 1 times [2021-06-10 11:47:03,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:03,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383288083] [2021-06-10 11:47:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:03,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:03,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:03,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:03,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:03,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:03,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:47:03,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383288083] [2021-06-10 11:47:03,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:03,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:03,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649434096] [2021-06-10 11:47:03,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:03,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:03,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:03,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 960 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:03,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:03,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:03,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:03,930 INFO L129 PetriNetUnfolder]: 90/1089 cut-off events. [2021-06-10 11:47:03,930 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:03,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1089 events. 90/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4512 event pairs, 0 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 1241. Up to 38 conditions per place. [2021-06-10 11:47:04,010 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2021-06-10 11:47:04,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 973 places, 958 transitions, 2186 flow [2021-06-10 11:47:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:04,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:04,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:04,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:04,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:04,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:04,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,015 INFO L185 Difference]: Start difference. First operand has 971 places, 960 transitions, 2183 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:04,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 973 places, 958 transitions, 2186 flow [2021-06-10 11:47:04,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 958 transitions, 2179 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:04,024 INFO L241 Difference]: Finished difference. Result has 971 places, 958 transitions, 2172 flow [2021-06-10 11:47:04,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2172, PETRI_PLACES=971, PETRI_TRANSITIONS=958} [2021-06-10 11:47:04,024 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -12 predicate places. [2021-06-10 11:47:04,024 INFO L480 AbstractCegarLoop]: Abstraction has has 971 places, 958 transitions, 2172 flow [2021-06-10 11:47:04,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:04,025 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:04,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2175 [2021-06-10 11:47:04,025 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1996994699, now seen corresponding path program 1 times [2021-06-10 11:47:04,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:04,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256403383] [2021-06-10 11:47:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:04,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:04,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:04,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:47:04,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256403383] [2021-06-10 11:47:04,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:04,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:04,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307186088] [2021-06-10 11:47:04,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:04,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:04,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:04,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:04,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 958 transitions, 2172 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:04,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:04,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:04,467 INFO L129 PetriNetUnfolder]: 90/1087 cut-off events. [2021-06-10 11:47:04,467 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:04,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1087 events. 90/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4498 event pairs, 0 based on Foata normal form. 0/960 useless extension candidates. Maximal degree in co-relation 1241. Up to 38 conditions per place. [2021-06-10 11:47:04,549 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/956 dead transitions. [2021-06-10 11:47:04,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 956 transitions, 2185 flow [2021-06-10 11:47:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:04,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:04,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:04,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:04,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:04,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:04,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,553 INFO L185 Difference]: Start difference. First operand has 971 places, 958 transitions, 2172 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:04,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 956 transitions, 2185 flow [2021-06-10 11:47:04,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 970 places, 956 transitions, 2184 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:04,563 INFO L241 Difference]: Finished difference. Result has 970 places, 956 transitions, 2168 flow [2021-06-10 11:47:04,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2168, PETRI_PLACES=970, PETRI_TRANSITIONS=956} [2021-06-10 11:47:04,563 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -13 predicate places. [2021-06-10 11:47:04,563 INFO L480 AbstractCegarLoop]: Abstraction has has 970 places, 956 transitions, 2168 flow [2021-06-10 11:47:04,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,563 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:04,563 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:04,563 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2176 [2021-06-10 11:47:04,563 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:04,564 INFO L82 PathProgramCache]: Analyzing trace with hash -863384842, now seen corresponding path program 1 times [2021-06-10 11:47:04,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:04,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239731673] [2021-06-10 11:47:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:04,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:04,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:04,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:04,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:47:04,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239731673] [2021-06-10 11:47:04,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:04,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:04,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346401284] [2021-06-10 11:47:04,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:04,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:04,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:04,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 956 transitions, 2168 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:04,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:04,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:04,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:04,997 INFO L129 PetriNetUnfolder]: 89/1095 cut-off events. [2021-06-10 11:47:04,997 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:05,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1095 events. 89/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4571 event pairs, 0 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1253. Up to 38 conditions per place. [2021-06-10 11:47:05,064 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/958 dead transitions. [2021-06-10 11:47:05,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 958 transitions, 2198 flow [2021-06-10 11:47:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:05,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:05,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:05,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:05,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:05,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:05,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,069 INFO L185 Difference]: Start difference. First operand has 970 places, 956 transitions, 2168 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:05,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 958 transitions, 2198 flow [2021-06-10 11:47:05,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 958 transitions, 2197 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:05,077 INFO L241 Difference]: Finished difference. Result has 973 places, 958 transitions, 2191 flow [2021-06-10 11:47:05,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=953, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=973, PETRI_TRANSITIONS=958} [2021-06-10 11:47:05,078 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -10 predicate places. [2021-06-10 11:47:05,078 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 958 transitions, 2191 flow [2021-06-10 11:47:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:05,078 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:05,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2177 [2021-06-10 11:47:05,078 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash -863383819, now seen corresponding path program 1 times [2021-06-10 11:47:05,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:05,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694577379] [2021-06-10 11:47:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:05,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:05,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:05,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:47:05,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694577379] [2021-06-10 11:47:05,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:05,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:05,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69269182] [2021-06-10 11:47:05,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:05,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:05,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:05,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 958 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:05,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:05,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:05,514 INFO L129 PetriNetUnfolder]: 88/1093 cut-off events. [2021-06-10 11:47:05,514 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:05,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 1093 events. 88/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4559 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1250. Up to 38 conditions per place. [2021-06-10 11:47:05,599 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/958 dead transitions. [2021-06-10 11:47:05,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 958 transitions, 2203 flow [2021-06-10 11:47:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:05,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:05,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:05,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:05,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:05,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:05,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,604 INFO L185 Difference]: Start difference. First operand has 973 places, 958 transitions, 2191 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:05,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 958 transitions, 2203 flow [2021-06-10 11:47:05,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 974 places, 958 transitions, 2198 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:05,613 INFO L241 Difference]: Finished difference. Result has 976 places, 958 transitions, 2196 flow [2021-06-10 11:47:05,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=972, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2196, PETRI_PLACES=976, PETRI_TRANSITIONS=958} [2021-06-10 11:47:05,613 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -7 predicate places. [2021-06-10 11:47:05,614 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 958 transitions, 2196 flow [2021-06-10 11:47:05,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:05,614 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:05,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2178 [2021-06-10 11:47:05,614 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -862431530, now seen corresponding path program 1 times [2021-06-10 11:47:05,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:05,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301232042] [2021-06-10 11:47:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:05,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:05,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:05,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:05,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:47:05,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301232042] [2021-06-10 11:47:05,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:05,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:05,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170849864] [2021-06-10 11:47:05,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:05,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:05,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:05,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 958 transitions, 2196 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:05,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:05,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:05,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:06,073 INFO L129 PetriNetUnfolder]: 87/1089 cut-off events. [2021-06-10 11:47:06,074 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:06,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1089 events. 87/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4534 event pairs, 0 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 1247. Up to 38 conditions per place. [2021-06-10 11:47:06,157 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/955 dead transitions. [2021-06-10 11:47:06,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 955 transitions, 2193 flow [2021-06-10 11:47:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:06,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:06,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:06,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:06,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:06,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:06,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,162 INFO L185 Difference]: Start difference. First operand has 976 places, 958 transitions, 2196 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:06,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 955 transitions, 2193 flow [2021-06-10 11:47:06,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 955 transitions, 2186 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:06,172 INFO L241 Difference]: Finished difference. Result has 975 places, 955 transitions, 2176 flow [2021-06-10 11:47:06,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=954, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2176, PETRI_PLACES=975, PETRI_TRANSITIONS=955} [2021-06-10 11:47:06,172 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -8 predicate places. [2021-06-10 11:47:06,172 INFO L480 AbstractCegarLoop]: Abstraction has has 975 places, 955 transitions, 2176 flow [2021-06-10 11:47:06,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:06,172 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:06,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2179 [2021-06-10 11:47:06,172 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -862430507, now seen corresponding path program 1 times [2021-06-10 11:47:06,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:06,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653252565] [2021-06-10 11:47:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:06,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:06,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:06,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:47:06,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653252565] [2021-06-10 11:47:06,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:06,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:06,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725958124] [2021-06-10 11:47:06,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:06,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:06,196 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:06,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 955 transitions, 2176 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:06,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:06,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:06,626 INFO L129 PetriNetUnfolder]: 87/1087 cut-off events. [2021-06-10 11:47:06,626 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:06,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 1087 events. 87/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4519 event pairs, 0 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 1248. Up to 38 conditions per place. [2021-06-10 11:47:06,706 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/953 dead transitions. [2021-06-10 11:47:06,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 953 transitions, 2189 flow [2021-06-10 11:47:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:06,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:06,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:06,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:06,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:06,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:06,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,711 INFO L185 Difference]: Start difference. First operand has 975 places, 955 transitions, 2176 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:06,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 953 transitions, 2189 flow [2021-06-10 11:47:06,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 974 places, 953 transitions, 2188 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:06,720 INFO L241 Difference]: Finished difference. Result has 974 places, 953 transitions, 2172 flow [2021-06-10 11:47:06,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=972, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=953, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=952, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2172, PETRI_PLACES=974, PETRI_TRANSITIONS=953} [2021-06-10 11:47:06,720 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -9 predicate places. [2021-06-10 11:47:06,720 INFO L480 AbstractCegarLoop]: Abstraction has has 974 places, 953 transitions, 2172 flow [2021-06-10 11:47:06,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:06,721 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:06,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2180 [2021-06-10 11:47:06,721 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -49246527, now seen corresponding path program 1 times [2021-06-10 11:47:06,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:06,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333072479] [2021-06-10 11:47:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:06,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:06,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:06,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:06,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:47:06,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333072479] [2021-06-10 11:47:06,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:06,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:06,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460441689] [2021-06-10 11:47:06,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:06,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:06,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:06,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 953 transitions, 2172 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:06,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:06,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:06,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:07,180 INFO L129 PetriNetUnfolder]: 86/1095 cut-off events. [2021-06-10 11:47:07,180 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:07,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 1095 events. 86/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4586 event pairs, 0 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 1260. Up to 38 conditions per place. [2021-06-10 11:47:07,253 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/955 dead transitions. [2021-06-10 11:47:07,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 976 places, 955 transitions, 2202 flow [2021-06-10 11:47:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:07,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:07,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:07,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:07,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:07,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:07,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,257 INFO L185 Difference]: Start difference. First operand has 974 places, 953 transitions, 2172 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:07,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 976 places, 955 transitions, 2202 flow [2021-06-10 11:47:07,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 955 transitions, 2201 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:07,266 INFO L241 Difference]: Finished difference. Result has 977 places, 955 transitions, 2195 flow [2021-06-10 11:47:07,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=953, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2195, PETRI_PLACES=977, PETRI_TRANSITIONS=955} [2021-06-10 11:47:07,266 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -6 predicate places. [2021-06-10 11:47:07,266 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 955 transitions, 2195 flow [2021-06-10 11:47:07,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:07,266 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:07,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2181 [2021-06-10 11:47:07,267 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash -49247550, now seen corresponding path program 1 times [2021-06-10 11:47:07,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:07,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785344719] [2021-06-10 11:47:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:07,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:07,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:07,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:47:07,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785344719] [2021-06-10 11:47:07,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:07,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:07,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659422375] [2021-06-10 11:47:07,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:07,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:07,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:07,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 955 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:07,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:07,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:07,711 INFO L129 PetriNetUnfolder]: 84/1096 cut-off events. [2021-06-10 11:47:07,712 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:07,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1096 events. 84/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4605 event pairs, 0 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1260. Up to 38 conditions per place. [2021-06-10 11:47:07,792 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/955 dead transitions. [2021-06-10 11:47:07,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 955 transitions, 2207 flow [2021-06-10 11:47:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:07,794 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:07,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:07,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:07,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:07,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:07,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,797 INFO L185 Difference]: Start difference. First operand has 977 places, 955 transitions, 2195 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:07,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 955 transitions, 2207 flow [2021-06-10 11:47:07,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 955 transitions, 2202 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:07,806 INFO L241 Difference]: Finished difference. Result has 979 places, 954 transitions, 2191 flow [2021-06-10 11:47:07,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=953, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=979, PETRI_TRANSITIONS=954} [2021-06-10 11:47:07,806 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -4 predicate places. [2021-06-10 11:47:07,806 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 954 transitions, 2191 flow [2021-06-10 11:47:07,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,806 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:07,806 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:07,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2182 [2021-06-10 11:47:07,807 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash -50199839, now seen corresponding path program 1 times [2021-06-10 11:47:07,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:07,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638016101] [2021-06-10 11:47:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:07,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:07,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:07,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:07,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:47:07,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638016101] [2021-06-10 11:47:07,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:07,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:07,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620926633] [2021-06-10 11:47:07,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:07,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:07,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:07,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 954 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:07,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:07,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:07,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:08,247 INFO L129 PetriNetUnfolder]: 84/1089 cut-off events. [2021-06-10 11:47:08,247 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:08,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 1089 events. 84/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4549 event pairs, 0 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 1254. Up to 38 conditions per place. [2021-06-10 11:47:08,325 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/952 dead transitions. [2021-06-10 11:47:08,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 952 transitions, 2194 flow [2021-06-10 11:47:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:08,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:08,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:08,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:08,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:08,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:08,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,329 INFO L185 Difference]: Start difference. First operand has 979 places, 954 transitions, 2191 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 952 transitions, 2194 flow [2021-06-10 11:47:08,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 952 transitions, 2187 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:08,339 INFO L241 Difference]: Finished difference. Result has 979 places, 952 transitions, 2180 flow [2021-06-10 11:47:08,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2180, PETRI_PLACES=979, PETRI_TRANSITIONS=952} [2021-06-10 11:47:08,339 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -4 predicate places. [2021-06-10 11:47:08,339 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 952 transitions, 2180 flow [2021-06-10 11:47:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:08,339 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:08,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2183 [2021-06-10 11:47:08,339 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -50200862, now seen corresponding path program 1 times [2021-06-10 11:47:08,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:08,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240477939] [2021-06-10 11:47:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:08,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:08,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:08,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:47:08,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240477939] [2021-06-10 11:47:08,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:08,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:08,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275418624] [2021-06-10 11:47:08,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:08,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:08,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:08,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:08,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 952 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:08,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:08,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:08,778 INFO L129 PetriNetUnfolder]: 84/1087 cut-off events. [2021-06-10 11:47:08,778 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:08,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 1087 events. 84/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4536 event pairs, 0 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1254. Up to 38 conditions per place. [2021-06-10 11:47:08,855 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/950 dead transitions. [2021-06-10 11:47:08,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 950 transitions, 2193 flow [2021-06-10 11:47:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:08,857 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:08,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:08,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:08,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:08,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:08,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,860 INFO L185 Difference]: Start difference. First operand has 979 places, 952 transitions, 2180 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:08,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 950 transitions, 2193 flow [2021-06-10 11:47:08,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 950 transitions, 2192 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:08,869 INFO L241 Difference]: Finished difference. Result has 978 places, 950 transitions, 2176 flow [2021-06-10 11:47:08,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2176, PETRI_PLACES=978, PETRI_TRANSITIONS=950} [2021-06-10 11:47:08,869 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -5 predicate places. [2021-06-10 11:47:08,869 INFO L480 AbstractCegarLoop]: Abstraction has has 978 places, 950 transitions, 2176 flow [2021-06-10 11:47:08,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:08,870 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:08,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2184 [2021-06-10 11:47:08,870 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 32469455, now seen corresponding path program 1 times [2021-06-10 11:47:08,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:08,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199097478] [2021-06-10 11:47:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:08,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:08,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:08,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:08,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:47:08,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199097478] [2021-06-10 11:47:08,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:08,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:08,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032268745] [2021-06-10 11:47:08,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:08,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:08,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:08,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 950 transitions, 2176 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:08,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:08,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:08,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:09,315 INFO L129 PetriNetUnfolder]: 83/1095 cut-off events. [2021-06-10 11:47:09,315 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:09,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1095 events. 83/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4604 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1266. Up to 38 conditions per place. [2021-06-10 11:47:09,393 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/952 dead transitions. [2021-06-10 11:47:09,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 952 transitions, 2206 flow [2021-06-10 11:47:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:09,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:09,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:09,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:09,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:09,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:09,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,398 INFO L185 Difference]: Start difference. First operand has 978 places, 950 transitions, 2176 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:09,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 952 transitions, 2206 flow [2021-06-10 11:47:09,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 952 transitions, 2205 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:09,407 INFO L241 Difference]: Finished difference. Result has 981 places, 952 transitions, 2199 flow [2021-06-10 11:47:09,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2199, PETRI_PLACES=981, PETRI_TRANSITIONS=952} [2021-06-10 11:47:09,407 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -2 predicate places. [2021-06-10 11:47:09,407 INFO L480 AbstractCegarLoop]: Abstraction has has 981 places, 952 transitions, 2199 flow [2021-06-10 11:47:09,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:09,408 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:09,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2185 [2021-06-10 11:47:09,408 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash 32470478, now seen corresponding path program 1 times [2021-06-10 11:47:09,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:09,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151206060] [2021-06-10 11:47:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:09,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:09,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:09,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:09,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:09,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:09,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:47:09,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151206060] [2021-06-10 11:47:09,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:09,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:09,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820474879] [2021-06-10 11:47:09,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:09,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:09,438 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:09,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 952 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:09,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:09,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:09,904 INFO L129 PetriNetUnfolder]: 82/1093 cut-off events. [2021-06-10 11:47:09,904 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:09,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1093 events. 82/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4596 event pairs, 0 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1263. Up to 38 conditions per place. [2021-06-10 11:47:09,983 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/952 dead transitions. [2021-06-10 11:47:09,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 952 transitions, 2211 flow [2021-06-10 11:47:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:09,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:09,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:09,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:09,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:09,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:09,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,988 INFO L185 Difference]: Start difference. First operand has 981 places, 952 transitions, 2199 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:09,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 952 transitions, 2211 flow [2021-06-10 11:47:09,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 952 transitions, 2206 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:09,997 INFO L241 Difference]: Finished difference. Result has 984 places, 952 transitions, 2204 flow [2021-06-10 11:47:09,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2204, PETRI_PLACES=984, PETRI_TRANSITIONS=952} [2021-06-10 11:47:09,997 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 1 predicate places. [2021-06-10 11:47:09,997 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 952 transitions, 2204 flow [2021-06-10 11:47:09,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:09,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:09,998 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:09,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2186 [2021-06-10 11:47:09,998 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 33422767, now seen corresponding path program 1 times [2021-06-10 11:47:09,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:09,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43170156] [2021-06-10 11:47:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:10,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:10,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:10,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:47:10,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43170156] [2021-06-10 11:47:10,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:10,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:10,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158846586] [2021-06-10 11:47:10,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:10,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:10,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:10,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:10,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:10,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 952 transitions, 2204 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:10,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:10,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:10,448 INFO L129 PetriNetUnfolder]: 81/1089 cut-off events. [2021-06-10 11:47:10,449 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:10,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1089 events. 81/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4567 event pairs, 0 based on Foata normal form. 1/973 useless extension candidates. Maximal degree in co-relation 1260. Up to 38 conditions per place. [2021-06-10 11:47:10,527 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/949 dead transitions. [2021-06-10 11:47:10,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 949 transitions, 2201 flow [2021-06-10 11:47:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:10,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:10,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:10,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:10,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:10,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:10,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,532 INFO L185 Difference]: Start difference. First operand has 984 places, 952 transitions, 2204 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:10,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 949 transitions, 2201 flow [2021-06-10 11:47:10,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 949 transitions, 2194 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:10,541 INFO L241 Difference]: Finished difference. Result has 983 places, 949 transitions, 2184 flow [2021-06-10 11:47:10,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2184, PETRI_PLACES=983, PETRI_TRANSITIONS=949} [2021-06-10 11:47:10,541 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 0 predicate places. [2021-06-10 11:47:10,541 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 949 transitions, 2184 flow [2021-06-10 11:47:10,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:10,542 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:10,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2187 [2021-06-10 11:47:10,542 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash 33423790, now seen corresponding path program 1 times [2021-06-10 11:47:10,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:10,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191216108] [2021-06-10 11:47:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:10,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:10,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:10,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:10,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:47:10,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191216108] [2021-06-10 11:47:10,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:10,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:10,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543941544] [2021-06-10 11:47:10,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:10,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:10,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:10,566 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:10,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 949 transitions, 2184 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:10,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:10,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:10,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:10,991 INFO L129 PetriNetUnfolder]: 81/1087 cut-off events. [2021-06-10 11:47:10,991 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:11,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1087 events. 81/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4550 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1261. Up to 38 conditions per place. [2021-06-10 11:47:11,070 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2021-06-10 11:47:11,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 947 transitions, 2197 flow [2021-06-10 11:47:11,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:11,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:11,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:11,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:11,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:11,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:11,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,074 INFO L185 Difference]: Start difference. First operand has 983 places, 949 transitions, 2184 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:11,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 947 transitions, 2197 flow [2021-06-10 11:47:11,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 947 transitions, 2196 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:11,084 INFO L241 Difference]: Finished difference. Result has 982 places, 947 transitions, 2180 flow [2021-06-10 11:47:11,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2180, PETRI_PLACES=982, PETRI_TRANSITIONS=947} [2021-06-10 11:47:11,084 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, -1 predicate places. [2021-06-10 11:47:11,084 INFO L480 AbstractCegarLoop]: Abstraction has has 982 places, 947 transitions, 2180 flow [2021-06-10 11:47:11,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:11,084 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:11,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2188 [2021-06-10 11:47:11,084 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1982516963, now seen corresponding path program 1 times [2021-06-10 11:47:11,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:11,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770137206] [2021-06-10 11:47:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:11,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:11,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:11,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:47:11,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770137206] [2021-06-10 11:47:11,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:11,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:11,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788454106] [2021-06-10 11:47:11,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:11,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:11,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:11,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 947 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:11,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:11,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:11,540 INFO L129 PetriNetUnfolder]: 80/1094 cut-off events. [2021-06-10 11:47:11,540 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:11,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1094 events. 80/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4615 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1266. Up to 38 conditions per place. [2021-06-10 11:47:11,617 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/948 dead transitions. [2021-06-10 11:47:11,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 948 transitions, 2196 flow [2021-06-10 11:47:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:11,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:11,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:11,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:11,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:11,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:11,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,622 INFO L185 Difference]: Start difference. First operand has 982 places, 947 transitions, 2180 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:11,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 948 transitions, 2196 flow [2021-06-10 11:47:11,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 948 transitions, 2195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:11,631 INFO L241 Difference]: Finished difference. Result has 984 places, 947 transitions, 2184 flow [2021-06-10 11:47:11,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2184, PETRI_PLACES=984, PETRI_TRANSITIONS=947} [2021-06-10 11:47:11,631 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 1 predicate places. [2021-06-10 11:47:11,631 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 947 transitions, 2184 flow [2021-06-10 11:47:11,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:11,632 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:11,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2189 [2021-06-10 11:47:11,632 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1982515940, now seen corresponding path program 1 times [2021-06-10 11:47:11,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:11,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501832180] [2021-06-10 11:47:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:11,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:11,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:11,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:11,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:47:11,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501832180] [2021-06-10 11:47:11,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:11,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:11,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737012298] [2021-06-10 11:47:11,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:11,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:11,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:11,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 947 transitions, 2184 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:11,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:11,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:11,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:12,085 INFO L129 PetriNetUnfolder]: 78/1096 cut-off events. [2021-06-10 11:47:12,085 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:12,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1096 events. 78/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4645 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1277. Up to 38 conditions per place. [2021-06-10 11:47:12,162 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/948 dead transitions. [2021-06-10 11:47:12,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 948 transitions, 2210 flow [2021-06-10 11:47:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:12,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:12,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:12,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:12,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:12,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:12,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,167 INFO L185 Difference]: Start difference. First operand has 984 places, 947 transitions, 2184 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:12,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 948 transitions, 2210 flow [2021-06-10 11:47:12,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 948 transitions, 2209 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:12,176 INFO L241 Difference]: Finished difference. Result has 987 places, 948 transitions, 2201 flow [2021-06-10 11:47:12,177 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2201, PETRI_PLACES=987, PETRI_TRANSITIONS=948} [2021-06-10 11:47:12,177 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 4 predicate places. [2021-06-10 11:47:12,177 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 948 transitions, 2201 flow [2021-06-10 11:47:12,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:12,177 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:12,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2190 [2021-06-10 11:47:12,177 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:12,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1983469252, now seen corresponding path program 1 times [2021-06-10 11:47:12,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:12,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038305050] [2021-06-10 11:47:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:12,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:12,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:12,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:47:12,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038305050] [2021-06-10 11:47:12,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:12,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:12,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859146743] [2021-06-10 11:47:12,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:12,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:12,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:12,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:12,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:12,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 948 transitions, 2201 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:12,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:12,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:12,641 INFO L129 PetriNetUnfolder]: 78/1089 cut-off events. [2021-06-10 11:47:12,641 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:12,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1089 events. 78/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4586 event pairs, 0 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 1263. Up to 38 conditions per place. [2021-06-10 11:47:12,729 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/946 dead transitions. [2021-06-10 11:47:12,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 946 transitions, 2203 flow [2021-06-10 11:47:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:12,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:12,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:12,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:12,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:12,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:12,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,734 INFO L185 Difference]: Start difference. First operand has 987 places, 948 transitions, 2201 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:12,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 946 transitions, 2203 flow [2021-06-10 11:47:12,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 946 transitions, 2195 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:12,743 INFO L241 Difference]: Finished difference. Result has 987 places, 946 transitions, 2188 flow [2021-06-10 11:47:12,744 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2188, PETRI_PLACES=987, PETRI_TRANSITIONS=946} [2021-06-10 11:47:12,744 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 4 predicate places. [2021-06-10 11:47:12,744 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 946 transitions, 2188 flow [2021-06-10 11:47:12,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:12,744 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:12,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2191 [2021-06-10 11:47:12,744 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1983470275, now seen corresponding path program 1 times [2021-06-10 11:47:12,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:12,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113071395] [2021-06-10 11:47:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:12,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:12,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:12,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:12,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:47:12,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113071395] [2021-06-10 11:47:12,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:12,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:12,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516194460] [2021-06-10 11:47:12,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:12,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:12,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:12,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 946 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:12,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:12,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:12,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:13,197 INFO L129 PetriNetUnfolder]: 78/1087 cut-off events. [2021-06-10 11:47:13,198 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:13,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 1087 events. 78/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4572 event pairs, 0 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1267. Up to 38 conditions per place. [2021-06-10 11:47:13,333 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/944 dead transitions. [2021-06-10 11:47:13,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 944 transitions, 2201 flow [2021-06-10 11:47:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:13,335 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:13,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:13,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:13,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:13,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:13,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,338 INFO L185 Difference]: Start difference. First operand has 987 places, 946 transitions, 2188 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:13,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 944 transitions, 2201 flow [2021-06-10 11:47:13,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 944 transitions, 2200 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:13,346 INFO L241 Difference]: Finished difference. Result has 986 places, 944 transitions, 2184 flow [2021-06-10 11:47:13,346 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2184, PETRI_PLACES=986, PETRI_TRANSITIONS=944} [2021-06-10 11:47:13,346 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 3 predicate places. [2021-06-10 11:47:13,347 INFO L480 AbstractCegarLoop]: Abstraction has has 986 places, 944 transitions, 2184 flow [2021-06-10 11:47:13,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:13,347 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:13,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2192 [2021-06-10 11:47:13,347 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2100480396, now seen corresponding path program 1 times [2021-06-10 11:47:13,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:13,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407645263] [2021-06-10 11:47:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:13,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:13,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:13,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:47:13,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407645263] [2021-06-10 11:47:13,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:13,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:13,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459509114] [2021-06-10 11:47:13,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:13,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:13,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:13,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:13,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:13,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 944 transitions, 2184 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:13,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:13,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:13,822 INFO L129 PetriNetUnfolder]: 77/1094 cut-off events. [2021-06-10 11:47:13,822 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:13,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1094 events. 77/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4629 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1272. Up to 38 conditions per place. [2021-06-10 11:47:13,900 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/945 dead transitions. [2021-06-10 11:47:13,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 945 transitions, 2200 flow [2021-06-10 11:47:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:13,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:13,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:13,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:13,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:13,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:13,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,905 INFO L185 Difference]: Start difference. First operand has 986 places, 944 transitions, 2184 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:13,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 945 transitions, 2200 flow [2021-06-10 11:47:13,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 945 transitions, 2199 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:13,914 INFO L241 Difference]: Finished difference. Result has 988 places, 944 transitions, 2188 flow [2021-06-10 11:47:13,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2188, PETRI_PLACES=988, PETRI_TRANSITIONS=944} [2021-06-10 11:47:13,914 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 5 predicate places. [2021-06-10 11:47:13,914 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 944 transitions, 2188 flow [2021-06-10 11:47:13,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,915 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:13,915 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:13,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2193 [2021-06-10 11:47:13,915 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2100481419, now seen corresponding path program 1 times [2021-06-10 11:47:13,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:13,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478456776] [2021-06-10 11:47:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:13,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:13,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:13,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:13,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:47:13,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478456776] [2021-06-10 11:47:13,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:13,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:13,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517465104] [2021-06-10 11:47:13,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:13,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:13,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:13,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 944 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:13,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:13,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:13,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:14,374 INFO L129 PetriNetUnfolder]: 75/1096 cut-off events. [2021-06-10 11:47:14,374 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:14,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1096 events. 75/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4660 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1283. Up to 38 conditions per place. [2021-06-10 11:47:14,452 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/945 dead transitions. [2021-06-10 11:47:14,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 945 transitions, 2214 flow [2021-06-10 11:47:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:14,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:14,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:14,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:14,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:14,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:14,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:14,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:14,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:14,457 INFO L185 Difference]: Start difference. First operand has 988 places, 944 transitions, 2188 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:14,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 945 transitions, 2214 flow [2021-06-10 11:47:14,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 945 transitions, 2213 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:14,467 INFO L241 Difference]: Finished difference. Result has 991 places, 945 transitions, 2205 flow [2021-06-10 11:47:14,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2205, PETRI_PLACES=991, PETRI_TRANSITIONS=945} [2021-06-10 11:47:14,467 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 8 predicate places. [2021-06-10 11:47:14,467 INFO L480 AbstractCegarLoop]: Abstraction has has 991 places, 945 transitions, 2205 flow [2021-06-10 11:47:14,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:14,467 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:14,467 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:14,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2194 [2021-06-10 11:47:14,468 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2099528107, now seen corresponding path program 1 times [2021-06-10 11:47:14,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:14,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892622726] [2021-06-10 11:47:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:14,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:14,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:14,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:14,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:14,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:14,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:47:14,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892622726] [2021-06-10 11:47:14,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:14,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:14,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781113742] [2021-06-10 11:47:14,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:14,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:14,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:14,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 945 transitions, 2205 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:14,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:14,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:14,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:14,925 INFO L129 PetriNetUnfolder]: 75/1089 cut-off events. [2021-06-10 11:47:14,926 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:14,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 1089 events. 75/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4603 event pairs, 0 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 1269. Up to 38 conditions per place. [2021-06-10 11:47:15,002 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/943 dead transitions. [2021-06-10 11:47:15,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 943 transitions, 2207 flow [2021-06-10 11:47:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:15,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:15,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:15,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:15,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:15,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:15,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,007 INFO L185 Difference]: Start difference. First operand has 991 places, 945 transitions, 2205 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:15,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 943 transitions, 2207 flow [2021-06-10 11:47:15,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 943 transitions, 2199 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:15,016 INFO L241 Difference]: Finished difference. Result has 991 places, 943 transitions, 2192 flow [2021-06-10 11:47:15,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2192, PETRI_PLACES=991, PETRI_TRANSITIONS=943} [2021-06-10 11:47:15,017 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 8 predicate places. [2021-06-10 11:47:15,017 INFO L480 AbstractCegarLoop]: Abstraction has has 991 places, 943 transitions, 2192 flow [2021-06-10 11:47:15,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:15,017 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:15,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2195 [2021-06-10 11:47:15,017 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2099527084, now seen corresponding path program 1 times [2021-06-10 11:47:15,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:15,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064446790] [2021-06-10 11:47:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:15,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:15,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:15,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:47:15,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064446790] [2021-06-10 11:47:15,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:15,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:15,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538441477] [2021-06-10 11:47:15,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:15,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:15,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:15,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 943 transitions, 2192 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:15,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:15,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:15,491 INFO L129 PetriNetUnfolder]: 75/1087 cut-off events. [2021-06-10 11:47:15,491 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:15,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1087 events. 75/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4586 event pairs, 0 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1273. Up to 38 conditions per place. [2021-06-10 11:47:15,546 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/941 dead transitions. [2021-06-10 11:47:15,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 941 transitions, 2205 flow [2021-06-10 11:47:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:15,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:15,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:15,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:15,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:15,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:15,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,551 INFO L185 Difference]: Start difference. First operand has 991 places, 943 transitions, 2192 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:15,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 941 transitions, 2205 flow [2021-06-10 11:47:15,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 990 places, 941 transitions, 2204 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:15,560 INFO L241 Difference]: Finished difference. Result has 990 places, 941 transitions, 2188 flow [2021-06-10 11:47:15,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=988, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2188, PETRI_PLACES=990, PETRI_TRANSITIONS=941} [2021-06-10 11:47:15,560 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 7 predicate places. [2021-06-10 11:47:15,560 INFO L480 AbstractCegarLoop]: Abstraction has has 990 places, 941 transitions, 2188 flow [2021-06-10 11:47:15,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,560 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:15,560 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:15,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2196 [2021-06-10 11:47:15,561 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:15,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 329885595, now seen corresponding path program 1 times [2021-06-10 11:47:15,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:15,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387988823] [2021-06-10 11:47:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:15,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:15,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:15,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:15,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:47:15,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387988823] [2021-06-10 11:47:15,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:15,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:15,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938944976] [2021-06-10 11:47:15,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:15,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:15,585 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:15,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 941 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:15,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:15,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:15,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:16,014 INFO L129 PetriNetUnfolder]: 73/1092 cut-off events. [2021-06-10 11:47:16,014 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:16,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 1092 events. 73/1092 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4640 event pairs, 0 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1276. Up to 38 conditions per place. [2021-06-10 11:47:16,093 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2021-06-10 11:47:16,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 942 transitions, 2204 flow [2021-06-10 11:47:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:16,094 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:16,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:16,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:16,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:16,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:16,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,097 INFO L185 Difference]: Start difference. First operand has 990 places, 941 transitions, 2188 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:16,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 992 places, 942 transitions, 2204 flow [2021-06-10 11:47:16,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 942 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:16,107 INFO L241 Difference]: Finished difference. Result has 993 places, 942 transitions, 2201 flow [2021-06-10 11:47:16,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2201, PETRI_PLACES=993, PETRI_TRANSITIONS=942} [2021-06-10 11:47:16,107 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 10 predicate places. [2021-06-10 11:47:16,107 INFO L480 AbstractCegarLoop]: Abstraction has has 993 places, 942 transitions, 2201 flow [2021-06-10 11:47:16,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,107 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:16,107 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:16,107 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2197 [2021-06-10 11:47:16,107 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash 329884572, now seen corresponding path program 1 times [2021-06-10 11:47:16,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:16,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933359210] [2021-06-10 11:47:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:16,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:16,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:16,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:47:16,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933359210] [2021-06-10 11:47:16,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:16,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:16,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708491198] [2021-06-10 11:47:16,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:16,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:16,132 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:16,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 942 transitions, 2201 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:16,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:16,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:16,565 INFO L129 PetriNetUnfolder]: 73/1093 cut-off events. [2021-06-10 11:47:16,566 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:47:16,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1093 events. 73/1093 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4646 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1284. Up to 38 conditions per place. [2021-06-10 11:47:16,643 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/943 dead transitions. [2021-06-10 11:47:16,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 943 transitions, 2227 flow [2021-06-10 11:47:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:16,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:16,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:16,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:16,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:16,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:16,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,648 INFO L185 Difference]: Start difference. First operand has 993 places, 942 transitions, 2201 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:16,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 943 transitions, 2227 flow [2021-06-10 11:47:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 943 transitions, 2225 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:16,658 INFO L241 Difference]: Finished difference. Result has 996 places, 943 transitions, 2217 flow [2021-06-10 11:47:16,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2217, PETRI_PLACES=996, PETRI_TRANSITIONS=943} [2021-06-10 11:47:16,658 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 13 predicate places. [2021-06-10 11:47:16,658 INFO L480 AbstractCegarLoop]: Abstraction has has 996 places, 943 transitions, 2217 flow [2021-06-10 11:47:16,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:16,659 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:16,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2198 [2021-06-10 11:47:16,659 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 330838907, now seen corresponding path program 1 times [2021-06-10 11:47:16,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:16,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204859543] [2021-06-10 11:47:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:16,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:16,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:16,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:16,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:47:16,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204859543] [2021-06-10 11:47:16,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:16,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:16,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559375563] [2021-06-10 11:47:16,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:16,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:16,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:16,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 943 transitions, 2217 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:16,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:16,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:16,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:17,127 INFO L129 PetriNetUnfolder]: 72/1090 cut-off events. [2021-06-10 11:47:17,127 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2021-06-10 11:47:17,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1090 events. 72/1090 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4631 event pairs, 0 based on Foata normal form. 2/983 useless extension candidates. Maximal degree in co-relation 1283. Up to 38 conditions per place. [2021-06-10 11:47:17,208 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 9 selfloop transitions, 1 changer transitions 0/941 dead transitions. [2021-06-10 11:47:17,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 941 transitions, 2225 flow [2021-06-10 11:47:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2922 transitions. [2021-06-10 11:47:17,210 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214758751182592 [2021-06-10 11:47:17,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2922 transitions. [2021-06-10 11:47:17,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2922 transitions. [2021-06-10 11:47:17,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:17,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2922 transitions. [2021-06-10 11:47:17,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.0) internal successors, (2922), 3 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,213 INFO L185 Difference]: Start difference. First operand has 996 places, 943 transitions, 2217 flow. Second operand 3 states and 2922 transitions. [2021-06-10 11:47:17,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 941 transitions, 2225 flow [2021-06-10 11:47:17,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 941 transitions, 2224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:17,223 INFO L241 Difference]: Finished difference. Result has 997 places, 941 transitions, 2206 flow [2021-06-10 11:47:17,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2206, PETRI_PLACES=997, PETRI_TRANSITIONS=941} [2021-06-10 11:47:17,223 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 14 predicate places. [2021-06-10 11:47:17,223 INFO L480 AbstractCegarLoop]: Abstraction has has 997 places, 941 transitions, 2206 flow [2021-06-10 11:47:17,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:17,224 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:17,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2199 [2021-06-10 11:47:17,224 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 330837884, now seen corresponding path program 1 times [2021-06-10 11:47:17,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:17,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134388686] [2021-06-10 11:47:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:17,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:17,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:17,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:47:17,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134388686] [2021-06-10 11:47:17,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:17,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:17,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286801180] [2021-06-10 11:47:17,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:17,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:17,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:17,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 941 transitions, 2206 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:17,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:17,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:17,682 INFO L129 PetriNetUnfolder]: 72/1087 cut-off events. [2021-06-10 11:47:17,682 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:17,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1087 events. 72/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4609 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1277. Up to 38 conditions per place. [2021-06-10 11:47:17,747 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/938 dead transitions. [2021-06-10 11:47:17,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 938 transitions, 2207 flow [2021-06-10 11:47:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:17,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:17,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:17,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:17,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:17,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:17,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,751 INFO L185 Difference]: Start difference. First operand has 997 places, 941 transitions, 2206 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:17,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 938 transitions, 2207 flow [2021-06-10 11:47:17,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 938 transitions, 2202 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:17,760 INFO L241 Difference]: Finished difference. Result has 994 places, 938 transitions, 2192 flow [2021-06-10 11:47:17,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2190, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2192, PETRI_PLACES=994, PETRI_TRANSITIONS=938} [2021-06-10 11:47:17,761 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 11 predicate places. [2021-06-10 11:47:17,761 INFO L480 AbstractCegarLoop]: Abstraction has has 994 places, 938 transitions, 2192 flow [2021-06-10 11:47:17,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:17,761 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:17,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2200 [2021-06-10 11:47:17,761 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -556662132, now seen corresponding path program 1 times [2021-06-10 11:47:17,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:17,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053365862] [2021-06-10 11:47:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:17,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:17,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:17,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:17,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:47:17,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053365862] [2021-06-10 11:47:17,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:17,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:17,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636046625] [2021-06-10 11:47:17,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:17,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:17,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:17,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 938 transitions, 2192 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:17,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:17,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:17,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:18,210 INFO L129 PetriNetUnfolder]: 70/1092 cut-off events. [2021-06-10 11:47:18,211 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:18,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 1092 events. 70/1092 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4659 event pairs, 0 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1285. Up to 38 conditions per place. [2021-06-10 11:47:18,287 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2021-06-10 11:47:18,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 939 transitions, 2208 flow [2021-06-10 11:47:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:18,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:18,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:18,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:18,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:18,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:18,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,292 INFO L185 Difference]: Start difference. First operand has 994 places, 938 transitions, 2192 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:18,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 939 transitions, 2208 flow [2021-06-10 11:47:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 939 transitions, 2207 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:18,301 INFO L241 Difference]: Finished difference. Result has 997 places, 939 transitions, 2205 flow [2021-06-10 11:47:18,301 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2191, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2205, PETRI_PLACES=997, PETRI_TRANSITIONS=939} [2021-06-10 11:47:18,302 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 14 predicate places. [2021-06-10 11:47:18,302 INFO L480 AbstractCegarLoop]: Abstraction has has 997 places, 939 transitions, 2205 flow [2021-06-10 11:47:18,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,302 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:18,302 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:18,302 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2201 [2021-06-10 11:47:18,302 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash -556663155, now seen corresponding path program 1 times [2021-06-10 11:47:18,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:18,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076297884] [2021-06-10 11:47:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:18,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:18,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:18,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:47:18,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076297884] [2021-06-10 11:47:18,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:18,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:18,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014545096] [2021-06-10 11:47:18,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:18,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:18,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:18,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 939 transitions, 2205 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:18,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:18,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:18,787 INFO L129 PetriNetUnfolder]: 70/1093 cut-off events. [2021-06-10 11:47:18,787 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:47:18,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1093 events. 70/1093 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4663 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1291. Up to 38 conditions per place. [2021-06-10 11:47:18,869 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/940 dead transitions. [2021-06-10 11:47:18,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 999 places, 940 transitions, 2231 flow [2021-06-10 11:47:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:18,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:18,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:18,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:18,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:18,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:18,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,873 INFO L185 Difference]: Start difference. First operand has 997 places, 939 transitions, 2205 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 999 places, 940 transitions, 2231 flow [2021-06-10 11:47:18,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 940 transitions, 2229 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:18,883 INFO L241 Difference]: Finished difference. Result has 1000 places, 940 transitions, 2221 flow [2021-06-10 11:47:18,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2221, PETRI_PLACES=1000, PETRI_TRANSITIONS=940} [2021-06-10 11:47:18,883 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 17 predicate places. [2021-06-10 11:47:18,883 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 940 transitions, 2221 flow [2021-06-10 11:47:18,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,883 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:18,883 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:18,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2202 [2021-06-10 11:47:18,884 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:18,884 INFO L82 PathProgramCache]: Analyzing trace with hash -555708820, now seen corresponding path program 1 times [2021-06-10 11:47:18,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:18,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558533373] [2021-06-10 11:47:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:18,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:18,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:18,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:18,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:47:18,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558533373] [2021-06-10 11:47:18,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:18,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:18,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140747980] [2021-06-10 11:47:18,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:18,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:18,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:18,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 940 transitions, 2221 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:18,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:18,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:18,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:19,348 INFO L129 PetriNetUnfolder]: 69/1090 cut-off events. [2021-06-10 11:47:19,349 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2021-06-10 11:47:19,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1090 events. 69/1090 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4649 event pairs, 0 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 1290. Up to 38 conditions per place. [2021-06-10 11:47:19,424 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 9 selfloop transitions, 1 changer transitions 0/938 dead transitions. [2021-06-10 11:47:19,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 938 transitions, 2229 flow [2021-06-10 11:47:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2922 transitions. [2021-06-10 11:47:19,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9214758751182592 [2021-06-10 11:47:19,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2922 transitions. [2021-06-10 11:47:19,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2922 transitions. [2021-06-10 11:47:19,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:19,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2922 transitions. [2021-06-10 11:47:19,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.0) internal successors, (2922), 3 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,429 INFO L185 Difference]: Start difference. First operand has 1000 places, 940 transitions, 2221 flow. Second operand 3 states and 2922 transitions. [2021-06-10 11:47:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 938 transitions, 2229 flow [2021-06-10 11:47:19,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 938 transitions, 2228 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:19,438 INFO L241 Difference]: Finished difference. Result has 1001 places, 938 transitions, 2210 flow [2021-06-10 11:47:19,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2210, PETRI_PLACES=1001, PETRI_TRANSITIONS=938} [2021-06-10 11:47:19,438 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 18 predicate places. [2021-06-10 11:47:19,438 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 938 transitions, 2210 flow [2021-06-10 11:47:19,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:19,439 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:19,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2203 [2021-06-10 11:47:19,439 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash -555709843, now seen corresponding path program 1 times [2021-06-10 11:47:19,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:19,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304032109] [2021-06-10 11:47:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:19,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:19,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:19,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:19,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:19,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:19,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:47:19,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304032109] [2021-06-10 11:47:19,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:19,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:19,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738861020] [2021-06-10 11:47:19,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:19,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:19,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:19,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:19,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 938 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:19,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:19,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:19,896 INFO L129 PetriNetUnfolder]: 69/1087 cut-off events. [2021-06-10 11:47:19,896 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:19,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1087 events. 69/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4622 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1284. Up to 38 conditions per place. [2021-06-10 11:47:19,968 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/935 dead transitions. [2021-06-10 11:47:19,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 935 transitions, 2211 flow [2021-06-10 11:47:19,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:19,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:19,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:19,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:19,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:19,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:19,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,972 INFO L185 Difference]: Start difference. First operand has 1001 places, 938 transitions, 2210 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:19,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 935 transitions, 2211 flow [2021-06-10 11:47:19,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 935 transitions, 2206 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:19,981 INFO L241 Difference]: Finished difference. Result has 998 places, 935 transitions, 2196 flow [2021-06-10 11:47:19,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2196, PETRI_PLACES=998, PETRI_TRANSITIONS=935} [2021-06-10 11:47:19,982 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 15 predicate places. [2021-06-10 11:47:19,982 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 935 transitions, 2196 flow [2021-06-10 11:47:19,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:19,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:19,982 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:19,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2204 [2021-06-10 11:47:19,982 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1378243617, now seen corresponding path program 1 times [2021-06-10 11:47:19,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:19,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847586320] [2021-06-10 11:47:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:20,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:20,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:20,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:47:20,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847586320] [2021-06-10 11:47:20,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:20,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:20,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029108092] [2021-06-10 11:47:20,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:20,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:20,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:20,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:20,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 935 transitions, 2196 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:20,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:20,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:20,443 INFO L129 PetriNetUnfolder]: 68/1094 cut-off events. [2021-06-10 11:47:20,444 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:20,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 1094 events. 68/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4688 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1294. Up to 38 conditions per place. [2021-06-10 11:47:20,521 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2021-06-10 11:47:20,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 936 transitions, 2212 flow [2021-06-10 11:47:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:20,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:20,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:20,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:20,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:20,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:20,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,526 INFO L185 Difference]: Start difference. First operand has 998 places, 935 transitions, 2196 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:20,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 936 transitions, 2212 flow [2021-06-10 11:47:20,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 936 transitions, 2211 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:20,535 INFO L241 Difference]: Finished difference. Result has 1000 places, 935 transitions, 2200 flow [2021-06-10 11:47:20,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2200, PETRI_PLACES=1000, PETRI_TRANSITIONS=935} [2021-06-10 11:47:20,536 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 17 predicate places. [2021-06-10 11:47:20,536 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 935 transitions, 2200 flow [2021-06-10 11:47:20,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,536 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:20,536 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:20,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2205 [2021-06-10 11:47:20,536 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1378242594, now seen corresponding path program 1 times [2021-06-10 11:47:20,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:20,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443184430] [2021-06-10 11:47:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:20,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:20,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:20,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:20,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:47:20,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443184430] [2021-06-10 11:47:20,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:20,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:20,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246578789] [2021-06-10 11:47:20,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:20,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:20,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:20,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 935 transitions, 2200 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:20,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:20,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:20,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:21,011 INFO L129 PetriNetUnfolder]: 66/1096 cut-off events. [2021-06-10 11:47:21,011 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:21,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1096 events. 66/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4717 event pairs, 0 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1303. Up to 38 conditions per place. [2021-06-10 11:47:21,091 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/936 dead transitions. [2021-06-10 11:47:21,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 936 transitions, 2226 flow [2021-06-10 11:47:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:21,102 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:21,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:21,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:21,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:21,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:21,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,105 INFO L185 Difference]: Start difference. First operand has 1000 places, 935 transitions, 2200 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:21,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 936 transitions, 2226 flow [2021-06-10 11:47:21,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 936 transitions, 2225 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:21,115 INFO L241 Difference]: Finished difference. Result has 1003 places, 936 transitions, 2217 flow [2021-06-10 11:47:21,115 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2217, PETRI_PLACES=1003, PETRI_TRANSITIONS=936} [2021-06-10 11:47:21,115 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 20 predicate places. [2021-06-10 11:47:21,115 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 936 transitions, 2217 flow [2021-06-10 11:47:21,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,116 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:21,116 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:21,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2206 [2021-06-10 11:47:21,116 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1379195906, now seen corresponding path program 1 times [2021-06-10 11:47:21,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:21,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430539202] [2021-06-10 11:47:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:21,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:21,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:21,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:47:21,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430539202] [2021-06-10 11:47:21,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:21,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:21,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616182580] [2021-06-10 11:47:21,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:21,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:21,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:21,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 936 transitions, 2217 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:21,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:21,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:21,640 INFO L129 PetriNetUnfolder]: 66/1089 cut-off events. [2021-06-10 11:47:21,640 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:21,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1089 events. 66/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4659 event pairs, 0 based on Foata normal form. 1/988 useless extension candidates. Maximal degree in co-relation 1289. Up to 38 conditions per place. [2021-06-10 11:47:21,684 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/934 dead transitions. [2021-06-10 11:47:21,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 934 transitions, 2219 flow [2021-06-10 11:47:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:21,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:21,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:21,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:21,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:21,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:21,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,689 INFO L185 Difference]: Start difference. First operand has 1003 places, 936 transitions, 2217 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:21,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 934 transitions, 2219 flow [2021-06-10 11:47:21,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 934 transitions, 2211 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:21,697 INFO L241 Difference]: Finished difference. Result has 1003 places, 934 transitions, 2204 flow [2021-06-10 11:47:21,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2204, PETRI_PLACES=1003, PETRI_TRANSITIONS=934} [2021-06-10 11:47:21,698 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 20 predicate places. [2021-06-10 11:47:21,698 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 934 transitions, 2204 flow [2021-06-10 11:47:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:21,698 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:21,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2207 [2021-06-10 11:47:21,698 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1379196929, now seen corresponding path program 1 times [2021-06-10 11:47:21,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:21,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485712421] [2021-06-10 11:47:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:21,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:21,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:21,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:21,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:47:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485712421] [2021-06-10 11:47:21,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:21,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:21,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579254789] [2021-06-10 11:47:21,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:21,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:21,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:21,723 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 934 transitions, 2204 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:21,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:21,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:21,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:22,175 INFO L129 PetriNetUnfolder]: 66/1087 cut-off events. [2021-06-10 11:47:22,176 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:22,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1087 events. 66/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4645 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1293. Up to 38 conditions per place. [2021-06-10 11:47:22,252 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/932 dead transitions. [2021-06-10 11:47:22,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 932 transitions, 2217 flow [2021-06-10 11:47:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:22,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:22,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:22,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:22,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:22,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:22,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,256 INFO L185 Difference]: Start difference. First operand has 1003 places, 934 transitions, 2204 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:22,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 932 transitions, 2217 flow [2021-06-10 11:47:22,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1002 places, 932 transitions, 2216 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:22,266 INFO L241 Difference]: Finished difference. Result has 1002 places, 932 transitions, 2200 flow [2021-06-10 11:47:22,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2200, PETRI_PLACES=1002, PETRI_TRANSITIONS=932} [2021-06-10 11:47:22,266 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 19 predicate places. [2021-06-10 11:47:22,266 INFO L480 AbstractCegarLoop]: Abstraction has has 1002 places, 932 transitions, 2200 flow [2021-06-10 11:47:22,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:22,266 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:22,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2208 [2021-06-10 11:47:22,267 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash -843896206, now seen corresponding path program 1 times [2021-06-10 11:47:22,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:22,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485840620] [2021-06-10 11:47:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:22,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:22,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:22,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:47:22,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485840620] [2021-06-10 11:47:22,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:22,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:22,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834776010] [2021-06-10 11:47:22,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:22,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:22,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:22,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:22,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 932 transitions, 2200 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:22,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:22,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:22,748 INFO L129 PetriNetUnfolder]: 65/1095 cut-off events. [2021-06-10 11:47:22,748 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:22,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1095 events. 65/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4710 event pairs, 0 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1305. Up to 38 conditions per place. [2021-06-10 11:47:22,825 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/934 dead transitions. [2021-06-10 11:47:22,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 934 transitions, 2230 flow [2021-06-10 11:47:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:22,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:22,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:22,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:22,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:22,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:22,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,830 INFO L185 Difference]: Start difference. First operand has 1002 places, 932 transitions, 2200 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 934 transitions, 2230 flow [2021-06-10 11:47:22,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 934 transitions, 2229 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:22,839 INFO L241 Difference]: Finished difference. Result has 1005 places, 934 transitions, 2223 flow [2021-06-10 11:47:22,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2223, PETRI_PLACES=1005, PETRI_TRANSITIONS=934} [2021-06-10 11:47:22,840 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 22 predicate places. [2021-06-10 11:47:22,840 INFO L480 AbstractCegarLoop]: Abstraction has has 1005 places, 934 transitions, 2223 flow [2021-06-10 11:47:22,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:22,840 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:22,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2209 [2021-06-10 11:47:22,840 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash -843895183, now seen corresponding path program 1 times [2021-06-10 11:47:22,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:22,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618179889] [2021-06-10 11:47:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:22,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:22,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:22,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:22,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:47:22,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618179889] [2021-06-10 11:47:22,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:22,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:22,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947847963] [2021-06-10 11:47:22,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:22,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:22,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:22,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:22,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 934 transitions, 2223 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:22,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:22,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:22,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:23,320 INFO L129 PetriNetUnfolder]: 64/1093 cut-off events. [2021-06-10 11:47:23,320 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:23,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1093 events. 64/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4699 event pairs, 0 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 1302. Up to 38 conditions per place. [2021-06-10 11:47:23,397 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/934 dead transitions. [2021-06-10 11:47:23,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 934 transitions, 2235 flow [2021-06-10 11:47:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:23,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:23,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:23,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:23,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:23,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:23,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,402 INFO L185 Difference]: Start difference. First operand has 1005 places, 934 transitions, 2223 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:23,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 934 transitions, 2235 flow [2021-06-10 11:47:23,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1006 places, 934 transitions, 2230 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:23,411 INFO L241 Difference]: Finished difference. Result has 1008 places, 934 transitions, 2228 flow [2021-06-10 11:47:23,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2228, PETRI_PLACES=1008, PETRI_TRANSITIONS=934} [2021-06-10 11:47:23,411 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 25 predicate places. [2021-06-10 11:47:23,411 INFO L480 AbstractCegarLoop]: Abstraction has has 1008 places, 934 transitions, 2228 flow [2021-06-10 11:47:23,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:23,412 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:23,412 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2210 [2021-06-10 11:47:23,412 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -842942894, now seen corresponding path program 1 times [2021-06-10 11:47:23,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:23,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86044955] [2021-06-10 11:47:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:23,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:23,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:23,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:47:23,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86044955] [2021-06-10 11:47:23,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:23,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:23,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709581187] [2021-06-10 11:47:23,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:23,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:23,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:23,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 934 transitions, 2228 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:23,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:23,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:23,865 INFO L129 PetriNetUnfolder]: 63/1089 cut-off events. [2021-06-10 11:47:23,865 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:23,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 1089 events. 63/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4675 event pairs, 0 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 1299. Up to 38 conditions per place. [2021-06-10 11:47:23,924 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/931 dead transitions. [2021-06-10 11:47:23,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 931 transitions, 2225 flow [2021-06-10 11:47:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:23,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:23,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:23,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:23,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:23,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:23,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,929 INFO L185 Difference]: Start difference. First operand has 1008 places, 934 transitions, 2228 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:23,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 931 transitions, 2225 flow [2021-06-10 11:47:23,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 931 transitions, 2218 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:23,938 INFO L241 Difference]: Finished difference. Result has 1007 places, 931 transitions, 2208 flow [2021-06-10 11:47:23,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2208, PETRI_PLACES=1007, PETRI_TRANSITIONS=931} [2021-06-10 11:47:23,938 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 24 predicate places. [2021-06-10 11:47:23,938 INFO L480 AbstractCegarLoop]: Abstraction has has 1007 places, 931 transitions, 2208 flow [2021-06-10 11:47:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:23,939 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:23,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2211 [2021-06-10 11:47:23,939 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -842941871, now seen corresponding path program 1 times [2021-06-10 11:47:23,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:23,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104616329] [2021-06-10 11:47:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:23,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:23,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:23,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:23,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:47:23,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104616329] [2021-06-10 11:47:23,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:23,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:23,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145809212] [2021-06-10 11:47:23,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:23,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:23,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:23,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 931 transitions, 2208 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:23,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:23,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:23,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:24,470 INFO L129 PetriNetUnfolder]: 63/1087 cut-off events. [2021-06-10 11:47:24,470 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:24,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1087 events. 63/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4658 event pairs, 0 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1300. Up to 38 conditions per place. [2021-06-10 11:47:24,545 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/929 dead transitions. [2021-06-10 11:47:24,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 929 transitions, 2221 flow [2021-06-10 11:47:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:24,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:24,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:24,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:24,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:24,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:24,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:24,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:24,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:24,549 INFO L185 Difference]: Start difference. First operand has 1007 places, 931 transitions, 2208 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:24,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 929 transitions, 2221 flow [2021-06-10 11:47:24,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1006 places, 929 transitions, 2220 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:24,559 INFO L241 Difference]: Finished difference. Result has 1006 places, 929 transitions, 2204 flow [2021-06-10 11:47:24,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2204, PETRI_PLACES=1006, PETRI_TRANSITIONS=929} [2021-06-10 11:47:24,559 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 23 predicate places. [2021-06-10 11:47:24,559 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 929 transitions, 2204 flow [2021-06-10 11:47:24,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:24,559 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:24,559 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:24,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2212 [2021-06-10 11:47:24,560 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1635770470, now seen corresponding path program 1 times [2021-06-10 11:47:24,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:24,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784943562] [2021-06-10 11:47:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:24,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:24,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:24,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:24,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:24,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:24,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:47:24,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784943562] [2021-06-10 11:47:24,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:24,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:24,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872979797] [2021-06-10 11:47:24,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:24,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:24,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:24,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 929 transitions, 2204 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:24,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:24,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:24,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:25,054 INFO L129 PetriNetUnfolder]: 62/1095 cut-off events. [2021-06-10 11:47:25,054 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:25,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1095 events. 62/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4732 event pairs, 0 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1312. Up to 38 conditions per place. [2021-06-10 11:47:25,131 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/931 dead transitions. [2021-06-10 11:47:25,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 931 transitions, 2234 flow [2021-06-10 11:47:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:25,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:25,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:25,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:25,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:25,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:25,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,136 INFO L185 Difference]: Start difference. First operand has 1006 places, 929 transitions, 2204 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:25,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 931 transitions, 2234 flow [2021-06-10 11:47:25,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 931 transitions, 2233 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:25,145 INFO L241 Difference]: Finished difference. Result has 1009 places, 931 transitions, 2227 flow [2021-06-10 11:47:25,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2227, PETRI_PLACES=1009, PETRI_TRANSITIONS=931} [2021-06-10 11:47:25,145 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 26 predicate places. [2021-06-10 11:47:25,145 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 931 transitions, 2227 flow [2021-06-10 11:47:25,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:25,146 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:25,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2213 [2021-06-10 11:47:25,146 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1635771493, now seen corresponding path program 1 times [2021-06-10 11:47:25,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:25,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820984131] [2021-06-10 11:47:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:25,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:25,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:25,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:47:25,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820984131] [2021-06-10 11:47:25,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:25,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:25,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195542984] [2021-06-10 11:47:25,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:25,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:25,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:25,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:25,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 931 transitions, 2227 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:25,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:25,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:25,622 INFO L129 PetriNetUnfolder]: 61/1093 cut-off events. [2021-06-10 11:47:25,622 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:25,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 1093 events. 61/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4718 event pairs, 0 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1309. Up to 38 conditions per place. [2021-06-10 11:47:25,700 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/931 dead transitions. [2021-06-10 11:47:25,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 931 transitions, 2239 flow [2021-06-10 11:47:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:25,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:25,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:25,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:25,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:25,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:25,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,705 INFO L185 Difference]: Start difference. First operand has 1009 places, 931 transitions, 2227 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:25,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 931 transitions, 2239 flow [2021-06-10 11:47:25,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 931 transitions, 2234 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:25,714 INFO L241 Difference]: Finished difference. Result has 1012 places, 931 transitions, 2232 flow [2021-06-10 11:47:25,714 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2232, PETRI_PLACES=1012, PETRI_TRANSITIONS=931} [2021-06-10 11:47:25,714 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 29 predicate places. [2021-06-10 11:47:25,714 INFO L480 AbstractCegarLoop]: Abstraction has has 1012 places, 931 transitions, 2232 flow [2021-06-10 11:47:25,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:25,715 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:25,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2214 [2021-06-10 11:47:25,715 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1636723782, now seen corresponding path program 1 times [2021-06-10 11:47:25,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:25,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943564579] [2021-06-10 11:47:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:25,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:25,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:25,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:25,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:47:25,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943564579] [2021-06-10 11:47:25,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:25,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:25,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621042113] [2021-06-10 11:47:25,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:25,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:25,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:25,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:25,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 931 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:25,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:25,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:25,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:26,169 INFO L129 PetriNetUnfolder]: 60/1089 cut-off events. [2021-06-10 11:47:26,169 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:26,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1089 events. 60/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4691 event pairs, 0 based on Foata normal form. 1/994 useless extension candidates. Maximal degree in co-relation 1306. Up to 38 conditions per place. [2021-06-10 11:47:26,241 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/928 dead transitions. [2021-06-10 11:47:26,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 928 transitions, 2229 flow [2021-06-10 11:47:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:26,243 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:26,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:26,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:26,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:26,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:26,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,246 INFO L185 Difference]: Start difference. First operand has 1012 places, 931 transitions, 2232 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:26,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 928 transitions, 2229 flow [2021-06-10 11:47:26,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 928 transitions, 2222 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:26,255 INFO L241 Difference]: Finished difference. Result has 1011 places, 928 transitions, 2212 flow [2021-06-10 11:47:26,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2212, PETRI_PLACES=1011, PETRI_TRANSITIONS=928} [2021-06-10 11:47:26,255 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 28 predicate places. [2021-06-10 11:47:26,255 INFO L480 AbstractCegarLoop]: Abstraction has has 1011 places, 928 transitions, 2212 flow [2021-06-10 11:47:26,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:26,255 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:26,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2215 [2021-06-10 11:47:26,255 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1636724805, now seen corresponding path program 1 times [2021-06-10 11:47:26,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:26,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362809805] [2021-06-10 11:47:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:26,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:26,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:26,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:47:26,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362809805] [2021-06-10 11:47:26,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:26,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:26,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096178823] [2021-06-10 11:47:26,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:26,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:26,285 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:26,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 928 transitions, 2212 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:26,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:26,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:26,731 INFO L129 PetriNetUnfolder]: 60/1087 cut-off events. [2021-06-10 11:47:26,731 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:26,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 1087 events. 60/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4676 event pairs, 0 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 1307. Up to 38 conditions per place. [2021-06-10 11:47:26,806 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/926 dead transitions. [2021-06-10 11:47:26,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 926 transitions, 2225 flow [2021-06-10 11:47:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:26,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:26,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:26,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:26,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:26,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:26,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,811 INFO L185 Difference]: Start difference. First operand has 1011 places, 928 transitions, 2212 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:26,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 926 transitions, 2225 flow [2021-06-10 11:47:26,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 926 transitions, 2224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:26,821 INFO L241 Difference]: Finished difference. Result has 1010 places, 926 transitions, 2208 flow [2021-06-10 11:47:26,821 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2208, PETRI_PLACES=1010, PETRI_TRANSITIONS=926} [2021-06-10 11:47:26,821 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 27 predicate places. [2021-06-10 11:47:26,821 INFO L480 AbstractCegarLoop]: Abstraction has has 1010 places, 926 transitions, 2208 flow [2021-06-10 11:47:26,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:26,822 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:26,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2216 [2021-06-10 11:47:26,822 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1420933029, now seen corresponding path program 1 times [2021-06-10 11:47:26,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:26,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744710742] [2021-06-10 11:47:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:26,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:26,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:26,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:26,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:47:26,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744710742] [2021-06-10 11:47:26,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:26,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:26,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373960720] [2021-06-10 11:47:26,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:26,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:26,850 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:26,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 926 transitions, 2208 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:26,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:26,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:26,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:27,310 INFO L129 PetriNetUnfolder]: 59/1095 cut-off events. [2021-06-10 11:47:27,310 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:27,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1095 events. 59/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4744 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1319. Up to 38 conditions per place. [2021-06-10 11:47:27,386 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/928 dead transitions. [2021-06-10 11:47:27,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 928 transitions, 2238 flow [2021-06-10 11:47:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:27,387 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:27,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:27,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:27,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:27,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:27,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:27,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:27,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:27,390 INFO L185 Difference]: Start difference. First operand has 1010 places, 926 transitions, 2208 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:27,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 928 transitions, 2238 flow [2021-06-10 11:47:27,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 928 transitions, 2237 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:27,400 INFO L241 Difference]: Finished difference. Result has 1013 places, 928 transitions, 2231 flow [2021-06-10 11:47:27,400 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2231, PETRI_PLACES=1013, PETRI_TRANSITIONS=928} [2021-06-10 11:47:27,400 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 30 predicate places. [2021-06-10 11:47:27,401 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 928 transitions, 2231 flow [2021-06-10 11:47:27,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:27,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:27,401 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:27,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2217 [2021-06-10 11:47:27,401 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1420932006, now seen corresponding path program 1 times [2021-06-10 11:47:27,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:27,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395000054] [2021-06-10 11:47:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:27,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:27,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:27,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:27,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:27,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:27,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:47:27,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395000054] [2021-06-10 11:47:27,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:27,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:27,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67202000] [2021-06-10 11:47:27,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:27,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:27,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:27,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:27,429 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:27,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 928 transitions, 2231 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:27,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:27,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:27,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:27,956 INFO L129 PetriNetUnfolder]: 58/1093 cut-off events. [2021-06-10 11:47:27,956 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:27,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1093 events. 58/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4735 event pairs, 0 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1316. Up to 38 conditions per place. [2021-06-10 11:47:27,999 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/928 dead transitions. [2021-06-10 11:47:27,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 928 transitions, 2243 flow [2021-06-10 11:47:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:28,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:28,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:28,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:28,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:28,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:28,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,004 INFO L185 Difference]: Start difference. First operand has 1013 places, 928 transitions, 2231 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:28,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 928 transitions, 2243 flow [2021-06-10 11:47:28,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 928 transitions, 2238 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:28,012 INFO L241 Difference]: Finished difference. Result has 1016 places, 928 transitions, 2236 flow [2021-06-10 11:47:28,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2236, PETRI_PLACES=1016, PETRI_TRANSITIONS=928} [2021-06-10 11:47:28,012 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 33 predicate places. [2021-06-10 11:47:28,012 INFO L480 AbstractCegarLoop]: Abstraction has has 1016 places, 928 transitions, 2236 flow [2021-06-10 11:47:28,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:28,013 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:28,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2218 [2021-06-10 11:47:28,013 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1419979717, now seen corresponding path program 1 times [2021-06-10 11:47:28,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:28,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655512773] [2021-06-10 11:47:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:28,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:28,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:28,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:47:28,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655512773] [2021-06-10 11:47:28,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:28,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:28,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006300215] [2021-06-10 11:47:28,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:28,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:28,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:28,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 928 transitions, 2236 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:28,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:28,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:28,500 INFO L129 PetriNetUnfolder]: 57/1089 cut-off events. [2021-06-10 11:47:28,500 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:28,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1089 events. 57/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4711 event pairs, 0 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 1313. Up to 38 conditions per place. [2021-06-10 11:47:28,576 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/925 dead transitions. [2021-06-10 11:47:28,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 925 transitions, 2233 flow [2021-06-10 11:47:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:28,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:28,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:28,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:28,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:28,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:28,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,581 INFO L185 Difference]: Start difference. First operand has 1016 places, 928 transitions, 2236 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:28,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 925 transitions, 2233 flow [2021-06-10 11:47:28,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 925 transitions, 2226 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:28,591 INFO L241 Difference]: Finished difference. Result has 1015 places, 925 transitions, 2216 flow [2021-06-10 11:47:28,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2216, PETRI_PLACES=1015, PETRI_TRANSITIONS=925} [2021-06-10 11:47:28,591 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 32 predicate places. [2021-06-10 11:47:28,591 INFO L480 AbstractCegarLoop]: Abstraction has has 1015 places, 925 transitions, 2216 flow [2021-06-10 11:47:28,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:28,592 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:28,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2219 [2021-06-10 11:47:28,592 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1419978694, now seen corresponding path program 1 times [2021-06-10 11:47:28,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:28,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523640457] [2021-06-10 11:47:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:28,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:28,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:28,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:28,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:47:28,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523640457] [2021-06-10 11:47:28,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:28,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:28,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781197707] [2021-06-10 11:47:28,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:28,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:28,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:28,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 925 transitions, 2216 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:28,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:28,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:28,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:29,073 INFO L129 PetriNetUnfolder]: 57/1087 cut-off events. [2021-06-10 11:47:29,073 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:29,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1087 events. 57/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4696 event pairs, 0 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 1314. Up to 38 conditions per place. [2021-06-10 11:47:29,147 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/923 dead transitions. [2021-06-10 11:47:29,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 923 transitions, 2229 flow [2021-06-10 11:47:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:29,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:29,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:29,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:29,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:29,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:29,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,151 INFO L185 Difference]: Start difference. First operand has 1015 places, 925 transitions, 2216 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:29,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 923 transitions, 2229 flow [2021-06-10 11:47:29,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 923 transitions, 2228 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:29,161 INFO L241 Difference]: Finished difference. Result has 1014 places, 923 transitions, 2212 flow [2021-06-10 11:47:29,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2212, PETRI_PLACES=1014, PETRI_TRANSITIONS=923} [2021-06-10 11:47:29,161 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 31 predicate places. [2021-06-10 11:47:29,161 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 923 transitions, 2212 flow [2021-06-10 11:47:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:29,161 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:29,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2220 [2021-06-10 11:47:29,161 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 783696081, now seen corresponding path program 1 times [2021-06-10 11:47:29,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:29,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022834250] [2021-06-10 11:47:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:29,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:29,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:29,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:47:29,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022834250] [2021-06-10 11:47:29,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:29,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:29,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909380781] [2021-06-10 11:47:29,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:29,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:29,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:29,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 923 transitions, 2212 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:29,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:29,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:29,648 INFO L129 PetriNetUnfolder]: 56/1095 cut-off events. [2021-06-10 11:47:29,648 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:29,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1095 events. 56/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4767 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1326. Up to 38 conditions per place. [2021-06-10 11:47:29,723 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/925 dead transitions. [2021-06-10 11:47:29,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 925 transitions, 2242 flow [2021-06-10 11:47:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:29,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:29,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:29,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:29,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:29,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:29,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,728 INFO L185 Difference]: Start difference. First operand has 1014 places, 923 transitions, 2212 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:29,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 925 transitions, 2242 flow [2021-06-10 11:47:29,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 925 transitions, 2241 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:29,737 INFO L241 Difference]: Finished difference. Result has 1017 places, 925 transitions, 2235 flow [2021-06-10 11:47:29,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=1017, PETRI_TRANSITIONS=925} [2021-06-10 11:47:29,737 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 34 predicate places. [2021-06-10 11:47:29,737 INFO L480 AbstractCegarLoop]: Abstraction has has 1017 places, 925 transitions, 2235 flow [2021-06-10 11:47:29,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,738 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:29,738 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:29,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2221 [2021-06-10 11:47:29,738 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash 783697104, now seen corresponding path program 1 times [2021-06-10 11:47:29,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:29,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008696697] [2021-06-10 11:47:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:29,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:29,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:29,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:29,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:47:29,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008696697] [2021-06-10 11:47:29,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:29,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:29,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349675538] [2021-06-10 11:47:29,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:29,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:29,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:29,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 925 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:29,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:29,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:29,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:30,201 INFO L129 PetriNetUnfolder]: 55/1093 cut-off events. [2021-06-10 11:47:30,202 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:30,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1093 events. 55/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4754 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1323. Up to 38 conditions per place. [2021-06-10 11:47:30,267 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/925 dead transitions. [2021-06-10 11:47:30,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 925 transitions, 2247 flow [2021-06-10 11:47:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:30,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:30,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:30,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:30,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:30,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:30,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,271 INFO L185 Difference]: Start difference. First operand has 1017 places, 925 transitions, 2235 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 925 transitions, 2247 flow [2021-06-10 11:47:30,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 925 transitions, 2242 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:30,280 INFO L241 Difference]: Finished difference. Result has 1020 places, 925 transitions, 2240 flow [2021-06-10 11:47:30,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2240, PETRI_PLACES=1020, PETRI_TRANSITIONS=925} [2021-06-10 11:47:30,280 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 37 predicate places. [2021-06-10 11:47:30,281 INFO L480 AbstractCegarLoop]: Abstraction has has 1020 places, 925 transitions, 2240 flow [2021-06-10 11:47:30,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:30,281 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:30,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2222 [2021-06-10 11:47:30,281 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 784649393, now seen corresponding path program 1 times [2021-06-10 11:47:30,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:30,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157877640] [2021-06-10 11:47:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:30,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:30,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:30,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:47:30,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157877640] [2021-06-10 11:47:30,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:30,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:30,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066786147] [2021-06-10 11:47:30,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:30,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:30,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:30,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 925 transitions, 2240 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:30,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:30,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:30,749 INFO L129 PetriNetUnfolder]: 54/1089 cut-off events. [2021-06-10 11:47:30,750 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:30,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1089 events. 54/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4728 event pairs, 0 based on Foata normal form. 1/1000 useless extension candidates. Maximal degree in co-relation 1320. Up to 38 conditions per place. [2021-06-10 11:47:30,822 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/922 dead transitions. [2021-06-10 11:47:30,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 922 transitions, 2237 flow [2021-06-10 11:47:30,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:30,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:30,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:30,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:30,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:30,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:30,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,827 INFO L185 Difference]: Start difference. First operand has 1020 places, 925 transitions, 2240 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:30,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 922 transitions, 2237 flow [2021-06-10 11:47:30,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 922 transitions, 2230 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:30,836 INFO L241 Difference]: Finished difference. Result has 1019 places, 922 transitions, 2220 flow [2021-06-10 11:47:30,837 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2220, PETRI_PLACES=1019, PETRI_TRANSITIONS=922} [2021-06-10 11:47:30,837 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 36 predicate places. [2021-06-10 11:47:30,837 INFO L480 AbstractCegarLoop]: Abstraction has has 1019 places, 922 transitions, 2220 flow [2021-06-10 11:47:30,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,837 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:30,837 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:30,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2223 [2021-06-10 11:47:30,837 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 784650416, now seen corresponding path program 1 times [2021-06-10 11:47:30,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:30,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835696178] [2021-06-10 11:47:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:30,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:30,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:30,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:30,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:47:30,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835696178] [2021-06-10 11:47:30,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:30,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:30,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853986131] [2021-06-10 11:47:30,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:30,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:30,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:30,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 922 transitions, 2220 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:30,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:30,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:30,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:31,327 INFO L129 PetriNetUnfolder]: 54/1087 cut-off events. [2021-06-10 11:47:31,327 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:31,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 1087 events. 54/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4711 event pairs, 0 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1321. Up to 38 conditions per place. [2021-06-10 11:47:31,402 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/920 dead transitions. [2021-06-10 11:47:31,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 920 transitions, 2233 flow [2021-06-10 11:47:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:31,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:31,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:31,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:31,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:31,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:31,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,406 INFO L185 Difference]: Start difference. First operand has 1019 places, 922 transitions, 2220 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:31,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 920 transitions, 2233 flow [2021-06-10 11:47:31,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 920 transitions, 2232 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:31,416 INFO L241 Difference]: Finished difference. Result has 1018 places, 920 transitions, 2216 flow [2021-06-10 11:47:31,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2216, PETRI_PLACES=1018, PETRI_TRANSITIONS=920} [2021-06-10 11:47:31,416 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 35 predicate places. [2021-06-10 11:47:31,416 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 920 transitions, 2216 flow [2021-06-10 11:47:31,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:31,416 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:31,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2224 [2021-06-10 11:47:31,416 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:31,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1830543577, now seen corresponding path program 1 times [2021-06-10 11:47:31,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:31,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317515169] [2021-06-10 11:47:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:31,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:31,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:31,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:31,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:31,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:31,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:47:31,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317515169] [2021-06-10 11:47:31,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:31,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:31,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659055836] [2021-06-10 11:47:31,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:31,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:31,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:31,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 920 transitions, 2216 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:31,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:31,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:31,907 INFO L129 PetriNetUnfolder]: 53/1095 cut-off events. [2021-06-10 11:47:31,908 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:31,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1095 events. 53/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4783 event pairs, 0 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1333. Up to 38 conditions per place. [2021-06-10 11:47:31,984 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/922 dead transitions. [2021-06-10 11:47:31,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 922 transitions, 2246 flow [2021-06-10 11:47:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:31,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:31,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:31,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:31,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:31,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:31,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,989 INFO L185 Difference]: Start difference. First operand has 1018 places, 920 transitions, 2216 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:31,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 922 transitions, 2246 flow [2021-06-10 11:47:31,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 922 transitions, 2245 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:31,998 INFO L241 Difference]: Finished difference. Result has 1021 places, 922 transitions, 2239 flow [2021-06-10 11:47:31,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2239, PETRI_PLACES=1021, PETRI_TRANSITIONS=922} [2021-06-10 11:47:31,999 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 38 predicate places. [2021-06-10 11:47:31,999 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 922 transitions, 2239 flow [2021-06-10 11:47:31,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:31,999 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:31,999 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:31,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2225 [2021-06-10 11:47:31,999 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:31,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1830544600, now seen corresponding path program 1 times [2021-06-10 11:47:31,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:31,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779436375] [2021-06-10 11:47:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:32,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:32,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:32,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:47:32,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779436375] [2021-06-10 11:47:32,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:32,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:32,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194482099] [2021-06-10 11:47:32,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:32,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:32,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:32,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:32,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 922 transitions, 2239 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:32,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:32,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:32,509 INFO L129 PetriNetUnfolder]: 51/1096 cut-off events. [2021-06-10 11:47:32,509 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:32,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 1096 events. 51/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4806 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1333. Up to 38 conditions per place. [2021-06-10 11:47:32,583 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/922 dead transitions. [2021-06-10 11:47:32,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 922 transitions, 2251 flow [2021-06-10 11:47:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:32,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:32,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:32,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:32,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:32,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:32,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,588 INFO L185 Difference]: Start difference. First operand has 1021 places, 922 transitions, 2239 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:32,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 922 transitions, 2251 flow [2021-06-10 11:47:32,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 922 transitions, 2246 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:32,598 INFO L241 Difference]: Finished difference. Result has 1023 places, 921 transitions, 2235 flow [2021-06-10 11:47:32,598 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=1023, PETRI_TRANSITIONS=921} [2021-06-10 11:47:32,598 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 40 predicate places. [2021-06-10 11:47:32,598 INFO L480 AbstractCegarLoop]: Abstraction has has 1023 places, 921 transitions, 2235 flow [2021-06-10 11:47:32,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:32,599 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:32,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2226 [2021-06-10 11:47:32,599 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1831496889, now seen corresponding path program 1 times [2021-06-10 11:47:32,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:32,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929107702] [2021-06-10 11:47:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:32,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:32,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:32,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:32,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:47:32,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929107702] [2021-06-10 11:47:32,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:32,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:32,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872669535] [2021-06-10 11:47:32,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:32,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:32,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:32,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:32,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:32,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 921 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:32,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:32,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:32,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:33,084 INFO L129 PetriNetUnfolder]: 51/1089 cut-off events. [2021-06-10 11:47:33,084 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:33,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 1089 events. 51/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4746 event pairs, 0 based on Foata normal form. 1/1003 useless extension candidates. Maximal degree in co-relation 1327. Up to 38 conditions per place. [2021-06-10 11:47:33,157 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/919 dead transitions. [2021-06-10 11:47:33,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 919 transitions, 2238 flow [2021-06-10 11:47:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:33,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:33,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:33,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:33,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:33,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:33,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,162 INFO L185 Difference]: Start difference. First operand has 1023 places, 921 transitions, 2235 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:33,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 919 transitions, 2238 flow [2021-06-10 11:47:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 919 transitions, 2231 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:33,172 INFO L241 Difference]: Finished difference. Result has 1023 places, 919 transitions, 2224 flow [2021-06-10 11:47:33,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2224, PETRI_PLACES=1023, PETRI_TRANSITIONS=919} [2021-06-10 11:47:33,172 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 40 predicate places. [2021-06-10 11:47:33,172 INFO L480 AbstractCegarLoop]: Abstraction has has 1023 places, 919 transitions, 2224 flow [2021-06-10 11:47:33,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:33,172 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:33,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2227 [2021-06-10 11:47:33,173 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1831497912, now seen corresponding path program 1 times [2021-06-10 11:47:33,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:33,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872725681] [2021-06-10 11:47:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:33,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:33,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:33,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:47:33,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872725681] [2021-06-10 11:47:33,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:33,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:33,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313106426] [2021-06-10 11:47:33,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:33,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:33,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:33,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:33,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 919 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:33,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:33,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:33,666 INFO L129 PetriNetUnfolder]: 51/1087 cut-off events. [2021-06-10 11:47:33,666 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:33,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1087 events. 51/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4731 event pairs, 0 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1327. Up to 38 conditions per place. [2021-06-10 11:47:33,740 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/917 dead transitions. [2021-06-10 11:47:33,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 917 transitions, 2237 flow [2021-06-10 11:47:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:33,742 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:33,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:33,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:33,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:33,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:33,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,745 INFO L185 Difference]: Start difference. First operand has 1023 places, 919 transitions, 2224 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 917 transitions, 2237 flow [2021-06-10 11:47:33,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 917 transitions, 2236 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:33,754 INFO L241 Difference]: Finished difference. Result has 1022 places, 917 transitions, 2220 flow [2021-06-10 11:47:33,754 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2220, PETRI_PLACES=1022, PETRI_TRANSITIONS=917} [2021-06-10 11:47:33,755 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 39 predicate places. [2021-06-10 11:47:33,755 INFO L480 AbstractCegarLoop]: Abstraction has has 1022 places, 917 transitions, 2220 flow [2021-06-10 11:47:33,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:33,755 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:33,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2228 [2021-06-10 11:47:33,755 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:33,755 INFO L82 PathProgramCache]: Analyzing trace with hash 567435552, now seen corresponding path program 1 times [2021-06-10 11:47:33,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:33,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161765206] [2021-06-10 11:47:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:33,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:33,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:33,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:33,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:47:33,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161765206] [2021-06-10 11:47:33,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:33,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213207008] [2021-06-10 11:47:33,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:33,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:33,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:33,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 917 transitions, 2220 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:33,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:33,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:33,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:34,274 INFO L129 PetriNetUnfolder]: 50/1094 cut-off events. [2021-06-10 11:47:34,274 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:34,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 1094 events. 50/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4787 event pairs, 0 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1332. Up to 38 conditions per place. [2021-06-10 11:47:34,324 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/918 dead transitions. [2021-06-10 11:47:34,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 918 transitions, 2236 flow [2021-06-10 11:47:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:34,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:34,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:34,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:34,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:34,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:34,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,329 INFO L185 Difference]: Start difference. First operand has 1022 places, 917 transitions, 2220 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:34,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 918 transitions, 2236 flow [2021-06-10 11:47:34,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 918 transitions, 2235 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:34,338 INFO L241 Difference]: Finished difference. Result has 1024 places, 917 transitions, 2224 flow [2021-06-10 11:47:34,338 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2224, PETRI_PLACES=1024, PETRI_TRANSITIONS=917} [2021-06-10 11:47:34,338 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 41 predicate places. [2021-06-10 11:47:34,338 INFO L480 AbstractCegarLoop]: Abstraction has has 1024 places, 917 transitions, 2224 flow [2021-06-10 11:47:34,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:34,339 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:34,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2229 [2021-06-10 11:47:34,339 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 567436575, now seen corresponding path program 1 times [2021-06-10 11:47:34,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:34,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563599625] [2021-06-10 11:47:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:34,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:34,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:34,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:47:34,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563599625] [2021-06-10 11:47:34,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:34,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:34,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357222639] [2021-06-10 11:47:34,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:34,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:34,368 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:34,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 917 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:34,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:34,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:34,838 INFO L129 PetriNetUnfolder]: 48/1096 cut-off events. [2021-06-10 11:47:34,838 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:34,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1096 events. 48/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4825 event pairs, 0 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1343. Up to 38 conditions per place. [2021-06-10 11:47:34,914 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/918 dead transitions. [2021-06-10 11:47:34,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 918 transitions, 2250 flow [2021-06-10 11:47:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:34,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:34,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:34,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:34,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:34,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:34,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,919 INFO L185 Difference]: Start difference. First operand has 1024 places, 917 transitions, 2224 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:34,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 918 transitions, 2250 flow [2021-06-10 11:47:34,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 918 transitions, 2249 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:34,929 INFO L241 Difference]: Finished difference. Result has 1027 places, 918 transitions, 2241 flow [2021-06-10 11:47:34,929 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2241, PETRI_PLACES=1027, PETRI_TRANSITIONS=918} [2021-06-10 11:47:34,929 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 44 predicate places. [2021-06-10 11:47:34,929 INFO L480 AbstractCegarLoop]: Abstraction has has 1027 places, 918 transitions, 2241 flow [2021-06-10 11:47:34,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:34,930 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:34,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2230 [2021-06-10 11:47:34,930 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 566483263, now seen corresponding path program 1 times [2021-06-10 11:47:34,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:34,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427271834] [2021-06-10 11:47:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:34,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:34,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:34,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:34,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:47:34,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427271834] [2021-06-10 11:47:34,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:34,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:34,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043485242] [2021-06-10 11:47:34,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:34,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:34,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:34,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 918 transitions, 2241 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:34,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:34,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:34,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:35,417 INFO L129 PetriNetUnfolder]: 48/1089 cut-off events. [2021-06-10 11:47:35,417 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:35,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 1089 events. 48/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4759 event pairs, 0 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 1329. Up to 38 conditions per place. [2021-06-10 11:47:35,493 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/916 dead transitions. [2021-06-10 11:47:35,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 916 transitions, 2243 flow [2021-06-10 11:47:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:35,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:35,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:35,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:35,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:35,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:35,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:35,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:35,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:35,498 INFO L185 Difference]: Start difference. First operand has 1027 places, 918 transitions, 2241 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:35,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 916 transitions, 2243 flow [2021-06-10 11:47:35,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 916 transitions, 2235 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:35,508 INFO L241 Difference]: Finished difference. Result has 1027 places, 916 transitions, 2228 flow [2021-06-10 11:47:35,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2228, PETRI_PLACES=1027, PETRI_TRANSITIONS=916} [2021-06-10 11:47:35,508 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 44 predicate places. [2021-06-10 11:47:35,508 INFO L480 AbstractCegarLoop]: Abstraction has has 1027 places, 916 transitions, 2228 flow [2021-06-10 11:47:35,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:35,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:35,509 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:35,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2231 [2021-06-10 11:47:35,509 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 566482240, now seen corresponding path program 1 times [2021-06-10 11:47:35,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:35,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481718989] [2021-06-10 11:47:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:35,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:35,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:35,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:35,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:35,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:35,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:47:35,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481718989] [2021-06-10 11:47:35,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:35,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:35,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071412349] [2021-06-10 11:47:35,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:35,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:35,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:35,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:35,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 916 transitions, 2228 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:35,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:35,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:35,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:36,000 INFO L129 PetriNetUnfolder]: 48/1087 cut-off events. [2021-06-10 11:47:36,001 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:36,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1087 events. 48/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4749 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1333. Up to 38 conditions per place. [2021-06-10 11:47:36,075 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/914 dead transitions. [2021-06-10 11:47:36,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 914 transitions, 2241 flow [2021-06-10 11:47:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:36,076 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:36,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:36,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:36,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:36,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:36,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,080 INFO L185 Difference]: Start difference. First operand has 1027 places, 916 transitions, 2228 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 914 transitions, 2241 flow [2021-06-10 11:47:36,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 914 transitions, 2240 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:36,090 INFO L241 Difference]: Finished difference. Result has 1026 places, 914 transitions, 2224 flow [2021-06-10 11:47:36,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2224, PETRI_PLACES=1026, PETRI_TRANSITIONS=914} [2021-06-10 11:47:36,090 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 43 predicate places. [2021-06-10 11:47:36,090 INFO L480 AbstractCegarLoop]: Abstraction has has 1026 places, 914 transitions, 2224 flow [2021-06-10 11:47:36,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:36,091 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:36,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2232 [2021-06-10 11:47:36,091 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1677301703, now seen corresponding path program 1 times [2021-06-10 11:47:36,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:36,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870724405] [2021-06-10 11:47:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:36,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:36,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:36,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:47:36,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870724405] [2021-06-10 11:47:36,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:36,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:36,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500589412] [2021-06-10 11:47:36,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:36,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:36,121 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:36,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 914 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:36,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:36,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:36,578 INFO L129 PetriNetUnfolder]: 47/1095 cut-off events. [2021-06-10 11:47:36,578 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:36,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 1095 events. 47/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4819 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1345. Up to 38 conditions per place. [2021-06-10 11:47:36,645 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/916 dead transitions. [2021-06-10 11:47:36,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 916 transitions, 2254 flow [2021-06-10 11:47:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:36,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:36,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:36,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:36,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:36,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,649 INFO L185 Difference]: Start difference. First operand has 1026 places, 914 transitions, 2224 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:36,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 916 transitions, 2254 flow [2021-06-10 11:47:36,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 916 transitions, 2253 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:36,658 INFO L241 Difference]: Finished difference. Result has 1029 places, 916 transitions, 2247 flow [2021-06-10 11:47:36,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2247, PETRI_PLACES=1029, PETRI_TRANSITIONS=916} [2021-06-10 11:47:36,659 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 46 predicate places. [2021-06-10 11:47:36,659 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 916 transitions, 2247 flow [2021-06-10 11:47:36,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:36,659 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:36,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2233 [2021-06-10 11:47:36,659 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1677300680, now seen corresponding path program 1 times [2021-06-10 11:47:36,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:36,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787656469] [2021-06-10 11:47:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:36,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:36,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:36,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:36,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:47:36,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787656469] [2021-06-10 11:47:36,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:36,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:36,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149020105] [2021-06-10 11:47:36,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:36,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:36,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:36,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:36,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 916 transitions, 2247 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:36,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:36,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:36,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:37,149 INFO L129 PetriNetUnfolder]: 46/1093 cut-off events. [2021-06-10 11:47:37,150 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:37,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1093 events. 46/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4809 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1342. Up to 38 conditions per place. [2021-06-10 11:47:37,224 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/916 dead transitions. [2021-06-10 11:47:37,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 916 transitions, 2259 flow [2021-06-10 11:47:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:37,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:37,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:37,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:37,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:37,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:37,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,229 INFO L185 Difference]: Start difference. First operand has 1029 places, 916 transitions, 2247 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:37,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 916 transitions, 2259 flow [2021-06-10 11:47:37,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 916 transitions, 2254 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:37,238 INFO L241 Difference]: Finished difference. Result has 1032 places, 916 transitions, 2252 flow [2021-06-10 11:47:37,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=1032, PETRI_TRANSITIONS=916} [2021-06-10 11:47:37,239 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 49 predicate places. [2021-06-10 11:47:37,239 INFO L480 AbstractCegarLoop]: Abstraction has has 1032 places, 916 transitions, 2252 flow [2021-06-10 11:47:37,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:37,239 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:37,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2234 [2021-06-10 11:47:37,239 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1676348391, now seen corresponding path program 1 times [2021-06-10 11:47:37,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:37,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809149298] [2021-06-10 11:47:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:37,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:37,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:37,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:47:37,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809149298] [2021-06-10 11:47:37,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:37,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:37,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484117673] [2021-06-10 11:47:37,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:37,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:37,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:37,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 916 transitions, 2252 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:37,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:37,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:37,742 INFO L129 PetriNetUnfolder]: 45/1089 cut-off events. [2021-06-10 11:47:37,742 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:47:37,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1089 events. 45/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4783 event pairs, 0 based on Foata normal form. 1/1009 useless extension candidates. Maximal degree in co-relation 1339. Up to 38 conditions per place. [2021-06-10 11:47:37,817 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/913 dead transitions. [2021-06-10 11:47:37,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 913 transitions, 2249 flow [2021-06-10 11:47:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:37,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:37,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:37,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:37,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:37,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:37,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,821 INFO L185 Difference]: Start difference. First operand has 1032 places, 916 transitions, 2252 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:37,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 913 transitions, 2249 flow [2021-06-10 11:47:37,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 913 transitions, 2242 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:37,831 INFO L241 Difference]: Finished difference. Result has 1031 places, 913 transitions, 2232 flow [2021-06-10 11:47:37,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2232, PETRI_PLACES=1031, PETRI_TRANSITIONS=913} [2021-06-10 11:47:37,832 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 48 predicate places. [2021-06-10 11:47:37,832 INFO L480 AbstractCegarLoop]: Abstraction has has 1031 places, 913 transitions, 2232 flow [2021-06-10 11:47:37,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,832 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:37,832 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:37,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2235 [2021-06-10 11:47:37,832 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1676347368, now seen corresponding path program 1 times [2021-06-10 11:47:37,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:37,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714564479] [2021-06-10 11:47:37,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:37,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:37,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:37,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:37,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:47:37,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714564479] [2021-06-10 11:47:37,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:37,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:37,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340036946] [2021-06-10 11:47:37,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:37,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:37,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:37,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 913 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:37,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:37,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:37,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:38,373 INFO L129 PetriNetUnfolder]: 45/1087 cut-off events. [2021-06-10 11:47:38,373 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:38,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1087 events. 45/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4767 event pairs, 0 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1340. Up to 38 conditions per place. [2021-06-10 11:47:38,418 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/911 dead transitions. [2021-06-10 11:47:38,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 911 transitions, 2245 flow [2021-06-10 11:47:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:38,419 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:38,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:38,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:38,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:38,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:38,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:38,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:38,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:38,422 INFO L185 Difference]: Start difference. First operand has 1031 places, 913 transitions, 2232 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 911 transitions, 2245 flow [2021-06-10 11:47:38,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 911 transitions, 2244 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:38,431 INFO L241 Difference]: Finished difference. Result has 1030 places, 911 transitions, 2228 flow [2021-06-10 11:47:38,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2228, PETRI_PLACES=1030, PETRI_TRANSITIONS=911} [2021-06-10 11:47:38,431 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 47 predicate places. [2021-06-10 11:47:38,431 INFO L480 AbstractCegarLoop]: Abstraction has has 1030 places, 911 transitions, 2228 flow [2021-06-10 11:47:38,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:38,432 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:38,432 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:38,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2236 [2021-06-10 11:47:38,432 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1432241810, now seen corresponding path program 1 times [2021-06-10 11:47:38,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:38,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907961680] [2021-06-10 11:47:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:38,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:38,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:38,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:38,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:38,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:38,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:47:38,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907961680] [2021-06-10 11:47:38,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:38,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:38,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097231193] [2021-06-10 11:47:38,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:38,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:38,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:38,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 911 transitions, 2228 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:38,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:38,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:38,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:38,932 INFO L129 PetriNetUnfolder]: 44/1095 cut-off events. [2021-06-10 11:47:38,932 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:38,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1095 events. 44/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4835 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1352. Up to 38 conditions per place. [2021-06-10 11:47:39,006 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/913 dead transitions. [2021-06-10 11:47:39,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 913 transitions, 2258 flow [2021-06-10 11:47:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:39,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:39,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:39,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:39,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:39,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:39,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,011 INFO L185 Difference]: Start difference. First operand has 1030 places, 911 transitions, 2228 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:39,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 913 transitions, 2258 flow [2021-06-10 11:47:39,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 913 transitions, 2257 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:39,020 INFO L241 Difference]: Finished difference. Result has 1033 places, 913 transitions, 2251 flow [2021-06-10 11:47:39,021 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2227, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2251, PETRI_PLACES=1033, PETRI_TRANSITIONS=913} [2021-06-10 11:47:39,021 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 50 predicate places. [2021-06-10 11:47:39,021 INFO L480 AbstractCegarLoop]: Abstraction has has 1033 places, 913 transitions, 2251 flow [2021-06-10 11:47:39,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:39,021 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:39,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2237 [2021-06-10 11:47:39,021 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1432240787, now seen corresponding path program 1 times [2021-06-10 11:47:39,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:39,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272351123] [2021-06-10 11:47:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:39,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:39,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:39,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:47:39,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272351123] [2021-06-10 11:47:39,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:39,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:39,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398076615] [2021-06-10 11:47:39,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:39,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:39,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:39,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:39,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 913 transitions, 2251 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:39,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:39,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:39,513 INFO L129 PetriNetUnfolder]: 42/1096 cut-off events. [2021-06-10 11:47:39,513 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:39,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1096 events. 42/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4856 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1352. Up to 38 conditions per place. [2021-06-10 11:47:39,586 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/913 dead transitions. [2021-06-10 11:47:39,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 913 transitions, 2263 flow [2021-06-10 11:47:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:39,587 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:39,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:39,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:39,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:39,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:39,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,590 INFO L185 Difference]: Start difference. First operand has 1033 places, 913 transitions, 2251 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:39,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 913 transitions, 2263 flow [2021-06-10 11:47:39,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1034 places, 913 transitions, 2258 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:39,600 INFO L241 Difference]: Finished difference. Result has 1035 places, 912 transitions, 2247 flow [2021-06-10 11:47:39,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=1032, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2247, PETRI_PLACES=1035, PETRI_TRANSITIONS=912} [2021-06-10 11:47:39,601 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 52 predicate places. [2021-06-10 11:47:39,601 INFO L480 AbstractCegarLoop]: Abstraction has has 1035 places, 912 transitions, 2247 flow [2021-06-10 11:47:39,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:39,601 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:39,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2238 [2021-06-10 11:47:39,601 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1431288498, now seen corresponding path program 1 times [2021-06-10 11:47:39,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:39,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523923379] [2021-06-10 11:47:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:39,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:39,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:39,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:39,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:47:39,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523923379] [2021-06-10 11:47:39,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:39,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:39,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660926727] [2021-06-10 11:47:39,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:39,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:39,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:39,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:39,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 912 transitions, 2247 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:39,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:39,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:39,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:40,092 INFO L129 PetriNetUnfolder]: 42/1089 cut-off events. [2021-06-10 11:47:40,093 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:40,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1089 events. 42/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4794 event pairs, 0 based on Foata normal form. 1/1012 useless extension candidates. Maximal degree in co-relation 1346. Up to 38 conditions per place. [2021-06-10 11:47:40,165 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/910 dead transitions. [2021-06-10 11:47:40,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 910 transitions, 2250 flow [2021-06-10 11:47:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:40,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:40,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:40,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:40,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:40,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:40,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,170 INFO L185 Difference]: Start difference. First operand has 1035 places, 912 transitions, 2247 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:40,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 910 transitions, 2250 flow [2021-06-10 11:47:40,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1034 places, 910 transitions, 2243 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:40,180 INFO L241 Difference]: Finished difference. Result has 1035 places, 910 transitions, 2236 flow [2021-06-10 11:47:40,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=1032, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2236, PETRI_PLACES=1035, PETRI_TRANSITIONS=910} [2021-06-10 11:47:40,180 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 52 predicate places. [2021-06-10 11:47:40,180 INFO L480 AbstractCegarLoop]: Abstraction has has 1035 places, 910 transitions, 2236 flow [2021-06-10 11:47:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:40,181 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:40,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2239 [2021-06-10 11:47:40,181 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1431287475, now seen corresponding path program 1 times [2021-06-10 11:47:40,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:40,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375579649] [2021-06-10 11:47:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:40,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:40,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:40,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:47:40,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375579649] [2021-06-10 11:47:40,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:40,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:40,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026377168] [2021-06-10 11:47:40,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:40,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:40,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:40,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:40,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 910 transitions, 2236 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:40,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:40,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:40,658 INFO L129 PetriNetUnfolder]: 42/1087 cut-off events. [2021-06-10 11:47:40,658 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:40,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1087 events. 42/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4783 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1346. Up to 38 conditions per place. [2021-06-10 11:47:40,722 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/908 dead transitions. [2021-06-10 11:47:40,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 908 transitions, 2249 flow [2021-06-10 11:47:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:40,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:40,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:40,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:40,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:40,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:40,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,726 INFO L185 Difference]: Start difference. First operand has 1035 places, 910 transitions, 2236 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:40,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 908 transitions, 2249 flow [2021-06-10 11:47:40,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1034 places, 908 transitions, 2248 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:40,735 INFO L241 Difference]: Finished difference. Result has 1034 places, 908 transitions, 2232 flow [2021-06-10 11:47:40,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=1032, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2232, PETRI_PLACES=1034, PETRI_TRANSITIONS=908} [2021-06-10 11:47:40,736 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 51 predicate places. [2021-06-10 11:47:40,736 INFO L480 AbstractCegarLoop]: Abstraction has has 1034 places, 908 transitions, 2232 flow [2021-06-10 11:47:40,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:40,736 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:40,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2240 [2021-06-10 11:47:40,736 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -110462707, now seen corresponding path program 1 times [2021-06-10 11:47:40,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:40,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044773941] [2021-06-10 11:47:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:40,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:40,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:40,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:40,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:47:40,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044773941] [2021-06-10 11:47:40,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:40,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:40,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488082113] [2021-06-10 11:47:40,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:40,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:40,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:40,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1034 places, 908 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:40,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:40,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:40,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:41,242 INFO L129 PetriNetUnfolder]: 41/1095 cut-off events. [2021-06-10 11:47:41,242 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:41,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 1095 events. 41/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4852 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1358. Up to 38 conditions per place. [2021-06-10 11:47:41,315 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/910 dead transitions. [2021-06-10 11:47:41,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 910 transitions, 2262 flow [2021-06-10 11:47:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:41,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:41,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:41,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:41,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:41,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:41,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,319 INFO L185 Difference]: Start difference. First operand has 1034 places, 908 transitions, 2232 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:41,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 910 transitions, 2262 flow [2021-06-10 11:47:41,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1035 places, 910 transitions, 2261 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:41,329 INFO L241 Difference]: Finished difference. Result has 1037 places, 910 transitions, 2255 flow [2021-06-10 11:47:41,330 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=1033, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2255, PETRI_PLACES=1037, PETRI_TRANSITIONS=910} [2021-06-10 11:47:41,330 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 54 predicate places. [2021-06-10 11:47:41,330 INFO L480 AbstractCegarLoop]: Abstraction has has 1037 places, 910 transitions, 2255 flow [2021-06-10 11:47:41,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:41,330 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:41,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2241 [2021-06-10 11:47:41,330 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -110463730, now seen corresponding path program 1 times [2021-06-10 11:47:41,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:41,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882974093] [2021-06-10 11:47:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:41,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:41,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:41,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:47:41,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882974093] [2021-06-10 11:47:41,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:41,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:41,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743614385] [2021-06-10 11:47:41,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:41,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:41,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:41,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 910 transitions, 2255 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:41,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:41,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:41,843 INFO L129 PetriNetUnfolder]: 39/1096 cut-off events. [2021-06-10 11:47:41,843 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:41,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 1096 events. 39/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4876 event pairs, 0 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1358. Up to 38 conditions per place. [2021-06-10 11:47:41,916 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/910 dead transitions. [2021-06-10 11:47:41,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 910 transitions, 2267 flow [2021-06-10 11:47:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:41,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:41,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:41,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:41,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:41,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,920 INFO L185 Difference]: Start difference. First operand has 1037 places, 910 transitions, 2255 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 910 transitions, 2267 flow [2021-06-10 11:47:41,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 910 transitions, 2262 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:41,930 INFO L241 Difference]: Finished difference. Result has 1039 places, 909 transitions, 2251 flow [2021-06-10 11:47:41,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2251, PETRI_PLACES=1039, PETRI_TRANSITIONS=909} [2021-06-10 11:47:41,931 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 56 predicate places. [2021-06-10 11:47:41,931 INFO L480 AbstractCegarLoop]: Abstraction has has 1039 places, 909 transitions, 2251 flow [2021-06-10 11:47:41,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,931 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:41,931 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:41,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2242 [2021-06-10 11:47:41,931 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash -111416019, now seen corresponding path program 1 times [2021-06-10 11:47:41,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:41,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515402330] [2021-06-10 11:47:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:41,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:41,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:41,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:41,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:47:41,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515402330] [2021-06-10 11:47:41,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:41,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:41,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119181453] [2021-06-10 11:47:41,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:41,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:41,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:41,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 909 transitions, 2251 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:41,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:41,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:41,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:42,465 INFO L129 PetriNetUnfolder]: 39/1089 cut-off events. [2021-06-10 11:47:42,465 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:42,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1089 events. 39/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4816 event pairs, 0 based on Foata normal form. 1/1015 useless extension candidates. Maximal degree in co-relation 1352. Up to 38 conditions per place. [2021-06-10 11:47:42,512 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/907 dead transitions. [2021-06-10 11:47:42,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 907 transitions, 2254 flow [2021-06-10 11:47:42,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:42,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:42,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:42,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:42,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:42,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:42,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:42,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:42,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:42,516 INFO L185 Difference]: Start difference. First operand has 1039 places, 909 transitions, 2251 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:42,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 907 transitions, 2254 flow [2021-06-10 11:47:42,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 907 transitions, 2247 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:42,525 INFO L241 Difference]: Finished difference. Result has 1039 places, 907 transitions, 2240 flow [2021-06-10 11:47:42,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2240, PETRI_PLACES=1039, PETRI_TRANSITIONS=907} [2021-06-10 11:47:42,525 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 56 predicate places. [2021-06-10 11:47:42,525 INFO L480 AbstractCegarLoop]: Abstraction has has 1039 places, 907 transitions, 2240 flow [2021-06-10 11:47:42,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:42,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:42,526 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:42,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2243 [2021-06-10 11:47:42,526 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash -111417042, now seen corresponding path program 1 times [2021-06-10 11:47:42,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:42,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933237966] [2021-06-10 11:47:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:42,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:42,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:42,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:42,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:42,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:42,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:47:42,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933237966] [2021-06-10 11:47:42,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:42,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:42,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541318431] [2021-06-10 11:47:42,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:42,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:42,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:42,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 907 transitions, 2240 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:42,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:42,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:42,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:43,029 INFO L129 PetriNetUnfolder]: 39/1087 cut-off events. [2021-06-10 11:47:43,029 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:43,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1087 events. 39/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4798 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1352. Up to 38 conditions per place. [2021-06-10 11:47:43,101 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/905 dead transitions. [2021-06-10 11:47:43,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 905 transitions, 2253 flow [2021-06-10 11:47:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:43,103 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:43,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:43,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:43,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:43,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:43,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,106 INFO L185 Difference]: Start difference. First operand has 1039 places, 907 transitions, 2240 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:43,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 905 transitions, 2253 flow [2021-06-10 11:47:43,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 905 transitions, 2252 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:43,116 INFO L241 Difference]: Finished difference. Result has 1038 places, 905 transitions, 2236 flow [2021-06-10 11:47:43,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2236, PETRI_PLACES=1038, PETRI_TRANSITIONS=905} [2021-06-10 11:47:43,116 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 55 predicate places. [2021-06-10 11:47:43,116 INFO L480 AbstractCegarLoop]: Abstraction has has 1038 places, 905 transitions, 2236 flow [2021-06-10 11:47:43,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:43,117 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:43,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2244 [2021-06-10 11:47:43,117 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1517774039, now seen corresponding path program 1 times [2021-06-10 11:47:43,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:43,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578298830] [2021-06-10 11:47:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:43,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:43,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:43,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:47:43,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578298830] [2021-06-10 11:47:43,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:43,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:43,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136933586] [2021-06-10 11:47:43,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:43,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:43,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:43,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:43,147 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:43,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 905 transitions, 2236 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:43,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:43,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:43,621 INFO L129 PetriNetUnfolder]: 37/1092 cut-off events. [2021-06-10 11:47:43,621 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:43,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1092 events. 37/1092 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4849 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1355. Up to 38 conditions per place. [2021-06-10 11:47:43,697 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/906 dead transitions. [2021-06-10 11:47:43,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 906 transitions, 2252 flow [2021-06-10 11:47:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:43,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:43,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:43,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:43,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:43,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:43,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,702 INFO L185 Difference]: Start difference. First operand has 1038 places, 905 transitions, 2236 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 906 transitions, 2252 flow [2021-06-10 11:47:43,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 906 transitions, 2251 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:43,712 INFO L241 Difference]: Finished difference. Result has 1041 places, 906 transitions, 2249 flow [2021-06-10 11:47:43,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2249, PETRI_PLACES=1041, PETRI_TRANSITIONS=906} [2021-06-10 11:47:43,712 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 58 predicate places. [2021-06-10 11:47:43,712 INFO L480 AbstractCegarLoop]: Abstraction has has 1041 places, 906 transitions, 2249 flow [2021-06-10 11:47:43,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:43,713 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:43,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2245 [2021-06-10 11:47:43,713 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1517775062, now seen corresponding path program 1 times [2021-06-10 11:47:43,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:43,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700291146] [2021-06-10 11:47:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:43,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:43,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:43,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:43,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:47:43,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700291146] [2021-06-10 11:47:43,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:43,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:43,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133548340] [2021-06-10 11:47:43,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:43,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:43,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:43,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 906 transitions, 2249 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:43,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:43,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:43,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:44,228 INFO L129 PetriNetUnfolder]: 37/1093 cut-off events. [2021-06-10 11:47:44,229 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:47:44,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1093 events. 37/1093 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4857 event pairs, 0 based on Foata normal form. 0/1018 useless extension candidates. Maximal degree in co-relation 1363. Up to 38 conditions per place. [2021-06-10 11:47:44,301 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/907 dead transitions. [2021-06-10 11:47:44,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 907 transitions, 2275 flow [2021-06-10 11:47:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:44,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:44,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:44,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:44,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:44,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:44,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,306 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,306 INFO L185 Difference]: Start difference. First operand has 1041 places, 906 transitions, 2249 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:44,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 907 transitions, 2275 flow [2021-06-10 11:47:44,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 907 transitions, 2273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:44,316 INFO L241 Difference]: Finished difference. Result has 1044 places, 907 transitions, 2265 flow [2021-06-10 11:47:44,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2265, PETRI_PLACES=1044, PETRI_TRANSITIONS=907} [2021-06-10 11:47:44,316 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 61 predicate places. [2021-06-10 11:47:44,316 INFO L480 AbstractCegarLoop]: Abstraction has has 1044 places, 907 transitions, 2265 flow [2021-06-10 11:47:44,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:44,317 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:44,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2246 [2021-06-10 11:47:44,317 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1516821750, now seen corresponding path program 1 times [2021-06-10 11:47:44,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:44,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066028590] [2021-06-10 11:47:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:44,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:44,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:44,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:47:44,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066028590] [2021-06-10 11:47:44,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:44,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:44,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75723680] [2021-06-10 11:47:44,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:44,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:44,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:44,347 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:44,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 907 transitions, 2265 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:44,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:44,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:44,794 INFO L129 PetriNetUnfolder]: 36/1089 cut-off events. [2021-06-10 11:47:44,794 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:44,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1089 events. 36/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4832 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1356. Up to 38 conditions per place. [2021-06-10 11:47:44,860 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/904 dead transitions. [2021-06-10 11:47:44,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 904 transitions, 2262 flow [2021-06-10 11:47:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:44,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:44,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:44,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:44,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:44,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:44,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,864 INFO L185 Difference]: Start difference. First operand has 1044 places, 907 transitions, 2265 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 904 transitions, 2262 flow [2021-06-10 11:47:44,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 904 transitions, 2254 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:44,874 INFO L241 Difference]: Finished difference. Result has 1043 places, 904 transitions, 2244 flow [2021-06-10 11:47:44,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2244, PETRI_PLACES=1043, PETRI_TRANSITIONS=904} [2021-06-10 11:47:44,874 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 60 predicate places. [2021-06-10 11:47:44,874 INFO L480 AbstractCegarLoop]: Abstraction has has 1043 places, 904 transitions, 2244 flow [2021-06-10 11:47:44,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:44,874 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:44,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2247 [2021-06-10 11:47:44,875 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1516820727, now seen corresponding path program 1 times [2021-06-10 11:47:44,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:44,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506889139] [2021-06-10 11:47:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:44,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:44,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:44,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:44,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:47:44,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506889139] [2021-06-10 11:47:44,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:44,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:44,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966860805] [2021-06-10 11:47:44,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:44,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:44,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:44,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 904 transitions, 2244 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:44,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:44,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:44,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:45,380 INFO L129 PetriNetUnfolder]: 36/1087 cut-off events. [2021-06-10 11:47:45,380 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:45,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1087 events. 36/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4815 event pairs, 0 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1359. Up to 38 conditions per place. [2021-06-10 11:47:45,452 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/902 dead transitions. [2021-06-10 11:47:45,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 902 transitions, 2257 flow [2021-06-10 11:47:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:45,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:45,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:45,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:45,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:45,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:45,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:45,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:45,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:45,456 INFO L185 Difference]: Start difference. First operand has 1043 places, 904 transitions, 2244 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:45,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 902 transitions, 2257 flow [2021-06-10 11:47:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 902 transitions, 2256 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:45,466 INFO L241 Difference]: Finished difference. Result has 1042 places, 902 transitions, 2240 flow [2021-06-10 11:47:45,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2240, PETRI_PLACES=1042, PETRI_TRANSITIONS=902} [2021-06-10 11:47:45,466 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 59 predicate places. [2021-06-10 11:47:45,466 INFO L480 AbstractCegarLoop]: Abstraction has has 1042 places, 902 transitions, 2240 flow [2021-06-10 11:47:45,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:45,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:45,466 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:45,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2248 [2021-06-10 11:47:45,467 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash 323301894, now seen corresponding path program 1 times [2021-06-10 11:47:45,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:45,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998371646] [2021-06-10 11:47:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:45,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:45,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:45,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:45,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:45,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:45,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:47:45,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998371646] [2021-06-10 11:47:45,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:45,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:45,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15828178] [2021-06-10 11:47:45,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:45,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:45,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:45,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 902 transitions, 2240 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:45,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:45,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:45,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:45,983 INFO L129 PetriNetUnfolder]: 35/1095 cut-off events. [2021-06-10 11:47:45,984 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:46,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1095 events. 35/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4885 event pairs, 0 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1371. Up to 38 conditions per place. [2021-06-10 11:47:46,056 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/904 dead transitions. [2021-06-10 11:47:46,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 904 transitions, 2270 flow [2021-06-10 11:47:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:46,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:46,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:46,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:46,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:46,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:46,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,061 INFO L185 Difference]: Start difference. First operand has 1042 places, 902 transitions, 2240 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:46,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 904 transitions, 2270 flow [2021-06-10 11:47:46,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 904 transitions, 2269 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:46,071 INFO L241 Difference]: Finished difference. Result has 1045 places, 904 transitions, 2263 flow [2021-06-10 11:47:46,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=899, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2263, PETRI_PLACES=1045, PETRI_TRANSITIONS=904} [2021-06-10 11:47:46,071 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 62 predicate places. [2021-06-10 11:47:46,071 INFO L480 AbstractCegarLoop]: Abstraction has has 1045 places, 904 transitions, 2263 flow [2021-06-10 11:47:46,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:46,071 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:46,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2249 [2021-06-10 11:47:46,071 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash 323300871, now seen corresponding path program 1 times [2021-06-10 11:47:46,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:46,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053460387] [2021-06-10 11:47:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:46,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:46,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:46,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:47:46,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053460387] [2021-06-10 11:47:46,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:46,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:46,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650351720] [2021-06-10 11:47:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:46,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:46,102 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:46,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 904 transitions, 2263 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:46,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:46,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:46,610 INFO L129 PetriNetUnfolder]: 33/1096 cut-off events. [2021-06-10 11:47:46,610 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:46,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1096 events. 33/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4910 event pairs, 0 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1371. Up to 38 conditions per place. [2021-06-10 11:47:46,661 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/904 dead transitions. [2021-06-10 11:47:46,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 904 transitions, 2275 flow [2021-06-10 11:47:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:46,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:46,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:46,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:46,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,666 INFO L185 Difference]: Start difference. First operand has 1045 places, 904 transitions, 2263 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:46,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 904 transitions, 2275 flow [2021-06-10 11:47:46,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 904 transitions, 2270 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:46,675 INFO L241 Difference]: Finished difference. Result has 1047 places, 903 transitions, 2259 flow [2021-06-10 11:47:46,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2259, PETRI_PLACES=1047, PETRI_TRANSITIONS=903} [2021-06-10 11:47:46,675 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 64 predicate places. [2021-06-10 11:47:46,675 INFO L480 AbstractCegarLoop]: Abstraction has has 1047 places, 903 transitions, 2259 flow [2021-06-10 11:47:46,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:46,676 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:46,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2250 [2021-06-10 11:47:46,676 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash 322348582, now seen corresponding path program 1 times [2021-06-10 11:47:46,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:46,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968848875] [2021-06-10 11:47:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:46,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:46,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:46,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:46,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:47:46,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968848875] [2021-06-10 11:47:46,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:46,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:46,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568127809] [2021-06-10 11:47:46,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:46,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:46,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:46,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 903 transitions, 2259 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:46,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:46,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:46,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:47,178 INFO L129 PetriNetUnfolder]: 33/1089 cut-off events. [2021-06-10 11:47:47,178 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:47,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1089 events. 33/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4852 event pairs, 0 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 1365. Up to 38 conditions per place. [2021-06-10 11:47:47,250 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/901 dead transitions. [2021-06-10 11:47:47,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 901 transitions, 2262 flow [2021-06-10 11:47:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:47,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:47,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:47,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:47,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:47,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:47,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,254 INFO L185 Difference]: Start difference. First operand has 1047 places, 903 transitions, 2259 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:47,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 901 transitions, 2262 flow [2021-06-10 11:47:47,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 901 transitions, 2255 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:47,264 INFO L241 Difference]: Finished difference. Result has 1047 places, 901 transitions, 2248 flow [2021-06-10 11:47:47,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2243, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=1047, PETRI_TRANSITIONS=901} [2021-06-10 11:47:47,264 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 64 predicate places. [2021-06-10 11:47:47,264 INFO L480 AbstractCegarLoop]: Abstraction has has 1047 places, 901 transitions, 2248 flow [2021-06-10 11:47:47,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,265 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:47,265 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:47,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2251 [2021-06-10 11:47:47,265 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 322347559, now seen corresponding path program 1 times [2021-06-10 11:47:47,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:47,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391044747] [2021-06-10 11:47:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:47,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:47,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:47,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:47:47,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391044747] [2021-06-10 11:47:47,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:47,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:47,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79432502] [2021-06-10 11:47:47,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:47,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:47,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:47,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:47,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 901 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:47,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:47,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:47,776 INFO L129 PetriNetUnfolder]: 33/1087 cut-off events. [2021-06-10 11:47:47,776 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:47,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 1087 events. 33/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4837 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1365. Up to 38 conditions per place. [2021-06-10 11:47:47,849 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/899 dead transitions. [2021-06-10 11:47:47,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 899 transitions, 2261 flow [2021-06-10 11:47:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:47,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:47,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:47,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:47,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:47,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:47,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,853 INFO L185 Difference]: Start difference. First operand has 1047 places, 901 transitions, 2248 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 899 transitions, 2261 flow [2021-06-10 11:47:47,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 899 transitions, 2260 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:47,863 INFO L241 Difference]: Finished difference. Result has 1046 places, 899 transitions, 2244 flow [2021-06-10 11:47:47,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2244, PETRI_PLACES=1046, PETRI_TRANSITIONS=899} [2021-06-10 11:47:47,864 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 63 predicate places. [2021-06-10 11:47:47,864 INFO L480 AbstractCegarLoop]: Abstraction has has 1046 places, 899 transitions, 2244 flow [2021-06-10 11:47:47,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:47,864 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:47,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2252 [2021-06-10 11:47:47,864 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -742395003, now seen corresponding path program 1 times [2021-06-10 11:47:47,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:47,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497200824] [2021-06-10 11:47:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:47,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:47,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:47,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:47,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:47:47,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497200824] [2021-06-10 11:47:47,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:47,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:47,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630238812] [2021-06-10 11:47:47,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:47,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:47,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:47,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 899 transitions, 2244 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:47,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:47,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:47,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:48,384 INFO L129 PetriNetUnfolder]: 32/1094 cut-off events. [2021-06-10 11:47:48,384 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:48,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1094 events. 32/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4893 event pairs, 0 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1370. Up to 38 conditions per place. [2021-06-10 11:47:48,456 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/900 dead transitions. [2021-06-10 11:47:48,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 900 transitions, 2260 flow [2021-06-10 11:47:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:48,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:48,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:48,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:48,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:48,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:48,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:48,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:48,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:48,461 INFO L185 Difference]: Start difference. First operand has 1046 places, 899 transitions, 2244 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:48,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1048 places, 900 transitions, 2260 flow [2021-06-10 11:47:48,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 900 transitions, 2259 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:48,472 INFO L241 Difference]: Finished difference. Result has 1048 places, 899 transitions, 2248 flow [2021-06-10 11:47:48,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2243, PETRI_DIFFERENCE_MINUEND_PLACES=1045, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=1048, PETRI_TRANSITIONS=899} [2021-06-10 11:47:48,472 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 65 predicate places. [2021-06-10 11:47:48,472 INFO L480 AbstractCegarLoop]: Abstraction has has 1048 places, 899 transitions, 2248 flow [2021-06-10 11:47:48,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:48,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:48,473 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:48,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2253 [2021-06-10 11:47:48,473 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash -742393980, now seen corresponding path program 1 times [2021-06-10 11:47:48,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:48,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242827689] [2021-06-10 11:47:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:48,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:48,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:48,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:48,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:48,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:48,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:47:48,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242827689] [2021-06-10 11:47:48,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:48,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:48,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550625995] [2021-06-10 11:47:48,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:48,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:48,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:48,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 899 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:48,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:48,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:48,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:48,992 INFO L129 PetriNetUnfolder]: 30/1096 cut-off events. [2021-06-10 11:47:48,992 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:49,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 1096 events. 30/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4929 event pairs, 0 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1381. Up to 38 conditions per place. [2021-06-10 11:47:49,063 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/900 dead transitions. [2021-06-10 11:47:49,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 900 transitions, 2274 flow [2021-06-10 11:47:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:49,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:49,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:49,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:49,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:49,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:49,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,068 INFO L185 Difference]: Start difference. First operand has 1048 places, 899 transitions, 2248 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:49,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 900 transitions, 2274 flow [2021-06-10 11:47:49,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 900 transitions, 2273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:49,078 INFO L241 Difference]: Finished difference. Result has 1051 places, 900 transitions, 2265 flow [2021-06-10 11:47:49,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2265, PETRI_PLACES=1051, PETRI_TRANSITIONS=900} [2021-06-10 11:47:49,078 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 68 predicate places. [2021-06-10 11:47:49,078 INFO L480 AbstractCegarLoop]: Abstraction has has 1051 places, 900 transitions, 2265 flow [2021-06-10 11:47:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:49,078 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:49,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2254 [2021-06-10 11:47:49,079 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash -743347292, now seen corresponding path program 1 times [2021-06-10 11:47:49,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:49,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030316689] [2021-06-10 11:47:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:49,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:49,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:49,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:47:49,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030316689] [2021-06-10 11:47:49,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:49,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:49,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562523357] [2021-06-10 11:47:49,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:49,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:49,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:49,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 900 transitions, 2265 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:49,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:49,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:49,586 INFO L129 PetriNetUnfolder]: 30/1089 cut-off events. [2021-06-10 11:47:49,586 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:49,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1089 events. 30/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4866 event pairs, 0 based on Foata normal form. 1/1024 useless extension candidates. Maximal degree in co-relation 1367. Up to 38 conditions per place. [2021-06-10 11:47:49,657 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/898 dead transitions. [2021-06-10 11:47:49,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 898 transitions, 2267 flow [2021-06-10 11:47:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:49,659 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:49,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:49,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:49,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:49,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:49,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,662 INFO L185 Difference]: Start difference. First operand has 1051 places, 900 transitions, 2265 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:49,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 898 transitions, 2267 flow [2021-06-10 11:47:49,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1050 places, 898 transitions, 2259 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:49,672 INFO L241 Difference]: Finished difference. Result has 1051 places, 898 transitions, 2252 flow [2021-06-10 11:47:49,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=1048, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=1051, PETRI_TRANSITIONS=898} [2021-06-10 11:47:49,672 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 68 predicate places. [2021-06-10 11:47:49,672 INFO L480 AbstractCegarLoop]: Abstraction has has 1051 places, 898 transitions, 2252 flow [2021-06-10 11:47:49,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:49,672 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:49,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2255 [2021-06-10 11:47:49,672 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash -743348315, now seen corresponding path program 1 times [2021-06-10 11:47:49,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:49,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911018619] [2021-06-10 11:47:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:49,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:49,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:49,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:49,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:47:49,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911018619] [2021-06-10 11:47:49,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:49,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:49,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830433908] [2021-06-10 11:47:49,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:49,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:49,703 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:49,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 898 transitions, 2252 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:49,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:49,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:49,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:50,185 INFO L129 PetriNetUnfolder]: 30/1087 cut-off events. [2021-06-10 11:47:50,186 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:50,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 1087 events. 30/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4850 event pairs, 0 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1371. Up to 38 conditions per place. [2021-06-10 11:47:50,256 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2021-06-10 11:47:50,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 896 transitions, 2265 flow [2021-06-10 11:47:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:50,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:50,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:50,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:50,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:50,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:50,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,260 INFO L185 Difference]: Start difference. First operand has 1051 places, 898 transitions, 2252 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:50,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1051 places, 896 transitions, 2265 flow [2021-06-10 11:47:50,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1050 places, 896 transitions, 2264 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:50,270 INFO L241 Difference]: Finished difference. Result has 1050 places, 896 transitions, 2248 flow [2021-06-10 11:47:50,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=1048, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=1050, PETRI_TRANSITIONS=896} [2021-06-10 11:47:50,271 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 67 predicate places. [2021-06-10 11:47:50,271 INFO L480 AbstractCegarLoop]: Abstraction has has 1050 places, 896 transitions, 2248 flow [2021-06-10 11:47:50,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:50,271 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:50,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2256 [2021-06-10 11:47:50,271 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash -405926397, now seen corresponding path program 1 times [2021-06-10 11:47:50,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:50,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720649914] [2021-06-10 11:47:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:50,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:50,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:50,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:47:50,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720649914] [2021-06-10 11:47:50,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:50,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:50,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236630261] [2021-06-10 11:47:50,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:50,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:50,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:50,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 896 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:50,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:50,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:50,787 INFO L129 PetriNetUnfolder]: 29/1095 cut-off events. [2021-06-10 11:47:50,787 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:50,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 1095 events. 29/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4923 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1383. Up to 38 conditions per place. [2021-06-10 11:47:50,841 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/898 dead transitions. [2021-06-10 11:47:50,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1052 places, 898 transitions, 2278 flow [2021-06-10 11:47:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:50,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:50,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:50,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:50,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:50,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:50,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,846 INFO L185 Difference]: Start difference. First operand has 1050 places, 896 transitions, 2248 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:50,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1052 places, 898 transitions, 2278 flow [2021-06-10 11:47:50,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1051 places, 898 transitions, 2277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:50,855 INFO L241 Difference]: Finished difference. Result has 1053 places, 898 transitions, 2271 flow [2021-06-10 11:47:50,855 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=1049, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2271, PETRI_PLACES=1053, PETRI_TRANSITIONS=898} [2021-06-10 11:47:50,855 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 70 predicate places. [2021-06-10 11:47:50,855 INFO L480 AbstractCegarLoop]: Abstraction has has 1053 places, 898 transitions, 2271 flow [2021-06-10 11:47:50,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,856 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:50,856 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:50,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2257 [2021-06-10 11:47:50,856 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -405927420, now seen corresponding path program 1 times [2021-06-10 11:47:50,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:50,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546351641] [2021-06-10 11:47:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:50,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:50,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:50,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:50,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:47:50,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546351641] [2021-06-10 11:47:50,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:50,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:50,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237634362] [2021-06-10 11:47:50,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:50,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:50,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:50,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1053 places, 898 transitions, 2271 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:50,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:50,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:50,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:51,374 INFO L129 PetriNetUnfolder]: 27/1096 cut-off events. [2021-06-10 11:47:51,375 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:51,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1096 events. 27/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4945 event pairs, 0 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 1383. Up to 38 conditions per place. [2021-06-10 11:47:51,447 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/898 dead transitions. [2021-06-10 11:47:51,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1055 places, 898 transitions, 2283 flow [2021-06-10 11:47:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:51,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:51,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:51,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:51,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:51,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:51,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:51,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:51,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:51,452 INFO L185 Difference]: Start difference. First operand has 1053 places, 898 transitions, 2271 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:51,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1055 places, 898 transitions, 2283 flow [2021-06-10 11:47:51,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1054 places, 898 transitions, 2278 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:51,462 INFO L241 Difference]: Finished difference. Result has 1055 places, 897 transitions, 2267 flow [2021-06-10 11:47:51,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=1052, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2267, PETRI_PLACES=1055, PETRI_TRANSITIONS=897} [2021-06-10 11:47:51,462 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 72 predicate places. [2021-06-10 11:47:51,462 INFO L480 AbstractCegarLoop]: Abstraction has has 1055 places, 897 transitions, 2267 flow [2021-06-10 11:47:51,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:51,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:51,463 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:51,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2258 [2021-06-10 11:47:51,463 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash -406879709, now seen corresponding path program 1 times [2021-06-10 11:47:51,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:51,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061584674] [2021-06-10 11:47:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:51,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:51,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:51,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:51,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:51,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:51,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:47:51,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061584674] [2021-06-10 11:47:51,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:51,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:51,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939804961] [2021-06-10 11:47:51,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:51,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:51,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:51,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 897 transitions, 2267 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:51,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:51,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:51,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:52,001 INFO L129 PetriNetUnfolder]: 27/1089 cut-off events. [2021-06-10 11:47:52,002 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:52,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1089 events. 27/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4884 event pairs, 0 based on Foata normal form. 1/1027 useless extension candidates. Maximal degree in co-relation 1377. Up to 38 conditions per place. [2021-06-10 11:47:52,074 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/895 dead transitions. [2021-06-10 11:47:52,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1057 places, 895 transitions, 2270 flow [2021-06-10 11:47:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:52,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:52,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:52,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:52,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:52,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:52,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,078 INFO L185 Difference]: Start difference. First operand has 1055 places, 897 transitions, 2267 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:52,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1057 places, 895 transitions, 2270 flow [2021-06-10 11:47:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1054 places, 895 transitions, 2263 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:52,088 INFO L241 Difference]: Finished difference. Result has 1055 places, 895 transitions, 2256 flow [2021-06-10 11:47:52,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=1052, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=895, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2256, PETRI_PLACES=1055, PETRI_TRANSITIONS=895} [2021-06-10 11:47:52,089 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 72 predicate places. [2021-06-10 11:47:52,089 INFO L480 AbstractCegarLoop]: Abstraction has has 1055 places, 895 transitions, 2256 flow [2021-06-10 11:47:52,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,089 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:52,089 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:52,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2259 [2021-06-10 11:47:52,089 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -406880732, now seen corresponding path program 1 times [2021-06-10 11:47:52,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:52,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872334363] [2021-06-10 11:47:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:52,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:52,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:52,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:47:52,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872334363] [2021-06-10 11:47:52,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:52,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:52,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308701408] [2021-06-10 11:47:52,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:52,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:52,121 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:52,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 895 transitions, 2256 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:52,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:52,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:52,724 INFO L129 PetriNetUnfolder]: 27/1087 cut-off events. [2021-06-10 11:47:52,724 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:52,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 1087 events. 27/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4871 event pairs, 0 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 1377. Up to 38 conditions per place. [2021-06-10 11:47:52,765 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/893 dead transitions. [2021-06-10 11:47:52,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1055 places, 893 transitions, 2269 flow [2021-06-10 11:47:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:52,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:52,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:52,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:52,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:52,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:52,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,770 INFO L185 Difference]: Start difference. First operand has 1055 places, 895 transitions, 2256 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:52,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1055 places, 893 transitions, 2269 flow [2021-06-10 11:47:52,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1054 places, 893 transitions, 2268 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:52,779 INFO L241 Difference]: Finished difference. Result has 1054 places, 893 transitions, 2252 flow [2021-06-10 11:47:52,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=1052, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=1054, PETRI_TRANSITIONS=893} [2021-06-10 11:47:52,780 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 71 predicate places. [2021-06-10 11:47:52,780 INFO L480 AbstractCegarLoop]: Abstraction has has 1054 places, 893 transitions, 2252 flow [2021-06-10 11:47:52,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:52,780 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:52,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2260 [2021-06-10 11:47:52,780 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -11516668, now seen corresponding path program 1 times [2021-06-10 11:47:52,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:52,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162088675] [2021-06-10 11:47:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:52,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:52,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:52,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:52,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:47:52,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162088675] [2021-06-10 11:47:52,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:52,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:52,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406663727] [2021-06-10 11:47:52,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:52,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:52,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:52,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:52,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1054 places, 893 transitions, 2252 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:52,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:52,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:52,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:53,308 INFO L129 PetriNetUnfolder]: 26/1094 cut-off events. [2021-06-10 11:47:53,308 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:53,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1094 events. 26/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4927 event pairs, 0 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1382. Up to 38 conditions per place. [2021-06-10 11:47:53,383 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/894 dead transitions. [2021-06-10 11:47:53,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1056 places, 894 transitions, 2268 flow [2021-06-10 11:47:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:53,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:53,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:53,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:53,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:53,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:53,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:53,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:53,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:53,387 INFO L185 Difference]: Start difference. First operand has 1054 places, 893 transitions, 2252 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:53,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1056 places, 894 transitions, 2268 flow [2021-06-10 11:47:53,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1055 places, 894 transitions, 2267 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:53,397 INFO L241 Difference]: Finished difference. Result has 1056 places, 893 transitions, 2256 flow [2021-06-10 11:47:53,398 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=1053, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2256, PETRI_PLACES=1056, PETRI_TRANSITIONS=893} [2021-06-10 11:47:53,398 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 73 predicate places. [2021-06-10 11:47:53,398 INFO L480 AbstractCegarLoop]: Abstraction has has 1056 places, 893 transitions, 2256 flow [2021-06-10 11:47:53,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:53,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:53,398 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:53,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2261 [2021-06-10 11:47:53,398 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -11515645, now seen corresponding path program 1 times [2021-06-10 11:47:53,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:53,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204189841] [2021-06-10 11:47:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:53,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:53,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:53,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:53,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:53,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:53,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:47:53,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204189841] [2021-06-10 11:47:53,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:53,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:53,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166289590] [2021-06-10 11:47:53,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:53,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:53,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:53,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1056 places, 893 transitions, 2256 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:53,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:53,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:53,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:53,929 INFO L129 PetriNetUnfolder]: 24/1096 cut-off events. [2021-06-10 11:47:53,929 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:53,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 1096 events. 24/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4963 event pairs, 0 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1393. Up to 38 conditions per place. [2021-06-10 11:47:54,003 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/894 dead transitions. [2021-06-10 11:47:54,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1058 places, 894 transitions, 2282 flow [2021-06-10 11:47:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:54,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:54,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:54,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:54,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:54,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:54,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,007 INFO L185 Difference]: Start difference. First operand has 1056 places, 893 transitions, 2256 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:54,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1058 places, 894 transitions, 2282 flow [2021-06-10 11:47:54,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1057 places, 894 transitions, 2281 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:54,018 INFO L241 Difference]: Finished difference. Result has 1059 places, 894 transitions, 2273 flow [2021-06-10 11:47:54,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=1055, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2273, PETRI_PLACES=1059, PETRI_TRANSITIONS=894} [2021-06-10 11:47:54,018 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 76 predicate places. [2021-06-10 11:47:54,018 INFO L480 AbstractCegarLoop]: Abstraction has has 1059 places, 894 transitions, 2273 flow [2021-06-10 11:47:54,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,018 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:54,019 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:54,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2262 [2021-06-10 11:47:54,019 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash -12468957, now seen corresponding path program 1 times [2021-06-10 11:47:54,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:54,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995737251] [2021-06-10 11:47:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:54,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:54,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:54,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:47:54,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995737251] [2021-06-10 11:47:54,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:54,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:54,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222688822] [2021-06-10 11:47:54,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:54,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:54,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:54,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1059 places, 894 transitions, 2273 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:54,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:54,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:54,545 INFO L129 PetriNetUnfolder]: 24/1089 cut-off events. [2021-06-10 11:47:54,545 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:54,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 1089 events. 24/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4900 event pairs, 0 based on Foata normal form. 1/1030 useless extension candidates. Maximal degree in co-relation 1379. Up to 38 conditions per place. [2021-06-10 11:47:54,618 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/892 dead transitions. [2021-06-10 11:47:54,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1061 places, 892 transitions, 2275 flow [2021-06-10 11:47:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:54,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:54,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:54,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:54,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:54,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:54,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,623 INFO L185 Difference]: Start difference. First operand has 1059 places, 894 transitions, 2273 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1061 places, 892 transitions, 2275 flow [2021-06-10 11:47:54,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1058 places, 892 transitions, 2267 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:54,633 INFO L241 Difference]: Finished difference. Result has 1059 places, 892 transitions, 2260 flow [2021-06-10 11:47:54,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=1056, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=1059, PETRI_TRANSITIONS=892} [2021-06-10 11:47:54,634 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 76 predicate places. [2021-06-10 11:47:54,634 INFO L480 AbstractCegarLoop]: Abstraction has has 1059 places, 892 transitions, 2260 flow [2021-06-10 11:47:54,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:54,634 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:54,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2263 [2021-06-10 11:47:54,634 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -12469980, now seen corresponding path program 1 times [2021-06-10 11:47:54,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:54,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649015368] [2021-06-10 11:47:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:54,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:54,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:54,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:54,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:47:54,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649015368] [2021-06-10 11:47:54,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:54,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:54,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441116397] [2021-06-10 11:47:54,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:54,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:54,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:54,667 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:54,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1059 places, 892 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:54,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:54,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:54,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:55,139 INFO L129 PetriNetUnfolder]: 24/1087 cut-off events. [2021-06-10 11:47:55,139 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:55,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1087 events. 24/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4884 event pairs, 0 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1383. Up to 38 conditions per place. [2021-06-10 11:47:55,206 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/890 dead transitions. [2021-06-10 11:47:55,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1059 places, 890 transitions, 2273 flow [2021-06-10 11:47:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:55,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:55,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:55,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:55,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:55,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:55,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,211 INFO L185 Difference]: Start difference. First operand has 1059 places, 892 transitions, 2260 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:55,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1059 places, 890 transitions, 2273 flow [2021-06-10 11:47:55,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1058 places, 890 transitions, 2272 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:55,220 INFO L241 Difference]: Finished difference. Result has 1058 places, 890 transitions, 2256 flow [2021-06-10 11:47:55,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=1056, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2256, PETRI_PLACES=1058, PETRI_TRANSITIONS=890} [2021-06-10 11:47:55,221 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 75 predicate places. [2021-06-10 11:47:55,221 INFO L480 AbstractCegarLoop]: Abstraction has has 1058 places, 890 transitions, 2256 flow [2021-06-10 11:47:55,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:55,221 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:55,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2264 [2021-06-10 11:47:55,221 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1386040060, now seen corresponding path program 1 times [2021-06-10 11:47:55,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:55,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346033791] [2021-06-10 11:47:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:55,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:55,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:55,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:47:55,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346033791] [2021-06-10 11:47:55,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:55,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:55,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876453796] [2021-06-10 11:47:55,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:55,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:55,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:55,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:55,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:55,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1058 places, 890 transitions, 2256 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:55,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:55,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:55,759 INFO L129 PetriNetUnfolder]: 23/1095 cut-off events. [2021-06-10 11:47:55,759 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:55,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 1095 events. 23/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4957 event pairs, 0 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1395. Up to 38 conditions per place. [2021-06-10 11:47:55,831 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/892 dead transitions. [2021-06-10 11:47:55,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1060 places, 892 transitions, 2286 flow [2021-06-10 11:47:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:47:55,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:47:55,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:47:55,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:47:55,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:55,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:47:55,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,836 INFO L185 Difference]: Start difference. First operand has 1058 places, 890 transitions, 2256 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:47:55,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1060 places, 892 transitions, 2286 flow [2021-06-10 11:47:55,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1059 places, 892 transitions, 2285 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:55,846 INFO L241 Difference]: Finished difference. Result has 1061 places, 892 transitions, 2279 flow [2021-06-10 11:47:55,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=1057, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2279, PETRI_PLACES=1061, PETRI_TRANSITIONS=892} [2021-06-10 11:47:55,846 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 78 predicate places. [2021-06-10 11:47:55,846 INFO L480 AbstractCegarLoop]: Abstraction has has 1061 places, 892 transitions, 2279 flow [2021-06-10 11:47:55,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:55,847 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:55,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2265 [2021-06-10 11:47:55,847 INFO L428 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1386041083, now seen corresponding path program 1 times [2021-06-10 11:47:55,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:55,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719469179] [2021-06-10 11:47:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:55,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:55,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:55,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:55,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:47:55,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719469179] [2021-06-10 11:47:55,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:55,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:55,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185845300] [2021-06-10 11:47:55,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:55,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:55,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:55,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1061 places, 892 transitions, 2279 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:55,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:55,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:55,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:56,379 INFO L129 PetriNetUnfolder]: 21/1096 cut-off events. [2021-06-10 11:47:56,380 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:56,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1096 events. 21/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4979 event pairs, 0 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1395. Up to 38 conditions per place. [2021-06-10 11:47:56,452 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/892 dead transitions. [2021-06-10 11:47:56,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 892 transitions, 2291 flow [2021-06-10 11:47:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:56,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:56,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:56,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:56,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:56,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:56,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:56,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:56,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:56,457 INFO L185 Difference]: Start difference. First operand has 1061 places, 892 transitions, 2279 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:56,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 892 transitions, 2291 flow [2021-06-10 11:47:56,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1062 places, 892 transitions, 2286 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:56,467 INFO L241 Difference]: Finished difference. Result has 1063 places, 891 transitions, 2275 flow [2021-06-10 11:47:56,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=1060, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2275, PETRI_PLACES=1063, PETRI_TRANSITIONS=891} [2021-06-10 11:47:56,468 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 80 predicate places. [2021-06-10 11:47:56,468 INFO L480 AbstractCegarLoop]: Abstraction has has 1063 places, 891 transitions, 2275 flow [2021-06-10 11:47:56,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:56,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:56,468 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:56,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2266 [2021-06-10 11:47:56,468 INFO L428 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1386993372, now seen corresponding path program 1 times [2021-06-10 11:47:56,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:56,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187833686] [2021-06-10 11:47:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:56,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:56,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:56,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:56,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:56,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:56,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:47:56,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187833686] [2021-06-10 11:47:56,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:56,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:56,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189117339] [2021-06-10 11:47:56,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:56,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:56,500 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:56,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1063 places, 891 transitions, 2275 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:56,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:56,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:56,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:56,992 INFO L129 PetriNetUnfolder]: 21/1089 cut-off events. [2021-06-10 11:47:56,992 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:57,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1089 events. 21/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4920 event pairs, 0 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 1389. Up to 38 conditions per place. [2021-06-10 11:47:57,047 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/889 dead transitions. [2021-06-10 11:47:57,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1065 places, 889 transitions, 2278 flow [2021-06-10 11:47:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:57,049 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:57,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:57,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:57,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:57,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:57,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,052 INFO L185 Difference]: Start difference. First operand has 1063 places, 891 transitions, 2275 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1065 places, 889 transitions, 2278 flow [2021-06-10 11:47:57,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1062 places, 889 transitions, 2271 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:57,061 INFO L241 Difference]: Finished difference. Result has 1063 places, 889 transitions, 2264 flow [2021-06-10 11:47:57,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=1060, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2264, PETRI_PLACES=1063, PETRI_TRANSITIONS=889} [2021-06-10 11:47:57,061 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 80 predicate places. [2021-06-10 11:47:57,062 INFO L480 AbstractCegarLoop]: Abstraction has has 1063 places, 889 transitions, 2264 flow [2021-06-10 11:47:57,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,062 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:57,062 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:57,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2267 [2021-06-10 11:47:57,062 INFO L428 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1386994395, now seen corresponding path program 1 times [2021-06-10 11:47:57,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:57,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899288881] [2021-06-10 11:47:57,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:57,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:57,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:57,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:47:57,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899288881] [2021-06-10 11:47:57,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:57,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:57,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829978660] [2021-06-10 11:47:57,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:57,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:57,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:57,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1063 places, 889 transitions, 2264 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:57,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:57,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:57,589 INFO L129 PetriNetUnfolder]: 21/1087 cut-off events. [2021-06-10 11:47:57,589 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:57,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 1087 events. 21/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4902 event pairs, 0 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1389. Up to 38 conditions per place. [2021-06-10 11:47:57,660 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/887 dead transitions. [2021-06-10 11:47:57,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1063 places, 887 transitions, 2277 flow [2021-06-10 11:47:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:47:57,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:47:57,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:47:57,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:47:57,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:57,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:47:57,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,664 INFO L185 Difference]: Start difference. First operand has 1063 places, 889 transitions, 2264 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:47:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1063 places, 887 transitions, 2277 flow [2021-06-10 11:47:57,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1062 places, 887 transitions, 2276 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:57,674 INFO L241 Difference]: Finished difference. Result has 1062 places, 887 transitions, 2260 flow [2021-06-10 11:47:57,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=1060, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=1062, PETRI_TRANSITIONS=887} [2021-06-10 11:47:57,675 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 79 predicate places. [2021-06-10 11:47:57,675 INFO L480 AbstractCegarLoop]: Abstraction has has 1062 places, 887 transitions, 2260 flow [2021-06-10 11:47:57,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:57,675 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:57,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2268 [2021-06-10 11:47:57,675 INFO L428 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash -529600121, now seen corresponding path program 1 times [2021-06-10 11:47:57,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:57,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392908187] [2021-06-10 11:47:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:57,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:57,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:57,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:57,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:47:57,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392908187] [2021-06-10 11:47:57,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:57,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:57,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351748985] [2021-06-10 11:47:57,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:57,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:57,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:57,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1062 places, 887 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:57,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:57,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:57,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:58,202 INFO L129 PetriNetUnfolder]: 20/1094 cut-off events. [2021-06-10 11:47:58,203 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:47:58,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1094 events. 20/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4962 event pairs, 0 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 1394. Up to 38 conditions per place. [2021-06-10 11:47:58,272 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/888 dead transitions. [2021-06-10 11:47:58,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1064 places, 888 transitions, 2276 flow [2021-06-10 11:47:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:47:58,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:47:58,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:47:58,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:47:58,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:58,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:47:58,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,277 INFO L185 Difference]: Start difference. First operand has 1062 places, 887 transitions, 2260 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:47:58,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1064 places, 888 transitions, 2276 flow [2021-06-10 11:47:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1063 places, 888 transitions, 2275 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:58,287 INFO L241 Difference]: Finished difference. Result has 1064 places, 887 transitions, 2264 flow [2021-06-10 11:47:58,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=1061, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2264, PETRI_PLACES=1064, PETRI_TRANSITIONS=887} [2021-06-10 11:47:58,287 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 81 predicate places. [2021-06-10 11:47:58,287 INFO L480 AbstractCegarLoop]: Abstraction has has 1064 places, 887 transitions, 2264 flow [2021-06-10 11:47:58,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:58,288 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:58,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2269 [2021-06-10 11:47:58,288 INFO L428 AbstractCegarLoop]: === Iteration 122 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash -529599098, now seen corresponding path program 1 times [2021-06-10 11:47:58,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:58,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387028000] [2021-06-10 11:47:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:58,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:58,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:47:58,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:47:58,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387028000] [2021-06-10 11:47:58,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:58,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:58,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898722376] [2021-06-10 11:47:58,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:58,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:58,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:58,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1064 places, 887 transitions, 2264 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:58,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:58,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:58,879 INFO L129 PetriNetUnfolder]: 18/1096 cut-off events. [2021-06-10 11:47:58,879 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:47:58,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1096 events. 18/1096 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4990 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1405. Up to 38 conditions per place. [2021-06-10 11:47:58,922 INFO L132 encePairwiseOnDemand]: 1053/1057 looper letters, 9 selfloop transitions, 3 changer transitions 0/888 dead transitions. [2021-06-10 11:47:58,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1066 places, 888 transitions, 2290 flow [2021-06-10 11:47:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2923 transitions. [2021-06-10 11:47:58,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9217912330495112 [2021-06-10 11:47:58,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2923 transitions. [2021-06-10 11:47:58,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2923 transitions. [2021-06-10 11:47:58,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:58,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2923 transitions. [2021-06-10 11:47:58,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 974.3333333333334) internal successors, (2923), 3 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,927 INFO L185 Difference]: Start difference. First operand has 1064 places, 887 transitions, 2264 flow. Second operand 3 states and 2923 transitions. [2021-06-10 11:47:58,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1066 places, 888 transitions, 2290 flow [2021-06-10 11:47:58,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1065 places, 888 transitions, 2289 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:47:58,936 INFO L241 Difference]: Finished difference. Result has 1067 places, 888 transitions, 2281 flow [2021-06-10 11:47:58,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=1063, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2281, PETRI_PLACES=1067, PETRI_TRANSITIONS=888} [2021-06-10 11:47:58,936 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 84 predicate places. [2021-06-10 11:47:58,936 INFO L480 AbstractCegarLoop]: Abstraction has has 1067 places, 888 transitions, 2281 flow [2021-06-10 11:47:58,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:58,937 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:58,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2270 [2021-06-10 11:47:58,937 INFO L428 AbstractCegarLoop]: === Iteration 123 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -530552410, now seen corresponding path program 1 times [2021-06-10 11:47:58,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:58,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498937892] [2021-06-10 11:47:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:58,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:58,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:47:58,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:58,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:47:58,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498937892] [2021-06-10 11:47:58,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:58,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:58,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557591543] [2021-06-10 11:47:58,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:58,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:58,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:47:58,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1067 places, 888 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:58,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:58,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:47:58,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:47:59,458 INFO L129 PetriNetUnfolder]: 18/1089 cut-off events. [2021-06-10 11:47:59,458 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:47:59,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1089 events. 18/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4934 event pairs, 0 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1391. Up to 38 conditions per place. [2021-06-10 11:47:59,528 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/886 dead transitions. [2021-06-10 11:47:59,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1069 places, 886 transitions, 2283 flow [2021-06-10 11:47:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:47:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:47:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:47:59,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:47:59,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:47:59,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:47:59,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:47:59,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:47:59,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:59,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:59,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:59,532 INFO L185 Difference]: Start difference. First operand has 1067 places, 888 transitions, 2281 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:47:59,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1069 places, 886 transitions, 2283 flow [2021-06-10 11:47:59,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1066 places, 886 transitions, 2275 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:47:59,543 INFO L241 Difference]: Finished difference. Result has 1067 places, 886 transitions, 2268 flow [2021-06-10 11:47:59,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=1064, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2268, PETRI_PLACES=1067, PETRI_TRANSITIONS=886} [2021-06-10 11:47:59,543 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 84 predicate places. [2021-06-10 11:47:59,543 INFO L480 AbstractCegarLoop]: Abstraction has has 1067 places, 886 transitions, 2268 flow [2021-06-10 11:47:59,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:59,543 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:47:59,543 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:47:59,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2271 [2021-06-10 11:47:59,543 INFO L428 AbstractCegarLoop]: === Iteration 124 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:47:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:47:59,544 INFO L82 PathProgramCache]: Analyzing trace with hash -530553433, now seen corresponding path program 1 times [2021-06-10 11:47:59,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:47:59,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182486806] [2021-06-10 11:47:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:47:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:47:59,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:59,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:59,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:59,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:47:59,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:47:59,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:47:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:47:59,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182486806] [2021-06-10 11:47:59,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:47:59,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:47:59,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324681884] [2021-06-10 11:47:59,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:47:59,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:47:59,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:47:59,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:47:59,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:47:59,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1067 places, 886 transitions, 2268 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:47:59,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:47:59,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:47:59,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:00,072 INFO L129 PetriNetUnfolder]: 18/1087 cut-off events. [2021-06-10 11:48:00,072 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:00,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1087 events. 18/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4918 event pairs, 0 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 1395. Up to 38 conditions per place. [2021-06-10 11:48:00,143 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/884 dead transitions. [2021-06-10 11:48:00,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1067 places, 884 transitions, 2281 flow [2021-06-10 11:48:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:48:00,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:48:00,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:48:00,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:48:00,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:00,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:48:00,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,147 INFO L185 Difference]: Start difference. First operand has 1067 places, 886 transitions, 2268 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:48:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1067 places, 884 transitions, 2281 flow [2021-06-10 11:48:00,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1066 places, 884 transitions, 2280 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:00,158 INFO L241 Difference]: Finished difference. Result has 1066 places, 884 transitions, 2264 flow [2021-06-10 11:48:00,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=1064, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2264, PETRI_PLACES=1066, PETRI_TRANSITIONS=884} [2021-06-10 11:48:00,158 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 83 predicate places. [2021-06-10 11:48:00,158 INFO L480 AbstractCegarLoop]: Abstraction has has 1066 places, 884 transitions, 2264 flow [2021-06-10 11:48:00,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,158 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:00,158 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:00,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2272 [2021-06-10 11:48:00,159 INFO L428 AbstractCegarLoop]: === Iteration 125 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1614524151, now seen corresponding path program 1 times [2021-06-10 11:48:00,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:00,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666751461] [2021-06-10 11:48:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:00,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:00,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:00,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:48:00,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666751461] [2021-06-10 11:48:00,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:00,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:00,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384800988] [2021-06-10 11:48:00,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:00,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:00,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:48:00,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1066 places, 884 transitions, 2264 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:00,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:48:00,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:00,707 INFO L129 PetriNetUnfolder]: 17/1095 cut-off events. [2021-06-10 11:48:00,707 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:48:00,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1095 events. 17/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4989 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1407. Up to 38 conditions per place. [2021-06-10 11:48:00,779 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/886 dead transitions. [2021-06-10 11:48:00,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1068 places, 886 transitions, 2294 flow [2021-06-10 11:48:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:48:00,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:48:00,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:48:00,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:48:00,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:48:00,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,784 INFO L185 Difference]: Start difference. First operand has 1066 places, 884 transitions, 2264 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:48:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1068 places, 886 transitions, 2294 flow [2021-06-10 11:48:00,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1067 places, 886 transitions, 2293 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:00,794 INFO L241 Difference]: Finished difference. Result has 1069 places, 886 transitions, 2287 flow [2021-06-10 11:48:00,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=1065, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2287, PETRI_PLACES=1069, PETRI_TRANSITIONS=886} [2021-06-10 11:48:00,795 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 86 predicate places. [2021-06-10 11:48:00,795 INFO L480 AbstractCegarLoop]: Abstraction has has 1069 places, 886 transitions, 2287 flow [2021-06-10 11:48:00,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:00,795 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:00,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2273 [2021-06-10 11:48:00,795 INFO L428 AbstractCegarLoop]: === Iteration 126 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1614525174, now seen corresponding path program 1 times [2021-06-10 11:48:00,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:00,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653662271] [2021-06-10 11:48:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:00,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:00,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:00,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:00,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:48:00,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653662271] [2021-06-10 11:48:00,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:00,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:00,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547514905] [2021-06-10 11:48:00,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:00,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:00,828 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:48:00,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1069 places, 886 transitions, 2287 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:00,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:00,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:48:00,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:01,324 INFO L129 PetriNetUnfolder]: 15/1096 cut-off events. [2021-06-10 11:48:01,324 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:01,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 1096 events. 15/1096 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5014 event pairs, 0 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1407. Up to 38 conditions per place. [2021-06-10 11:48:01,393 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 6 selfloop transitions, 1 changer transitions 0/886 dead transitions. [2021-06-10 11:48:01,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1071 places, 886 transitions, 2299 flow [2021-06-10 11:48:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:48:01,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:48:01,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:48:01,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:48:01,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:01,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:48:01,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:01,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:01,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:01,397 INFO L185 Difference]: Start difference. First operand has 1069 places, 886 transitions, 2287 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:48:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1071 places, 886 transitions, 2299 flow [2021-06-10 11:48:01,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1070 places, 886 transitions, 2294 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:01,407 INFO L241 Difference]: Finished difference. Result has 1071 places, 885 transitions, 2283 flow [2021-06-10 11:48:01,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=1068, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2283, PETRI_PLACES=1071, PETRI_TRANSITIONS=885} [2021-06-10 11:48:01,407 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 88 predicate places. [2021-06-10 11:48:01,407 INFO L480 AbstractCegarLoop]: Abstraction has has 1071 places, 885 transitions, 2283 flow [2021-06-10 11:48:01,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:01,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:01,408 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:01,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2274 [2021-06-10 11:48:01,408 INFO L428 AbstractCegarLoop]: === Iteration 127 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1615477463, now seen corresponding path program 1 times [2021-06-10 11:48:01,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:01,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506591711] [2021-06-10 11:48:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:01,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:01,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:01,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:01,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:01,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:01,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:48:01,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506591711] [2021-06-10 11:48:01,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:01,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:01,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125394658] [2021-06-10 11:48:01,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:01,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:01,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:48:01,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1071 places, 885 transitions, 2283 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:01,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:01,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:48:01,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:01,937 INFO L129 PetriNetUnfolder]: 15/1089 cut-off events. [2021-06-10 11:48:01,937 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:02,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1089 events. 15/1089 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4956 event pairs, 0 based on Foata normal form. 1/1039 useless extension candidates. Maximal degree in co-relation 1401. Up to 38 conditions per place. [2021-06-10 11:48:02,010 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/883 dead transitions. [2021-06-10 11:48:02,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1073 places, 883 transitions, 2286 flow [2021-06-10 11:48:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:48:02,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:48:02,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:48:02,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:48:02,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:02,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:48:02,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,015 INFO L185 Difference]: Start difference. First operand has 1071 places, 885 transitions, 2283 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:48:02,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1073 places, 883 transitions, 2286 flow [2021-06-10 11:48:02,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1070 places, 883 transitions, 2279 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:02,025 INFO L241 Difference]: Finished difference. Result has 1071 places, 883 transitions, 2272 flow [2021-06-10 11:48:02,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=1068, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=883, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2272, PETRI_PLACES=1071, PETRI_TRANSITIONS=883} [2021-06-10 11:48:02,025 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 88 predicate places. [2021-06-10 11:48:02,025 INFO L480 AbstractCegarLoop]: Abstraction has has 1071 places, 883 transitions, 2272 flow [2021-06-10 11:48:02,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,026 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:02,026 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:02,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2275 [2021-06-10 11:48:02,026 INFO L428 AbstractCegarLoop]: === Iteration 128 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1615478486, now seen corresponding path program 1 times [2021-06-10 11:48:02,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:02,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45781446] [2021-06-10 11:48:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:02,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:02,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:02,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:48:02,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45781446] [2021-06-10 11:48:02,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:02,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:02,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044352887] [2021-06-10 11:48:02,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:02,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:02,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:48:02,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1071 places, 883 transitions, 2272 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:02,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:48:02,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:02,571 INFO L129 PetriNetUnfolder]: 15/1087 cut-off events. [2021-06-10 11:48:02,571 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:02,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1087 events. 15/1087 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4941 event pairs, 0 based on Foata normal form. 0/1035 useless extension candidates. Maximal degree in co-relation 1401. Up to 38 conditions per place. [2021-06-10 11:48:02,641 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/881 dead transitions. [2021-06-10 11:48:02,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1071 places, 881 transitions, 2285 flow [2021-06-10 11:48:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:48:02,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:48:02,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:48:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:48:02,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:02,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:48:02,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,646 INFO L185 Difference]: Start difference. First operand has 1071 places, 883 transitions, 2272 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:48:02,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1071 places, 881 transitions, 2285 flow [2021-06-10 11:48:02,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1070 places, 881 transitions, 2284 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:02,656 INFO L241 Difference]: Finished difference. Result has 1070 places, 881 transitions, 2268 flow [2021-06-10 11:48:02,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=1068, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2268, PETRI_PLACES=1070, PETRI_TRANSITIONS=881} [2021-06-10 11:48:02,656 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 87 predicate places. [2021-06-10 11:48:02,656 INFO L480 AbstractCegarLoop]: Abstraction has has 1070 places, 881 transitions, 2268 flow [2021-06-10 11:48:02,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:02,657 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:02,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2276 [2021-06-10 11:48:02,657 INFO L428 AbstractCegarLoop]: === Iteration 129 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -729664722, now seen corresponding path program 1 times [2021-06-10 11:48:02,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:02,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574732908] [2021-06-10 11:48:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:02,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:02,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:02,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:02,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:48:02,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574732908] [2021-06-10 11:48:02,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:02,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:02,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082520675] [2021-06-10 11:48:02,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:02,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:02,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:48:02,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1070 places, 881 transitions, 2268 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:02,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:02,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:48:02,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:03,178 INFO L129 PetriNetUnfolder]: 14/1095 cut-off events. [2021-06-10 11:48:03,178 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:48:03,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 1095 events. 14/1095 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5008 event pairs, 0 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1413. Up to 38 conditions per place. [2021-06-10 11:48:03,236 INFO L132 encePairwiseOnDemand]: 1052/1057 looper letters, 10 selfloop transitions, 3 changer transitions 0/883 dead transitions. [2021-06-10 11:48:03,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1072 places, 883 transitions, 2298 flow [2021-06-10 11:48:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2925 transitions. [2021-06-10 11:48:03,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224219489120151 [2021-06-10 11:48:03,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2925 transitions. [2021-06-10 11:48:03,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2925 transitions. [2021-06-10 11:48:03,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:03,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2925 transitions. [2021-06-10 11:48:03,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 975.0) internal successors, (2925), 3 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,240 INFO L185 Difference]: Start difference. First operand has 1070 places, 881 transitions, 2268 flow. Second operand 3 states and 2925 transitions. [2021-06-10 11:48:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1072 places, 883 transitions, 2298 flow [2021-06-10 11:48:03,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1071 places, 883 transitions, 2297 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:03,250 INFO L241 Difference]: Finished difference. Result has 1073 places, 883 transitions, 2291 flow [2021-06-10 11:48:03,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=1069, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=878, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2291, PETRI_PLACES=1073, PETRI_TRANSITIONS=883} [2021-06-10 11:48:03,250 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 90 predicate places. [2021-06-10 11:48:03,250 INFO L480 AbstractCegarLoop]: Abstraction has has 1073 places, 883 transitions, 2291 flow [2021-06-10 11:48:03,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:03,250 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:03,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2277 [2021-06-10 11:48:03,251 INFO L428 AbstractCegarLoop]: === Iteration 130 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -729663699, now seen corresponding path program 1 times [2021-06-10 11:48:03,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:03,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630260318] [2021-06-10 11:48:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:03,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:03,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:03,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:48:03,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630260318] [2021-06-10 11:48:03,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:03,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:03,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081293930] [2021-06-10 11:48:03,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:03,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:03,283 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:48:03,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1073 places, 883 transitions, 2291 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:03,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:48:03,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:03,789 INFO L129 PetriNetUnfolder]: 13/1093 cut-off events. [2021-06-10 11:48:03,789 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:03,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1093 events. 13/1093 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4999 event pairs, 0 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1410. Up to 38 conditions per place. [2021-06-10 11:48:03,861 INFO L132 encePairwiseOnDemand]: 1054/1057 looper letters, 5 selfloop transitions, 2 changer transitions 0/883 dead transitions. [2021-06-10 11:48:03,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1075 places, 883 transitions, 2303 flow [2021-06-10 11:48:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2933 transitions. [2021-06-10 11:48:03,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9249448123620309 [2021-06-10 11:48:03,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2933 transitions. [2021-06-10 11:48:03,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2933 transitions. [2021-06-10 11:48:03,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:03,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2933 transitions. [2021-06-10 11:48:03,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.6666666666666) internal successors, (2933), 3 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,865 INFO L185 Difference]: Start difference. First operand has 1073 places, 883 transitions, 2291 flow. Second operand 3 states and 2933 transitions. [2021-06-10 11:48:03,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1075 places, 883 transitions, 2303 flow [2021-06-10 11:48:03,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1074 places, 883 transitions, 2298 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:03,876 INFO L241 Difference]: Finished difference. Result has 1076 places, 883 transitions, 2296 flow [2021-06-10 11:48:03,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=1072, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=882, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2296, PETRI_PLACES=1076, PETRI_TRANSITIONS=883} [2021-06-10 11:48:03,876 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 93 predicate places. [2021-06-10 11:48:03,876 INFO L480 AbstractCegarLoop]: Abstraction has has 1076 places, 883 transitions, 2296 flow [2021-06-10 11:48:03,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:03,877 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:03,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2278 [2021-06-10 11:48:03,877 INFO L428 AbstractCegarLoop]: === Iteration 131 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash -728711410, now seen corresponding path program 1 times [2021-06-10 11:48:03,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:03,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975988369] [2021-06-10 11:48:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:03,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:03,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:03,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:03,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:48:03,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975988369] [2021-06-10 11:48:03,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:03,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:03,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613368902] [2021-06-10 11:48:03,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:03,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:03,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1057 [2021-06-10 11:48:03,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1076 places, 883 transitions, 2296 flow. Second operand has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:03,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:03,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1057 [2021-06-10 11:48:03,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:04,411 INFO L129 PetriNetUnfolder]: 12/1089 cut-off events. [2021-06-10 11:48:04,411 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:04,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1089 events. 12/1089 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4971 event pairs, 0 based on Foata normal form. 1/1042 useless extension candidates. Maximal degree in co-relation 1407. Up to 38 conditions per place. [2021-06-10 11:48:04,482 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 5 selfloop transitions, 1 changer transitions 0/880 dead transitions. [2021-06-10 11:48:04,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1078 places, 880 transitions, 2293 flow [2021-06-10 11:48:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2932 transitions. [2021-06-10 11:48:04,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246294544307789 [2021-06-10 11:48:04,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2932 transitions. [2021-06-10 11:48:04,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2932 transitions. [2021-06-10 11:48:04,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:04,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2932 transitions. [2021-06-10 11:48:04,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 977.3333333333334) internal successors, (2932), 3 states have internal predecessors, (2932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:04,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:04,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:04,486 INFO L185 Difference]: Start difference. First operand has 1076 places, 883 transitions, 2296 flow. Second operand 3 states and 2932 transitions. [2021-06-10 11:48:04,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1078 places, 880 transitions, 2293 flow [2021-06-10 11:48:04,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1075 places, 880 transitions, 2286 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:04,497 INFO L241 Difference]: Finished difference. Result has 1075 places, 880 transitions, 2276 flow [2021-06-10 11:48:04,497 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=1073, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2276, PETRI_PLACES=1075, PETRI_TRANSITIONS=880} [2021-06-10 11:48:04,497 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 92 predicate places. [2021-06-10 11:48:04,497 INFO L480 AbstractCegarLoop]: Abstraction has has 1075 places, 880 transitions, 2276 flow [2021-06-10 11:48:04,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 976.3333333333334) internal successors, (2929), 3 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:04,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:04,497 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:04,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2279 [2021-06-10 11:48:04,498 INFO L428 AbstractCegarLoop]: === Iteration 132 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash -728710387, now seen corresponding path program 1 times [2021-06-10 11:48:04,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:04,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940171617] [2021-06-10 11:48:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:04,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:04,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:04,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:04,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:04,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:04,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:48:04,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940171617] [2021-06-10 11:48:04,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:04,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:04,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146611698] [2021-06-10 11:48:04,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:04,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:04,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:04,531 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 970 out of 1057 [2021-06-10 11:48:04,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1075 places, 880 transitions, 2276 flow. Second operand has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:04,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:04,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 970 of 1057 [2021-06-10 11:48:04,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:05,073 INFO L129 PetriNetUnfolder]: 12/1087 cut-off events. [2021-06-10 11:48:05,074 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:48:05,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 1087 events. 12/1087 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4958 event pairs, 0 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1408. Up to 38 conditions per place. [2021-06-10 11:48:05,120 INFO L132 encePairwiseOnDemand]: 1055/1057 looper letters, 8 selfloop transitions, 1 changer transitions 0/878 dead transitions. [2021-06-10 11:48:05,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1075 places, 878 transitions, 2289 flow [2021-06-10 11:48:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2920 transitions. [2021-06-10 11:48:05,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9208451592557553 [2021-06-10 11:48:05,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2920 transitions. [2021-06-10 11:48:05,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2920 transitions. [2021-06-10 11:48:05,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:05,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2920 transitions. [2021-06-10 11:48:05,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 973.3333333333334) internal successors, (2920), 3 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:05,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:05,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1057.0) internal successors, (4228), 4 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:05,125 INFO L185 Difference]: Start difference. First operand has 1075 places, 880 transitions, 2276 flow. Second operand 3 states and 2920 transitions. [2021-06-10 11:48:05,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1075 places, 878 transitions, 2289 flow [2021-06-10 11:48:05,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1074 places, 878 transitions, 2288 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:05,134 INFO L241 Difference]: Finished difference. Result has 1074 places, 878 transitions, 2272 flow [2021-06-10 11:48:05,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=1072, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2272, PETRI_PLACES=1074, PETRI_TRANSITIONS=878} [2021-06-10 11:48:05,134 INFO L343 CegarLoopForPetriNet]: 983 programPoint places, 91 predicate places. [2021-06-10 11:48:05,134 INFO L480 AbstractCegarLoop]: Abstraction has has 1074 places, 878 transitions, 2272 flow [2021-06-10 11:48:05,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 972.3333333333334) internal successors, (2917), 3 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:05,135 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:05,135 INFO L263 CegarLoopForPetriNet]: trace histogram [38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:05,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2280 [2021-06-10 11:48:05,135 INFO L428 AbstractCegarLoop]: === Iteration 133 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 362035167, now seen corresponding path program 1 times [2021-06-10 11:48:05,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:05,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333938457] [2021-06-10 11:48:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:48:05,159 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:48:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:48:05,166 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:48:05,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:48:05,190 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:48:05,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2281 [2021-06-10 11:48:05,190 WARN L342 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:48:05,190 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,264 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,265 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,267 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,268 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,281 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,282 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,283 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,284 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,285 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,286 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,287 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,291 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,346 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,347 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,348 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,359 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,360 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,361 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,362 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,363 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,364 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,365 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of38ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of38ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:48:05,394 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:48:05,394 INFO L253 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-06-10 11:48:05,394 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:48:05,394 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:48:05,394 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:48:05,394 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:48:05,394 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:48:05,394 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:48:05,394 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:48:05,394 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:48:05,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 1009 places, 1085 transitions, 3766 flow [2021-06-10 11:48:05,957 INFO L129 PetriNetUnfolder]: 191/1426 cut-off events. [2021-06-10 11:48:05,958 INFO L130 PetriNetUnfolder]: For 9842/9842 co-relation queries the response was YES. [2021-06-10 11:48:06,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 1426 events. 191/1426 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6177 event pairs, 0 based on Foata normal form. 0/1158 useless extension candidates. Maximal degree in co-relation 2194. Up to 78 conditions per place. [2021-06-10 11:48:06,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 1009 places, 1085 transitions, 3766 flow [2021-06-10 11:48:06,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1009 places, 1085 transitions, 3766 flow [2021-06-10 11:48:06,112 INFO L129 PetriNetUnfolder]: 8/98 cut-off events. [2021-06-10 11:48:06,112 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:48:06,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:06,112 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-06-10 11:48:06,112 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:06,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1063699176, now seen corresponding path program 1 times [2021-06-10 11:48:06,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:06,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979361725] [2021-06-10 11:48:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:06,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:06,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:06,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:48:06,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979361725] [2021-06-10 11:48:06,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:06,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:06,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067378541] [2021-06-10 11:48:06,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:06,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:06,138 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:06,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1085 transitions, 3766 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:06,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:06,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:06,615 INFO L129 PetriNetUnfolder]: 112/1121 cut-off events. [2021-06-10 11:48:06,615 INFO L130 PetriNetUnfolder]: For 9843/9843 co-relation queries the response was YES. [2021-06-10 11:48:06,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 1121 events. 112/1121 cut-off events. For 9843/9843 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4546 event pairs, 0 based on Foata normal form. 154/1123 useless extension candidates. Maximal degree in co-relation 1901. Up to 39 conditions per place. [2021-06-10 11:48:06,719 INFO L132 encePairwiseOnDemand]: 1042/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/1004 dead transitions. [2021-06-10 11:48:06,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 968 places, 1004 transitions, 3618 flow [2021-06-10 11:48:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3091 transitions. [2021-06-10 11:48:06,721 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.949615975422427 [2021-06-10 11:48:06,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3091 transitions. [2021-06-10 11:48:06,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3091 transitions. [2021-06-10 11:48:06,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:06,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3091 transitions. [2021-06-10 11:48:06,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1030.3333333333333) internal successors, (3091), 3 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,724 INFO L185 Difference]: Start difference. First operand has 1009 places, 1085 transitions, 3766 flow. Second operand 3 states and 3091 transitions. [2021-06-10 11:48:06,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 968 places, 1004 transitions, 3618 flow [2021-06-10 11:48:06,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 1004 transitions, 2212 flow, removed 703 selfloop flow, removed 0 redundant places. [2021-06-10 11:48:06,745 INFO L241 Difference]: Finished difference. Result has 970 places, 1004 transitions, 2210 flow [2021-06-10 11:48:06,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=966, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2210, PETRI_PLACES=970, PETRI_TRANSITIONS=1004} [2021-06-10 11:48:06,746 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -39 predicate places. [2021-06-10 11:48:06,746 INFO L480 AbstractCegarLoop]: Abstraction has has 970 places, 1004 transitions, 2210 flow [2021-06-10 11:48:06,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:06,746 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-06-10 11:48:06,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2282 [2021-06-10 11:48:06,746 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1062745864, now seen corresponding path program 1 times [2021-06-10 11:48:06,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:06,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461728956] [2021-06-10 11:48:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:06,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:06,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:06,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:06,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:48:06,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461728956] [2021-06-10 11:48:06,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:06,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:06,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104362957] [2021-06-10 11:48:06,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:06,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:06,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:06,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 1004 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:06,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:06,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:06,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:07,256 INFO L129 PetriNetUnfolder]: 112/1120 cut-off events. [2021-06-10 11:48:07,256 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:07,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1120 events. 112/1120 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4537 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1233. Up to 39 conditions per place. [2021-06-10 11:48:07,313 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 2 changer transitions 0/1004 dead transitions. [2021-06-10 11:48:07,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 972 places, 1004 transitions, 2232 flow [2021-06-10 11:48:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:07,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:07,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:07,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:07,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:07,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:07,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,318 INFO L185 Difference]: Start difference. First operand has 970 places, 1004 transitions, 2210 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 972 places, 1004 transitions, 2232 flow [2021-06-10 11:48:07,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 1004 transitions, 2230 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:07,326 INFO L241 Difference]: Finished difference. Result has 973 places, 1004 transitions, 2220 flow [2021-06-10 11:48:07,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2220, PETRI_PLACES=973, PETRI_TRANSITIONS=1004} [2021-06-10 11:48:07,327 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -36 predicate places. [2021-06-10 11:48:07,327 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 1004 transitions, 2220 flow [2021-06-10 11:48:07,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:07,327 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-06-10 11:48:07,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2283 [2021-06-10 11:48:07,327 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1062746887, now seen corresponding path program 1 times [2021-06-10 11:48:07,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:07,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731796638] [2021-06-10 11:48:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:07,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:07,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:07,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:48:07,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731796638] [2021-06-10 11:48:07,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:07,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:07,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767697344] [2021-06-10 11:48:07,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:07,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:07,353 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:07,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 1004 transitions, 2220 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:07,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:07,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:07,771 INFO L129 PetriNetUnfolder]: 111/1118 cut-off events. [2021-06-10 11:48:07,772 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:07,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1118 events. 111/1118 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4529 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1231. Up to 39 conditions per place. [2021-06-10 11:48:07,861 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/1002 dead transitions. [2021-06-10 11:48:07,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1002 transitions, 2223 flow [2021-06-10 11:48:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:07,863 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:07,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:07,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:07,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:07,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:07,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,866 INFO L185 Difference]: Start difference. First operand has 973 places, 1004 transitions, 2220 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:07,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1002 transitions, 2223 flow [2021-06-10 11:48:07,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1002 transitions, 2217 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 11:48:07,875 INFO L241 Difference]: Finished difference. Result has 973 places, 1002 transitions, 2207 flow [2021-06-10 11:48:07,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2207, PETRI_PLACES=973, PETRI_TRANSITIONS=1002} [2021-06-10 11:48:07,875 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -36 predicate places. [2021-06-10 11:48:07,875 INFO L480 AbstractCegarLoop]: Abstraction has has 973 places, 1002 transitions, 2207 flow [2021-06-10 11:48:07,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:07,876 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-06-10 11:48:07,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2284 [2021-06-10 11:48:07,876 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1063700199, now seen corresponding path program 1 times [2021-06-10 11:48:07,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:07,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279812628] [2021-06-10 11:48:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:07,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:07,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:07,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:07,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:48:07,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279812628] [2021-06-10 11:48:07,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:07,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:07,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926442131] [2021-06-10 11:48:07,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:07,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:07,900 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:07,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 1002 transitions, 2207 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:07,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:07,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:07,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:08,317 INFO L129 PetriNetUnfolder]: 111/1116 cut-off events. [2021-06-10 11:48:08,317 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-06-10 11:48:08,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 1116 events. 111/1116 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4515 event pairs, 0 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1237. Up to 39 conditions per place. [2021-06-10 11:48:08,408 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/1000 dead transitions. [2021-06-10 11:48:08,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 973 places, 1000 transitions, 2219 flow [2021-06-10 11:48:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:08,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:08,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:08,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:08,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:08,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:08,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,413 INFO L185 Difference]: Start difference. First operand has 973 places, 1002 transitions, 2207 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:08,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 973 places, 1000 transitions, 2219 flow [2021-06-10 11:48:08,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 1000 transitions, 2218 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:08,422 INFO L241 Difference]: Finished difference. Result has 972 places, 1000 transitions, 2202 flow [2021-06-10 11:48:08,422 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2202, PETRI_PLACES=972, PETRI_TRANSITIONS=1000} [2021-06-10 11:48:08,422 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -37 predicate places. [2021-06-10 11:48:08,422 INFO L480 AbstractCegarLoop]: Abstraction has has 972 places, 1000 transitions, 2202 flow [2021-06-10 11:48:08,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,423 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:08,423 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:08,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2285 [2021-06-10 11:48:08,423 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash -829083975, now seen corresponding path program 1 times [2021-06-10 11:48:08,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:08,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164128594] [2021-06-10 11:48:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:08,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:08,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:08,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:48:08,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164128594] [2021-06-10 11:48:08,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:08,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:08,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033594497] [2021-06-10 11:48:08,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:08,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:08,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:08,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:08,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 972 places, 1000 transitions, 2202 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:08,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:08,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:08,870 INFO L129 PetriNetUnfolder]: 110/1123 cut-off events. [2021-06-10 11:48:08,870 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:08,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 1123 events. 110/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4575 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1241. Up to 39 conditions per place. [2021-06-10 11:48:08,958 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/1001 dead transitions. [2021-06-10 11:48:08,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1001 transitions, 2218 flow [2021-06-10 11:48:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:08,959 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:08,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:08,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:08,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:08,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:08,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,962 INFO L185 Difference]: Start difference. First operand has 972 places, 1000 transitions, 2202 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:08,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 1001 transitions, 2218 flow [2021-06-10 11:48:08,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1001 transitions, 2217 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:08,972 INFO L241 Difference]: Finished difference. Result has 974 places, 1000 transitions, 2206 flow [2021-06-10 11:48:08,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2206, PETRI_PLACES=974, PETRI_TRANSITIONS=1000} [2021-06-10 11:48:08,972 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -35 predicate places. [2021-06-10 11:48:08,972 INFO L480 AbstractCegarLoop]: Abstraction has has 974 places, 1000 transitions, 2206 flow [2021-06-10 11:48:08,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,973 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:08,973 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:08,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2286 [2021-06-10 11:48:08,973 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:08,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash -829082952, now seen corresponding path program 1 times [2021-06-10 11:48:08,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:08,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720282311] [2021-06-10 11:48:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:08,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:08,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:08,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:08,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:48:08,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720282311] [2021-06-10 11:48:08,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:08,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:08,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904485391] [2021-06-10 11:48:08,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:08,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:08,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:08,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 1000 transitions, 2206 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:08,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:08,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:08,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:09,423 INFO L129 PetriNetUnfolder]: 108/1125 cut-off events. [2021-06-10 11:48:09,423 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:09,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1125 events. 108/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4608 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1253. Up to 39 conditions per place. [2021-06-10 11:48:09,484 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/1001 dead transitions. [2021-06-10 11:48:09,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 976 places, 1001 transitions, 2232 flow [2021-06-10 11:48:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:09,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:09,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:09,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:09,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:09,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:09,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:09,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:09,488 INFO L185 Difference]: Start difference. First operand has 974 places, 1000 transitions, 2206 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:09,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 976 places, 1001 transitions, 2232 flow [2021-06-10 11:48:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 1001 transitions, 2231 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:09,497 INFO L241 Difference]: Finished difference. Result has 977 places, 1001 transitions, 2223 flow [2021-06-10 11:48:09,497 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2223, PETRI_PLACES=977, PETRI_TRANSITIONS=1001} [2021-06-10 11:48:09,497 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -32 predicate places. [2021-06-10 11:48:09,497 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 1001 transitions, 2223 flow [2021-06-10 11:48:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:09,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:09,498 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:09,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2287 [2021-06-10 11:48:09,498 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash -830036264, now seen corresponding path program 1 times [2021-06-10 11:48:09,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:09,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615013044] [2021-06-10 11:48:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:09,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:09,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:09,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:09,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:09,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:09,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:48:09,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615013044] [2021-06-10 11:48:09,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:09,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:09,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316258139] [2021-06-10 11:48:09,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:09,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:09,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:09,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 1001 transitions, 2223 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:09,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:09,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:09,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:09,929 INFO L129 PetriNetUnfolder]: 108/1118 cut-off events. [2021-06-10 11:48:09,929 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:09,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 1118 events. 108/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4549 event pairs, 0 based on Foata normal form. 1/974 useless extension candidates. Maximal degree in co-relation 1238. Up to 39 conditions per place. [2021-06-10 11:48:10,015 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/999 dead transitions. [2021-06-10 11:48:10,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 999 transitions, 2225 flow [2021-06-10 11:48:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:10,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:10,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:10,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:10,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:10,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:10,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,019 INFO L185 Difference]: Start difference. First operand has 977 places, 1001 transitions, 2223 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:10,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 999 transitions, 2225 flow [2021-06-10 11:48:10,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 999 transitions, 2217 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:10,028 INFO L241 Difference]: Finished difference. Result has 977 places, 999 transitions, 2210 flow [2021-06-10 11:48:10,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2210, PETRI_PLACES=977, PETRI_TRANSITIONS=999} [2021-06-10 11:48:10,028 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -32 predicate places. [2021-06-10 11:48:10,028 INFO L480 AbstractCegarLoop]: Abstraction has has 977 places, 999 transitions, 2210 flow [2021-06-10 11:48:10,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:10,029 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:10,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2288 [2021-06-10 11:48:10,029 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -830037287, now seen corresponding path program 1 times [2021-06-10 11:48:10,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:10,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912063840] [2021-06-10 11:48:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:10,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:10,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:10,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:48:10,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912063840] [2021-06-10 11:48:10,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:10,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:10,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454107899] [2021-06-10 11:48:10,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:10,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:10,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:10,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 999 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:10,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:10,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:10,472 INFO L129 PetriNetUnfolder]: 108/1116 cut-off events. [2021-06-10 11:48:10,473 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:10,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1116 events. 108/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4534 event pairs, 0 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1243. Up to 39 conditions per place. [2021-06-10 11:48:10,562 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/997 dead transitions. [2021-06-10 11:48:10,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 997 transitions, 2223 flow [2021-06-10 11:48:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:10,564 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:10,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:10,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:10,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:10,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:10,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,567 INFO L185 Difference]: Start difference. First operand has 977 places, 999 transitions, 2210 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:10,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 997 transitions, 2223 flow [2021-06-10 11:48:10,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 997 transitions, 2222 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:10,577 INFO L241 Difference]: Finished difference. Result has 976 places, 997 transitions, 2206 flow [2021-06-10 11:48:10,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2206, PETRI_PLACES=976, PETRI_TRANSITIONS=997} [2021-06-10 11:48:10,577 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -33 predicate places. [2021-06-10 11:48:10,577 INFO L480 AbstractCegarLoop]: Abstraction has has 976 places, 997 transitions, 2206 flow [2021-06-10 11:48:10,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:10,578 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:10,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2289 [2021-06-10 11:48:10,578 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1659007335, now seen corresponding path program 1 times [2021-06-10 11:48:10,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:10,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114860914] [2021-06-10 11:48:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:10,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:10,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:10,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:10,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:48:10,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114860914] [2021-06-10 11:48:10,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:10,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:10,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410020047] [2021-06-10 11:48:10,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:10,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:10,603 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:10,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 997 transitions, 2206 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:10,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:10,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:10,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:11,021 INFO L129 PetriNetUnfolder]: 106/1121 cut-off events. [2021-06-10 11:48:11,022 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:11,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 1121 events. 106/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4585 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1246. Up to 39 conditions per place. [2021-06-10 11:48:11,107 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/998 dead transitions. [2021-06-10 11:48:11,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 998 transitions, 2222 flow [2021-06-10 11:48:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:11,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:11,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:11,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:11,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:11,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:11,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,112 INFO L185 Difference]: Start difference. First operand has 976 places, 997 transitions, 2206 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:11,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 998 transitions, 2222 flow [2021-06-10 11:48:11,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 998 transitions, 2221 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:11,121 INFO L241 Difference]: Finished difference. Result has 979 places, 998 transitions, 2219 flow [2021-06-10 11:48:11,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2219, PETRI_PLACES=979, PETRI_TRANSITIONS=998} [2021-06-10 11:48:11,121 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -30 predicate places. [2021-06-10 11:48:11,121 INFO L480 AbstractCegarLoop]: Abstraction has has 979 places, 998 transitions, 2219 flow [2021-06-10 11:48:11,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:11,121 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:11,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2290 [2021-06-10 11:48:11,122 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1659008358, now seen corresponding path program 1 times [2021-06-10 11:48:11,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:11,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619317475] [2021-06-10 11:48:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:11,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:11,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:11,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:48:11,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619317475] [2021-06-10 11:48:11,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:11,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:11,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263891725] [2021-06-10 11:48:11,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:11,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:11,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:11,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 998 transitions, 2219 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:11,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:11,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:11,564 INFO L129 PetriNetUnfolder]: 106/1122 cut-off events. [2021-06-10 11:48:11,564 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:11,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1122 events. 106/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4595 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1254. Up to 39 conditions per place. [2021-06-10 11:48:11,633 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/999 dead transitions. [2021-06-10 11:48:11,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 999 transitions, 2245 flow [2021-06-10 11:48:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:11,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:11,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:11,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:11,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:11,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:11,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,637 INFO L185 Difference]: Start difference. First operand has 979 places, 998 transitions, 2219 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:11,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 999 transitions, 2245 flow [2021-06-10 11:48:11,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 999 transitions, 2243 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:11,646 INFO L241 Difference]: Finished difference. Result has 982 places, 999 transitions, 2235 flow [2021-06-10 11:48:11,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2235, PETRI_PLACES=982, PETRI_TRANSITIONS=999} [2021-06-10 11:48:11,646 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -27 predicate places. [2021-06-10 11:48:11,646 INFO L480 AbstractCegarLoop]: Abstraction has has 982 places, 999 transitions, 2235 flow [2021-06-10 11:48:11,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:11,646 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:11,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2291 [2021-06-10 11:48:11,646 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1658054023, now seen corresponding path program 1 times [2021-06-10 11:48:11,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:11,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753285292] [2021-06-10 11:48:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:11,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:11,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:11,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:11,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:48:11,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753285292] [2021-06-10 11:48:11,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:11,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:11,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646030625] [2021-06-10 11:48:11,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:11,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:11,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:11,671 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:11,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 999 transitions, 2235 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:11,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:11,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:11,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:12,085 INFO L129 PetriNetUnfolder]: 105/1119 cut-off events. [2021-06-10 11:48:12,085 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:12,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1119 events. 105/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4576 event pairs, 0 based on Foata normal form. 2/978 useless extension candidates. Maximal degree in co-relation 1253. Up to 39 conditions per place. [2021-06-10 11:48:12,173 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/997 dead transitions. [2021-06-10 11:48:12,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 997 transitions, 2243 flow [2021-06-10 11:48:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:12,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:12,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:12,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:12,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:12,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,178 INFO L185 Difference]: Start difference. First operand has 982 places, 999 transitions, 2235 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:12,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 997 transitions, 2243 flow [2021-06-10 11:48:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 997 transitions, 2242 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:12,187 INFO L241 Difference]: Finished difference. Result has 983 places, 997 transitions, 2224 flow [2021-06-10 11:48:12,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2224, PETRI_PLACES=983, PETRI_TRANSITIONS=997} [2021-06-10 11:48:12,187 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -26 predicate places. [2021-06-10 11:48:12,187 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 997 transitions, 2224 flow [2021-06-10 11:48:12,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:12,188 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:12,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2292 [2021-06-10 11:48:12,188 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:12,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1658055046, now seen corresponding path program 1 times [2021-06-10 11:48:12,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:12,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086796909] [2021-06-10 11:48:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:12,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:12,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:12,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:48:12,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086796909] [2021-06-10 11:48:12,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:12,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:12,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568437390] [2021-06-10 11:48:12,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:12,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:12,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:12,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 997 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:12,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:12,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:12,633 INFO L129 PetriNetUnfolder]: 105/1116 cut-off events. [2021-06-10 11:48:12,633 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:12,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1116 events. 105/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4555 event pairs, 0 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 1247. Up to 39 conditions per place. [2021-06-10 11:48:12,720 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/994 dead transitions. [2021-06-10 11:48:12,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 994 transitions, 2225 flow [2021-06-10 11:48:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:12,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:12,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:12,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:12,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:12,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:12,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,725 INFO L185 Difference]: Start difference. First operand has 983 places, 997 transitions, 2224 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:12,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 994 transitions, 2225 flow [2021-06-10 11:48:12,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 980 places, 994 transitions, 2220 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:12,735 INFO L241 Difference]: Finished difference. Result has 980 places, 994 transitions, 2210 flow [2021-06-10 11:48:12,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2210, PETRI_PLACES=980, PETRI_TRANSITIONS=994} [2021-06-10 11:48:12,735 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -29 predicate places. [2021-06-10 11:48:12,735 INFO L480 AbstractCegarLoop]: Abstraction has has 980 places, 994 transitions, 2210 flow [2021-06-10 11:48:12,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:12,736 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:12,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2293 [2021-06-10 11:48:12,736 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1118233413, now seen corresponding path program 1 times [2021-06-10 11:48:12,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:12,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250452518] [2021-06-10 11:48:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:12,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:12,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:12,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:12,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:48:12,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250452518] [2021-06-10 11:48:12,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:12,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:12,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490979688] [2021-06-10 11:48:12,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:12,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:12,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:12,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:12,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:12,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 994 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:12,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:12,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:12,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:13,201 INFO L129 PetriNetUnfolder]: 104/1124 cut-off events. [2021-06-10 11:48:13,202 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:13,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 1124 events. 104/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4621 event pairs, 0 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1264. Up to 39 conditions per place. [2021-06-10 11:48:13,291 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2021-06-10 11:48:13,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 996 transitions, 2240 flow [2021-06-10 11:48:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:13,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:13,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:13,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:13,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:13,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:13,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,295 INFO L185 Difference]: Start difference. First operand has 980 places, 994 transitions, 2210 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:13,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 996 transitions, 2240 flow [2021-06-10 11:48:13,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 996 transitions, 2239 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:13,305 INFO L241 Difference]: Finished difference. Result has 983 places, 996 transitions, 2233 flow [2021-06-10 11:48:13,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2233, PETRI_PLACES=983, PETRI_TRANSITIONS=996} [2021-06-10 11:48:13,305 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -26 predicate places. [2021-06-10 11:48:13,305 INFO L480 AbstractCegarLoop]: Abstraction has has 983 places, 996 transitions, 2233 flow [2021-06-10 11:48:13,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,306 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:13,306 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:13,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2294 [2021-06-10 11:48:13,306 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1118234436, now seen corresponding path program 1 times [2021-06-10 11:48:13,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:13,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382229970] [2021-06-10 11:48:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:13,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:13,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:13,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:48:13,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382229970] [2021-06-10 11:48:13,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:13,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:13,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712928165] [2021-06-10 11:48:13,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:13,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:13,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:13,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 996 transitions, 2233 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:13,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:13,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:13,795 INFO L129 PetriNetUnfolder]: 102/1125 cut-off events. [2021-06-10 11:48:13,795 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:13,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1125 events. 102/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4649 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1262. Up to 39 conditions per place. [2021-06-10 11:48:13,877 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/996 dead transitions. [2021-06-10 11:48:13,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 996 transitions, 2245 flow [2021-06-10 11:48:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:13,879 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:13,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:13,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:13,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:13,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:13,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,882 INFO L185 Difference]: Start difference. First operand has 983 places, 996 transitions, 2233 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:13,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 996 transitions, 2245 flow [2021-06-10 11:48:13,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 996 transitions, 2240 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:13,891 INFO L241 Difference]: Finished difference. Result has 985 places, 995 transitions, 2229 flow [2021-06-10 11:48:13,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2229, PETRI_PLACES=985, PETRI_TRANSITIONS=995} [2021-06-10 11:48:13,891 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -24 predicate places. [2021-06-10 11:48:13,891 INFO L480 AbstractCegarLoop]: Abstraction has has 985 places, 995 transitions, 2229 flow [2021-06-10 11:48:13,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,891 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:13,891 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:13,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2295 [2021-06-10 11:48:13,892 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1119186725, now seen corresponding path program 1 times [2021-06-10 11:48:13,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:13,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961001463] [2021-06-10 11:48:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:13,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:13,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:13,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:13,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:48:13,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961001463] [2021-06-10 11:48:13,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:13,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:13,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271831588] [2021-06-10 11:48:13,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:13,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:13,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:13,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:13,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:13,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 995 transitions, 2229 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:13,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:13,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:13,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:14,345 INFO L129 PetriNetUnfolder]: 102/1118 cut-off events. [2021-06-10 11:48:14,346 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:14,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1118 events. 102/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4586 event pairs, 0 based on Foata normal form. 1/980 useless extension candidates. Maximal degree in co-relation 1256. Up to 39 conditions per place. [2021-06-10 11:48:14,434 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/993 dead transitions. [2021-06-10 11:48:14,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 993 transitions, 2232 flow [2021-06-10 11:48:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:14,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:14,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:14,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:14,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:14,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:14,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:14,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:14,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:14,439 INFO L185 Difference]: Start difference. First operand has 985 places, 995 transitions, 2229 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:14,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 993 transitions, 2232 flow [2021-06-10 11:48:14,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 993 transitions, 2225 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:14,449 INFO L241 Difference]: Finished difference. Result has 985 places, 993 transitions, 2218 flow [2021-06-10 11:48:14,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2218, PETRI_PLACES=985, PETRI_TRANSITIONS=993} [2021-06-10 11:48:14,449 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -24 predicate places. [2021-06-10 11:48:14,449 INFO L480 AbstractCegarLoop]: Abstraction has has 985 places, 993 transitions, 2218 flow [2021-06-10 11:48:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:14,449 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:14,449 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:14,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2296 [2021-06-10 11:48:14,449 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:14,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1119187748, now seen corresponding path program 1 times [2021-06-10 11:48:14,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:14,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555597940] [2021-06-10 11:48:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:14,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:14,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:14,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:14,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:14,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:14,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:48:14,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555597940] [2021-06-10 11:48:14,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:14,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:14,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353367301] [2021-06-10 11:48:14,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:14,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:14,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:14,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 993 transitions, 2218 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:14,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:14,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:14,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:14,909 INFO L129 PetriNetUnfolder]: 102/1116 cut-off events. [2021-06-10 11:48:14,909 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:14,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 1116 events. 102/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4569 event pairs, 0 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1256. Up to 39 conditions per place. [2021-06-10 11:48:14,996 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/991 dead transitions. [2021-06-10 11:48:14,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 991 transitions, 2231 flow [2021-06-10 11:48:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:14,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:14,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:14,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:14,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:14,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:15,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,001 INFO L185 Difference]: Start difference. First operand has 985 places, 993 transitions, 2218 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:15,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 991 transitions, 2231 flow [2021-06-10 11:48:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 991 transitions, 2230 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:15,010 INFO L241 Difference]: Finished difference. Result has 984 places, 991 transitions, 2214 flow [2021-06-10 11:48:15,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2214, PETRI_PLACES=984, PETRI_TRANSITIONS=991} [2021-06-10 11:48:15,010 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -25 predicate places. [2021-06-10 11:48:15,011 INFO L480 AbstractCegarLoop]: Abstraction has has 984 places, 991 transitions, 2214 flow [2021-06-10 11:48:15,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:15,011 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:15,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2297 [2021-06-10 11:48:15,011 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash -827491074, now seen corresponding path program 1 times [2021-06-10 11:48:15,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:15,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816385210] [2021-06-10 11:48:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:15,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:15,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:15,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:48:15,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816385210] [2021-06-10 11:48:15,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:15,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:15,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927877949] [2021-06-10 11:48:15,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:15,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:15,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:15,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:15,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 984 places, 991 transitions, 2214 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:15,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:15,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:15,469 INFO L129 PetriNetUnfolder]: 101/1124 cut-off events. [2021-06-10 11:48:15,469 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:15,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1124 events. 101/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4644 event pairs, 0 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1268. Up to 39 conditions per place. [2021-06-10 11:48:15,557 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/993 dead transitions. [2021-06-10 11:48:15,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 993 transitions, 2244 flow [2021-06-10 11:48:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:15,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:15,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:15,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:15,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:15,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:15,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,561 INFO L185 Difference]: Start difference. First operand has 984 places, 991 transitions, 2214 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:15,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 993 transitions, 2244 flow [2021-06-10 11:48:15,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 985 places, 993 transitions, 2243 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:15,570 INFO L241 Difference]: Finished difference. Result has 987 places, 993 transitions, 2237 flow [2021-06-10 11:48:15,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=983, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2237, PETRI_PLACES=987, PETRI_TRANSITIONS=993} [2021-06-10 11:48:15,571 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -22 predicate places. [2021-06-10 11:48:15,571 INFO L480 AbstractCegarLoop]: Abstraction has has 987 places, 993 transitions, 2237 flow [2021-06-10 11:48:15,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:15,571 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:15,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2298 [2021-06-10 11:48:15,571 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -827492097, now seen corresponding path program 1 times [2021-06-10 11:48:15,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:15,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169200800] [2021-06-10 11:48:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:15,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:15,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:15,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:15,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:48:15,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169200800] [2021-06-10 11:48:15,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:15,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:15,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946868860] [2021-06-10 11:48:15,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:15,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:15,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:15,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 993 transitions, 2237 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:15,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:15,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:15,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:16,025 INFO L129 PetriNetUnfolder]: 99/1125 cut-off events. [2021-06-10 11:48:16,025 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:16,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 1125 events. 99/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4663 event pairs, 0 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1268. Up to 39 conditions per place. [2021-06-10 11:48:16,111 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/993 dead transitions. [2021-06-10 11:48:16,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 993 transitions, 2249 flow [2021-06-10 11:48:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:16,112 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:16,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:16,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:16,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:16,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:16,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,115 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,116 INFO L185 Difference]: Start difference. First operand has 987 places, 993 transitions, 2237 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 993 transitions, 2249 flow [2021-06-10 11:48:16,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 993 transitions, 2244 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:16,124 INFO L241 Difference]: Finished difference. Result has 989 places, 992 transitions, 2233 flow [2021-06-10 11:48:16,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=992, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2233, PETRI_PLACES=989, PETRI_TRANSITIONS=992} [2021-06-10 11:48:16,125 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -20 predicate places. [2021-06-10 11:48:16,125 INFO L480 AbstractCegarLoop]: Abstraction has has 989 places, 992 transitions, 2233 flow [2021-06-10 11:48:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:16,125 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:16,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2299 [2021-06-10 11:48:16,125 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -828444386, now seen corresponding path program 1 times [2021-06-10 11:48:16,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:16,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989804588] [2021-06-10 11:48:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:16,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:16,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:16,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:48:16,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989804588] [2021-06-10 11:48:16,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:16,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:16,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052324064] [2021-06-10 11:48:16,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:16,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:16,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:16,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 992 transitions, 2233 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:16,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:16,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:16,571 INFO L129 PetriNetUnfolder]: 99/1118 cut-off events. [2021-06-10 11:48:16,571 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:16,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1118 events. 99/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4605 event pairs, 0 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 1262. Up to 39 conditions per place. [2021-06-10 11:48:16,657 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/990 dead transitions. [2021-06-10 11:48:16,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 990 transitions, 2236 flow [2021-06-10 11:48:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:16,662 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:16,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:16,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:16,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:16,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:16,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,665 INFO L185 Difference]: Start difference. First operand has 989 places, 992 transitions, 2233 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:16,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 990 transitions, 2236 flow [2021-06-10 11:48:16,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 990 transitions, 2229 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:16,674 INFO L241 Difference]: Finished difference. Result has 989 places, 990 transitions, 2222 flow [2021-06-10 11:48:16,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=989, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2222, PETRI_PLACES=989, PETRI_TRANSITIONS=990} [2021-06-10 11:48:16,674 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -20 predicate places. [2021-06-10 11:48:16,674 INFO L480 AbstractCegarLoop]: Abstraction has has 989 places, 990 transitions, 2222 flow [2021-06-10 11:48:16,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:16,674 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:16,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2300 [2021-06-10 11:48:16,675 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash -828445409, now seen corresponding path program 1 times [2021-06-10 11:48:16,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:16,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654221729] [2021-06-10 11:48:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:16,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:16,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:16,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:16,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:48:16,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654221729] [2021-06-10 11:48:16,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:16,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:16,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484489858] [2021-06-10 11:48:16,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:16,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:16,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:16,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 990 transitions, 2222 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:16,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:16,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:16,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:17,120 INFO L129 PetriNetUnfolder]: 99/1116 cut-off events. [2021-06-10 11:48:17,120 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:17,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1116 events. 99/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4591 event pairs, 0 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1262. Up to 39 conditions per place. [2021-06-10 11:48:17,205 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/988 dead transitions. [2021-06-10 11:48:17,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 988 transitions, 2235 flow [2021-06-10 11:48:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:17,207 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:17,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:17,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:17,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:17,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:17,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,210 INFO L185 Difference]: Start difference. First operand has 989 places, 990 transitions, 2222 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:17,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 988 transitions, 2235 flow [2021-06-10 11:48:17,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 988 transitions, 2234 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:17,219 INFO L241 Difference]: Finished difference. Result has 988 places, 988 transitions, 2218 flow [2021-06-10 11:48:17,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2218, PETRI_PLACES=988, PETRI_TRANSITIONS=988} [2021-06-10 11:48:17,219 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -21 predicate places. [2021-06-10 11:48:17,219 INFO L480 AbstractCegarLoop]: Abstraction has has 988 places, 988 transitions, 2218 flow [2021-06-10 11:48:17,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:17,219 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:17,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2301 [2021-06-10 11:48:17,220 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash 662700227, now seen corresponding path program 1 times [2021-06-10 11:48:17,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:17,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251908247] [2021-06-10 11:48:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:17,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:17,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:17,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:48:17,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251908247] [2021-06-10 11:48:17,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:17,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:17,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061028202] [2021-06-10 11:48:17,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:17,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:17,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:17,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 988 transitions, 2218 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:17,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:17,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:17,678 INFO L129 PetriNetUnfolder]: 98/1123 cut-off events. [2021-06-10 11:48:17,678 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:17,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1123 events. 98/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4648 event pairs, 0 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 1267. Up to 39 conditions per place. [2021-06-10 11:48:17,765 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/989 dead transitions. [2021-06-10 11:48:17,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 990 places, 989 transitions, 2234 flow [2021-06-10 11:48:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:17,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:17,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:17,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:17,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:17,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:17,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,831 INFO L185 Difference]: Start difference. First operand has 988 places, 988 transitions, 2218 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:17,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 990 places, 989 transitions, 2234 flow [2021-06-10 11:48:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 989 transitions, 2233 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:17,839 INFO L241 Difference]: Finished difference. Result has 990 places, 988 transitions, 2222 flow [2021-06-10 11:48:17,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2222, PETRI_PLACES=990, PETRI_TRANSITIONS=988} [2021-06-10 11:48:17,839 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -19 predicate places. [2021-06-10 11:48:17,839 INFO L480 AbstractCegarLoop]: Abstraction has has 990 places, 988 transitions, 2222 flow [2021-06-10 11:48:17,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:17,840 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:17,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2302 [2021-06-10 11:48:17,840 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash 662701250, now seen corresponding path program 1 times [2021-06-10 11:48:17,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:17,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290604349] [2021-06-10 11:48:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:17,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:17,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:17,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:17,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:48:17,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290604349] [2021-06-10 11:48:17,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:17,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:17,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946313722] [2021-06-10 11:48:17,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:17,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:17,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:17,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 988 transitions, 2222 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:17,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:17,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:17,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:18,302 INFO L129 PetriNetUnfolder]: 96/1125 cut-off events. [2021-06-10 11:48:18,302 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:18,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1125 events. 96/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4679 event pairs, 0 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1278. Up to 39 conditions per place. [2021-06-10 11:48:18,388 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/989 dead transitions. [2021-06-10 11:48:18,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 989 transitions, 2248 flow [2021-06-10 11:48:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:18,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:18,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:18,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:18,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:18,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:18,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,397 INFO L185 Difference]: Start difference. First operand has 990 places, 988 transitions, 2222 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 992 places, 989 transitions, 2248 flow [2021-06-10 11:48:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 989 transitions, 2247 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:18,406 INFO L241 Difference]: Finished difference. Result has 993 places, 989 transitions, 2239 flow [2021-06-10 11:48:18,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2239, PETRI_PLACES=993, PETRI_TRANSITIONS=989} [2021-06-10 11:48:18,407 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -16 predicate places. [2021-06-10 11:48:18,407 INFO L480 AbstractCegarLoop]: Abstraction has has 993 places, 989 transitions, 2239 flow [2021-06-10 11:48:18,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:18,407 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:18,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2303 [2021-06-10 11:48:18,407 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash 661747938, now seen corresponding path program 1 times [2021-06-10 11:48:18,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:18,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391616676] [2021-06-10 11:48:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:18,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:18,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:18,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:48:18,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391616676] [2021-06-10 11:48:18,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:18,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:18,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917981] [2021-06-10 11:48:18,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:18,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:18,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:18,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 989 transitions, 2239 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:18,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:18,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:18,875 INFO L129 PetriNetUnfolder]: 96/1118 cut-off events. [2021-06-10 11:48:18,875 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:18,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1118 events. 96/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4621 event pairs, 0 based on Foata normal form. 1/986 useless extension candidates. Maximal degree in co-relation 1264. Up to 39 conditions per place. [2021-06-10 11:48:18,959 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/987 dead transitions. [2021-06-10 11:48:18,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 987 transitions, 2241 flow [2021-06-10 11:48:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:18,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:18,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:18,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:18,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:18,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:18,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,964 INFO L185 Difference]: Start difference. First operand has 993 places, 989 transitions, 2239 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:18,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 987 transitions, 2241 flow [2021-06-10 11:48:18,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 987 transitions, 2233 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:18,973 INFO L241 Difference]: Finished difference. Result has 993 places, 987 transitions, 2226 flow [2021-06-10 11:48:18,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=987, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2226, PETRI_PLACES=993, PETRI_TRANSITIONS=987} [2021-06-10 11:48:18,973 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -16 predicate places. [2021-06-10 11:48:18,973 INFO L480 AbstractCegarLoop]: Abstraction has has 993 places, 987 transitions, 2226 flow [2021-06-10 11:48:18,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:18,974 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:18,974 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:18,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2304 [2021-06-10 11:48:18,974 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash 661746915, now seen corresponding path program 1 times [2021-06-10 11:48:18,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:18,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248021166] [2021-06-10 11:48:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:18,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:18,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:18,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:18,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:48:18,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248021166] [2021-06-10 11:48:18,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:18,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:18,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573217606] [2021-06-10 11:48:18,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:18,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:18,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:19,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 987 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:19,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:19,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:19,426 INFO L129 PetriNetUnfolder]: 96/1116 cut-off events. [2021-06-10 11:48:19,427 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:19,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1116 events. 96/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4604 event pairs, 0 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1268. Up to 39 conditions per place. [2021-06-10 11:48:19,512 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/985 dead transitions. [2021-06-10 11:48:19,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 985 transitions, 2239 flow [2021-06-10 11:48:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:19,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:19,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:19,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:19,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:19,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:19,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,517 INFO L185 Difference]: Start difference. First operand has 993 places, 987 transitions, 2226 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:19,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 985 transitions, 2239 flow [2021-06-10 11:48:19,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 985 transitions, 2238 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:19,527 INFO L241 Difference]: Finished difference. Result has 992 places, 985 transitions, 2222 flow [2021-06-10 11:48:19,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2222, PETRI_PLACES=992, PETRI_TRANSITIONS=985} [2021-06-10 11:48:19,527 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -17 predicate places. [2021-06-10 11:48:19,527 INFO L480 AbstractCegarLoop]: Abstraction has has 992 places, 985 transitions, 2222 flow [2021-06-10 11:48:19,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:19,527 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:19,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2305 [2021-06-10 11:48:19,528 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 634896296, now seen corresponding path program 1 times [2021-06-10 11:48:19,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:19,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687161772] [2021-06-10 11:48:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:19,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:19,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:19,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:19,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:19,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:19,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:48:19,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687161772] [2021-06-10 11:48:19,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:19,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:19,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788692592] [2021-06-10 11:48:19,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:19,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:19,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:19,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 985 transitions, 2222 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:19,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:19,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:19,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:20,014 INFO L129 PetriNetUnfolder]: 95/1124 cut-off events. [2021-06-10 11:48:20,014 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:20,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1124 events. 95/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4677 event pairs, 0 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 1280. Up to 39 conditions per place. [2021-06-10 11:48:20,074 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2021-06-10 11:48:20,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 987 transitions, 2252 flow [2021-06-10 11:48:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:20,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:20,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:20,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:20,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:20,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:20,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,078 INFO L185 Difference]: Start difference. First operand has 992 places, 985 transitions, 2222 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:20,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 987 transitions, 2252 flow [2021-06-10 11:48:20,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 987 transitions, 2251 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:20,087 INFO L241 Difference]: Finished difference. Result has 995 places, 987 transitions, 2245 flow [2021-06-10 11:48:20,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2245, PETRI_PLACES=995, PETRI_TRANSITIONS=987} [2021-06-10 11:48:20,087 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -14 predicate places. [2021-06-10 11:48:20,087 INFO L480 AbstractCegarLoop]: Abstraction has has 995 places, 987 transitions, 2245 flow [2021-06-10 11:48:20,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:20,087 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:20,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2306 [2021-06-10 11:48:20,087 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash 634897319, now seen corresponding path program 1 times [2021-06-10 11:48:20,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:20,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323044300] [2021-06-10 11:48:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:20,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:20,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:20,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:48:20,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323044300] [2021-06-10 11:48:20,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:20,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:20,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144693551] [2021-06-10 11:48:20,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:20,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:20,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:20,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 987 transitions, 2245 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:20,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:20,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:20,544 INFO L129 PetriNetUnfolder]: 94/1122 cut-off events. [2021-06-10 11:48:20,544 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:20,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 1122 events. 94/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4663 event pairs, 0 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1277. Up to 39 conditions per place. [2021-06-10 11:48:20,632 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/987 dead transitions. [2021-06-10 11:48:20,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 987 transitions, 2257 flow [2021-06-10 11:48:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:20,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:20,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:20,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:20,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:20,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:20,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,637 INFO L185 Difference]: Start difference. First operand has 995 places, 987 transitions, 2245 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:20,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 987 transitions, 2257 flow [2021-06-10 11:48:20,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 987 transitions, 2252 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:20,646 INFO L241 Difference]: Finished difference. Result has 998 places, 987 transitions, 2250 flow [2021-06-10 11:48:20,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2250, PETRI_PLACES=998, PETRI_TRANSITIONS=987} [2021-06-10 11:48:20,647 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -11 predicate places. [2021-06-10 11:48:20,647 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 987 transitions, 2250 flow [2021-06-10 11:48:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,647 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:20,647 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:20,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2307 [2021-06-10 11:48:20,647 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 635849608, now seen corresponding path program 1 times [2021-06-10 11:48:20,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:20,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358744] [2021-06-10 11:48:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:20,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:20,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:20,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:20,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:48:20,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358744] [2021-06-10 11:48:20,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:20,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:20,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500486122] [2021-06-10 11:48:20,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:20,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:20,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:20,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 987 transitions, 2250 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:20,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:20,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:20,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:21,098 INFO L129 PetriNetUnfolder]: 93/1118 cut-off events. [2021-06-10 11:48:21,098 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:48:21,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 1118 events. 93/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4639 event pairs, 0 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 1274. Up to 39 conditions per place. [2021-06-10 11:48:21,182 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/984 dead transitions. [2021-06-10 11:48:21,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 984 transitions, 2247 flow [2021-06-10 11:48:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:21,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:21,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:21,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:21,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:21,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:21,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,187 INFO L185 Difference]: Start difference. First operand has 998 places, 987 transitions, 2250 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:21,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 984 transitions, 2247 flow [2021-06-10 11:48:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 984 transitions, 2240 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:21,197 INFO L241 Difference]: Finished difference. Result has 997 places, 984 transitions, 2230 flow [2021-06-10 11:48:21,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2230, PETRI_PLACES=997, PETRI_TRANSITIONS=984} [2021-06-10 11:48:21,197 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -12 predicate places. [2021-06-10 11:48:21,197 INFO L480 AbstractCegarLoop]: Abstraction has has 997 places, 984 transitions, 2230 flow [2021-06-10 11:48:21,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:21,197 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:21,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2308 [2021-06-10 11:48:21,197 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash 635850631, now seen corresponding path program 1 times [2021-06-10 11:48:21,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:21,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303080005] [2021-06-10 11:48:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:21,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:21,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:21,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:48:21,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303080005] [2021-06-10 11:48:21,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:21,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:21,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356751235] [2021-06-10 11:48:21,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:21,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:21,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:21,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:21,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 984 transitions, 2230 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:21,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:21,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:21,666 INFO L129 PetriNetUnfolder]: 93/1116 cut-off events. [2021-06-10 11:48:21,666 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:21,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1116 events. 93/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4621 event pairs, 0 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1275. Up to 39 conditions per place. [2021-06-10 11:48:21,754 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/982 dead transitions. [2021-06-10 11:48:21,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 982 transitions, 2243 flow [2021-06-10 11:48:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:21,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:21,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:21,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:21,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:21,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:21,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,759 INFO L185 Difference]: Start difference. First operand has 997 places, 984 transitions, 2230 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:21,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 982 transitions, 2243 flow [2021-06-10 11:48:21,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 982 transitions, 2242 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:21,769 INFO L241 Difference]: Finished difference. Result has 996 places, 982 transitions, 2226 flow [2021-06-10 11:48:21,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2226, PETRI_PLACES=996, PETRI_TRANSITIONS=982} [2021-06-10 11:48:21,770 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -13 predicate places. [2021-06-10 11:48:21,770 INFO L480 AbstractCegarLoop]: Abstraction has has 996 places, 982 transitions, 2226 flow [2021-06-10 11:48:21,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,770 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:21,770 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:21,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2309 [2021-06-10 11:48:21,770 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash -227740947, now seen corresponding path program 1 times [2021-06-10 11:48:21,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:21,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308224778] [2021-06-10 11:48:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:21,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:21,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:21,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:21,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:48:21,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308224778] [2021-06-10 11:48:21,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:21,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:21,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245149433] [2021-06-10 11:48:21,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:21,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:21,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:21,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 982 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:21,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:21,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:21,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:22,225 INFO L129 PetriNetUnfolder]: 91/1121 cut-off events. [2021-06-10 11:48:22,226 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:22,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 1121 events. 91/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4675 event pairs, 0 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1278. Up to 39 conditions per place. [2021-06-10 11:48:22,297 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/983 dead transitions. [2021-06-10 11:48:22,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 983 transitions, 2242 flow [2021-06-10 11:48:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:22,299 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:22,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:22,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:22,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:22,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:22,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,302 INFO L185 Difference]: Start difference. First operand has 996 places, 982 transitions, 2226 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:22,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 983 transitions, 2242 flow [2021-06-10 11:48:22,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 983 transitions, 2241 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:22,311 INFO L241 Difference]: Finished difference. Result has 999 places, 983 transitions, 2239 flow [2021-06-10 11:48:22,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=980, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2239, PETRI_PLACES=999, PETRI_TRANSITIONS=983} [2021-06-10 11:48:22,311 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -10 predicate places. [2021-06-10 11:48:22,311 INFO L480 AbstractCegarLoop]: Abstraction has has 999 places, 983 transitions, 2239 flow [2021-06-10 11:48:22,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,311 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:22,311 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:22,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2310 [2021-06-10 11:48:22,311 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash -227741970, now seen corresponding path program 1 times [2021-06-10 11:48:22,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:22,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60013383] [2021-06-10 11:48:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:22,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:22,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:22,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:48:22,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60013383] [2021-06-10 11:48:22,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:22,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:22,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650243325] [2021-06-10 11:48:22,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:22,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:22,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:22,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 983 transitions, 2239 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:22,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:22,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:22,774 INFO L129 PetriNetUnfolder]: 91/1122 cut-off events. [2021-06-10 11:48:22,774 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:22,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1122 events. 91/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4680 event pairs, 0 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1286. Up to 39 conditions per place. [2021-06-10 11:48:22,860 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/984 dead transitions. [2021-06-10 11:48:22,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 984 transitions, 2265 flow [2021-06-10 11:48:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:22,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:22,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:22,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:22,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:22,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:22,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,865 INFO L185 Difference]: Start difference. First operand has 999 places, 983 transitions, 2239 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:22,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 984 transitions, 2265 flow [2021-06-10 11:48:22,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 984 transitions, 2263 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:22,874 INFO L241 Difference]: Finished difference. Result has 1002 places, 984 transitions, 2255 flow [2021-06-10 11:48:22,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=980, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2255, PETRI_PLACES=1002, PETRI_TRANSITIONS=984} [2021-06-10 11:48:22,875 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -7 predicate places. [2021-06-10 11:48:22,875 INFO L480 AbstractCegarLoop]: Abstraction has has 1002 places, 984 transitions, 2255 flow [2021-06-10 11:48:22,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:22,875 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:22,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2311 [2021-06-10 11:48:22,875 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash -226787635, now seen corresponding path program 1 times [2021-06-10 11:48:22,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:22,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913321724] [2021-06-10 11:48:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:22,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:22,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:22,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:22,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:48:22,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913321724] [2021-06-10 11:48:22,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:22,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:22,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798882464] [2021-06-10 11:48:22,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:22,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:22,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:22,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:22,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:22,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 984 transitions, 2255 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:22,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:22,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:22,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:23,338 INFO L129 PetriNetUnfolder]: 90/1119 cut-off events. [2021-06-10 11:48:23,338 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:23,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1119 events. 90/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4664 event pairs, 0 based on Foata normal form. 2/993 useless extension candidates. Maximal degree in co-relation 1285. Up to 39 conditions per place. [2021-06-10 11:48:23,423 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/982 dead transitions. [2021-06-10 11:48:23,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 982 transitions, 2263 flow [2021-06-10 11:48:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:23,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:23,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:23,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:23,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:23,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:23,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:23,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:23,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:23,428 INFO L185 Difference]: Start difference. First operand has 1002 places, 984 transitions, 2255 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:23,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 982 transitions, 2263 flow [2021-06-10 11:48:23,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 982 transitions, 2262 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:23,438 INFO L241 Difference]: Finished difference. Result has 1003 places, 982 transitions, 2244 flow [2021-06-10 11:48:23,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=981, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2244, PETRI_PLACES=1003, PETRI_TRANSITIONS=982} [2021-06-10 11:48:23,438 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -6 predicate places. [2021-06-10 11:48:23,438 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 982 transitions, 2244 flow [2021-06-10 11:48:23,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:23,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:23,438 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:23,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2312 [2021-06-10 11:48:23,438 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash -226788658, now seen corresponding path program 1 times [2021-06-10 11:48:23,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:23,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110587172] [2021-06-10 11:48:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:23,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:23,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:23,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:23,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:23,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:23,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:48:23,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110587172] [2021-06-10 11:48:23,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:23,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:23,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747735173] [2021-06-10 11:48:23,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:23,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:23,464 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:23,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 982 transitions, 2244 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:23,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:23,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:23,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:23,907 INFO L129 PetriNetUnfolder]: 90/1116 cut-off events. [2021-06-10 11:48:23,907 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:23,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 1116 events. 90/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4643 event pairs, 0 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1279. Up to 39 conditions per place. [2021-06-10 11:48:24,001 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/979 dead transitions. [2021-06-10 11:48:24,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 979 transitions, 2245 flow [2021-06-10 11:48:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:24,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:24,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:24,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:24,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:24,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:24,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,006 INFO L185 Difference]: Start difference. First operand has 1003 places, 982 transitions, 2244 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:24,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 979 transitions, 2245 flow [2021-06-10 11:48:24,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 979 transitions, 2240 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:24,017 INFO L241 Difference]: Finished difference. Result has 1000 places, 979 transitions, 2230 flow [2021-06-10 11:48:24,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2230, PETRI_PLACES=1000, PETRI_TRANSITIONS=979} [2021-06-10 11:48:24,017 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -9 predicate places. [2021-06-10 11:48:24,017 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 979 transitions, 2230 flow [2021-06-10 11:48:24,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:24,017 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:24,018 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2313 [2021-06-10 11:48:24,018 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1868599348, now seen corresponding path program 1 times [2021-06-10 11:48:24,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:24,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613317296] [2021-06-10 11:48:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:24,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:24,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:24,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:48:24,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613317296] [2021-06-10 11:48:24,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:24,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:24,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193688273] [2021-06-10 11:48:24,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:24,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:24,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:24,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 979 transitions, 2230 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:24,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:24,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:24,530 INFO L129 PetriNetUnfolder]: 88/1121 cut-off events. [2021-06-10 11:48:24,530 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:24,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1121 events. 88/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4692 event pairs, 0 based on Foata normal form. 0/993 useless extension candidates. Maximal degree in co-relation 1287. Up to 39 conditions per place. [2021-06-10 11:48:24,613 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/980 dead transitions. [2021-06-10 11:48:24,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 980 transitions, 2246 flow [2021-06-10 11:48:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:24,615 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:24,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:24,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:24,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:24,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:24,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,618 INFO L185 Difference]: Start difference. First operand has 1000 places, 979 transitions, 2230 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:24,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 980 transitions, 2246 flow [2021-06-10 11:48:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 980 transitions, 2245 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:24,627 INFO L241 Difference]: Finished difference. Result has 1003 places, 980 transitions, 2243 flow [2021-06-10 11:48:24,627 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2229, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2243, PETRI_PLACES=1003, PETRI_TRANSITIONS=980} [2021-06-10 11:48:24,628 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -6 predicate places. [2021-06-10 11:48:24,628 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 980 transitions, 2243 flow [2021-06-10 11:48:24,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:24,628 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:24,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2314 [2021-06-10 11:48:24,628 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1868598325, now seen corresponding path program 1 times [2021-06-10 11:48:24,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:24,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150981487] [2021-06-10 11:48:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:24,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:24,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:24,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:24,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:48:24,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150981487] [2021-06-10 11:48:24,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:24,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:24,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974101726] [2021-06-10 11:48:24,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:24,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:24,654 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:24,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 980 transitions, 2243 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:24,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:24,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:24,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:25,105 INFO L129 PetriNetUnfolder]: 88/1122 cut-off events. [2021-06-10 11:48:25,105 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:25,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1122 events. 88/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4698 event pairs, 0 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1293. Up to 39 conditions per place. [2021-06-10 11:48:25,193 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/981 dead transitions. [2021-06-10 11:48:25,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 981 transitions, 2269 flow [2021-06-10 11:48:25,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:25,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:25,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:25,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:25,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:25,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:25,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,198 INFO L185 Difference]: Start difference. First operand has 1003 places, 980 transitions, 2243 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:25,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 981 transitions, 2269 flow [2021-06-10 11:48:25,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 981 transitions, 2267 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:25,207 INFO L241 Difference]: Finished difference. Result has 1006 places, 981 transitions, 2259 flow [2021-06-10 11:48:25,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=980, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2259, PETRI_PLACES=1006, PETRI_TRANSITIONS=981} [2021-06-10 11:48:25,208 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -3 predicate places. [2021-06-10 11:48:25,208 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 981 transitions, 2259 flow [2021-06-10 11:48:25,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:25,208 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:25,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2315 [2021-06-10 11:48:25,208 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:25,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:25,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1869552660, now seen corresponding path program 1 times [2021-06-10 11:48:25,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:25,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012093533] [2021-06-10 11:48:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:25,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:25,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:25,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:48:25,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012093533] [2021-06-10 11:48:25,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:25,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:25,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023675621] [2021-06-10 11:48:25,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:25,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:25,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:25,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 981 transitions, 2259 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:25,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:25,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:25,683 INFO L129 PetriNetUnfolder]: 87/1119 cut-off events. [2021-06-10 11:48:25,683 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:25,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1119 events. 87/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4683 event pairs, 0 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 1292. Up to 39 conditions per place. [2021-06-10 11:48:25,766 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/979 dead transitions. [2021-06-10 11:48:25,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 979 transitions, 2267 flow [2021-06-10 11:48:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:25,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:25,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:25,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:25,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:25,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:25,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,771 INFO L185 Difference]: Start difference. First operand has 1006 places, 981 transitions, 2259 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:25,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 979 transitions, 2267 flow [2021-06-10 11:48:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 979 transitions, 2266 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:25,780 INFO L241 Difference]: Finished difference. Result has 1007 places, 979 transitions, 2248 flow [2021-06-10 11:48:25,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=1007, PETRI_TRANSITIONS=979} [2021-06-10 11:48:25,780 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -2 predicate places. [2021-06-10 11:48:25,780 INFO L480 AbstractCegarLoop]: Abstraction has has 1007 places, 979 transitions, 2248 flow [2021-06-10 11:48:25,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:25,781 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:25,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2316 [2021-06-10 11:48:25,781 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1869551637, now seen corresponding path program 1 times [2021-06-10 11:48:25,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:25,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398366280] [2021-06-10 11:48:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:25,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:25,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:25,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:25,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:48:25,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398366280] [2021-06-10 11:48:25,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:25,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:25,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021330727] [2021-06-10 11:48:25,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:25,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:25,807 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:25,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 979 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:25,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:25,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:25,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:26,295 INFO L129 PetriNetUnfolder]: 87/1116 cut-off events. [2021-06-10 11:48:26,295 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:26,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 1116 events. 87/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4658 event pairs, 0 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1286. Up to 39 conditions per place. [2021-06-10 11:48:26,345 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/976 dead transitions. [2021-06-10 11:48:26,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 976 transitions, 2249 flow [2021-06-10 11:48:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:26,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:26,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:26,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:26,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:26,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:26,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,350 INFO L185 Difference]: Start difference. First operand has 1007 places, 979 transitions, 2248 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:26,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 976 transitions, 2249 flow [2021-06-10 11:48:26,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 976 transitions, 2244 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:26,358 INFO L241 Difference]: Finished difference. Result has 1004 places, 976 transitions, 2234 flow [2021-06-10 11:48:26,359 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2232, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2234, PETRI_PLACES=1004, PETRI_TRANSITIONS=976} [2021-06-10 11:48:26,359 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -5 predicate places. [2021-06-10 11:48:26,359 INFO L480 AbstractCegarLoop]: Abstraction has has 1004 places, 976 transitions, 2234 flow [2021-06-10 11:48:26,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:26,359 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:26,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2317 [2021-06-10 11:48:26,359 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash 227329245, now seen corresponding path program 1 times [2021-06-10 11:48:26,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:26,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883249518] [2021-06-10 11:48:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:26,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:26,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:26,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:48:26,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883249518] [2021-06-10 11:48:26,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:26,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:26,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515905162] [2021-06-10 11:48:26,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:26,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:26,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:26,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 976 transitions, 2234 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:26,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:26,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:26,820 INFO L129 PetriNetUnfolder]: 86/1123 cut-off events. [2021-06-10 11:48:26,820 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:26,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1123 events. 86/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4719 event pairs, 0 based on Foata normal form. 0/997 useless extension candidates. Maximal degree in co-relation 1296. Up to 39 conditions per place. [2021-06-10 11:48:26,903 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/977 dead transitions. [2021-06-10 11:48:26,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 977 transitions, 2250 flow [2021-06-10 11:48:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:26,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:26,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:26,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:26,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:26,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:26,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,908 INFO L185 Difference]: Start difference. First operand has 1004 places, 976 transitions, 2234 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:26,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 977 transitions, 2250 flow [2021-06-10 11:48:26,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 977 transitions, 2249 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:26,917 INFO L241 Difference]: Finished difference. Result has 1006 places, 976 transitions, 2238 flow [2021-06-10 11:48:26,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2238, PETRI_PLACES=1006, PETRI_TRANSITIONS=976} [2021-06-10 11:48:26,917 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -3 predicate places. [2021-06-10 11:48:26,917 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 976 transitions, 2238 flow [2021-06-10 11:48:26,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:26,918 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:26,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2318 [2021-06-10 11:48:26,918 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 227330268, now seen corresponding path program 1 times [2021-06-10 11:48:26,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:26,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278690123] [2021-06-10 11:48:26,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:26,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:26,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:26,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:26,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:48:26,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278690123] [2021-06-10 11:48:26,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:26,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:26,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111865096] [2021-06-10 11:48:26,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:26,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:26,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:26,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:26,944 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:26,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 976 transitions, 2238 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:26,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:26,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:26,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:27,385 INFO L129 PetriNetUnfolder]: 84/1125 cut-off events. [2021-06-10 11:48:27,385 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:27,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1125 events. 84/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4751 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1305. Up to 39 conditions per place. [2021-06-10 11:48:27,468 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/977 dead transitions. [2021-06-10 11:48:27,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 977 transitions, 2264 flow [2021-06-10 11:48:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:27,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:27,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:27,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:27,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:27,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:27,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:27,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:27,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:27,473 INFO L185 Difference]: Start difference. First operand has 1006 places, 976 transitions, 2238 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 977 transitions, 2264 flow [2021-06-10 11:48:27,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 977 transitions, 2263 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:27,482 INFO L241 Difference]: Finished difference. Result has 1009 places, 977 transitions, 2255 flow [2021-06-10 11:48:27,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2255, PETRI_PLACES=1009, PETRI_TRANSITIONS=977} [2021-06-10 11:48:27,482 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 0 predicate places. [2021-06-10 11:48:27,483 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 977 transitions, 2255 flow [2021-06-10 11:48:27,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:27,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:27,483 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:27,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2319 [2021-06-10 11:48:27,483 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 226376956, now seen corresponding path program 1 times [2021-06-10 11:48:27,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:27,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655909448] [2021-06-10 11:48:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:27,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:27,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:27,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:27,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:27,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:27,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:48:27,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655909448] [2021-06-10 11:48:27,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:27,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:27,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45207189] [2021-06-10 11:48:27,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:27,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:27,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:27,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 977 transitions, 2255 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:27,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:27,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:27,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:27,948 INFO L129 PetriNetUnfolder]: 84/1118 cut-off events. [2021-06-10 11:48:27,948 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:28,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1118 events. 84/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4691 event pairs, 0 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 1291. Up to 39 conditions per place. [2021-06-10 11:48:28,029 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/975 dead transitions. [2021-06-10 11:48:28,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1011 places, 975 transitions, 2257 flow [2021-06-10 11:48:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:28,031 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:28,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:28,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:28,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:28,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:28,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,034 INFO L185 Difference]: Start difference. First operand has 1009 places, 977 transitions, 2255 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:28,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1011 places, 975 transitions, 2257 flow [2021-06-10 11:48:28,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 975 transitions, 2249 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:28,044 INFO L241 Difference]: Finished difference. Result has 1009 places, 975 transitions, 2242 flow [2021-06-10 11:48:28,044 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2242, PETRI_PLACES=1009, PETRI_TRANSITIONS=975} [2021-06-10 11:48:28,044 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 0 predicate places. [2021-06-10 11:48:28,044 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 975 transitions, 2242 flow [2021-06-10 11:48:28,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:28,045 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:28,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2320 [2021-06-10 11:48:28,045 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash 226375933, now seen corresponding path program 1 times [2021-06-10 11:48:28,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:28,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616596696] [2021-06-10 11:48:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:28,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:28,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:28,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:48:28,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616596696] [2021-06-10 11:48:28,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:28,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:28,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432444840] [2021-06-10 11:48:28,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:28,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:28,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:28,072 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:28,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 975 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:28,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:28,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:28,502 INFO L129 PetriNetUnfolder]: 84/1116 cut-off events. [2021-06-10 11:48:28,502 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:28,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1116 events. 84/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4674 event pairs, 0 based on Foata normal form. 0/994 useless extension candidates. Maximal degree in co-relation 1295. Up to 39 conditions per place. [2021-06-10 11:48:28,569 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2021-06-10 11:48:28,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 973 transitions, 2255 flow [2021-06-10 11:48:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:28,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:28,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:28,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:28,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:28,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:28,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,574 INFO L185 Difference]: Start difference. First operand has 1009 places, 975 transitions, 2242 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:28,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 973 transitions, 2255 flow [2021-06-10 11:48:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 973 transitions, 2254 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:28,583 INFO L241 Difference]: Finished difference. Result has 1008 places, 973 transitions, 2238 flow [2021-06-10 11:48:28,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2238, PETRI_PLACES=1008, PETRI_TRANSITIONS=973} [2021-06-10 11:48:28,584 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, -1 predicate places. [2021-06-10 11:48:28,584 INFO L480 AbstractCegarLoop]: Abstraction has has 1008 places, 973 transitions, 2238 flow [2021-06-10 11:48:28,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:28,584 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:28,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2321 [2021-06-10 11:48:28,584 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1973048518, now seen corresponding path program 1 times [2021-06-10 11:48:28,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:28,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485729924] [2021-06-10 11:48:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:28,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:28,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:28,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:28,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:48:28,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485729924] [2021-06-10 11:48:28,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:28,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:28,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109707997] [2021-06-10 11:48:28,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:28,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:28,611 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:28,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 973 transitions, 2238 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:28,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:28,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:28,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:29,060 INFO L129 PetriNetUnfolder]: 83/1124 cut-off events. [2021-06-10 11:48:29,060 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:29,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1124 events. 83/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4745 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1307. Up to 39 conditions per place. [2021-06-10 11:48:29,148 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/975 dead transitions. [2021-06-10 11:48:29,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 975 transitions, 2268 flow [2021-06-10 11:48:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:29,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:29,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:29,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:29,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:29,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:29,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,154 INFO L185 Difference]: Start difference. First operand has 1008 places, 973 transitions, 2238 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:29,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 975 transitions, 2268 flow [2021-06-10 11:48:29,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 975 transitions, 2267 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:29,164 INFO L241 Difference]: Finished difference. Result has 1011 places, 975 transitions, 2261 flow [2021-06-10 11:48:29,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2261, PETRI_PLACES=1011, PETRI_TRANSITIONS=975} [2021-06-10 11:48:29,164 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 2 predicate places. [2021-06-10 11:48:29,164 INFO L480 AbstractCegarLoop]: Abstraction has has 1011 places, 975 transitions, 2261 flow [2021-06-10 11:48:29,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,165 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:29,165 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:29,165 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2322 [2021-06-10 11:48:29,165 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1973049541, now seen corresponding path program 1 times [2021-06-10 11:48:29,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:29,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565261654] [2021-06-10 11:48:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:29,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:29,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:29,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:48:29,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565261654] [2021-06-10 11:48:29,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:29,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:29,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371808389] [2021-06-10 11:48:29,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:29,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:29,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:29,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 975 transitions, 2261 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:29,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:29,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:29,640 INFO L129 PetriNetUnfolder]: 82/1122 cut-off events. [2021-06-10 11:48:29,640 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:29,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1122 events. 82/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4734 event pairs, 0 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 1304. Up to 39 conditions per place. [2021-06-10 11:48:29,724 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/975 dead transitions. [2021-06-10 11:48:29,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 975 transitions, 2273 flow [2021-06-10 11:48:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:29,726 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:29,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:29,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:29,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:29,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:29,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,729 INFO L185 Difference]: Start difference. First operand has 1011 places, 975 transitions, 2261 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:29,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 975 transitions, 2273 flow [2021-06-10 11:48:29,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 975 transitions, 2268 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:29,739 INFO L241 Difference]: Finished difference. Result has 1014 places, 975 transitions, 2266 flow [2021-06-10 11:48:29,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2266, PETRI_PLACES=1014, PETRI_TRANSITIONS=975} [2021-06-10 11:48:29,739 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 5 predicate places. [2021-06-10 11:48:29,739 INFO L480 AbstractCegarLoop]: Abstraction has has 1014 places, 975 transitions, 2266 flow [2021-06-10 11:48:29,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:29,740 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:29,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2323 [2021-06-10 11:48:29,740 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:29,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1974001830, now seen corresponding path program 1 times [2021-06-10 11:48:29,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:29,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018310754] [2021-06-10 11:48:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:29,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:29,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:29,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:29,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:48:29,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018310754] [2021-06-10 11:48:29,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:29,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:29,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985426974] [2021-06-10 11:48:29,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:29,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:29,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:29,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 975 transitions, 2266 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:29,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:29,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:29,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:30,208 INFO L129 PetriNetUnfolder]: 81/1118 cut-off events. [2021-06-10 11:48:30,208 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:48:30,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1118 events. 81/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4708 event pairs, 0 based on Foata normal form. 1/1001 useless extension candidates. Maximal degree in co-relation 1301. Up to 39 conditions per place. [2021-06-10 11:48:30,289 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/972 dead transitions. [2021-06-10 11:48:30,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 972 transitions, 2263 flow [2021-06-10 11:48:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:30,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:30,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:30,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:30,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:30,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:30,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,294 INFO L185 Difference]: Start difference. First operand has 1014 places, 975 transitions, 2266 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:30,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 972 transitions, 2263 flow [2021-06-10 11:48:30,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 972 transitions, 2256 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:30,303 INFO L241 Difference]: Finished difference. Result has 1013 places, 972 transitions, 2246 flow [2021-06-10 11:48:30,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=971, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2246, PETRI_PLACES=1013, PETRI_TRANSITIONS=972} [2021-06-10 11:48:30,304 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 4 predicate places. [2021-06-10 11:48:30,304 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 972 transitions, 2246 flow [2021-06-10 11:48:30,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:30,304 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:30,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2324 [2021-06-10 11:48:30,304 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1974002853, now seen corresponding path program 1 times [2021-06-10 11:48:30,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:30,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638200309] [2021-06-10 11:48:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:30,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:30,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:30,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:48:30,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638200309] [2021-06-10 11:48:30,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:30,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:30,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885616026] [2021-06-10 11:48:30,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:30,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:30,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:30,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 972 transitions, 2246 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:30,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:30,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:30,781 INFO L129 PetriNetUnfolder]: 81/1116 cut-off events. [2021-06-10 11:48:30,781 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:30,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1116 events. 81/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4695 event pairs, 0 based on Foata normal form. 0/997 useless extension candidates. Maximal degree in co-relation 1302. Up to 39 conditions per place. [2021-06-10 11:48:30,860 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/970 dead transitions. [2021-06-10 11:48:30,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 970 transitions, 2259 flow [2021-06-10 11:48:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:30,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:30,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:30,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:30,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:30,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:30,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,865 INFO L185 Difference]: Start difference. First operand has 1013 places, 972 transitions, 2246 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:30,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 970 transitions, 2259 flow [2021-06-10 11:48:30,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 970 transitions, 2258 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:30,874 INFO L241 Difference]: Finished difference. Result has 1012 places, 970 transitions, 2242 flow [2021-06-10 11:48:30,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2242, PETRI_PLACES=1012, PETRI_TRANSITIONS=970} [2021-06-10 11:48:30,874 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 3 predicate places. [2021-06-10 11:48:30,874 INFO L480 AbstractCegarLoop]: Abstraction has has 1012 places, 970 transitions, 2242 flow [2021-06-10 11:48:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:30,875 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:30,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2325 [2021-06-10 11:48:30,875 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash 363329551, now seen corresponding path program 1 times [2021-06-10 11:48:30,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:30,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163170483] [2021-06-10 11:48:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:30,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:30,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:30,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:30,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:48:30,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163170483] [2021-06-10 11:48:30,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:30,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:30,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700732292] [2021-06-10 11:48:30,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:30,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:30,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:30,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 970 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:30,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:30,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:30,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:31,347 INFO L129 PetriNetUnfolder]: 79/1121 cut-off events. [2021-06-10 11:48:31,347 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:31,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 1121 events. 79/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4746 event pairs, 0 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 1305. Up to 39 conditions per place. [2021-06-10 11:48:31,429 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/971 dead transitions. [2021-06-10 11:48:31,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 971 transitions, 2258 flow [2021-06-10 11:48:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:31,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:31,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:31,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:31,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:31,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:31,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:31,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:31,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:31,434 INFO L185 Difference]: Start difference. First operand has 1012 places, 970 transitions, 2242 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:31,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 971 transitions, 2258 flow [2021-06-10 11:48:31,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 971 transitions, 2257 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:31,443 INFO L241 Difference]: Finished difference. Result has 1015 places, 971 transitions, 2255 flow [2021-06-10 11:48:31,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2255, PETRI_PLACES=1015, PETRI_TRANSITIONS=971} [2021-06-10 11:48:31,444 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 6 predicate places. [2021-06-10 11:48:31,444 INFO L480 AbstractCegarLoop]: Abstraction has has 1015 places, 971 transitions, 2255 flow [2021-06-10 11:48:31,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:31,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:31,444 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:31,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2326 [2021-06-10 11:48:31,444 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 363328528, now seen corresponding path program 1 times [2021-06-10 11:48:31,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:31,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321654420] [2021-06-10 11:48:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:31,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:31,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:31,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:31,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:31,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:31,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:48:31,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321654420] [2021-06-10 11:48:31,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:31,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:31,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293751462] [2021-06-10 11:48:31,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:31,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:31,471 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:31,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 971 transitions, 2255 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:31,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:31,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:31,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:31,923 INFO L129 PetriNetUnfolder]: 79/1122 cut-off events. [2021-06-10 11:48:31,923 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:31,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1122 events. 79/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4753 event pairs, 0 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1313. Up to 39 conditions per place. [2021-06-10 11:48:32,006 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/972 dead transitions. [2021-06-10 11:48:32,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 972 transitions, 2281 flow [2021-06-10 11:48:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:32,007 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:32,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:32,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:32,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:32,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:32,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,010 INFO L185 Difference]: Start difference. First operand has 1015 places, 971 transitions, 2255 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:32,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 972 transitions, 2281 flow [2021-06-10 11:48:32,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 972 transitions, 2279 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:32,020 INFO L241 Difference]: Finished difference. Result has 1018 places, 972 transitions, 2271 flow [2021-06-10 11:48:32,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2271, PETRI_PLACES=1018, PETRI_TRANSITIONS=972} [2021-06-10 11:48:32,020 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 9 predicate places. [2021-06-10 11:48:32,020 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 972 transitions, 2271 flow [2021-06-10 11:48:32,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:32,021 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:32,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2327 [2021-06-10 11:48:32,021 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 364282863, now seen corresponding path program 1 times [2021-06-10 11:48:32,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:32,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049418672] [2021-06-10 11:48:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:32,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:32,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:32,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:48:32,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049418672] [2021-06-10 11:48:32,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:32,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:32,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111961190] [2021-06-10 11:48:32,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:32,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:32,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:32,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 972 transitions, 2271 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:32,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:32,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:32,540 INFO L129 PetriNetUnfolder]: 78/1119 cut-off events. [2021-06-10 11:48:32,540 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:32,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1119 events. 78/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4735 event pairs, 0 based on Foata normal form. 2/1005 useless extension candidates. Maximal degree in co-relation 1312. Up to 39 conditions per place. [2021-06-10 11:48:32,595 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/970 dead transitions. [2021-06-10 11:48:32,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 970 transitions, 2279 flow [2021-06-10 11:48:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:32,596 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:32,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:32,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:32,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:32,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:32,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,599 INFO L185 Difference]: Start difference. First operand has 1018 places, 972 transitions, 2271 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:32,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 970 transitions, 2279 flow [2021-06-10 11:48:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 970 transitions, 2278 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:32,608 INFO L241 Difference]: Finished difference. Result has 1019 places, 970 transitions, 2260 flow [2021-06-10 11:48:32,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=1019, PETRI_TRANSITIONS=970} [2021-06-10 11:48:32,608 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 10 predicate places. [2021-06-10 11:48:32,608 INFO L480 AbstractCegarLoop]: Abstraction has has 1019 places, 970 transitions, 2260 flow [2021-06-10 11:48:32,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:32,609 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:32,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2328 [2021-06-10 11:48:32,609 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash 364281840, now seen corresponding path program 1 times [2021-06-10 11:48:32,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:32,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654862182] [2021-06-10 11:48:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:32,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:32,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:32,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:32,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:48:32,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654862182] [2021-06-10 11:48:32,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:32,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:32,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679892586] [2021-06-10 11:48:32,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:32,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:32,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:32,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:32,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:32,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 970 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:32,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:32,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:32,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:33,087 INFO L129 PetriNetUnfolder]: 78/1116 cut-off events. [2021-06-10 11:48:33,087 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:33,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1116 events. 78/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4713 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1306. Up to 39 conditions per place. [2021-06-10 11:48:33,171 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/967 dead transitions. [2021-06-10 11:48:33,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 967 transitions, 2261 flow [2021-06-10 11:48:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:33,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:33,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:33,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:33,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:33,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:33,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,175 INFO L185 Difference]: Start difference. First operand has 1019 places, 970 transitions, 2260 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:33,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 967 transitions, 2261 flow [2021-06-10 11:48:33,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 967 transitions, 2256 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:33,185 INFO L241 Difference]: Finished difference. Result has 1016 places, 967 transitions, 2246 flow [2021-06-10 11:48:33,186 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2246, PETRI_PLACES=1016, PETRI_TRANSITIONS=967} [2021-06-10 11:48:33,186 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 7 predicate places. [2021-06-10 11:48:33,186 INFO L480 AbstractCegarLoop]: Abstraction has has 1016 places, 967 transitions, 2246 flow [2021-06-10 11:48:33,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:33,186 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:33,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2329 [2021-06-10 11:48:33,186 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:33,186 INFO L82 PathProgramCache]: Analyzing trace with hash 288396859, now seen corresponding path program 1 times [2021-06-10 11:48:33,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:33,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586906198] [2021-06-10 11:48:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:33,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:33,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:33,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:48:33,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586906198] [2021-06-10 11:48:33,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:33,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:33,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847930291] [2021-06-10 11:48:33,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:33,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:33,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:33,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 967 transitions, 2246 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:33,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:33,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:33,672 INFO L129 PetriNetUnfolder]: 77/1123 cut-off events. [2021-06-10 11:48:33,672 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:33,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 1123 events. 77/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4771 event pairs, 0 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1316. Up to 39 conditions per place. [2021-06-10 11:48:33,754 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/968 dead transitions. [2021-06-10 11:48:33,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 968 transitions, 2262 flow [2021-06-10 11:48:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:33,756 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:33,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:33,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:33,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:33,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:33,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,759 INFO L185 Difference]: Start difference. First operand has 1016 places, 967 transitions, 2246 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:33,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 968 transitions, 2262 flow [2021-06-10 11:48:33,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 968 transitions, 2261 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:33,768 INFO L241 Difference]: Finished difference. Result has 1018 places, 967 transitions, 2250 flow [2021-06-10 11:48:33,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2250, PETRI_PLACES=1018, PETRI_TRANSITIONS=967} [2021-06-10 11:48:33,769 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 9 predicate places. [2021-06-10 11:48:33,769 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 967 transitions, 2250 flow [2021-06-10 11:48:33,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:33,769 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:33,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2330 [2021-06-10 11:48:33,769 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash 288397882, now seen corresponding path program 1 times [2021-06-10 11:48:33,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:33,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299050059] [2021-06-10 11:48:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:33,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:33,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:33,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:33,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:48:33,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299050059] [2021-06-10 11:48:33,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:33,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:33,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597171934] [2021-06-10 11:48:33,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:33,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:33,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:33,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 967 transitions, 2250 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:33,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:33,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:33,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:34,260 INFO L129 PetriNetUnfolder]: 75/1125 cut-off events. [2021-06-10 11:48:34,260 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:34,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 1125 events. 75/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4804 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1325. Up to 39 conditions per place. [2021-06-10 11:48:34,344 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/968 dead transitions. [2021-06-10 11:48:34,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 968 transitions, 2276 flow [2021-06-10 11:48:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:34,350 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:34,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:34,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:34,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:34,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:34,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,353 INFO L185 Difference]: Start difference. First operand has 1018 places, 967 transitions, 2250 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:34,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 968 transitions, 2276 flow [2021-06-10 11:48:34,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 968 transitions, 2275 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:34,362 INFO L241 Difference]: Finished difference. Result has 1021 places, 968 transitions, 2267 flow [2021-06-10 11:48:34,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=964, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2267, PETRI_PLACES=1021, PETRI_TRANSITIONS=968} [2021-06-10 11:48:34,363 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 12 predicate places. [2021-06-10 11:48:34,363 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 968 transitions, 2267 flow [2021-06-10 11:48:34,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:34,363 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:34,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2331 [2021-06-10 11:48:34,363 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 287444570, now seen corresponding path program 1 times [2021-06-10 11:48:34,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:34,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066881130] [2021-06-10 11:48:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:34,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:34,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:34,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:48:34,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066881130] [2021-06-10 11:48:34,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:34,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:34,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18874438] [2021-06-10 11:48:34,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:34,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:34,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:34,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 968 transitions, 2267 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:34,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:34,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:34,835 INFO L129 PetriNetUnfolder]: 75/1118 cut-off events. [2021-06-10 11:48:34,835 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:34,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1118 events. 75/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4744 event pairs, 0 based on Foata normal form. 1/1007 useless extension candidates. Maximal degree in co-relation 1311. Up to 39 conditions per place. [2021-06-10 11:48:34,908 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/966 dead transitions. [2021-06-10 11:48:34,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 966 transitions, 2269 flow [2021-06-10 11:48:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:34,910 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:34,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:34,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:34,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:34,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:34,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,913 INFO L185 Difference]: Start difference. First operand has 1021 places, 968 transitions, 2267 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:34,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 966 transitions, 2269 flow [2021-06-10 11:48:34,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 966 transitions, 2261 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:34,922 INFO L241 Difference]: Finished difference. Result has 1021 places, 966 transitions, 2254 flow [2021-06-10 11:48:34,922 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=966, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=965, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2254, PETRI_PLACES=1021, PETRI_TRANSITIONS=966} [2021-06-10 11:48:34,922 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 12 predicate places. [2021-06-10 11:48:34,922 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 966 transitions, 2254 flow [2021-06-10 11:48:34,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,923 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:34,923 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:34,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2332 [2021-06-10 11:48:34,923 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash 287443547, now seen corresponding path program 1 times [2021-06-10 11:48:34,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:34,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000155997] [2021-06-10 11:48:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:34,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:34,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:34,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:34,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:48:34,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000155997] [2021-06-10 11:48:34,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:34,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:34,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998509543] [2021-06-10 11:48:34,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:34,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:34,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:34,950 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:34,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 966 transitions, 2254 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:34,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:34,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:34,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:35,400 INFO L129 PetriNetUnfolder]: 75/1116 cut-off events. [2021-06-10 11:48:35,401 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:35,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1116 events. 75/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4727 event pairs, 0 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 1315. Up to 39 conditions per place. [2021-06-10 11:48:35,483 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/964 dead transitions. [2021-06-10 11:48:35,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 964 transitions, 2267 flow [2021-06-10 11:48:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:35,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:35,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:35,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:35,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:35,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:35,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:35,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:35,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:35,488 INFO L185 Difference]: Start difference. First operand has 1021 places, 966 transitions, 2254 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:35,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 964 transitions, 2267 flow [2021-06-10 11:48:35,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 964 transitions, 2266 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:35,499 INFO L241 Difference]: Finished difference. Result has 1020 places, 964 transitions, 2250 flow [2021-06-10 11:48:35,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2248, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=964, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2250, PETRI_PLACES=1020, PETRI_TRANSITIONS=964} [2021-06-10 11:48:35,500 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 11 predicate places. [2021-06-10 11:48:35,500 INFO L480 AbstractCegarLoop]: Abstraction has has 1020 places, 964 transitions, 2250 flow [2021-06-10 11:48:35,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:35,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:35,500 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:35,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2333 [2021-06-10 11:48:35,501 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -4900569, now seen corresponding path program 1 times [2021-06-10 11:48:35,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:35,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411533302] [2021-06-10 11:48:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:35,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:35,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:35,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:35,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:35,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:35,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:48:35,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411533302] [2021-06-10 11:48:35,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:35,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:35,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372894784] [2021-06-10 11:48:35,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:35,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:35,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:35,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 964 transitions, 2250 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:35,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:35,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:35,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:36,006 INFO L129 PetriNetUnfolder]: 74/1124 cut-off events. [2021-06-10 11:48:36,006 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:36,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1124 events. 74/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4800 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1327. Up to 39 conditions per place. [2021-06-10 11:48:36,088 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/966 dead transitions. [2021-06-10 11:48:36,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 966 transitions, 2280 flow [2021-06-10 11:48:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:36,089 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:36,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:36,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:36,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:36,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:36,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,092 INFO L185 Difference]: Start difference. First operand has 1020 places, 964 transitions, 2250 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:36,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 966 transitions, 2280 flow [2021-06-10 11:48:36,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 966 transitions, 2279 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:36,102 INFO L241 Difference]: Finished difference. Result has 1023 places, 966 transitions, 2273 flow [2021-06-10 11:48:36,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=964, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2273, PETRI_PLACES=1023, PETRI_TRANSITIONS=966} [2021-06-10 11:48:36,103 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 14 predicate places. [2021-06-10 11:48:36,103 INFO L480 AbstractCegarLoop]: Abstraction has has 1023 places, 966 transitions, 2273 flow [2021-06-10 11:48:36,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:36,103 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:36,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2334 [2021-06-10 11:48:36,103 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -4899546, now seen corresponding path program 1 times [2021-06-10 11:48:36,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:36,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190697577] [2021-06-10 11:48:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:36,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:36,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:36,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:48:36,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190697577] [2021-06-10 11:48:36,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:36,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:36,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410560382] [2021-06-10 11:48:36,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:36,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:36,130 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:36,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 966 transitions, 2273 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:36,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:36,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:36,653 INFO L129 PetriNetUnfolder]: 73/1122 cut-off events. [2021-06-10 11:48:36,653 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:36,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 1122 events. 73/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4790 event pairs, 0 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1324. Up to 39 conditions per place. [2021-06-10 11:48:36,702 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/966 dead transitions. [2021-06-10 11:48:36,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 966 transitions, 2285 flow [2021-06-10 11:48:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:36,704 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:36,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:36,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:36,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:36,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:36,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,707 INFO L185 Difference]: Start difference. First operand has 1023 places, 966 transitions, 2273 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:36,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 966 transitions, 2285 flow [2021-06-10 11:48:36,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 966 transitions, 2280 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:36,715 INFO L241 Difference]: Finished difference. Result has 1026 places, 966 transitions, 2278 flow [2021-06-10 11:48:36,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2278, PETRI_PLACES=1026, PETRI_TRANSITIONS=966} [2021-06-10 11:48:36,716 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 17 predicate places. [2021-06-10 11:48:36,716 INFO L480 AbstractCegarLoop]: Abstraction has has 1026 places, 966 transitions, 2278 flow [2021-06-10 11:48:36,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:36,716 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:36,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2335 [2021-06-10 11:48:36,716 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash -3947257, now seen corresponding path program 1 times [2021-06-10 11:48:36,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:36,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199115329] [2021-06-10 11:48:36,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:36,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:36,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:36,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:36,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:48:36,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199115329] [2021-06-10 11:48:36,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:36,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:36,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045329503] [2021-06-10 11:48:36,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:36,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:36,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:36,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 966 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:36,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:36,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:36,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:37,205 INFO L129 PetriNetUnfolder]: 72/1118 cut-off events. [2021-06-10 11:48:37,205 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:48:37,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1118 events. 72/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4761 event pairs, 0 based on Foata normal form. 1/1010 useless extension candidates. Maximal degree in co-relation 1321. Up to 39 conditions per place. [2021-06-10 11:48:37,289 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/963 dead transitions. [2021-06-10 11:48:37,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 963 transitions, 2275 flow [2021-06-10 11:48:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:37,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:37,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:37,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:37,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:37,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:37,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,294 INFO L185 Difference]: Start difference. First operand has 1026 places, 966 transitions, 2278 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:37,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 963 transitions, 2275 flow [2021-06-10 11:48:37,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 963 transitions, 2268 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:37,303 INFO L241 Difference]: Finished difference. Result has 1025 places, 963 transitions, 2258 flow [2021-06-10 11:48:37,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2258, PETRI_PLACES=1025, PETRI_TRANSITIONS=963} [2021-06-10 11:48:37,304 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 16 predicate places. [2021-06-10 11:48:37,304 INFO L480 AbstractCegarLoop]: Abstraction has has 1025 places, 963 transitions, 2258 flow [2021-06-10 11:48:37,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:37,304 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:37,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2336 [2021-06-10 11:48:37,304 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -3946234, now seen corresponding path program 1 times [2021-06-10 11:48:37,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:37,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213111822] [2021-06-10 11:48:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:37,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:37,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:37,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:48:37,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213111822] [2021-06-10 11:48:37,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:37,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:37,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809669721] [2021-06-10 11:48:37,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:37,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:37,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:37,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 963 transitions, 2258 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:37,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:37,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:37,790 INFO L129 PetriNetUnfolder]: 72/1116 cut-off events. [2021-06-10 11:48:37,790 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:37,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 1116 events. 72/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4745 event pairs, 0 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1322. Up to 39 conditions per place. [2021-06-10 11:48:37,871 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/961 dead transitions. [2021-06-10 11:48:37,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 961 transitions, 2271 flow [2021-06-10 11:48:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:37,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:37,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:37,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:37,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:37,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:37,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,876 INFO L185 Difference]: Start difference. First operand has 1025 places, 963 transitions, 2258 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:37,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 961 transitions, 2271 flow [2021-06-10 11:48:37,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 961 transitions, 2270 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:37,886 INFO L241 Difference]: Finished difference. Result has 1024 places, 961 transitions, 2254 flow [2021-06-10 11:48:37,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2254, PETRI_PLACES=1024, PETRI_TRANSITIONS=961} [2021-06-10 11:48:37,886 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 15 predicate places. [2021-06-10 11:48:37,886 INFO L480 AbstractCegarLoop]: Abstraction has has 1024 places, 961 transitions, 2254 flow [2021-06-10 11:48:37,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:37,886 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:37,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2337 [2021-06-10 11:48:37,887 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash 12727252, now seen corresponding path program 1 times [2021-06-10 11:48:37,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:37,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728342318] [2021-06-10 11:48:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:37,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:37,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:37,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:37,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:48:37,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728342318] [2021-06-10 11:48:37,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:37,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:37,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11508505] [2021-06-10 11:48:37,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:37,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:37,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:37,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 961 transitions, 2254 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:37,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:37,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:37,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:38,391 INFO L129 PetriNetUnfolder]: 71/1123 cut-off events. [2021-06-10 11:48:38,391 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:38,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 1123 events. 71/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4808 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1327. Up to 39 conditions per place. [2021-06-10 11:48:38,470 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2021-06-10 11:48:38,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 962 transitions, 2270 flow [2021-06-10 11:48:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:38,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:38,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:38,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:38,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:38,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:38,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:38,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:38,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:38,475 INFO L185 Difference]: Start difference. First operand has 1024 places, 961 transitions, 2254 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:38,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 962 transitions, 2270 flow [2021-06-10 11:48:38,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 962 transitions, 2269 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:38,485 INFO L241 Difference]: Finished difference. Result has 1026 places, 961 transitions, 2258 flow [2021-06-10 11:48:38,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2258, PETRI_PLACES=1026, PETRI_TRANSITIONS=961} [2021-06-10 11:48:38,485 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 17 predicate places. [2021-06-10 11:48:38,485 INFO L480 AbstractCegarLoop]: Abstraction has has 1026 places, 961 transitions, 2258 flow [2021-06-10 11:48:38,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:38,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:38,485 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:38,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2338 [2021-06-10 11:48:38,485 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:38,486 INFO L82 PathProgramCache]: Analyzing trace with hash 12728275, now seen corresponding path program 1 times [2021-06-10 11:48:38,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:38,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263412309] [2021-06-10 11:48:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:38,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:38,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:38,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:38,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:38,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:38,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:48:38,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263412309] [2021-06-10 11:48:38,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:38,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:38,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105629090] [2021-06-10 11:48:38,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:38,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:38,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:38,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:38,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 961 transitions, 2258 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:38,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:38,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:38,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:38,968 INFO L129 PetriNetUnfolder]: 69/1125 cut-off events. [2021-06-10 11:48:38,968 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:39,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1125 events. 69/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4838 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1338. Up to 39 conditions per place. [2021-06-10 11:48:39,039 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/962 dead transitions. [2021-06-10 11:48:39,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 962 transitions, 2284 flow [2021-06-10 11:48:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:39,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:39,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:39,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:39,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:39,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:39,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,044 INFO L185 Difference]: Start difference. First operand has 1026 places, 961 transitions, 2258 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 962 transitions, 2284 flow [2021-06-10 11:48:39,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 962 transitions, 2283 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:39,053 INFO L241 Difference]: Finished difference. Result has 1029 places, 962 transitions, 2275 flow [2021-06-10 11:48:39,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=958, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2275, PETRI_PLACES=1029, PETRI_TRANSITIONS=962} [2021-06-10 11:48:39,054 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 20 predicate places. [2021-06-10 11:48:39,054 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 962 transitions, 2275 flow [2021-06-10 11:48:39,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:39,054 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:39,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2339 [2021-06-10 11:48:39,054 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash 11774963, now seen corresponding path program 1 times [2021-06-10 11:48:39,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:39,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702040828] [2021-06-10 11:48:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:39,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:39,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:39,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:48:39,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702040828] [2021-06-10 11:48:39,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:39,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:39,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019543197] [2021-06-10 11:48:39,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:39,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:39,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:39,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 962 transitions, 2275 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:39,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:39,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:39,548 INFO L129 PetriNetUnfolder]: 69/1118 cut-off events. [2021-06-10 11:48:39,549 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:39,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1118 events. 69/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4780 event pairs, 0 based on Foata normal form. 1/1013 useless extension candidates. Maximal degree in co-relation 1324. Up to 39 conditions per place. [2021-06-10 11:48:39,629 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/960 dead transitions. [2021-06-10 11:48:39,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 960 transitions, 2277 flow [2021-06-10 11:48:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:39,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:39,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:39,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:39,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:39,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:39,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,634 INFO L185 Difference]: Start difference. First operand has 1029 places, 962 transitions, 2275 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:39,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 960 transitions, 2277 flow [2021-06-10 11:48:39,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 960 transitions, 2269 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:39,643 INFO L241 Difference]: Finished difference. Result has 1029 places, 960 transitions, 2262 flow [2021-06-10 11:48:39,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2262, PETRI_PLACES=1029, PETRI_TRANSITIONS=960} [2021-06-10 11:48:39,644 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 20 predicate places. [2021-06-10 11:48:39,644 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 960 transitions, 2262 flow [2021-06-10 11:48:39,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:39,644 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:39,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2340 [2021-06-10 11:48:39,644 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:39,644 INFO L82 PathProgramCache]: Analyzing trace with hash 11773940, now seen corresponding path program 1 times [2021-06-10 11:48:39,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:39,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808049751] [2021-06-10 11:48:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:39,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:39,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:39,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:39,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:48:39,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808049751] [2021-06-10 11:48:39,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:39,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:39,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725888392] [2021-06-10 11:48:39,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:39,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:39,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:39,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 960 transitions, 2262 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:39,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:39,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:39,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:40,134 INFO L129 PetriNetUnfolder]: 69/1116 cut-off events. [2021-06-10 11:48:40,134 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:40,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1116 events. 69/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4764 event pairs, 0 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1328. Up to 39 conditions per place. [2021-06-10 11:48:40,213 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2021-06-10 11:48:40,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 958 transitions, 2275 flow [2021-06-10 11:48:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:40,215 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:40,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:40,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:40,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:40,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:40,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,218 INFO L185 Difference]: Start difference. First operand has 1029 places, 960 transitions, 2262 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:40,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 958 transitions, 2275 flow [2021-06-10 11:48:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 958 transitions, 2274 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:40,228 INFO L241 Difference]: Finished difference. Result has 1028 places, 958 transitions, 2258 flow [2021-06-10 11:48:40,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2258, PETRI_PLACES=1028, PETRI_TRANSITIONS=958} [2021-06-10 11:48:40,228 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 19 predicate places. [2021-06-10 11:48:40,228 INFO L480 AbstractCegarLoop]: Abstraction has has 1028 places, 958 transitions, 2258 flow [2021-06-10 11:48:40,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:40,229 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:40,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2341 [2021-06-10 11:48:40,229 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 119097121, now seen corresponding path program 1 times [2021-06-10 11:48:40,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:40,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102899403] [2021-06-10 11:48:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:40,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:40,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:40,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:48:40,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102899403] [2021-06-10 11:48:40,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:40,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:40,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934805728] [2021-06-10 11:48:40,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:40,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:40,261 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:40,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 958 transitions, 2258 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:40,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:40,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:40,748 INFO L129 PetriNetUnfolder]: 68/1124 cut-off events. [2021-06-10 11:48:40,748 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:40,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 1124 events. 68/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4833 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1340. Up to 39 conditions per place. [2021-06-10 11:48:40,858 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/960 dead transitions. [2021-06-10 11:48:40,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 960 transitions, 2288 flow [2021-06-10 11:48:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:40,859 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:40,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:40,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:40,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:40,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:40,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,862 INFO L185 Difference]: Start difference. First operand has 1028 places, 958 transitions, 2258 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:40,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 960 transitions, 2288 flow [2021-06-10 11:48:40,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 960 transitions, 2287 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:40,871 INFO L241 Difference]: Finished difference. Result has 1031 places, 960 transitions, 2281 flow [2021-06-10 11:48:40,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2281, PETRI_PLACES=1031, PETRI_TRANSITIONS=960} [2021-06-10 11:48:40,871 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 22 predicate places. [2021-06-10 11:48:40,872 INFO L480 AbstractCegarLoop]: Abstraction has has 1031 places, 960 transitions, 2281 flow [2021-06-10 11:48:40,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:40,872 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:40,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2342 [2021-06-10 11:48:40,872 INFO L428 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash 119096098, now seen corresponding path program 1 times [2021-06-10 11:48:40,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:40,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865788625] [2021-06-10 11:48:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:40,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:40,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:40,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:40,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:48:40,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865788625] [2021-06-10 11:48:40,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:40,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:40,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111461836] [2021-06-10 11:48:40,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:40,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:40,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:40,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:40,900 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:40,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 960 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:40,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:40,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:40,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:41,369 INFO L129 PetriNetUnfolder]: 66/1125 cut-off events. [2021-06-10 11:48:41,369 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:41,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 1125 events. 66/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4855 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1340. Up to 39 conditions per place. [2021-06-10 11:48:41,452 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/960 dead transitions. [2021-06-10 11:48:41,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 960 transitions, 2293 flow [2021-06-10 11:48:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:41,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:41,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:41,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:41,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:41,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:41,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:41,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:41,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:41,456 INFO L185 Difference]: Start difference. First operand has 1031 places, 960 transitions, 2281 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:41,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 960 transitions, 2293 flow [2021-06-10 11:48:41,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 960 transitions, 2288 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:41,466 INFO L241 Difference]: Finished difference. Result has 1033 places, 959 transitions, 2277 flow [2021-06-10 11:48:41,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=958, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2277, PETRI_PLACES=1033, PETRI_TRANSITIONS=959} [2021-06-10 11:48:41,467 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 24 predicate places. [2021-06-10 11:48:41,467 INFO L480 AbstractCegarLoop]: Abstraction has has 1033 places, 959 transitions, 2277 flow [2021-06-10 11:48:41,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:41,467 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:41,467 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:41,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2343 [2021-06-10 11:48:41,467 INFO L428 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash 118143809, now seen corresponding path program 1 times [2021-06-10 11:48:41,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:41,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210704834] [2021-06-10 11:48:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:41,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:41,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:41,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:41,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:41,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:41,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:48:41,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210704834] [2021-06-10 11:48:41,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:41,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:41,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672810461] [2021-06-10 11:48:41,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:41,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:41,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:41,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 959 transitions, 2277 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:41,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:41,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:41,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:41,957 INFO L129 PetriNetUnfolder]: 66/1118 cut-off events. [2021-06-10 11:48:41,957 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:42,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1118 events. 66/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4800 event pairs, 0 based on Foata normal form. 1/1016 useless extension candidates. Maximal degree in co-relation 1334. Up to 39 conditions per place. [2021-06-10 11:48:42,038 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/957 dead transitions. [2021-06-10 11:48:42,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 957 transitions, 2280 flow [2021-06-10 11:48:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:42,040 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:42,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:42,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:42,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:42,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:42,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,043 INFO L185 Difference]: Start difference. First operand has 1033 places, 959 transitions, 2277 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:42,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 957 transitions, 2280 flow [2021-06-10 11:48:42,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 957 transitions, 2273 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:42,053 INFO L241 Difference]: Finished difference. Result has 1033 places, 957 transitions, 2266 flow [2021-06-10 11:48:42,053 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2266, PETRI_PLACES=1033, PETRI_TRANSITIONS=957} [2021-06-10 11:48:42,053 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 24 predicate places. [2021-06-10 11:48:42,053 INFO L480 AbstractCegarLoop]: Abstraction has has 1033 places, 957 transitions, 2266 flow [2021-06-10 11:48:42,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,053 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:42,053 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:42,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2344 [2021-06-10 11:48:42,053 INFO L428 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash 118142786, now seen corresponding path program 1 times [2021-06-10 11:48:42,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:42,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957626689] [2021-06-10 11:48:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:42,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:42,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:42,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:48:42,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957626689] [2021-06-10 11:48:42,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:42,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:42,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295308487] [2021-06-10 11:48:42,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:42,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:42,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:42,081 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:42,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 957 transitions, 2266 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:42,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:42,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:42,554 INFO L129 PetriNetUnfolder]: 66/1116 cut-off events. [2021-06-10 11:48:42,554 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:42,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1116 events. 66/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4785 event pairs, 0 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1334. Up to 39 conditions per place. [2021-06-10 11:48:42,634 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/955 dead transitions. [2021-06-10 11:48:42,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 955 transitions, 2279 flow [2021-06-10 11:48:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:42,636 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:42,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:42,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:42,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:42,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:42,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,639 INFO L185 Difference]: Start difference. First operand has 1033 places, 957 transitions, 2266 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:42,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 955 transitions, 2279 flow [2021-06-10 11:48:42,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 955 transitions, 2278 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:42,649 INFO L241 Difference]: Finished difference. Result has 1032 places, 955 transitions, 2262 flow [2021-06-10 11:48:42,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=954, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2262, PETRI_PLACES=1032, PETRI_TRANSITIONS=955} [2021-06-10 11:48:42,649 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 23 predicate places. [2021-06-10 11:48:42,649 INFO L480 AbstractCegarLoop]: Abstraction has has 1032 places, 955 transitions, 2262 flow [2021-06-10 11:48:42,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:42,650 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:42,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2345 [2021-06-10 11:48:42,650 INFO L428 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 443932816, now seen corresponding path program 1 times [2021-06-10 11:48:42,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:42,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326353339] [2021-06-10 11:48:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:42,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:42,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:42,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:42,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:48:42,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326353339] [2021-06-10 11:48:42,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:42,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:42,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680704488] [2021-06-10 11:48:42,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:42,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:42,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:42,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:42,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 955 transitions, 2262 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:42,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:42,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:42,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:43,130 INFO L129 PetriNetUnfolder]: 64/1121 cut-off events. [2021-06-10 11:48:43,130 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:43,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 1121 events. 64/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4834 event pairs, 0 based on Foata normal form. 0/1018 useless extension candidates. Maximal degree in co-relation 1337. Up to 39 conditions per place. [2021-06-10 11:48:43,201 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/956 dead transitions. [2021-06-10 11:48:43,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 956 transitions, 2278 flow [2021-06-10 11:48:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:43,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:43,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:43,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:43,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:43,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:43,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,205 INFO L185 Difference]: Start difference. First operand has 1032 places, 955 transitions, 2262 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:43,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 956 transitions, 2278 flow [2021-06-10 11:48:43,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 956 transitions, 2277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:43,215 INFO L241 Difference]: Finished difference. Result has 1035 places, 956 transitions, 2275 flow [2021-06-10 11:48:43,215 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=953, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2275, PETRI_PLACES=1035, PETRI_TRANSITIONS=956} [2021-06-10 11:48:43,215 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 26 predicate places. [2021-06-10 11:48:43,215 INFO L480 AbstractCegarLoop]: Abstraction has has 1035 places, 956 transitions, 2275 flow [2021-06-10 11:48:43,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:43,216 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:43,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2346 [2021-06-10 11:48:43,216 INFO L428 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash 443931793, now seen corresponding path program 1 times [2021-06-10 11:48:43,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:43,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257085921] [2021-06-10 11:48:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:43,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:43,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:43,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:48:43,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257085921] [2021-06-10 11:48:43,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:43,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:43,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620303527] [2021-06-10 11:48:43,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:43,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:43,244 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:43,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 956 transitions, 2275 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:43,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:43,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:43,721 INFO L129 PetriNetUnfolder]: 64/1122 cut-off events. [2021-06-10 11:48:43,721 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:43,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1122 events. 64/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4844 event pairs, 0 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 1345. Up to 39 conditions per place. [2021-06-10 11:48:43,802 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/957 dead transitions. [2021-06-10 11:48:43,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 957 transitions, 2301 flow [2021-06-10 11:48:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:43,804 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:43,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:43,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:43,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:43,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:43,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,807 INFO L185 Difference]: Start difference. First operand has 1035 places, 956 transitions, 2275 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:43,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 957 transitions, 2301 flow [2021-06-10 11:48:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 957 transitions, 2299 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:43,817 INFO L241 Difference]: Finished difference. Result has 1038 places, 957 transitions, 2291 flow [2021-06-10 11:48:43,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=953, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2291, PETRI_PLACES=1038, PETRI_TRANSITIONS=957} [2021-06-10 11:48:43,817 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 29 predicate places. [2021-06-10 11:48:43,817 INFO L480 AbstractCegarLoop]: Abstraction has has 1038 places, 957 transitions, 2291 flow [2021-06-10 11:48:43,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:43,817 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:43,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2347 [2021-06-10 11:48:43,818 INFO L428 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 444886128, now seen corresponding path program 1 times [2021-06-10 11:48:43,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:43,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058126537] [2021-06-10 11:48:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:43,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:43,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:43,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:43,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:48:43,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058126537] [2021-06-10 11:48:43,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:43,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:43,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745270800] [2021-06-10 11:48:43,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:43,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:43,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:43,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 957 transitions, 2291 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:43,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:43,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:43,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:44,325 INFO L129 PetriNetUnfolder]: 63/1119 cut-off events. [2021-06-10 11:48:44,325 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:44,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1119 events. 63/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4823 event pairs, 0 based on Foata normal form. 2/1020 useless extension candidates. Maximal degree in co-relation 1344. Up to 39 conditions per place. [2021-06-10 11:48:44,409 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/955 dead transitions. [2021-06-10 11:48:44,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 955 transitions, 2299 flow [2021-06-10 11:48:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:44,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:44,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:44,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:44,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:44,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:44,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:44,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:44,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:44,414 INFO L185 Difference]: Start difference. First operand has 1038 places, 957 transitions, 2291 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 955 transitions, 2299 flow [2021-06-10 11:48:44,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 955 transitions, 2298 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:44,424 INFO L241 Difference]: Finished difference. Result has 1039 places, 955 transitions, 2280 flow [2021-06-10 11:48:44,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=954, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2280, PETRI_PLACES=1039, PETRI_TRANSITIONS=955} [2021-06-10 11:48:44,425 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 30 predicate places. [2021-06-10 11:48:44,425 INFO L480 AbstractCegarLoop]: Abstraction has has 1039 places, 955 transitions, 2280 flow [2021-06-10 11:48:44,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:44,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:44,425 INFO L263 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:44,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2348 [2021-06-10 11:48:44,425 INFO L428 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash 444885105, now seen corresponding path program 1 times [2021-06-10 11:48:44,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:44,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908232528] [2021-06-10 11:48:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:44,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:44,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:44,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:44,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:44,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:44,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2021-06-10 11:48:44,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908232528] [2021-06-10 11:48:44,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:44,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:44,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540211071] [2021-06-10 11:48:44,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:44,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:44,454 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:44,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 955 transitions, 2280 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:44,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:44,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:44,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:44,978 INFO L129 PetriNetUnfolder]: 63/1116 cut-off events. [2021-06-10 11:48:44,978 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:45,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 1116 events. 63/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4803 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1338. Up to 39 conditions per place. [2021-06-10 11:48:45,025 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/952 dead transitions. [2021-06-10 11:48:45,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 952 transitions, 2281 flow [2021-06-10 11:48:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:45,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:45,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:45,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:45,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:45,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:45,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,030 INFO L185 Difference]: Start difference. First operand has 1039 places, 955 transitions, 2280 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:45,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 952 transitions, 2281 flow [2021-06-10 11:48:45,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 952 transitions, 2276 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:45,039 INFO L241 Difference]: Finished difference. Result has 1036 places, 952 transitions, 2266 flow [2021-06-10 11:48:45,039 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2266, PETRI_PLACES=1036, PETRI_TRANSITIONS=952} [2021-06-10 11:48:45,039 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 27 predicate places. [2021-06-10 11:48:45,039 INFO L480 AbstractCegarLoop]: Abstraction has has 1036 places, 952 transitions, 2266 flow [2021-06-10 11:48:45,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:45,039 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:45,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2349 [2021-06-10 11:48:45,040 INFO L428 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:45,040 INFO L82 PathProgramCache]: Analyzing trace with hash 485191745, now seen corresponding path program 1 times [2021-06-10 11:48:45,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:45,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778313249] [2021-06-10 11:48:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:45,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:45,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:45,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:48:45,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778313249] [2021-06-10 11:48:45,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:45,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:45,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363564158] [2021-06-10 11:48:45,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:45,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:45,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:45,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 952 transitions, 2266 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:45,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:45,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:45,541 INFO L129 PetriNetUnfolder]: 62/1123 cut-off events. [2021-06-10 11:48:45,542 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:45,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1123 events. 62/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4860 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1348. Up to 39 conditions per place. [2021-06-10 11:48:45,624 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/953 dead transitions. [2021-06-10 11:48:45,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 953 transitions, 2282 flow [2021-06-10 11:48:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:45,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:45,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:45,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:45,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:45,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:45,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,629 INFO L185 Difference]: Start difference. First operand has 1036 places, 952 transitions, 2266 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:45,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 953 transitions, 2282 flow [2021-06-10 11:48:45,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 953 transitions, 2281 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:45,639 INFO L241 Difference]: Finished difference. Result has 1038 places, 952 transitions, 2270 flow [2021-06-10 11:48:45,639 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2270, PETRI_PLACES=1038, PETRI_TRANSITIONS=952} [2021-06-10 11:48:45,639 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 29 predicate places. [2021-06-10 11:48:45,639 INFO L480 AbstractCegarLoop]: Abstraction has has 1038 places, 952 transitions, 2270 flow [2021-06-10 11:48:45,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:45,640 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:45,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2350 [2021-06-10 11:48:45,640 INFO L428 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash 485192768, now seen corresponding path program 1 times [2021-06-10 11:48:45,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:45,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542324896] [2021-06-10 11:48:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:45,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:45,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:45,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:45,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:48:45,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542324896] [2021-06-10 11:48:45,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:45,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:45,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357421321] [2021-06-10 11:48:45,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:45,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:45,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:45,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 952 transitions, 2270 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:45,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:45,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:45,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:46,154 INFO L129 PetriNetUnfolder]: 60/1125 cut-off events. [2021-06-10 11:48:46,155 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:46,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1125 events. 60/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4896 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1357. Up to 39 conditions per place. [2021-06-10 11:48:46,234 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/953 dead transitions. [2021-06-10 11:48:46,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 953 transitions, 2296 flow [2021-06-10 11:48:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:46,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:46,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:46,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:46,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:46,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:46,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,239 INFO L185 Difference]: Start difference. First operand has 1038 places, 952 transitions, 2270 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:46,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 953 transitions, 2296 flow [2021-06-10 11:48:46,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 953 transitions, 2295 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:46,250 INFO L241 Difference]: Finished difference. Result has 1041 places, 953 transitions, 2287 flow [2021-06-10 11:48:46,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=949, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2287, PETRI_PLACES=1041, PETRI_TRANSITIONS=953} [2021-06-10 11:48:46,250 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 32 predicate places. [2021-06-10 11:48:46,250 INFO L480 AbstractCegarLoop]: Abstraction has has 1041 places, 953 transitions, 2287 flow [2021-06-10 11:48:46,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:46,250 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:46,250 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2351 [2021-06-10 11:48:46,251 INFO L428 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 484239456, now seen corresponding path program 1 times [2021-06-10 11:48:46,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:46,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954030884] [2021-06-10 11:48:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:46,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:46,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:46,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:48:46,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954030884] [2021-06-10 11:48:46,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:46,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:46,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025450805] [2021-06-10 11:48:46,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:46,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:46,281 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:46,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 953 transitions, 2287 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:46,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:46,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:46,756 INFO L129 PetriNetUnfolder]: 60/1118 cut-off events. [2021-06-10 11:48:46,756 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:46,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1118 events. 60/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4830 event pairs, 0 based on Foata normal form. 1/1022 useless extension candidates. Maximal degree in co-relation 1343. Up to 39 conditions per place. [2021-06-10 11:48:46,836 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2021-06-10 11:48:46,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 951 transitions, 2289 flow [2021-06-10 11:48:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:46,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:46,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:46,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:46,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:46,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:46,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,841 INFO L185 Difference]: Start difference. First operand has 1041 places, 953 transitions, 2287 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:46,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 951 transitions, 2289 flow [2021-06-10 11:48:46,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 951 transitions, 2281 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:46,851 INFO L241 Difference]: Finished difference. Result has 1041 places, 951 transitions, 2274 flow [2021-06-10 11:48:46,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=1041, PETRI_TRANSITIONS=951} [2021-06-10 11:48:46,851 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 32 predicate places. [2021-06-10 11:48:46,851 INFO L480 AbstractCegarLoop]: Abstraction has has 1041 places, 951 transitions, 2274 flow [2021-06-10 11:48:46,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,852 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:46,852 INFO L263 CegarLoopForPetriNet]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:46,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2352 [2021-06-10 11:48:46,852 INFO L428 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 484238433, now seen corresponding path program 1 times [2021-06-10 11:48:46,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:46,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971932021] [2021-06-10 11:48:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:46,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:46,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:46,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:46,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-06-10 11:48:46,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971932021] [2021-06-10 11:48:46,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:46,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:46,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860804419] [2021-06-10 11:48:46,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:46,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:46,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:46,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 951 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:46,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:46,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:46,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:47,335 INFO L129 PetriNetUnfolder]: 60/1116 cut-off events. [2021-06-10 11:48:47,335 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:47,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1116 events. 60/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4815 event pairs, 0 based on Foata normal form. 0/1018 useless extension candidates. Maximal degree in co-relation 1347. Up to 39 conditions per place. [2021-06-10 11:48:47,404 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/949 dead transitions. [2021-06-10 11:48:47,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 949 transitions, 2287 flow [2021-06-10 11:48:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:47,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:47,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:47,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:47,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:47,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:47,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:47,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:47,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:47,409 INFO L185 Difference]: Start difference. First operand has 1041 places, 951 transitions, 2274 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:47,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 949 transitions, 2287 flow [2021-06-10 11:48:47,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 949 transitions, 2286 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:47,418 INFO L241 Difference]: Finished difference. Result has 1040 places, 949 transitions, 2270 flow [2021-06-10 11:48:47,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2270, PETRI_PLACES=1040, PETRI_TRANSITIONS=949} [2021-06-10 11:48:47,419 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 31 predicate places. [2021-06-10 11:48:47,419 INFO L480 AbstractCegarLoop]: Abstraction has has 1040 places, 949 transitions, 2270 flow [2021-06-10 11:48:47,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:47,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:47,419 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:47,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2353 [2021-06-10 11:48:47,419 INFO L428 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash 140452401, now seen corresponding path program 1 times [2021-06-10 11:48:47,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:47,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2373082] [2021-06-10 11:48:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:47,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:47,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:47,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:47,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:47,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:47,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:48:47,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2373082] [2021-06-10 11:48:47,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:47,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:47,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251734972] [2021-06-10 11:48:47,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:47,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:47,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:47,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 949 transitions, 2270 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:47,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:47,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:47,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:47,921 INFO L129 PetriNetUnfolder]: 58/1121 cut-off events. [2021-06-10 11:48:47,921 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:47,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1121 events. 58/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4868 event pairs, 0 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1350. Up to 39 conditions per place. [2021-06-10 11:48:48,001 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/950 dead transitions. [2021-06-10 11:48:48,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 950 transitions, 2286 flow [2021-06-10 11:48:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:48,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:48,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:48,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:48,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:48,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:48,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,006 INFO L185 Difference]: Start difference. First operand has 1040 places, 949 transitions, 2270 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:48,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 950 transitions, 2286 flow [2021-06-10 11:48:48,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 950 transitions, 2285 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:48,015 INFO L241 Difference]: Finished difference. Result has 1043 places, 950 transitions, 2283 flow [2021-06-10 11:48:48,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2283, PETRI_PLACES=1043, PETRI_TRANSITIONS=950} [2021-06-10 11:48:48,016 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 34 predicate places. [2021-06-10 11:48:48,016 INFO L480 AbstractCegarLoop]: Abstraction has has 1043 places, 950 transitions, 2283 flow [2021-06-10 11:48:48,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:48,016 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:48,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2354 [2021-06-10 11:48:48,016 INFO L428 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash 140451378, now seen corresponding path program 1 times [2021-06-10 11:48:48,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:48,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694912127] [2021-06-10 11:48:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:48,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:48,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:48,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:48:48,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694912127] [2021-06-10 11:48:48,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:48,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:48,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959696350] [2021-06-10 11:48:48,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:48,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:48,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:48,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 950 transitions, 2283 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:48,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:48,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:48,548 INFO L129 PetriNetUnfolder]: 58/1122 cut-off events. [2021-06-10 11:48:48,548 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:48,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 1122 events. 58/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4875 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1358. Up to 39 conditions per place. [2021-06-10 11:48:48,628 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/951 dead transitions. [2021-06-10 11:48:48,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 951 transitions, 2309 flow [2021-06-10 11:48:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:48,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:48,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:48,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:48,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:48,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:48,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,632 INFO L185 Difference]: Start difference. First operand has 1043 places, 950 transitions, 2283 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:48,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 951 transitions, 2309 flow [2021-06-10 11:48:48,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 951 transitions, 2307 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:48,642 INFO L241 Difference]: Finished difference. Result has 1046 places, 951 transitions, 2299 flow [2021-06-10 11:48:48,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2299, PETRI_PLACES=1046, PETRI_TRANSITIONS=951} [2021-06-10 11:48:48,643 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 37 predicate places. [2021-06-10 11:48:48,643 INFO L480 AbstractCegarLoop]: Abstraction has has 1046 places, 951 transitions, 2299 flow [2021-06-10 11:48:48,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:48,643 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:48,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2355 [2021-06-10 11:48:48,643 INFO L428 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 141404690, now seen corresponding path program 1 times [2021-06-10 11:48:48,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:48,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627505031] [2021-06-10 11:48:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:48,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:48,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:48,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:48,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:48:48,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627505031] [2021-06-10 11:48:48,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:48,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:48,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357874825] [2021-06-10 11:48:48,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:48,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:48,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:48,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 951 transitions, 2299 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:48,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:48,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:48,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:49,183 INFO L129 PetriNetUnfolder]: 57/1118 cut-off events. [2021-06-10 11:48:49,183 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:49,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1118 events. 57/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4850 event pairs, 0 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1351. Up to 39 conditions per place. [2021-06-10 11:48:49,234 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/948 dead transitions. [2021-06-10 11:48:49,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 948 transitions, 2296 flow [2021-06-10 11:48:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:49,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:49,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:49,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:49,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:49,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:49,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,239 INFO L185 Difference]: Start difference. First operand has 1046 places, 951 transitions, 2299 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:49,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1048 places, 948 transitions, 2296 flow [2021-06-10 11:48:49,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 948 transitions, 2288 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:49,248 INFO L241 Difference]: Finished difference. Result has 1045 places, 948 transitions, 2278 flow [2021-06-10 11:48:49,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2278, PETRI_PLACES=1045, PETRI_TRANSITIONS=948} [2021-06-10 11:48:49,248 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 36 predicate places. [2021-06-10 11:48:49,248 INFO L480 AbstractCegarLoop]: Abstraction has has 1045 places, 948 transitions, 2278 flow [2021-06-10 11:48:49,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,249 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:49,249 INFO L263 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:49,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2356 [2021-06-10 11:48:49,249 INFO L428 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash 141405713, now seen corresponding path program 1 times [2021-06-10 11:48:49,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:49,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679158969] [2021-06-10 11:48:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:49,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:49,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:49,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2021-06-10 11:48:49,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679158969] [2021-06-10 11:48:49,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:49,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:49,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498832469] [2021-06-10 11:48:49,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:49,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:49,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:49,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 948 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:49,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:49,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:49,756 INFO L129 PetriNetUnfolder]: 57/1116 cut-off events. [2021-06-10 11:48:49,757 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:49,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1116 events. 57/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4837 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1354. Up to 39 conditions per place. [2021-06-10 11:48:49,834 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/946 dead transitions. [2021-06-10 11:48:49,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 946 transitions, 2291 flow [2021-06-10 11:48:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:49,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:49,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:49,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:49,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:49,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:49,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,839 INFO L185 Difference]: Start difference. First operand has 1045 places, 948 transitions, 2278 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:49,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 946 transitions, 2291 flow [2021-06-10 11:48:49,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 946 transitions, 2290 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:49,849 INFO L241 Difference]: Finished difference. Result has 1044 places, 946 transitions, 2274 flow [2021-06-10 11:48:49,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=1044, PETRI_TRANSITIONS=946} [2021-06-10 11:48:49,849 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 35 predicate places. [2021-06-10 11:48:49,849 INFO L480 AbstractCegarLoop]: Abstraction has has 1044 places, 946 transitions, 2274 flow [2021-06-10 11:48:49,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:49,850 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:49,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2357 [2021-06-10 11:48:49,850 INFO L428 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:49,850 INFO L82 PathProgramCache]: Analyzing trace with hash 659110755, now seen corresponding path program 1 times [2021-06-10 11:48:49,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:49,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729518856] [2021-06-10 11:48:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:49,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:49,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:49,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:49,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:48:49,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729518856] [2021-06-10 11:48:49,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:49,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:49,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48304452] [2021-06-10 11:48:49,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:49,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:49,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:49,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 946 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:49,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:49,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:49,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:50,383 INFO L129 PetriNetUnfolder]: 56/1124 cut-off events. [2021-06-10 11:48:50,383 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:50,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 1124 events. 56/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4905 event pairs, 0 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1366. Up to 39 conditions per place. [2021-06-10 11:48:50,463 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/948 dead transitions. [2021-06-10 11:48:50,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 948 transitions, 2304 flow [2021-06-10 11:48:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:50,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:50,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:50,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:50,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:50,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:50,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:50,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:50,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:50,468 INFO L185 Difference]: Start difference. First operand has 1044 places, 946 transitions, 2274 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:50,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 948 transitions, 2304 flow [2021-06-10 11:48:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 948 transitions, 2303 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:50,478 INFO L241 Difference]: Finished difference. Result has 1047 places, 948 transitions, 2297 flow [2021-06-10 11:48:50,478 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2297, PETRI_PLACES=1047, PETRI_TRANSITIONS=948} [2021-06-10 11:48:50,478 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 38 predicate places. [2021-06-10 11:48:50,478 INFO L480 AbstractCegarLoop]: Abstraction has has 1047 places, 948 transitions, 2297 flow [2021-06-10 11:48:50,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:50,478 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:50,478 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:50,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2358 [2021-06-10 11:48:50,479 INFO L428 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 659109732, now seen corresponding path program 1 times [2021-06-10 11:48:50,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:50,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113569172] [2021-06-10 11:48:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:50,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:50,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:50,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:50,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:50,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:50,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:48:50,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113569172] [2021-06-10 11:48:50,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:50,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:50,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308120041] [2021-06-10 11:48:50,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:50,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:50,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:50,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:50,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 948 transitions, 2297 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:50,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:50,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:50,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:51,005 INFO L129 PetriNetUnfolder]: 54/1125 cut-off events. [2021-06-10 11:48:51,006 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:51,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 1125 events. 54/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4930 event pairs, 0 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1366. Up to 39 conditions per place. [2021-06-10 11:48:51,086 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/948 dead transitions. [2021-06-10 11:48:51,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 948 transitions, 2309 flow [2021-06-10 11:48:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:51,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:51,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:51,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:51,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:51,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:51,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,090 INFO L185 Difference]: Start difference. First operand has 1047 places, 948 transitions, 2297 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:51,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 948 transitions, 2309 flow [2021-06-10 11:48:51,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 948 transitions, 2304 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:51,101 INFO L241 Difference]: Finished difference. Result has 1049 places, 947 transitions, 2293 flow [2021-06-10 11:48:51,101 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2293, PETRI_PLACES=1049, PETRI_TRANSITIONS=947} [2021-06-10 11:48:51,101 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 40 predicate places. [2021-06-10 11:48:51,101 INFO L480 AbstractCegarLoop]: Abstraction has has 1049 places, 947 transitions, 2293 flow [2021-06-10 11:48:51,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:51,102 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:51,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2359 [2021-06-10 11:48:51,102 INFO L428 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:51,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash 658157443, now seen corresponding path program 1 times [2021-06-10 11:48:51,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:51,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604080934] [2021-06-10 11:48:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:51,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:51,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:51,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:48:51,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604080934] [2021-06-10 11:48:51,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:51,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:51,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829853523] [2021-06-10 11:48:51,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:51,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:51,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:51,132 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:51,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 947 transitions, 2293 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:51,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:51,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:51,592 INFO L129 PetriNetUnfolder]: 54/1118 cut-off events. [2021-06-10 11:48:51,593 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:51,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 1118 events. 54/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4869 event pairs, 0 based on Foata normal form. 1/1028 useless extension candidates. Maximal degree in co-relation 1360. Up to 39 conditions per place. [2021-06-10 11:48:51,667 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/945 dead transitions. [2021-06-10 11:48:51,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 945 transitions, 2296 flow [2021-06-10 11:48:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:51,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:51,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:51,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:51,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:51,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:51,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,673 INFO L185 Difference]: Start difference. First operand has 1049 places, 947 transitions, 2293 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:51,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1051 places, 945 transitions, 2296 flow [2021-06-10 11:48:51,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 945 transitions, 2289 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:51,683 INFO L241 Difference]: Finished difference. Result has 1049 places, 945 transitions, 2282 flow [2021-06-10 11:48:51,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2282, PETRI_PLACES=1049, PETRI_TRANSITIONS=945} [2021-06-10 11:48:51,683 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 40 predicate places. [2021-06-10 11:48:51,683 INFO L480 AbstractCegarLoop]: Abstraction has has 1049 places, 945 transitions, 2282 flow [2021-06-10 11:48:51,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:51,684 INFO L263 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:51,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2360 [2021-06-10 11:48:51,684 INFO L428 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash 658156420, now seen corresponding path program 1 times [2021-06-10 11:48:51,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:51,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959501393] [2021-06-10 11:48:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:51,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:51,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:51,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:51,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2021-06-10 11:48:51,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959501393] [2021-06-10 11:48:51,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:51,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:51,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075255708] [2021-06-10 11:48:51,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:51,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:51,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:51,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 945 transitions, 2282 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:51,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:51,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:51,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:52,198 INFO L129 PetriNetUnfolder]: 54/1116 cut-off events. [2021-06-10 11:48:52,198 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:52,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1116 events. 54/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4855 event pairs, 0 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1360. Up to 39 conditions per place. [2021-06-10 11:48:52,278 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/943 dead transitions. [2021-06-10 11:48:52,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 943 transitions, 2295 flow [2021-06-10 11:48:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:52,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:52,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:52,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:52,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:52,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:52,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,283 INFO L185 Difference]: Start difference. First operand has 1049 places, 945 transitions, 2282 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:52,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 943 transitions, 2295 flow [2021-06-10 11:48:52,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 943 transitions, 2294 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:52,293 INFO L241 Difference]: Finished difference. Result has 1048 places, 943 transitions, 2278 flow [2021-06-10 11:48:52,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2278, PETRI_PLACES=1048, PETRI_TRANSITIONS=943} [2021-06-10 11:48:52,294 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 39 predicate places. [2021-06-10 11:48:52,294 INFO L480 AbstractCegarLoop]: Abstraction has has 1048 places, 943 transitions, 2278 flow [2021-06-10 11:48:52,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:52,294 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:52,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2361 [2021-06-10 11:48:52,294 INFO L428 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash -320694314, now seen corresponding path program 1 times [2021-06-10 11:48:52,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:52,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580653487] [2021-06-10 11:48:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:52,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:52,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:52,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:48:52,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580653487] [2021-06-10 11:48:52,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:52,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:52,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964525178] [2021-06-10 11:48:52,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:52,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:52,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:52,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 943 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:52,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:52,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:52,812 INFO L129 PetriNetUnfolder]: 52/1121 cut-off events. [2021-06-10 11:48:52,813 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:52,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 1121 events. 52/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4906 event pairs, 0 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1363. Up to 39 conditions per place. [2021-06-10 11:48:52,891 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2021-06-10 11:48:52,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 944 transitions, 2294 flow [2021-06-10 11:48:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:52,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:52,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:52,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:52,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:52,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:52,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,896 INFO L185 Difference]: Start difference. First operand has 1048 places, 943 transitions, 2278 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:52,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 944 transitions, 2294 flow [2021-06-10 11:48:52,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 944 transitions, 2293 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:52,906 INFO L241 Difference]: Finished difference. Result has 1051 places, 944 transitions, 2291 flow [2021-06-10 11:48:52,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2291, PETRI_PLACES=1051, PETRI_TRANSITIONS=944} [2021-06-10 11:48:52,906 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 42 predicate places. [2021-06-10 11:48:52,906 INFO L480 AbstractCegarLoop]: Abstraction has has 1051 places, 944 transitions, 2291 flow [2021-06-10 11:48:52,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:52,906 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:52,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2362 [2021-06-10 11:48:52,907 INFO L428 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -320695337, now seen corresponding path program 1 times [2021-06-10 11:48:52,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:52,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897499612] [2021-06-10 11:48:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:52,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:52,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:52,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:52,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:48:52,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897499612] [2021-06-10 11:48:52,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:52,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:52,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848493679] [2021-06-10 11:48:52,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:52,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:52,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:52,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 944 transitions, 2291 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:52,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:52,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:52,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:53,430 INFO L129 PetriNetUnfolder]: 52/1122 cut-off events. [2021-06-10 11:48:53,430 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:53,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1122 events. 52/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4911 event pairs, 0 based on Foata normal form. 0/1031 useless extension candidates. Maximal degree in co-relation 1371. Up to 39 conditions per place. [2021-06-10 11:48:53,487 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/945 dead transitions. [2021-06-10 11:48:53,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 945 transitions, 2317 flow [2021-06-10 11:48:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:53,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:53,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:53,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:53,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:53,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:53,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:53,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:53,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:53,491 INFO L185 Difference]: Start difference. First operand has 1051 places, 944 transitions, 2291 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:53,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 945 transitions, 2317 flow [2021-06-10 11:48:53,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 945 transitions, 2315 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:53,500 INFO L241 Difference]: Finished difference. Result has 1054 places, 945 transitions, 2307 flow [2021-06-10 11:48:53,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2307, PETRI_PLACES=1054, PETRI_TRANSITIONS=945} [2021-06-10 11:48:53,500 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 45 predicate places. [2021-06-10 11:48:53,500 INFO L480 AbstractCegarLoop]: Abstraction has has 1054 places, 945 transitions, 2307 flow [2021-06-10 11:48:53,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:53,501 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:53,501 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:53,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2363 [2021-06-10 11:48:53,501 INFO L428 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash -319741002, now seen corresponding path program 1 times [2021-06-10 11:48:53,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:53,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931069671] [2021-06-10 11:48:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:53,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:53,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:53,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:53,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:53,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:53,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:48:53,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931069671] [2021-06-10 11:48:53,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:53,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:53,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804290275] [2021-06-10 11:48:53,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:53,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:53,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:53,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1054 places, 945 transitions, 2307 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:53,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:53,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:53,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:53,991 INFO L129 PetriNetUnfolder]: 51/1119 cut-off events. [2021-06-10 11:48:53,991 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:48:54,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1119 events. 51/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4893 event pairs, 0 based on Foata normal form. 2/1032 useless extension candidates. Maximal degree in co-relation 1370. Up to 39 conditions per place. [2021-06-10 11:48:54,068 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/943 dead transitions. [2021-06-10 11:48:54,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1056 places, 943 transitions, 2315 flow [2021-06-10 11:48:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:48:54,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:48:54,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:48:54,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:48:54,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:54,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:48:54,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,072 INFO L185 Difference]: Start difference. First operand has 1054 places, 945 transitions, 2307 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:48:54,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1056 places, 943 transitions, 2315 flow [2021-06-10 11:48:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1055 places, 943 transitions, 2314 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:54,082 INFO L241 Difference]: Finished difference. Result has 1055 places, 943 transitions, 2296 flow [2021-06-10 11:48:54,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=1053, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2296, PETRI_PLACES=1055, PETRI_TRANSITIONS=943} [2021-06-10 11:48:54,082 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 46 predicate places. [2021-06-10 11:48:54,082 INFO L480 AbstractCegarLoop]: Abstraction has has 1055 places, 943 transitions, 2296 flow [2021-06-10 11:48:54,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:54,082 INFO L263 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:54,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2364 [2021-06-10 11:48:54,082 INFO L428 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -319742025, now seen corresponding path program 1 times [2021-06-10 11:48:54,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:54,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958902390] [2021-06-10 11:48:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:54,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:54,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:54,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2021-06-10 11:48:54,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958902390] [2021-06-10 11:48:54,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:54,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:54,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359962383] [2021-06-10 11:48:54,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:54,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:54,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:54,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 943 transitions, 2296 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:54,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:54,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:54,569 INFO L129 PetriNetUnfolder]: 51/1116 cut-off events. [2021-06-10 11:48:54,569 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:48:54,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 1116 events. 51/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4872 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1364. Up to 39 conditions per place. [2021-06-10 11:48:54,648 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/940 dead transitions. [2021-06-10 11:48:54,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1055 places, 940 transitions, 2297 flow [2021-06-10 11:48:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:54,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:54,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:54,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:54,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:54,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:54,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,653 INFO L185 Difference]: Start difference. First operand has 1055 places, 943 transitions, 2296 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:54,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1055 places, 940 transitions, 2297 flow [2021-06-10 11:48:54,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 940 transitions, 2292 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:54,662 INFO L241 Difference]: Finished difference. Result has 1052 places, 940 transitions, 2282 flow [2021-06-10 11:48:54,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2282, PETRI_PLACES=1052, PETRI_TRANSITIONS=940} [2021-06-10 11:48:54,663 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 43 predicate places. [2021-06-10 11:48:54,663 INFO L480 AbstractCegarLoop]: Abstraction has has 1052 places, 940 transitions, 2282 flow [2021-06-10 11:48:54,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,663 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:54,663 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:54,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2365 [2021-06-10 11:48:54,663 INFO L428 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash -936979029, now seen corresponding path program 1 times [2021-06-10 11:48:54,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:54,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259464757] [2021-06-10 11:48:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:54,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:54,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:54,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:54,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:48:54,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259464757] [2021-06-10 11:48:54,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:54,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:54,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805540230] [2021-06-10 11:48:54,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:54,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:54,692 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:54,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 940 transitions, 2282 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:54,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:54,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:54,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:55,166 INFO L129 PetriNetUnfolder]: 50/1124 cut-off events. [2021-06-10 11:48:55,166 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:55,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 1124 events. 50/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4938 event pairs, 0 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1381. Up to 39 conditions per place. [2021-06-10 11:48:55,243 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/942 dead transitions. [2021-06-10 11:48:55,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1054 places, 942 transitions, 2312 flow [2021-06-10 11:48:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:48:55,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:48:55,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:48:55,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:48:55,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:55,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:48:55,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,248 INFO L185 Difference]: Start difference. First operand has 1052 places, 940 transitions, 2282 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:48:55,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1054 places, 942 transitions, 2312 flow [2021-06-10 11:48:55,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1053 places, 942 transitions, 2311 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:55,267 INFO L241 Difference]: Finished difference. Result has 1055 places, 942 transitions, 2305 flow [2021-06-10 11:48:55,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=1051, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2305, PETRI_PLACES=1055, PETRI_TRANSITIONS=942} [2021-06-10 11:48:55,267 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 46 predicate places. [2021-06-10 11:48:55,267 INFO L480 AbstractCegarLoop]: Abstraction has has 1055 places, 942 transitions, 2305 flow [2021-06-10 11:48:55,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:55,267 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:55,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2366 [2021-06-10 11:48:55,268 INFO L428 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash -936978006, now seen corresponding path program 1 times [2021-06-10 11:48:55,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:55,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107276422] [2021-06-10 11:48:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:55,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:55,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:55,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:48:55,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107276422] [2021-06-10 11:48:55,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:55,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:55,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405630596] [2021-06-10 11:48:55,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:55,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:55,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:55,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 942 transitions, 2305 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:55,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:55,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:55,751 INFO L129 PetriNetUnfolder]: 49/1122 cut-off events. [2021-06-10 11:48:55,752 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:55,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1122 events. 49/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4931 event pairs, 0 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 1376. Up to 39 conditions per place. [2021-06-10 11:48:55,827 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2021-06-10 11:48:55,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1057 places, 942 transitions, 2317 flow [2021-06-10 11:48:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:55,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:55,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:55,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:55,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:55,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:55,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,831 INFO L185 Difference]: Start difference. First operand has 1055 places, 942 transitions, 2305 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:55,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1057 places, 942 transitions, 2317 flow [2021-06-10 11:48:55,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1056 places, 942 transitions, 2312 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:55,840 INFO L241 Difference]: Finished difference. Result has 1058 places, 942 transitions, 2310 flow [2021-06-10 11:48:55,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=1054, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1058, PETRI_TRANSITIONS=942} [2021-06-10 11:48:55,841 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 49 predicate places. [2021-06-10 11:48:55,841 INFO L480 AbstractCegarLoop]: Abstraction has has 1058 places, 942 transitions, 2310 flow [2021-06-10 11:48:55,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:55,841 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:55,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2367 [2021-06-10 11:48:55,841 INFO L428 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash -936025717, now seen corresponding path program 1 times [2021-06-10 11:48:55,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:55,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360142191] [2021-06-10 11:48:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:55,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:55,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:55,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:55,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:48:55,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360142191] [2021-06-10 11:48:55,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:55,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:55,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058525465] [2021-06-10 11:48:55,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:55,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:55,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:55,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:55,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:55,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1058 places, 942 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:55,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:55,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:55,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:56,325 INFO L129 PetriNetUnfolder]: 48/1118 cut-off events. [2021-06-10 11:48:56,325 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:48:56,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1118 events. 48/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4900 event pairs, 0 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1373. Up to 39 conditions per place. [2021-06-10 11:48:56,401 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/939 dead transitions. [2021-06-10 11:48:56,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1060 places, 939 transitions, 2307 flow [2021-06-10 11:48:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:56,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:56,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:56,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:56,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:56,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:56,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,406 INFO L185 Difference]: Start difference. First operand has 1058 places, 942 transitions, 2310 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:56,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1060 places, 939 transitions, 2307 flow [2021-06-10 11:48:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1057 places, 939 transitions, 2300 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:56,415 INFO L241 Difference]: Finished difference. Result has 1057 places, 939 transitions, 2290 flow [2021-06-10 11:48:56,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1055, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2290, PETRI_PLACES=1057, PETRI_TRANSITIONS=939} [2021-06-10 11:48:56,416 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 48 predicate places. [2021-06-10 11:48:56,416 INFO L480 AbstractCegarLoop]: Abstraction has has 1057 places, 939 transitions, 2290 flow [2021-06-10 11:48:56,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:56,416 INFO L263 CegarLoopForPetriNet]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:56,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2368 [2021-06-10 11:48:56,416 INFO L428 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash -936024694, now seen corresponding path program 1 times [2021-06-10 11:48:56,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:56,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677032429] [2021-06-10 11:48:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:56,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:56,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:56,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:56,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:56,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:56,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-06-10 11:48:56,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677032429] [2021-06-10 11:48:56,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:56,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:56,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566116251] [2021-06-10 11:48:56,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:56,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:56,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:56,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:56,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1057 places, 939 transitions, 2290 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:56,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:56,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:56,911 INFO L129 PetriNetUnfolder]: 48/1116 cut-off events. [2021-06-10 11:48:56,911 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:56,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 1116 events. 48/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4886 event pairs, 0 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1374. Up to 39 conditions per place. [2021-06-10 11:48:56,986 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/937 dead transitions. [2021-06-10 11:48:56,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1057 places, 937 transitions, 2303 flow [2021-06-10 11:48:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:56,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:56,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:56,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:56,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:56,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:56,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:56,991 INFO L185 Difference]: Start difference. First operand has 1057 places, 939 transitions, 2290 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:56,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1057 places, 937 transitions, 2303 flow [2021-06-10 11:48:56,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1056 places, 937 transitions, 2302 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:57,000 INFO L241 Difference]: Finished difference. Result has 1056 places, 937 transitions, 2286 flow [2021-06-10 11:48:57,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=1054, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2286, PETRI_PLACES=1056, PETRI_TRANSITIONS=937} [2021-06-10 11:48:57,000 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 47 predicate places. [2021-06-10 11:48:57,000 INFO L480 AbstractCegarLoop]: Abstraction has has 1056 places, 937 transitions, 2286 flow [2021-06-10 11:48:57,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,000 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:57,001 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:57,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2369 [2021-06-10 11:48:57,001 INFO L428 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1525388673, now seen corresponding path program 1 times [2021-06-10 11:48:57,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:57,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666382490] [2021-06-10 11:48:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:57,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:57,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:57,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:48:57,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666382490] [2021-06-10 11:48:57,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:57,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:57,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257967745] [2021-06-10 11:48:57,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:57,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:57,028 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:57,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1056 places, 937 transitions, 2286 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:57,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:57,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:57,475 INFO L129 PetriNetUnfolder]: 46/1121 cut-off events. [2021-06-10 11:48:57,476 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:57,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1121 events. 46/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4937 event pairs, 0 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 1377. Up to 39 conditions per place. [2021-06-10 11:48:57,538 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2021-06-10 11:48:57,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1058 places, 938 transitions, 2302 flow [2021-06-10 11:48:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:57,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:57,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:57,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:57,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:57,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:57,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,543 INFO L185 Difference]: Start difference. First operand has 1056 places, 937 transitions, 2286 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:57,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1058 places, 938 transitions, 2302 flow [2021-06-10 11:48:57,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1057 places, 938 transitions, 2301 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:57,551 INFO L241 Difference]: Finished difference. Result has 1059 places, 938 transitions, 2299 flow [2021-06-10 11:48:57,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=1055, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2299, PETRI_PLACES=1059, PETRI_TRANSITIONS=938} [2021-06-10 11:48:57,552 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 50 predicate places. [2021-06-10 11:48:57,552 INFO L480 AbstractCegarLoop]: Abstraction has has 1059 places, 938 transitions, 2299 flow [2021-06-10 11:48:57,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:57,552 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:57,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2370 [2021-06-10 11:48:57,552 INFO L428 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1525389696, now seen corresponding path program 1 times [2021-06-10 11:48:57,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:57,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520592766] [2021-06-10 11:48:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:57,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:57,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:57,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:57,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:48:57,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520592766] [2021-06-10 11:48:57,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:57,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:57,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744024108] [2021-06-10 11:48:57,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:57,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:57,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:57,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1059 places, 938 transitions, 2299 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:57,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:57,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:57,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:58,047 INFO L129 PetriNetUnfolder]: 46/1122 cut-off events. [2021-06-10 11:48:58,047 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:48:58,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1122 events. 46/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4946 event pairs, 0 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1385. Up to 39 conditions per place. [2021-06-10 11:48:58,123 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/939 dead transitions. [2021-06-10 11:48:58,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1061 places, 939 transitions, 2325 flow [2021-06-10 11:48:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:48:58,124 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:48:58,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:48:58,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:48:58,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:58,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:48:58,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,127 INFO L185 Difference]: Start difference. First operand has 1059 places, 938 transitions, 2299 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:48:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1061 places, 939 transitions, 2325 flow [2021-06-10 11:48:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1060 places, 939 transitions, 2323 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:58,137 INFO L241 Difference]: Finished difference. Result has 1062 places, 939 transitions, 2315 flow [2021-06-10 11:48:58,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=1058, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2315, PETRI_PLACES=1062, PETRI_TRANSITIONS=939} [2021-06-10 11:48:58,137 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 53 predicate places. [2021-06-10 11:48:58,137 INFO L480 AbstractCegarLoop]: Abstraction has has 1062 places, 939 transitions, 2315 flow [2021-06-10 11:48:58,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:58,137 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:58,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2371 [2021-06-10 11:48:58,137 INFO L428 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1524436384, now seen corresponding path program 1 times [2021-06-10 11:48:58,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:58,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190249599] [2021-06-10 11:48:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:58,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:58,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:58,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:48:58,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190249599] [2021-06-10 11:48:58,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:58,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:58,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109702977] [2021-06-10 11:48:58,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:58,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:58,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:58,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1062 places, 939 transitions, 2315 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:58,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:58,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:58,641 INFO L129 PetriNetUnfolder]: 45/1118 cut-off events. [2021-06-10 11:48:58,641 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:48:58,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 1118 events. 45/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4921 event pairs, 0 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 1378. Up to 39 conditions per place. [2021-06-10 11:48:58,719 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2021-06-10 11:48:58,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1064 places, 936 transitions, 2312 flow [2021-06-10 11:48:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:48:58,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:48:58,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:48:58,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:48:58,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:58,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:48:58,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,723 INFO L185 Difference]: Start difference. First operand has 1062 places, 939 transitions, 2315 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:48:58,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1064 places, 936 transitions, 2312 flow [2021-06-10 11:48:58,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1061 places, 936 transitions, 2304 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:48:58,733 INFO L241 Difference]: Finished difference. Result has 1061 places, 936 transitions, 2294 flow [2021-06-10 11:48:58,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1059, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1061, PETRI_TRANSITIONS=936} [2021-06-10 11:48:58,733 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 52 predicate places. [2021-06-10 11:48:58,733 INFO L480 AbstractCegarLoop]: Abstraction has has 1061 places, 936 transitions, 2294 flow [2021-06-10 11:48:58,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:58,734 INFO L263 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:58,734 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2372 [2021-06-10 11:48:58,734 INFO L428 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1524435361, now seen corresponding path program 1 times [2021-06-10 11:48:58,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:58,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764411210] [2021-06-10 11:48:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:58,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:58,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:48:58,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:58,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-06-10 11:48:58,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764411210] [2021-06-10 11:48:58,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:58,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:58,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563796061] [2021-06-10 11:48:58,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:58,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:58,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:58,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:58,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1061 places, 936 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:58,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:58,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:58,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:59,290 INFO L129 PetriNetUnfolder]: 45/1116 cut-off events. [2021-06-10 11:48:59,290 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:59,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1116 events. 45/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4904 event pairs, 0 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1381. Up to 39 conditions per place. [2021-06-10 11:48:59,337 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/934 dead transitions. [2021-06-10 11:48:59,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1061 places, 934 transitions, 2307 flow [2021-06-10 11:48:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:48:59,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:48:59,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:48:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:48:59,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:59,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:48:59,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,342 INFO L185 Difference]: Start difference. First operand has 1061 places, 936 transitions, 2294 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:48:59,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1061 places, 934 transitions, 2307 flow [2021-06-10 11:48:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1060 places, 934 transitions, 2306 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:59,350 INFO L241 Difference]: Finished difference. Result has 1060 places, 934 transitions, 2290 flow [2021-06-10 11:48:59,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1058, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2290, PETRI_PLACES=1060, PETRI_TRANSITIONS=934} [2021-06-10 11:48:59,350 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 51 predicate places. [2021-06-10 11:48:59,351 INFO L480 AbstractCegarLoop]: Abstraction has has 1060 places, 934 transitions, 2290 flow [2021-06-10 11:48:59,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,351 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:59,351 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:59,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2373 [2021-06-10 11:48:59,351 INFO L428 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -782351403, now seen corresponding path program 1 times [2021-06-10 11:48:59,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:59,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472419186] [2021-06-10 11:48:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:59,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:59,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:48:59,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:48:59,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472419186] [2021-06-10 11:48:59,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:59,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:59,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847253710] [2021-06-10 11:48:59,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:59,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:59,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:48:59,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1060 places, 934 transitions, 2290 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:59,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:48:59,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:48:59,843 INFO L129 PetriNetUnfolder]: 43/1121 cut-off events. [2021-06-10 11:48:59,843 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:48:59,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 1121 events. 43/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4956 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1384. Up to 39 conditions per place. [2021-06-10 11:48:59,917 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/935 dead transitions. [2021-06-10 11:48:59,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1062 places, 935 transitions, 2306 flow [2021-06-10 11:48:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:48:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:48:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:48:59,919 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:48:59,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:48:59,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:48:59,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:48:59,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:48:59,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,921 INFO L185 Difference]: Start difference. First operand has 1060 places, 934 transitions, 2290 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:48:59,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1062 places, 935 transitions, 2306 flow [2021-06-10 11:48:59,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1061 places, 935 transitions, 2305 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:48:59,931 INFO L241 Difference]: Finished difference. Result has 1063 places, 935 transitions, 2303 flow [2021-06-10 11:48:59,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=1059, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2303, PETRI_PLACES=1063, PETRI_TRANSITIONS=935} [2021-06-10 11:48:59,931 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 54 predicate places. [2021-06-10 11:48:59,931 INFO L480 AbstractCegarLoop]: Abstraction has has 1063 places, 935 transitions, 2303 flow [2021-06-10 11:48:59,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,931 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:48:59,931 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:48:59,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2374 [2021-06-10 11:48:59,931 INFO L428 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:48:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:48:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash -782352426, now seen corresponding path program 1 times [2021-06-10 11:48:59,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:48:59,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083182856] [2021-06-10 11:48:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:48:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:48:59,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:59,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:48:59,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:48:59,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:48:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:48:59,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083182856] [2021-06-10 11:48:59,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:48:59,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:48:59,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365040638] [2021-06-10 11:48:59,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:48:59,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:48:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:48:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:48:59,960 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:48:59,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1063 places, 935 transitions, 2303 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:48:59,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:48:59,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:48:59,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:00,439 INFO L129 PetriNetUnfolder]: 43/1122 cut-off events. [2021-06-10 11:49:00,440 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:00,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1122 events. 43/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4962 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1392. Up to 39 conditions per place. [2021-06-10 11:49:00,514 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/936 dead transitions. [2021-06-10 11:49:00,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1065 places, 936 transitions, 2329 flow [2021-06-10 11:49:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:00,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:00,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:00,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:00,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:00,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:00,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:00,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:00,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:00,518 INFO L185 Difference]: Start difference. First operand has 1063 places, 935 transitions, 2303 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:00,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1065 places, 936 transitions, 2329 flow [2021-06-10 11:49:00,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1064 places, 936 transitions, 2327 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:00,528 INFO L241 Difference]: Finished difference. Result has 1066 places, 936 transitions, 2319 flow [2021-06-10 11:49:00,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=1062, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2319, PETRI_PLACES=1066, PETRI_TRANSITIONS=936} [2021-06-10 11:49:00,528 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 57 predicate places. [2021-06-10 11:49:00,528 INFO L480 AbstractCegarLoop]: Abstraction has has 1066 places, 936 transitions, 2319 flow [2021-06-10 11:49:00,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:00,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:00,528 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:00,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2375 [2021-06-10 11:49:00,528 INFO L428 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:00,529 INFO L82 PathProgramCache]: Analyzing trace with hash -781398091, now seen corresponding path program 1 times [2021-06-10 11:49:00,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:00,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553510975] [2021-06-10 11:49:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:00,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:00,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:00,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:00,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:00,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:00,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:49:00,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553510975] [2021-06-10 11:49:00,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:00,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:00,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256649602] [2021-06-10 11:49:00,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:00,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:00,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:00,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1066 places, 936 transitions, 2319 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:00,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:00,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:00,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:01,031 INFO L129 PetriNetUnfolder]: 42/1119 cut-off events. [2021-06-10 11:49:01,031 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:49:01,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 1119 events. 42/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4947 event pairs, 0 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 1391. Up to 39 conditions per place. [2021-06-10 11:49:01,106 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/934 dead transitions. [2021-06-10 11:49:01,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1068 places, 934 transitions, 2327 flow [2021-06-10 11:49:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:49:01,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:49:01,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:49:01,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:49:01,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:01,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:49:01,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,110 INFO L185 Difference]: Start difference. First operand has 1066 places, 936 transitions, 2319 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:49:01,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1068 places, 934 transitions, 2327 flow [2021-06-10 11:49:01,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1067 places, 934 transitions, 2326 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:01,120 INFO L241 Difference]: Finished difference. Result has 1067 places, 934 transitions, 2308 flow [2021-06-10 11:49:01,120 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=1065, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2308, PETRI_PLACES=1067, PETRI_TRANSITIONS=934} [2021-06-10 11:49:01,120 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 58 predicate places. [2021-06-10 11:49:01,120 INFO L480 AbstractCegarLoop]: Abstraction has has 1067 places, 934 transitions, 2308 flow [2021-06-10 11:49:01,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,120 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:01,120 INFO L263 CegarLoopForPetriNet]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:01,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2376 [2021-06-10 11:49:01,120 INFO L428 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -781399114, now seen corresponding path program 1 times [2021-06-10 11:49:01,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:01,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086682292] [2021-06-10 11:49:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:01,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:01,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:01,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-06-10 11:49:01,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086682292] [2021-06-10 11:49:01,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:01,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:01,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121859658] [2021-06-10 11:49:01,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:01,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:01,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:01,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1067 places, 934 transitions, 2308 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:01,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:01,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:01,611 INFO L129 PetriNetUnfolder]: 42/1116 cut-off events. [2021-06-10 11:49:01,611 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:01,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1116 events. 42/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4924 event pairs, 0 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1385. Up to 39 conditions per place. [2021-06-10 11:49:01,683 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/931 dead transitions. [2021-06-10 11:49:01,683 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1067 places, 931 transitions, 2309 flow [2021-06-10 11:49:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:01,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:01,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:01,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:01,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:01,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:01,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,688 INFO L185 Difference]: Start difference. First operand has 1067 places, 934 transitions, 2308 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:01,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1067 places, 931 transitions, 2309 flow [2021-06-10 11:49:01,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1064 places, 931 transitions, 2304 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:01,697 INFO L241 Difference]: Finished difference. Result has 1064 places, 931 transitions, 2294 flow [2021-06-10 11:49:01,697 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1062, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1064, PETRI_TRANSITIONS=931} [2021-06-10 11:49:01,698 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 55 predicate places. [2021-06-10 11:49:01,698 INFO L480 AbstractCegarLoop]: Abstraction has has 1064 places, 931 transitions, 2294 flow [2021-06-10 11:49:01,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:01,698 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:01,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2377 [2021-06-10 11:49:01,698 INFO L428 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2024842195, now seen corresponding path program 1 times [2021-06-10 11:49:01,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:01,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48727137] [2021-06-10 11:49:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:01,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:01,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:01,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:01,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:49:01,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48727137] [2021-06-10 11:49:01,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:01,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:01,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067701600] [2021-06-10 11:49:01,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:01,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:01,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:01,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1064 places, 931 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:01,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:01,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:01,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:02,207 INFO L129 PetriNetUnfolder]: 41/1124 cut-off events. [2021-06-10 11:49:02,207 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:02,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 1124 events. 41/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4991 event pairs, 0 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1402. Up to 39 conditions per place. [2021-06-10 11:49:02,285 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/933 dead transitions. [2021-06-10 11:49:02,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1066 places, 933 transitions, 2324 flow [2021-06-10 11:49:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:49:02,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:49:02,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:49:02,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:49:02,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:02,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:49:02,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,290 INFO L185 Difference]: Start difference. First operand has 1064 places, 931 transitions, 2294 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:49:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1066 places, 933 transitions, 2324 flow [2021-06-10 11:49:02,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1065 places, 933 transitions, 2323 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:02,300 INFO L241 Difference]: Finished difference. Result has 1067 places, 933 transitions, 2317 flow [2021-06-10 11:49:02,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=1063, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2317, PETRI_PLACES=1067, PETRI_TRANSITIONS=933} [2021-06-10 11:49:02,300 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 58 predicate places. [2021-06-10 11:49:02,300 INFO L480 AbstractCegarLoop]: Abstraction has has 1067 places, 933 transitions, 2317 flow [2021-06-10 11:49:02,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,301 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:02,301 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:02,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2378 [2021-06-10 11:49:02,301 INFO L428 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2024841172, now seen corresponding path program 1 times [2021-06-10 11:49:02,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:02,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105919780] [2021-06-10 11:49:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:02,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:02,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:02,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:49:02,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105919780] [2021-06-10 11:49:02,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:02,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:02,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803365783] [2021-06-10 11:49:02,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:02,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:02,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:02,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1067 places, 933 transitions, 2317 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:02,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:02,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:02,816 INFO L129 PetriNetUnfolder]: 40/1122 cut-off events. [2021-06-10 11:49:02,817 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:02,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1122 events. 40/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4979 event pairs, 0 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1397. Up to 39 conditions per place. [2021-06-10 11:49:02,894 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2021-06-10 11:49:02,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1069 places, 933 transitions, 2329 flow [2021-06-10 11:49:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:02,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:02,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:02,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:02,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:02,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:02,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,899 INFO L185 Difference]: Start difference. First operand has 1067 places, 933 transitions, 2317 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:02,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1069 places, 933 transitions, 2329 flow [2021-06-10 11:49:02,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1068 places, 933 transitions, 2324 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:02,909 INFO L241 Difference]: Finished difference. Result has 1070 places, 933 transitions, 2322 flow [2021-06-10 11:49:02,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1066, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2322, PETRI_PLACES=1070, PETRI_TRANSITIONS=933} [2021-06-10 11:49:02,909 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 61 predicate places. [2021-06-10 11:49:02,909 INFO L480 AbstractCegarLoop]: Abstraction has has 1070 places, 933 transitions, 2322 flow [2021-06-10 11:49:02,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:02,910 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:02,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2379 [2021-06-10 11:49:02,910 INFO L428 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2023888883, now seen corresponding path program 1 times [2021-06-10 11:49:02,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:02,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393350903] [2021-06-10 11:49:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:02,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:02,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:02,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:02,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:49:02,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393350903] [2021-06-10 11:49:02,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:02,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:02,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694488453] [2021-06-10 11:49:02,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:02,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:02,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:02,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1070 places, 933 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:02,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:02,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:02,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:03,406 INFO L129 PetriNetUnfolder]: 39/1118 cut-off events. [2021-06-10 11:49:03,406 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:03,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1118 events. 39/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4955 event pairs, 0 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 1394. Up to 39 conditions per place. [2021-06-10 11:49:03,470 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/930 dead transitions. [2021-06-10 11:49:03,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1072 places, 930 transitions, 2319 flow [2021-06-10 11:49:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:03,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:03,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:03,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:03,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:03,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:03,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:03,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:03,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:03,475 INFO L185 Difference]: Start difference. First operand has 1070 places, 933 transitions, 2322 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:03,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1072 places, 930 transitions, 2319 flow [2021-06-10 11:49:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1069 places, 930 transitions, 2312 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:03,484 INFO L241 Difference]: Finished difference. Result has 1069 places, 930 transitions, 2302 flow [2021-06-10 11:49:03,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1067, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1069, PETRI_TRANSITIONS=930} [2021-06-10 11:49:03,484 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 60 predicate places. [2021-06-10 11:49:03,484 INFO L480 AbstractCegarLoop]: Abstraction has has 1069 places, 930 transitions, 2302 flow [2021-06-10 11:49:03,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:03,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:03,485 INFO L263 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:03,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2380 [2021-06-10 11:49:03,485 INFO L428 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2023887860, now seen corresponding path program 1 times [2021-06-10 11:49:03,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:03,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109685432] [2021-06-10 11:49:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:03,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:03,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:03,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:03,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2021-06-10 11:49:03,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109685432] [2021-06-10 11:49:03,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:03,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:03,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562574569] [2021-06-10 11:49:03,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:03,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:03,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:03,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1069 places, 930 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:03,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:03,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:03,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:04,009 INFO L129 PetriNetUnfolder]: 39/1116 cut-off events. [2021-06-10 11:49:04,009 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:04,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1116 events. 39/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4942 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1395. Up to 39 conditions per place. [2021-06-10 11:49:04,084 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/928 dead transitions. [2021-06-10 11:49:04,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1069 places, 928 transitions, 2315 flow [2021-06-10 11:49:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:04,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:04,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:04,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:04,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:04,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:04,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,089 INFO L185 Difference]: Start difference. First operand has 1069 places, 930 transitions, 2302 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:04,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1069 places, 928 transitions, 2315 flow [2021-06-10 11:49:04,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1068 places, 928 transitions, 2314 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:04,099 INFO L241 Difference]: Finished difference. Result has 1068 places, 928 transitions, 2298 flow [2021-06-10 11:49:04,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=1066, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2298, PETRI_PLACES=1068, PETRI_TRANSITIONS=928} [2021-06-10 11:49:04,100 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 59 predicate places. [2021-06-10 11:49:04,100 INFO L480 AbstractCegarLoop]: Abstraction has has 1068 places, 928 transitions, 2298 flow [2021-06-10 11:49:04,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:04,100 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:04,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2381 [2021-06-10 11:49:04,100 INFO L428 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2063446021, now seen corresponding path program 1 times [2021-06-10 11:49:04,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:04,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242955062] [2021-06-10 11:49:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:04,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:04,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:04,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:49:04,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242955062] [2021-06-10 11:49:04,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:04,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:04,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551973331] [2021-06-10 11:49:04,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:04,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:04,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:04,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1068 places, 928 transitions, 2298 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:04,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:04,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:04,663 INFO L129 PetriNetUnfolder]: 38/1124 cut-off events. [2021-06-10 11:49:04,663 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:04,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1124 events. 38/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5011 event pairs, 0 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1407. Up to 39 conditions per place. [2021-06-10 11:49:04,740 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/930 dead transitions. [2021-06-10 11:49:04,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1070 places, 930 transitions, 2328 flow [2021-06-10 11:49:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:49:04,742 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:49:04,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:49:04,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:49:04,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:04,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:49:04,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,745 INFO L185 Difference]: Start difference. First operand has 1068 places, 928 transitions, 2298 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:49:04,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1070 places, 930 transitions, 2328 flow [2021-06-10 11:49:04,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1069 places, 930 transitions, 2327 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:04,754 INFO L241 Difference]: Finished difference. Result has 1071 places, 930 transitions, 2321 flow [2021-06-10 11:49:04,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=1067, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2321, PETRI_PLACES=1071, PETRI_TRANSITIONS=930} [2021-06-10 11:49:04,755 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 62 predicate places. [2021-06-10 11:49:04,755 INFO L480 AbstractCegarLoop]: Abstraction has has 1071 places, 930 transitions, 2321 flow [2021-06-10 11:49:04,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:04,755 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:04,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2382 [2021-06-10 11:49:04,756 INFO L428 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2063447044, now seen corresponding path program 1 times [2021-06-10 11:49:04,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:04,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257591088] [2021-06-10 11:49:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:04,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:04,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:04,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:04,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:49:04,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257591088] [2021-06-10 11:49:04,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:04,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:04,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450638055] [2021-06-10 11:49:04,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:04,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:04,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:04,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1071 places, 930 transitions, 2321 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:04,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:04,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:04,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:05,350 INFO L129 PetriNetUnfolder]: 37/1122 cut-off events. [2021-06-10 11:49:05,351 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:05,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1122 events. 37/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5001 event pairs, 0 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 1404. Up to 39 conditions per place. [2021-06-10 11:49:05,401 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2021-06-10 11:49:05,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1073 places, 930 transitions, 2333 flow [2021-06-10 11:49:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:05,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:05,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:05,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:05,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:05,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:05,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:05,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:05,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:05,406 INFO L185 Difference]: Start difference. First operand has 1071 places, 930 transitions, 2321 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:05,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1073 places, 930 transitions, 2333 flow [2021-06-10 11:49:05,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1072 places, 930 transitions, 2328 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:05,415 INFO L241 Difference]: Finished difference. Result has 1074 places, 930 transitions, 2326 flow [2021-06-10 11:49:05,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2312, PETRI_DIFFERENCE_MINUEND_PLACES=1070, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2326, PETRI_PLACES=1074, PETRI_TRANSITIONS=930} [2021-06-10 11:49:05,416 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 65 predicate places. [2021-06-10 11:49:05,416 INFO L480 AbstractCegarLoop]: Abstraction has has 1074 places, 930 transitions, 2326 flow [2021-06-10 11:49:05,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:05,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:05,416 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:05,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383 [2021-06-10 11:49:05,416 INFO L428 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2064399333, now seen corresponding path program 1 times [2021-06-10 11:49:05,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:05,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080307820] [2021-06-10 11:49:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:05,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:05,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:05,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:05,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:05,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:49:05,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080307820] [2021-06-10 11:49:05,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:05,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:05,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137987531] [2021-06-10 11:49:05,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:05,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:05,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:05,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1074 places, 930 transitions, 2326 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:05,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:05,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:05,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:05,947 INFO L129 PetriNetUnfolder]: 36/1118 cut-off events. [2021-06-10 11:49:05,947 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:06,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 1118 events. 36/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4974 event pairs, 0 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 1401. Up to 39 conditions per place. [2021-06-10 11:49:06,025 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/927 dead transitions. [2021-06-10 11:49:06,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1076 places, 927 transitions, 2323 flow [2021-06-10 11:49:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:06,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:06,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:06,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:06,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:06,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:06,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,030 INFO L185 Difference]: Start difference. First operand has 1074 places, 930 transitions, 2326 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1076 places, 927 transitions, 2323 flow [2021-06-10 11:49:06,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1073 places, 927 transitions, 2316 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:06,041 INFO L241 Difference]: Finished difference. Result has 1073 places, 927 transitions, 2306 flow [2021-06-10 11:49:06,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1071, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1073, PETRI_TRANSITIONS=927} [2021-06-10 11:49:06,041 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 64 predicate places. [2021-06-10 11:49:06,041 INFO L480 AbstractCegarLoop]: Abstraction has has 1073 places, 927 transitions, 2306 flow [2021-06-10 11:49:06,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:06,042 INFO L263 CegarLoopForPetriNet]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:06,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2384 [2021-06-10 11:49:06,042 INFO L428 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2064400356, now seen corresponding path program 1 times [2021-06-10 11:49:06,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:06,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488035902] [2021-06-10 11:49:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:06,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:06,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:06,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2021-06-10 11:49:06,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488035902] [2021-06-10 11:49:06,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:06,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:06,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641907515] [2021-06-10 11:49:06,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:06,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:06,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:06,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1073 places, 927 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:06,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:06,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:06,594 INFO L129 PetriNetUnfolder]: 36/1116 cut-off events. [2021-06-10 11:49:06,595 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:06,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1116 events. 36/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4959 event pairs, 0 based on Foata normal form. 0/1042 useless extension candidates. Maximal degree in co-relation 1402. Up to 39 conditions per place. [2021-06-10 11:49:06,671 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/925 dead transitions. [2021-06-10 11:49:06,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1073 places, 925 transitions, 2319 flow [2021-06-10 11:49:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:06,673 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:06,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:06,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:06,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:06,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:06,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,676 INFO L185 Difference]: Start difference. First operand has 1073 places, 927 transitions, 2306 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1073 places, 925 transitions, 2319 flow [2021-06-10 11:49:06,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1072 places, 925 transitions, 2318 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:06,686 INFO L241 Difference]: Finished difference. Result has 1072 places, 925 transitions, 2302 flow [2021-06-10 11:49:06,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1070, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1072, PETRI_TRANSITIONS=925} [2021-06-10 11:49:06,687 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 63 predicate places. [2021-06-10 11:49:06,687 INFO L480 AbstractCegarLoop]: Abstraction has has 1072 places, 925 transitions, 2302 flow [2021-06-10 11:49:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,687 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:06,687 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:06,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2385 [2021-06-10 11:49:06,687 INFO L428 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1648488259, now seen corresponding path program 1 times [2021-06-10 11:49:06,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:06,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400967637] [2021-06-10 11:49:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:06,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:06,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:06,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:06,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:49:06,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400967637] [2021-06-10 11:49:06,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:06,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:06,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406181420] [2021-06-10 11:49:06,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:06,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:06,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:06,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1072 places, 925 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:06,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:06,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:06,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:07,247 INFO L129 PetriNetUnfolder]: 35/1124 cut-off events. [2021-06-10 11:49:07,247 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:07,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1124 events. 35/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5028 event pairs, 0 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1414. Up to 39 conditions per place. [2021-06-10 11:49:07,325 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/927 dead transitions. [2021-06-10 11:49:07,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 927 transitions, 2332 flow [2021-06-10 11:49:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:49:07,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:49:07,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:49:07,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:49:07,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:07,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:49:07,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,329 INFO L185 Difference]: Start difference. First operand has 1072 places, 925 transitions, 2302 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:49:07,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1074 places, 927 transitions, 2332 flow [2021-06-10 11:49:07,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1073 places, 927 transitions, 2331 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:07,340 INFO L241 Difference]: Finished difference. Result has 1075 places, 927 transitions, 2325 flow [2021-06-10 11:49:07,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=1071, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2325, PETRI_PLACES=1075, PETRI_TRANSITIONS=927} [2021-06-10 11:49:07,340 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 66 predicate places. [2021-06-10 11:49:07,340 INFO L480 AbstractCegarLoop]: Abstraction has has 1075 places, 927 transitions, 2325 flow [2021-06-10 11:49:07,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,340 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:07,340 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:07,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2386 [2021-06-10 11:49:07,341 INFO L428 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:07,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:07,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1648489282, now seen corresponding path program 1 times [2021-06-10 11:49:07,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:07,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666708440] [2021-06-10 11:49:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:07,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:07,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:07,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:07,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:07,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:07,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:49:07,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666708440] [2021-06-10 11:49:07,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:07,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:07,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713333330] [2021-06-10 11:49:07,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:07,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:07,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:07,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:07,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1075 places, 927 transitions, 2325 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:07,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:07,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:07,894 INFO L129 PetriNetUnfolder]: 33/1125 cut-off events. [2021-06-10 11:49:07,894 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:07,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1125 events. 33/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5050 event pairs, 0 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 1414. Up to 39 conditions per place. [2021-06-10 11:49:07,972 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/927 dead transitions. [2021-06-10 11:49:07,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1077 places, 927 transitions, 2337 flow [2021-06-10 11:49:07,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:07,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:07,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:07,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:07,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:07,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:07,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,977 INFO L185 Difference]: Start difference. First operand has 1075 places, 927 transitions, 2325 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:07,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1077 places, 927 transitions, 2337 flow [2021-06-10 11:49:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1076 places, 927 transitions, 2332 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:07,987 INFO L241 Difference]: Finished difference. Result has 1077 places, 926 transitions, 2321 flow [2021-06-10 11:49:07,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=1074, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2321, PETRI_PLACES=1077, PETRI_TRANSITIONS=926} [2021-06-10 11:49:07,987 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 68 predicate places. [2021-06-10 11:49:07,987 INFO L480 AbstractCegarLoop]: Abstraction has has 1077 places, 926 transitions, 2321 flow [2021-06-10 11:49:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:07,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:07,988 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:07,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2387 [2021-06-10 11:49:07,988 INFO L428 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1649441571, now seen corresponding path program 1 times [2021-06-10 11:49:07,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:07,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918468757] [2021-06-10 11:49:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:08,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:08,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:08,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:49:08,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918468757] [2021-06-10 11:49:08,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:08,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:08,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792752249] [2021-06-10 11:49:08,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:08,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:08,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:08,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1077 places, 926 transitions, 2321 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:08,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:08,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:08,527 INFO L129 PetriNetUnfolder]: 33/1118 cut-off events. [2021-06-10 11:49:08,527 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:08,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 1118 events. 33/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4988 event pairs, 0 based on Foata normal form. 1/1049 useless extension candidates. Maximal degree in co-relation 1408. Up to 39 conditions per place. [2021-06-10 11:49:08,603 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/924 dead transitions. [2021-06-10 11:49:08,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1079 places, 924 transitions, 2324 flow [2021-06-10 11:49:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:08,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:08,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:08,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:08,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:08,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:08,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,607 INFO L185 Difference]: Start difference. First operand has 1077 places, 926 transitions, 2321 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:08,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1079 places, 924 transitions, 2324 flow [2021-06-10 11:49:08,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1076 places, 924 transitions, 2317 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:08,617 INFO L241 Difference]: Finished difference. Result has 1077 places, 924 transitions, 2310 flow [2021-06-10 11:49:08,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=1074, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=924, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1077, PETRI_TRANSITIONS=924} [2021-06-10 11:49:08,618 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 68 predicate places. [2021-06-10 11:49:08,618 INFO L480 AbstractCegarLoop]: Abstraction has has 1077 places, 924 transitions, 2310 flow [2021-06-10 11:49:08,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:08,618 INFO L263 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:08,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2388 [2021-06-10 11:49:08,618 INFO L428 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1649442594, now seen corresponding path program 1 times [2021-06-10 11:49:08,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:08,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961713700] [2021-06-10 11:49:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:08,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:08,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:08,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:08,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2021-06-10 11:49:08,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961713700] [2021-06-10 11:49:08,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:08,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:08,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818514388] [2021-06-10 11:49:08,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:08,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:08,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:08,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1077 places, 924 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:08,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:08,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:08,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:09,157 INFO L129 PetriNetUnfolder]: 33/1116 cut-off events. [2021-06-10 11:49:09,157 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:09,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1116 events. 33/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4975 event pairs, 0 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1408. Up to 39 conditions per place. [2021-06-10 11:49:09,232 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/922 dead transitions. [2021-06-10 11:49:09,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1077 places, 922 transitions, 2323 flow [2021-06-10 11:49:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:09,234 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:09,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:09,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:09,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:09,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:09,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,237 INFO L185 Difference]: Start difference. First operand has 1077 places, 924 transitions, 2310 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:09,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1077 places, 922 transitions, 2323 flow [2021-06-10 11:49:09,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1076 places, 922 transitions, 2322 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:09,247 INFO L241 Difference]: Finished difference. Result has 1076 places, 922 transitions, 2306 flow [2021-06-10 11:49:09,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1074, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1076, PETRI_TRANSITIONS=922} [2021-06-10 11:49:09,247 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 67 predicate places. [2021-06-10 11:49:09,247 INFO L480 AbstractCegarLoop]: Abstraction has has 1076 places, 922 transitions, 2306 flow [2021-06-10 11:49:09,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:09,248 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:09,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2389 [2021-06-10 11:49:09,248 INFO L428 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash 881160759, now seen corresponding path program 1 times [2021-06-10 11:49:09,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:09,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215743864] [2021-06-10 11:49:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:09,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:09,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:09,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:49:09,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215743864] [2021-06-10 11:49:09,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:09,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:09,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545195905] [2021-06-10 11:49:09,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:09,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:09,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:09,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1076 places, 922 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:09,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:09,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:09,761 INFO L129 PetriNetUnfolder]: 31/1121 cut-off events. [2021-06-10 11:49:09,761 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:09,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 1121 events. 31/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5026 event pairs, 0 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 1411. Up to 39 conditions per place. [2021-06-10 11:49:09,826 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/923 dead transitions. [2021-06-10 11:49:09,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1078 places, 923 transitions, 2322 flow [2021-06-10 11:49:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:09,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:09,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:09,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:09,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:09,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:09,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,830 INFO L185 Difference]: Start difference. First operand has 1076 places, 922 transitions, 2306 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:09,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1078 places, 923 transitions, 2322 flow [2021-06-10 11:49:09,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1077 places, 923 transitions, 2321 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:09,840 INFO L241 Difference]: Finished difference. Result has 1079 places, 923 transitions, 2319 flow [2021-06-10 11:49:09,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=1075, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2319, PETRI_PLACES=1079, PETRI_TRANSITIONS=923} [2021-06-10 11:49:09,840 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 70 predicate places. [2021-06-10 11:49:09,840 INFO L480 AbstractCegarLoop]: Abstraction has has 1079 places, 923 transitions, 2319 flow [2021-06-10 11:49:09,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:09,841 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:09,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2390 [2021-06-10 11:49:09,841 INFO L428 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:09,841 INFO L82 PathProgramCache]: Analyzing trace with hash 881159736, now seen corresponding path program 1 times [2021-06-10 11:49:09,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:09,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915911251] [2021-06-10 11:49:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:09,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:09,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:09,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:09,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:49:09,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915911251] [2021-06-10 11:49:09,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:09,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:09,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224410049] [2021-06-10 11:49:09,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:09,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:09,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:09,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1079 places, 923 transitions, 2319 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:09,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:09,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:09,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:10,395 INFO L129 PetriNetUnfolder]: 31/1122 cut-off events. [2021-06-10 11:49:10,395 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:10,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1122 events. 31/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5035 event pairs, 0 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1419. Up to 39 conditions per place. [2021-06-10 11:49:10,471 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/924 dead transitions. [2021-06-10 11:49:10,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1081 places, 924 transitions, 2345 flow [2021-06-10 11:49:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:10,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:10,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:10,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:10,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:10,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:10,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:10,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:10,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:10,475 INFO L185 Difference]: Start difference. First operand has 1079 places, 923 transitions, 2319 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:10,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1081 places, 924 transitions, 2345 flow [2021-06-10 11:49:10,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1080 places, 924 transitions, 2343 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:10,485 INFO L241 Difference]: Finished difference. Result has 1082 places, 924 transitions, 2335 flow [2021-06-10 11:49:10,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=1078, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2335, PETRI_PLACES=1082, PETRI_TRANSITIONS=924} [2021-06-10 11:49:10,486 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 73 predicate places. [2021-06-10 11:49:10,486 INFO L480 AbstractCegarLoop]: Abstraction has has 1082 places, 924 transitions, 2335 flow [2021-06-10 11:49:10,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:10,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:10,486 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:10,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2391 [2021-06-10 11:49:10,486 INFO L428 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 882114071, now seen corresponding path program 1 times [2021-06-10 11:49:10,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:10,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800422454] [2021-06-10 11:49:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:10,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:10,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:10,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:10,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:10,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:10,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:49:10,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800422454] [2021-06-10 11:49:10,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:10,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:10,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486736107] [2021-06-10 11:49:10,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:10,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:10,518 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:10,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1082 places, 924 transitions, 2335 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:10,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:10,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:10,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:11,035 INFO L129 PetriNetUnfolder]: 30/1119 cut-off events. [2021-06-10 11:49:11,036 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:49:11,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1119 events. 30/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5017 event pairs, 0 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 1418. Up to 39 conditions per place. [2021-06-10 11:49:11,113 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/922 dead transitions. [2021-06-10 11:49:11,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1084 places, 922 transitions, 2343 flow [2021-06-10 11:49:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:49:11,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:49:11,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:49:11,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:49:11,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:11,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:49:11,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,118 INFO L185 Difference]: Start difference. First operand has 1082 places, 924 transitions, 2335 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:49:11,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1084 places, 922 transitions, 2343 flow [2021-06-10 11:49:11,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1083 places, 922 transitions, 2342 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:11,129 INFO L241 Difference]: Finished difference. Result has 1083 places, 922 transitions, 2324 flow [2021-06-10 11:49:11,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2322, PETRI_DIFFERENCE_MINUEND_PLACES=1081, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2324, PETRI_PLACES=1083, PETRI_TRANSITIONS=922} [2021-06-10 11:49:11,129 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 74 predicate places. [2021-06-10 11:49:11,129 INFO L480 AbstractCegarLoop]: Abstraction has has 1083 places, 922 transitions, 2324 flow [2021-06-10 11:49:11,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:11,130 INFO L263 CegarLoopForPetriNet]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:11,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2392 [2021-06-10 11:49:11,130 INFO L428 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 882113048, now seen corresponding path program 1 times [2021-06-10 11:49:11,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:11,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785922206] [2021-06-10 11:49:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:11,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:11,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:11,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2021-06-10 11:49:11,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785922206] [2021-06-10 11:49:11,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:11,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:11,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799591846] [2021-06-10 11:49:11,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:11,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:11,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:11,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1083 places, 922 transitions, 2324 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:11,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:11,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:11,722 INFO L129 PetriNetUnfolder]: 30/1116 cut-off events. [2021-06-10 11:49:11,723 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:11,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 1116 events. 30/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4990 event pairs, 0 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 1412. Up to 39 conditions per place. [2021-06-10 11:49:11,778 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/919 dead transitions. [2021-06-10 11:49:11,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1083 places, 919 transitions, 2325 flow [2021-06-10 11:49:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:11,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:11,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:11,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:11,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:11,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:11,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,783 INFO L185 Difference]: Start difference. First operand has 1083 places, 922 transitions, 2324 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:11,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1083 places, 919 transitions, 2325 flow [2021-06-10 11:49:11,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1080 places, 919 transitions, 2320 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:11,793 INFO L241 Difference]: Finished difference. Result has 1080 places, 919 transitions, 2310 flow [2021-06-10 11:49:11,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1078, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1080, PETRI_TRANSITIONS=919} [2021-06-10 11:49:11,793 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 71 predicate places. [2021-06-10 11:49:11,793 INFO L480 AbstractCegarLoop]: Abstraction has has 1080 places, 919 transitions, 2310 flow [2021-06-10 11:49:11,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:11,794 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:11,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2393 [2021-06-10 11:49:11,794 INFO L428 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:11,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1973351539, now seen corresponding path program 1 times [2021-06-10 11:49:11,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:11,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767240117] [2021-06-10 11:49:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:11,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:11,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:11,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:11,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:49:11,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767240117] [2021-06-10 11:49:11,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:11,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:11,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502261913] [2021-06-10 11:49:11,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:11,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:11,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:11,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:11,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1080 places, 919 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:11,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:11,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:11,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:12,336 INFO L129 PetriNetUnfolder]: 29/1123 cut-off events. [2021-06-10 11:49:12,336 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:12,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 1123 events. 29/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5054 event pairs, 0 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 1422. Up to 39 conditions per place. [2021-06-10 11:49:12,413 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/920 dead transitions. [2021-06-10 11:49:12,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1082 places, 920 transitions, 2326 flow [2021-06-10 11:49:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:12,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:12,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:12,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:12,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:12,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:12,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:12,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:12,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:12,417 INFO L185 Difference]: Start difference. First operand has 1080 places, 919 transitions, 2310 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:12,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1082 places, 920 transitions, 2326 flow [2021-06-10 11:49:12,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1081 places, 920 transitions, 2325 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:12,427 INFO L241 Difference]: Finished difference. Result has 1082 places, 919 transitions, 2314 flow [2021-06-10 11:49:12,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=1079, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1082, PETRI_TRANSITIONS=919} [2021-06-10 11:49:12,428 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 73 predicate places. [2021-06-10 11:49:12,428 INFO L480 AbstractCegarLoop]: Abstraction has has 1082 places, 919 transitions, 2314 flow [2021-06-10 11:49:12,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:12,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:12,428 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:12,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2394 [2021-06-10 11:49:12,428 INFO L428 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1973352562, now seen corresponding path program 1 times [2021-06-10 11:49:12,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:12,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419904991] [2021-06-10 11:49:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:12,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:12,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:12,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:12,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:12,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:12,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:49:12,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419904991] [2021-06-10 11:49:12,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:12,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:12,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269775897] [2021-06-10 11:49:12,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:12,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:12,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:12,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:12,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1082 places, 919 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:12,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:12,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:12,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:12,986 INFO L129 PetriNetUnfolder]: 27/1125 cut-off events. [2021-06-10 11:49:12,986 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:13,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 1125 events. 27/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5082 event pairs, 0 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1431. Up to 39 conditions per place. [2021-06-10 11:49:13,063 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/920 dead transitions. [2021-06-10 11:49:13,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1084 places, 920 transitions, 2340 flow [2021-06-10 11:49:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:13,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:13,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:13,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:13,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:13,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:13,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,068 INFO L185 Difference]: Start difference. First operand has 1082 places, 919 transitions, 2314 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:13,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1084 places, 920 transitions, 2340 flow [2021-06-10 11:49:13,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1083 places, 920 transitions, 2339 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:13,078 INFO L241 Difference]: Finished difference. Result has 1085 places, 920 transitions, 2331 flow [2021-06-10 11:49:13,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=1081, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2331, PETRI_PLACES=1085, PETRI_TRANSITIONS=920} [2021-06-10 11:49:13,078 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 76 predicate places. [2021-06-10 11:49:13,078 INFO L480 AbstractCegarLoop]: Abstraction has has 1085 places, 920 transitions, 2331 flow [2021-06-10 11:49:13,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,079 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:13,079 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:13,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2395 [2021-06-10 11:49:13,079 INFO L428 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1972399250, now seen corresponding path program 1 times [2021-06-10 11:49:13,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:13,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016171994] [2021-06-10 11:49:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:13,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:13,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:13,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:49:13,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016171994] [2021-06-10 11:49:13,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:13,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:13,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654618411] [2021-06-10 11:49:13,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:13,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:13,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1085 places, 920 transitions, 2331 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:13,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:13,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:13,679 INFO L129 PetriNetUnfolder]: 27/1118 cut-off events. [2021-06-10 11:49:13,679 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:13,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 1118 events. 27/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5025 event pairs, 0 based on Foata normal form. 1/1055 useless extension candidates. Maximal degree in co-relation 1417. Up to 39 conditions per place. [2021-06-10 11:49:13,728 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/918 dead transitions. [2021-06-10 11:49:13,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1087 places, 918 transitions, 2333 flow [2021-06-10 11:49:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:13,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:13,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:13,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:13,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:13,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:13,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,732 INFO L185 Difference]: Start difference. First operand has 1085 places, 920 transitions, 2331 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1087 places, 918 transitions, 2333 flow [2021-06-10 11:49:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1084 places, 918 transitions, 2325 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:13,742 INFO L241 Difference]: Finished difference. Result has 1085 places, 918 transitions, 2318 flow [2021-06-10 11:49:13,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=1082, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2318, PETRI_PLACES=1085, PETRI_TRANSITIONS=918} [2021-06-10 11:49:13,742 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 76 predicate places. [2021-06-10 11:49:13,742 INFO L480 AbstractCegarLoop]: Abstraction has has 1085 places, 918 transitions, 2318 flow [2021-06-10 11:49:13,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:13,743 INFO L263 CegarLoopForPetriNet]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:13,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2396 [2021-06-10 11:49:13,743 INFO L428 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1972398227, now seen corresponding path program 1 times [2021-06-10 11:49:13,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:13,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734399092] [2021-06-10 11:49:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:13,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:13,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:13,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:13,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2021-06-10 11:49:13,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734399092] [2021-06-10 11:49:13,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:13,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:13,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347382435] [2021-06-10 11:49:13,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:13,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:13,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:13,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1085 places, 918 transitions, 2318 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:13,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:13,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:13,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:14,291 INFO L129 PetriNetUnfolder]: 27/1116 cut-off events. [2021-06-10 11:49:14,291 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:14,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 1116 events. 27/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5008 event pairs, 0 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 1421. Up to 39 conditions per place. [2021-06-10 11:49:14,368 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/916 dead transitions. [2021-06-10 11:49:14,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1085 places, 916 transitions, 2331 flow [2021-06-10 11:49:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:14,369 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:14,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:14,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:14,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:14,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:14,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:14,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:14,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:14,372 INFO L185 Difference]: Start difference. First operand has 1085 places, 918 transitions, 2318 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:14,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1085 places, 916 transitions, 2331 flow [2021-06-10 11:49:14,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1084 places, 916 transitions, 2330 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:14,383 INFO L241 Difference]: Finished difference. Result has 1084 places, 916 transitions, 2314 flow [2021-06-10 11:49:14,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2312, PETRI_DIFFERENCE_MINUEND_PLACES=1082, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1084, PETRI_TRANSITIONS=916} [2021-06-10 11:49:14,383 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 75 predicate places. [2021-06-10 11:49:14,383 INFO L480 AbstractCegarLoop]: Abstraction has has 1084 places, 916 transitions, 2314 flow [2021-06-10 11:49:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:14,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:14,384 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:14,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2397 [2021-06-10 11:49:14,384 INFO L428 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1662522033, now seen corresponding path program 1 times [2021-06-10 11:49:14,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:14,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535745846] [2021-06-10 11:49:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:14,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:14,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:14,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:14,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:14,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:14,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:49:14,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535745846] [2021-06-10 11:49:14,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:14,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:14,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575587302] [2021-06-10 11:49:14,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:14,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:14,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:14,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1084 places, 916 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:14,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:14,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:14,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:14,934 INFO L129 PetriNetUnfolder]: 26/1123 cut-off events. [2021-06-10 11:49:14,934 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:15,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 1123 events. 26/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5066 event pairs, 0 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1426. Up to 39 conditions per place. [2021-06-10 11:49:15,011 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/917 dead transitions. [2021-06-10 11:49:15,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1086 places, 917 transitions, 2330 flow [2021-06-10 11:49:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:15,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:15,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:15,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:15,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:15,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:15,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,016 INFO L185 Difference]: Start difference. First operand has 1084 places, 916 transitions, 2314 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:15,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1086 places, 917 transitions, 2330 flow [2021-06-10 11:49:15,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1085 places, 917 transitions, 2329 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:15,026 INFO L241 Difference]: Finished difference. Result has 1086 places, 916 transitions, 2318 flow [2021-06-10 11:49:15,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=1083, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2318, PETRI_PLACES=1086, PETRI_TRANSITIONS=916} [2021-06-10 11:49:15,027 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 77 predicate places. [2021-06-10 11:49:15,027 INFO L480 AbstractCegarLoop]: Abstraction has has 1086 places, 916 transitions, 2318 flow [2021-06-10 11:49:15,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:15,027 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:15,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2398 [2021-06-10 11:49:15,027 INFO L428 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1662521010, now seen corresponding path program 1 times [2021-06-10 11:49:15,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:15,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963385709] [2021-06-10 11:49:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:15,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:15,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:15,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:49:15,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963385709] [2021-06-10 11:49:15,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:15,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:15,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181857034] [2021-06-10 11:49:15,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:15,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:15,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:15,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1086 places, 916 transitions, 2318 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:15,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:15,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:15,610 INFO L129 PetriNetUnfolder]: 24/1125 cut-off events. [2021-06-10 11:49:15,610 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:15,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1125 events. 24/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5100 event pairs, 0 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 1437. Up to 39 conditions per place. [2021-06-10 11:49:15,738 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/917 dead transitions. [2021-06-10 11:49:15,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1088 places, 917 transitions, 2344 flow [2021-06-10 11:49:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:15,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:15,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:15,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:15,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:15,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:15,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,743 INFO L185 Difference]: Start difference. First operand has 1086 places, 916 transitions, 2318 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1088 places, 917 transitions, 2344 flow [2021-06-10 11:49:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1087 places, 917 transitions, 2343 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:15,752 INFO L241 Difference]: Finished difference. Result has 1089 places, 917 transitions, 2335 flow [2021-06-10 11:49:15,752 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=1085, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2335, PETRI_PLACES=1089, PETRI_TRANSITIONS=917} [2021-06-10 11:49:15,752 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 80 predicate places. [2021-06-10 11:49:15,752 INFO L480 AbstractCegarLoop]: Abstraction has has 1089 places, 917 transitions, 2335 flow [2021-06-10 11:49:15,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:15,753 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:15,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2399 [2021-06-10 11:49:15,753 INFO L428 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1663474322, now seen corresponding path program 1 times [2021-06-10 11:49:15,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:15,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351453677] [2021-06-10 11:49:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:15,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:15,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:15,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:15,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:49:15,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351453677] [2021-06-10 11:49:15,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:15,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:15,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005433875] [2021-06-10 11:49:15,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:15,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:15,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:15,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:15,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 917 transitions, 2335 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:15,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:15,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:15,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:16,287 INFO L129 PetriNetUnfolder]: 24/1118 cut-off events. [2021-06-10 11:49:16,287 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:16,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 1118 events. 24/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5043 event pairs, 0 based on Foata normal form. 1/1058 useless extension candidates. Maximal degree in co-relation 1423. Up to 39 conditions per place. [2021-06-10 11:49:16,363 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/915 dead transitions. [2021-06-10 11:49:16,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1091 places, 915 transitions, 2337 flow [2021-06-10 11:49:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:16,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:16,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:16,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:16,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:16,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:16,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:16,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:16,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:16,368 INFO L185 Difference]: Start difference. First operand has 1089 places, 917 transitions, 2335 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:16,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1091 places, 915 transitions, 2337 flow [2021-06-10 11:49:16,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1088 places, 915 transitions, 2329 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:16,378 INFO L241 Difference]: Finished difference. Result has 1089 places, 915 transitions, 2322 flow [2021-06-10 11:49:16,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=1086, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2322, PETRI_PLACES=1089, PETRI_TRANSITIONS=915} [2021-06-10 11:49:16,379 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 80 predicate places. [2021-06-10 11:49:16,379 INFO L480 AbstractCegarLoop]: Abstraction has has 1089 places, 915 transitions, 2322 flow [2021-06-10 11:49:16,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:16,379 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:16,379 INFO L263 CegarLoopForPetriNet]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:16,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2400 [2021-06-10 11:49:16,379 INFO L428 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1663475345, now seen corresponding path program 1 times [2021-06-10 11:49:16,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:16,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224642682] [2021-06-10 11:49:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:16,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:16,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:16,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:16,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:16,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:16,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-06-10 11:49:16,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224642682] [2021-06-10 11:49:16,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:16,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:16,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535268797] [2021-06-10 11:49:16,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:16,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:16,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:16,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 915 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:16,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:16,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:16,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:16,928 INFO L129 PetriNetUnfolder]: 24/1116 cut-off events. [2021-06-10 11:49:16,928 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:16,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 1116 events. 24/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5025 event pairs, 0 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 1427. Up to 39 conditions per place. [2021-06-10 11:49:17,002 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/913 dead transitions. [2021-06-10 11:49:17,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1089 places, 913 transitions, 2335 flow [2021-06-10 11:49:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:17,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:17,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:17,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:17,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:17,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:17,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,007 INFO L185 Difference]: Start difference. First operand has 1089 places, 915 transitions, 2322 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:17,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1089 places, 913 transitions, 2335 flow [2021-06-10 11:49:17,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1088 places, 913 transitions, 2334 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:17,018 INFO L241 Difference]: Finished difference. Result has 1088 places, 913 transitions, 2318 flow [2021-06-10 11:49:17,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=1086, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2318, PETRI_PLACES=1088, PETRI_TRANSITIONS=913} [2021-06-10 11:49:17,018 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 79 predicate places. [2021-06-10 11:49:17,018 INFO L480 AbstractCegarLoop]: Abstraction has has 1088 places, 913 transitions, 2318 flow [2021-06-10 11:49:17,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:17,019 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:17,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2401 [2021-06-10 11:49:17,019 INFO L428 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1972661292, now seen corresponding path program 1 times [2021-06-10 11:49:17,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:17,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046097337] [2021-06-10 11:49:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:17,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:17,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:17,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:49:17,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046097337] [2021-06-10 11:49:17,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:17,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:17,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150865689] [2021-06-10 11:49:17,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:17,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:17,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:17,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1088 places, 913 transitions, 2318 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:17,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:17,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:17,570 INFO L129 PetriNetUnfolder]: 23/1123 cut-off events. [2021-06-10 11:49:17,571 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:17,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 1123 events. 23/1123 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5088 event pairs, 0 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 1432. Up to 39 conditions per place. [2021-06-10 11:49:17,646 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/914 dead transitions. [2021-06-10 11:49:17,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1090 places, 914 transitions, 2334 flow [2021-06-10 11:49:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:17,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:17,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:17,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:17,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:17,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:17,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,650 INFO L185 Difference]: Start difference. First operand has 1088 places, 913 transitions, 2318 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:17,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1090 places, 914 transitions, 2334 flow [2021-06-10 11:49:17,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1089 places, 914 transitions, 2333 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:17,660 INFO L241 Difference]: Finished difference. Result has 1090 places, 913 transitions, 2322 flow [2021-06-10 11:49:17,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=1087, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2322, PETRI_PLACES=1090, PETRI_TRANSITIONS=913} [2021-06-10 11:49:17,661 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 81 predicate places. [2021-06-10 11:49:17,661 INFO L480 AbstractCegarLoop]: Abstraction has has 1090 places, 913 transitions, 2322 flow [2021-06-10 11:49:17,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:17,661 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:17,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2402 [2021-06-10 11:49:17,661 INFO L428 AbstractCegarLoop]: === Iteration 122 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1972662315, now seen corresponding path program 1 times [2021-06-10 11:49:17,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:17,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053854399] [2021-06-10 11:49:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:17,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:17,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:17,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:17,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:49:17,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053854399] [2021-06-10 11:49:17,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:17,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:17,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981940004] [2021-06-10 11:49:17,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:17,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:17,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:17,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:17,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:17,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1090 places, 913 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:17,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:17,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:17,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:18,222 INFO L129 PetriNetUnfolder]: 21/1125 cut-off events. [2021-06-10 11:49:18,222 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:18,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1125 events. 21/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5119 event pairs, 0 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1443. Up to 39 conditions per place. [2021-06-10 11:49:18,299 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/914 dead transitions. [2021-06-10 11:49:18,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1092 places, 914 transitions, 2348 flow [2021-06-10 11:49:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:18,301 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:18,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:18,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:18,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:18,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:18,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,304 INFO L185 Difference]: Start difference. First operand has 1090 places, 913 transitions, 2322 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:18,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1092 places, 914 transitions, 2348 flow [2021-06-10 11:49:18,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1091 places, 914 transitions, 2347 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:18,314 INFO L241 Difference]: Finished difference. Result has 1093 places, 914 transitions, 2339 flow [2021-06-10 11:49:18,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=1089, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2339, PETRI_PLACES=1093, PETRI_TRANSITIONS=914} [2021-06-10 11:49:18,314 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 84 predicate places. [2021-06-10 11:49:18,315 INFO L480 AbstractCegarLoop]: Abstraction has has 1093 places, 914 transitions, 2339 flow [2021-06-10 11:49:18,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:18,315 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:18,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2403 [2021-06-10 11:49:18,315 INFO L428 AbstractCegarLoop]: === Iteration 123 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1971709003, now seen corresponding path program 1 times [2021-06-10 11:49:18,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:18,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761031193] [2021-06-10 11:49:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:18,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:18,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:18,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:49:18,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761031193] [2021-06-10 11:49:18,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:18,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:18,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622434875] [2021-06-10 11:49:18,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:18,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:18,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:18,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1093 places, 914 transitions, 2339 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:18,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:18,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:18,862 INFO L129 PetriNetUnfolder]: 21/1118 cut-off events. [2021-06-10 11:49:18,862 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:18,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 1118 events. 21/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5060 event pairs, 0 based on Foata normal form. 1/1061 useless extension candidates. Maximal degree in co-relation 1429. Up to 39 conditions per place. [2021-06-10 11:49:18,936 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/912 dead transitions. [2021-06-10 11:49:18,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1095 places, 912 transitions, 2341 flow [2021-06-10 11:49:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:18,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:18,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:18,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:18,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:18,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:18,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,941 INFO L185 Difference]: Start difference. First operand has 1093 places, 914 transitions, 2339 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:18,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1095 places, 912 transitions, 2341 flow [2021-06-10 11:49:18,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 912 transitions, 2333 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:18,951 INFO L241 Difference]: Finished difference. Result has 1093 places, 912 transitions, 2326 flow [2021-06-10 11:49:18,951 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=1090, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2326, PETRI_PLACES=1093, PETRI_TRANSITIONS=912} [2021-06-10 11:49:18,951 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 84 predicate places. [2021-06-10 11:49:18,951 INFO L480 AbstractCegarLoop]: Abstraction has has 1093 places, 912 transitions, 2326 flow [2021-06-10 11:49:18,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:18,952 INFO L263 CegarLoopForPetriNet]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:18,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2404 [2021-06-10 11:49:18,952 INFO L428 AbstractCegarLoop]: === Iteration 124 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1971707980, now seen corresponding path program 1 times [2021-06-10 11:49:18,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:18,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192851784] [2021-06-10 11:49:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:18,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:18,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:18,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:18,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2021-06-10 11:49:18,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192851784] [2021-06-10 11:49:18,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:18,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:18,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575258342] [2021-06-10 11:49:18,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:18,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:18,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:18,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1093 places, 912 transitions, 2326 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:18,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:18,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:18,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:19,506 INFO L129 PetriNetUnfolder]: 21/1116 cut-off events. [2021-06-10 11:49:19,506 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:19,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1116 events. 21/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5047 event pairs, 0 based on Foata normal form. 0/1057 useless extension candidates. Maximal degree in co-relation 1433. Up to 39 conditions per place. [2021-06-10 11:49:19,582 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/910 dead transitions. [2021-06-10 11:49:19,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1093 places, 910 transitions, 2339 flow [2021-06-10 11:49:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:19,584 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:19,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:19,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:19,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:19,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:19,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:19,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:19,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:19,588 INFO L185 Difference]: Start difference. First operand has 1093 places, 912 transitions, 2326 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:19,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1093 places, 910 transitions, 2339 flow [2021-06-10 11:49:19,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 910 transitions, 2338 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:19,598 INFO L241 Difference]: Finished difference. Result has 1092 places, 910 transitions, 2322 flow [2021-06-10 11:49:19,598 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=1090, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2322, PETRI_PLACES=1092, PETRI_TRANSITIONS=910} [2021-06-10 11:49:19,598 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 83 predicate places. [2021-06-10 11:49:19,598 INFO L480 AbstractCegarLoop]: Abstraction has has 1092 places, 910 transitions, 2322 flow [2021-06-10 11:49:19,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:19,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:19,598 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:19,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2405 [2021-06-10 11:49:19,599 INFO L428 AbstractCegarLoop]: === Iteration 125 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 242918313, now seen corresponding path program 1 times [2021-06-10 11:49:19,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:19,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252758386] [2021-06-10 11:49:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:19,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:19,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:19,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:19,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:19,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:19,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:49:19,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252758386] [2021-06-10 11:49:19,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:19,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:19,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771954355] [2021-06-10 11:49:19,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:19,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:19,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:19,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1092 places, 910 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:19,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:19,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:19,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:20,130 INFO L129 PetriNetUnfolder]: 19/1121 cut-off events. [2021-06-10 11:49:20,130 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:20,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 1121 events. 19/1121 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5097 event pairs, 0 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1436. Up to 39 conditions per place. [2021-06-10 11:49:20,194 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/911 dead transitions. [2021-06-10 11:49:20,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1094 places, 911 transitions, 2338 flow [2021-06-10 11:49:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:20,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:20,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:20,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:20,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:20,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:20,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,199 INFO L185 Difference]: Start difference. First operand has 1092 places, 910 transitions, 2322 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:20,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1094 places, 911 transitions, 2338 flow [2021-06-10 11:49:20,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1093 places, 911 transitions, 2337 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:20,208 INFO L241 Difference]: Finished difference. Result has 1095 places, 911 transitions, 2335 flow [2021-06-10 11:49:20,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=1091, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2335, PETRI_PLACES=1095, PETRI_TRANSITIONS=911} [2021-06-10 11:49:20,208 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 86 predicate places. [2021-06-10 11:49:20,208 INFO L480 AbstractCegarLoop]: Abstraction has has 1095 places, 911 transitions, 2335 flow [2021-06-10 11:49:20,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:20,209 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:20,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2406 [2021-06-10 11:49:20,209 INFO L428 AbstractCegarLoop]: === Iteration 126 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 242917290, now seen corresponding path program 1 times [2021-06-10 11:49:20,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:20,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532140036] [2021-06-10 11:49:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:20,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:20,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:20,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:49:20,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532140036] [2021-06-10 11:49:20,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:20,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:20,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26601856] [2021-06-10 11:49:20,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:20,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:20,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:20,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1095 places, 911 transitions, 2335 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:20,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:20,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:20,790 INFO L129 PetriNetUnfolder]: 19/1122 cut-off events. [2021-06-10 11:49:20,791 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:20,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1122 events. 19/1122 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5104 event pairs, 0 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1444. Up to 39 conditions per place. [2021-06-10 11:49:20,866 INFO L132 encePairwiseOnDemand]: 1081/1085 looper letters, 9 selfloop transitions, 3 changer transitions 0/912 dead transitions. [2021-06-10 11:49:20,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1097 places, 912 transitions, 2361 flow [2021-06-10 11:49:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3001 transitions. [2021-06-10 11:49:20,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9219662058371736 [2021-06-10 11:49:20,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3001 transitions. [2021-06-10 11:49:20,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3001 transitions. [2021-06-10 11:49:20,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:20,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3001 transitions. [2021-06-10 11:49:20,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,871 INFO L185 Difference]: Start difference. First operand has 1095 places, 911 transitions, 2335 flow. Second operand 3 states and 3001 transitions. [2021-06-10 11:49:20,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1097 places, 912 transitions, 2361 flow [2021-06-10 11:49:20,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1096 places, 912 transitions, 2359 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:20,881 INFO L241 Difference]: Finished difference. Result has 1098 places, 912 transitions, 2351 flow [2021-06-10 11:49:20,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=1094, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=908, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2351, PETRI_PLACES=1098, PETRI_TRANSITIONS=912} [2021-06-10 11:49:20,881 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 89 predicate places. [2021-06-10 11:49:20,881 INFO L480 AbstractCegarLoop]: Abstraction has has 1098 places, 912 transitions, 2351 flow [2021-06-10 11:49:20,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:20,882 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:20,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2407 [2021-06-10 11:49:20,882 INFO L428 AbstractCegarLoop]: === Iteration 127 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash 243871625, now seen corresponding path program 1 times [2021-06-10 11:49:20,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:20,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210270027] [2021-06-10 11:49:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:20,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:20,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:20,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:20,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:49:20,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210270027] [2021-06-10 11:49:20,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:20,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:20,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983731255] [2021-06-10 11:49:20,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:20,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:20,915 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:20,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1098 places, 912 transitions, 2351 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:20,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:20,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:20,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:21,458 INFO L129 PetriNetUnfolder]: 18/1119 cut-off events. [2021-06-10 11:49:21,458 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-06-10 11:49:21,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1119 events. 18/1119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5088 event pairs, 0 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 1443. Up to 39 conditions per place. [2021-06-10 11:49:21,532 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 9 selfloop transitions, 1 changer transitions 0/910 dead transitions. [2021-06-10 11:49:21,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1100 places, 910 transitions, 2359 flow [2021-06-10 11:49:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3000 transitions. [2021-06-10 11:49:21,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9216589861751152 [2021-06-10 11:49:21,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3000 transitions. [2021-06-10 11:49:21,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3000 transitions. [2021-06-10 11:49:21,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:21,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3000 transitions. [2021-06-10 11:49:21,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:21,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:21,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:21,536 INFO L185 Difference]: Start difference. First operand has 1098 places, 912 transitions, 2351 flow. Second operand 3 states and 3000 transitions. [2021-06-10 11:49:21,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1100 places, 910 transitions, 2359 flow [2021-06-10 11:49:21,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1099 places, 910 transitions, 2358 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:21,546 INFO L241 Difference]: Finished difference. Result has 1099 places, 910 transitions, 2340 flow [2021-06-10 11:49:21,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=1097, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2340, PETRI_PLACES=1099, PETRI_TRANSITIONS=910} [2021-06-10 11:49:21,547 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 90 predicate places. [2021-06-10 11:49:21,547 INFO L480 AbstractCegarLoop]: Abstraction has has 1099 places, 910 transitions, 2340 flow [2021-06-10 11:49:21,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:21,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:21,547 INFO L263 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:21,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2408 [2021-06-10 11:49:21,547 INFO L428 AbstractCegarLoop]: === Iteration 128 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash 243870602, now seen corresponding path program 1 times [2021-06-10 11:49:21,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:21,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623500959] [2021-06-10 11:49:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:21,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:21,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:21,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:21,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:21,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:21,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2021-06-10 11:49:21,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623500959] [2021-06-10 11:49:21,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:21,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:21,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383567983] [2021-06-10 11:49:21,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:21,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:21,579 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:21,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 910 transitions, 2340 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:21,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:21,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:21,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:22,074 INFO L129 PetriNetUnfolder]: 18/1116 cut-off events. [2021-06-10 11:49:22,074 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:22,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1116 events. 18/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5064 event pairs, 0 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 1437. Up to 39 conditions per place. [2021-06-10 11:49:22,132 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/907 dead transitions. [2021-06-10 11:49:22,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1099 places, 907 transitions, 2341 flow [2021-06-10 11:49:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:22,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:22,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:22,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:22,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:22,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:22,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,141 INFO L185 Difference]: Start difference. First operand has 1099 places, 910 transitions, 2340 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:22,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1099 places, 907 transitions, 2341 flow [2021-06-10 11:49:22,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1096 places, 907 transitions, 2336 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:22,150 INFO L241 Difference]: Finished difference. Result has 1096 places, 907 transitions, 2326 flow [2021-06-10 11:49:22,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=1094, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2326, PETRI_PLACES=1096, PETRI_TRANSITIONS=907} [2021-06-10 11:49:22,151 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 87 predicate places. [2021-06-10 11:49:22,151 INFO L480 AbstractCegarLoop]: Abstraction has has 1096 places, 907 transitions, 2326 flow [2021-06-10 11:49:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,151 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:22,151 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:22,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2409 [2021-06-10 11:49:22,151 INFO L428 AbstractCegarLoop]: === Iteration 129 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -920494583, now seen corresponding path program 1 times [2021-06-10 11:49:22,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:22,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992051657] [2021-06-10 11:49:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:22,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:22,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:22,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:49:22,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992051657] [2021-06-10 11:49:22,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:22,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:22,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309525990] [2021-06-10 11:49:22,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:22,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:22,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:22,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 907 transitions, 2326 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:22,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:22,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:22,736 INFO L129 PetriNetUnfolder]: 17/1124 cut-off events. [2021-06-10 11:49:22,736 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:22,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 1124 events. 17/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5133 event pairs, 0 based on Foata normal form. 0/1067 useless extension candidates. Maximal degree in co-relation 1454. Up to 39 conditions per place. [2021-06-10 11:49:22,812 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/909 dead transitions. [2021-06-10 11:49:22,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 909 transitions, 2356 flow [2021-06-10 11:49:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:49:22,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:49:22,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:49:22,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:49:22,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:22,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:49:22,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,817 INFO L185 Difference]: Start difference. First operand has 1096 places, 907 transitions, 2326 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:49:22,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1098 places, 909 transitions, 2356 flow [2021-06-10 11:49:22,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1097 places, 909 transitions, 2355 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:22,827 INFO L241 Difference]: Finished difference. Result has 1099 places, 909 transitions, 2349 flow [2021-06-10 11:49:22,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=1095, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2349, PETRI_PLACES=1099, PETRI_TRANSITIONS=909} [2021-06-10 11:49:22,827 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 90 predicate places. [2021-06-10 11:49:22,827 INFO L480 AbstractCegarLoop]: Abstraction has has 1099 places, 909 transitions, 2349 flow [2021-06-10 11:49:22,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:22,828 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:22,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2410 [2021-06-10 11:49:22,828 INFO L428 AbstractCegarLoop]: === Iteration 130 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash -920493560, now seen corresponding path program 1 times [2021-06-10 11:49:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:22,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723600008] [2021-06-10 11:49:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:22,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:22,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:22,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:22,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:49:22,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723600008] [2021-06-10 11:49:22,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:22,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:22,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132936565] [2021-06-10 11:49:22,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:22,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:22,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:22,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:22,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 909 transitions, 2349 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:22,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:22,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:22,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:23,408 INFO L129 PetriNetUnfolder]: 16/1122 cut-off events. [2021-06-10 11:49:23,408 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:23,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 1122 events. 16/1122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5121 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1449. Up to 39 conditions per place. [2021-06-10 11:49:23,484 INFO L132 encePairwiseOnDemand]: 1082/1085 looper letters, 5 selfloop transitions, 2 changer transitions 0/909 dead transitions. [2021-06-10 11:49:23,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1101 places, 909 transitions, 2361 flow [2021-06-10 11:49:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:23,486 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:23,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:23,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:23,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:23,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:23,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:23,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:23,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:23,489 INFO L185 Difference]: Start difference. First operand has 1099 places, 909 transitions, 2349 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:23,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1101 places, 909 transitions, 2361 flow [2021-06-10 11:49:23,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1100 places, 909 transitions, 2356 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:23,499 INFO L241 Difference]: Finished difference. Result has 1102 places, 909 transitions, 2354 flow [2021-06-10 11:49:23,500 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2340, PETRI_DIFFERENCE_MINUEND_PLACES=1098, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2354, PETRI_PLACES=1102, PETRI_TRANSITIONS=909} [2021-06-10 11:49:23,500 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 93 predicate places. [2021-06-10 11:49:23,500 INFO L480 AbstractCegarLoop]: Abstraction has has 1102 places, 909 transitions, 2354 flow [2021-06-10 11:49:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:23,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:23,500 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:23,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2411 [2021-06-10 11:49:23,500 INFO L428 AbstractCegarLoop]: === Iteration 131 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:23,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash -919541271, now seen corresponding path program 1 times [2021-06-10 11:49:23,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:23,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368898673] [2021-06-10 11:49:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:23,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:23,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:23,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:23,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:23,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:23,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:49:23,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368898673] [2021-06-10 11:49:23,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:23,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:23,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105994933] [2021-06-10 11:49:23,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:23,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:23,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:23,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1102 places, 909 transitions, 2354 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:23,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:23,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:23,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:24,122 INFO L129 PetriNetUnfolder]: 15/1118 cut-off events. [2021-06-10 11:49:24,122 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:24,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1118 events. 15/1118 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5095 event pairs, 0 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 1446. Up to 39 conditions per place. [2021-06-10 11:49:24,175 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/906 dead transitions. [2021-06-10 11:49:24,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1104 places, 906 transitions, 2351 flow [2021-06-10 11:49:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:24,177 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:24,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:24,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:24,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:24,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:24,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,180 INFO L185 Difference]: Start difference. First operand has 1102 places, 909 transitions, 2354 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1104 places, 906 transitions, 2351 flow [2021-06-10 11:49:24,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1101 places, 906 transitions, 2344 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:24,189 INFO L241 Difference]: Finished difference. Result has 1101 places, 906 transitions, 2334 flow [2021-06-10 11:49:24,190 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=1099, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2334, PETRI_PLACES=1101, PETRI_TRANSITIONS=906} [2021-06-10 11:49:24,190 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 92 predicate places. [2021-06-10 11:49:24,190 INFO L480 AbstractCegarLoop]: Abstraction has has 1101 places, 906 transitions, 2334 flow [2021-06-10 11:49:24,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:24,190 INFO L263 CegarLoopForPetriNet]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:24,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2412 [2021-06-10 11:49:24,191 INFO L428 AbstractCegarLoop]: === Iteration 132 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash -919540248, now seen corresponding path program 1 times [2021-06-10 11:49:24,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:24,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490367037] [2021-06-10 11:49:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:24,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:24,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:24,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2021-06-10 11:49:24,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490367037] [2021-06-10 11:49:24,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:24,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:24,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708324069] [2021-06-10 11:49:24,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:24,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:24,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:24,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1101 places, 906 transitions, 2334 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:24,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:24,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:24,758 INFO L129 PetriNetUnfolder]: 15/1116 cut-off events. [2021-06-10 11:49:24,758 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:24,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 1116 events. 15/1116 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5081 event pairs, 0 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1447. Up to 39 conditions per place. [2021-06-10 11:49:24,833 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/904 dead transitions. [2021-06-10 11:49:24,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1101 places, 904 transitions, 2347 flow [2021-06-10 11:49:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:24,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:24,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:24,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:24,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:24,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:24,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,838 INFO L185 Difference]: Start difference. First operand has 1101 places, 906 transitions, 2334 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1101 places, 904 transitions, 2347 flow [2021-06-10 11:49:24,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1100 places, 904 transitions, 2346 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:24,848 INFO L241 Difference]: Finished difference. Result has 1100 places, 904 transitions, 2330 flow [2021-06-10 11:49:24,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=1098, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2330, PETRI_PLACES=1100, PETRI_TRANSITIONS=904} [2021-06-10 11:49:24,849 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 91 predicate places. [2021-06-10 11:49:24,849 INFO L480 AbstractCegarLoop]: Abstraction has has 1100 places, 904 transitions, 2330 flow [2021-06-10 11:49:24,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,849 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:24,849 INFO L263 CegarLoopForPetriNet]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:24,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2413 [2021-06-10 11:49:24,849 INFO L428 AbstractCegarLoop]: === Iteration 133 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -572163384, now seen corresponding path program 1 times [2021-06-10 11:49:24,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:24,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655013291] [2021-06-10 11:49:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:24,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:24,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:24,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:24,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2021-06-10 11:49:24,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655013291] [2021-06-10 11:49:24,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:24,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:24,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128808484] [2021-06-10 11:49:24,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:24,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:24,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:24,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:24,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:24,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1100 places, 904 transitions, 2330 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:24,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:24,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:24,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:25,440 INFO L129 PetriNetUnfolder]: 14/1124 cut-off events. [2021-06-10 11:49:25,440 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:25,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1124 events. 14/1124 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5150 event pairs, 0 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1459. Up to 39 conditions per place. [2021-06-10 11:49:25,518 INFO L132 encePairwiseOnDemand]: 1080/1085 looper letters, 10 selfloop transitions, 3 changer transitions 0/906 dead transitions. [2021-06-10 11:49:25,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1102 places, 906 transitions, 2360 flow [2021-06-10 11:49:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3003 transitions. [2021-06-10 11:49:25,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2021-06-10 11:49:25,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3003 transitions. [2021-06-10 11:49:25,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3003 transitions. [2021-06-10 11:49:25,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:25,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3003 transitions. [2021-06-10 11:49:25,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1001.0) internal successors, (3003), 3 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:25,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:25,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:25,522 INFO L185 Difference]: Start difference. First operand has 1100 places, 904 transitions, 2330 flow. Second operand 3 states and 3003 transitions. [2021-06-10 11:49:25,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1102 places, 906 transitions, 2360 flow [2021-06-10 11:49:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1101 places, 906 transitions, 2359 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:25,533 INFO L241 Difference]: Finished difference. Result has 1103 places, 906 transitions, 2353 flow [2021-06-10 11:49:25,533 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=1099, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2353, PETRI_PLACES=1103, PETRI_TRANSITIONS=906} [2021-06-10 11:49:25,533 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 94 predicate places. [2021-06-10 11:49:25,533 INFO L480 AbstractCegarLoop]: Abstraction has has 1103 places, 906 transitions, 2353 flow [2021-06-10 11:49:25,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:25,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:25,534 INFO L263 CegarLoopForPetriNet]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:25,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2414 [2021-06-10 11:49:25,534 INFO L428 AbstractCegarLoop]: === Iteration 134 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -572164407, now seen corresponding path program 1 times [2021-06-10 11:49:25,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:25,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615926670] [2021-06-10 11:49:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:25,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:25,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:25,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:25,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:25,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:25,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2021-06-10 11:49:25,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615926670] [2021-06-10 11:49:25,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:25,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:25,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148260979] [2021-06-10 11:49:25,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:25,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:25,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:25,567 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:25,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1103 places, 906 transitions, 2353 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:25,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:25,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:25,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:26,130 INFO L129 PetriNetUnfolder]: 12/1125 cut-off events. [2021-06-10 11:49:26,131 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:26,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1125 events. 12/1125 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 5173 event pairs, 0 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1459. Up to 39 conditions per place. [2021-06-10 11:49:26,182 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 6 selfloop transitions, 1 changer transitions 0/906 dead transitions. [2021-06-10 11:49:26,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 906 transitions, 2365 flow [2021-06-10 11:49:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3011 transitions. [2021-06-10 11:49:26,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9250384024577573 [2021-06-10 11:49:26,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3011 transitions. [2021-06-10 11:49:26,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3011 transitions. [2021-06-10 11:49:26,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:26,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3011 transitions. [2021-06-10 11:49:26,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.6666666666666) internal successors, (3011), 3 states have internal predecessors, (3011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,187 INFO L185 Difference]: Start difference. First operand has 1103 places, 906 transitions, 2353 flow. Second operand 3 states and 3011 transitions. [2021-06-10 11:49:26,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 906 transitions, 2365 flow [2021-06-10 11:49:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1104 places, 906 transitions, 2360 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:26,196 INFO L241 Difference]: Finished difference. Result has 1105 places, 905 transitions, 2349 flow [2021-06-10 11:49:26,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=1102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=905, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=904, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2349, PETRI_PLACES=1105, PETRI_TRANSITIONS=905} [2021-06-10 11:49:26,197 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 96 predicate places. [2021-06-10 11:49:26,197 INFO L480 AbstractCegarLoop]: Abstraction has has 1105 places, 905 transitions, 2349 flow [2021-06-10 11:49:26,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:26,197 INFO L263 CegarLoopForPetriNet]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:26,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2415 [2021-06-10 11:49:26,197 INFO L428 AbstractCegarLoop]: === Iteration 135 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -573116696, now seen corresponding path program 1 times [2021-06-10 11:49:26,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:26,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432052108] [2021-06-10 11:49:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:26,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:26,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:26,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2021-06-10 11:49:26,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432052108] [2021-06-10 11:49:26,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:26,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:26,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668476639] [2021-06-10 11:49:26,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:26,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:26,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1085 [2021-06-10 11:49:26,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1105 places, 905 transitions, 2349 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:26,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1085 [2021-06-10 11:49:26,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:26,754 INFO L129 PetriNetUnfolder]: 12/1118 cut-off events. [2021-06-10 11:49:26,754 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:26,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 1118 events. 12/1118 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5114 event pairs, 0 based on Foata normal form. 1/1070 useless extension candidates. Maximal degree in co-relation 1453. Up to 39 conditions per place. [2021-06-10 11:49:26,826 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 5 selfloop transitions, 1 changer transitions 0/903 dead transitions. [2021-06-10 11:49:26,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1107 places, 903 transitions, 2352 flow [2021-06-10 11:49:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3010 transitions. [2021-06-10 11:49:26,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2021-06-10 11:49:26,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3010 transitions. [2021-06-10 11:49:26,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3010 transitions. [2021-06-10 11:49:26,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:26,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3010 transitions. [2021-06-10 11:49:26,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,831 INFO L185 Difference]: Start difference. First operand has 1105 places, 905 transitions, 2349 flow. Second operand 3 states and 3010 transitions. [2021-06-10 11:49:26,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1107 places, 903 transitions, 2352 flow [2021-06-10 11:49:26,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1104 places, 903 transitions, 2345 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:26,841 INFO L241 Difference]: Finished difference. Result has 1105 places, 903 transitions, 2338 flow [2021-06-10 11:49:26,842 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=1102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=903, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2338, PETRI_PLACES=1105, PETRI_TRANSITIONS=903} [2021-06-10 11:49:26,842 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 96 predicate places. [2021-06-10 11:49:26,842 INFO L480 AbstractCegarLoop]: Abstraction has has 1105 places, 903 transitions, 2338 flow [2021-06-10 11:49:26,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:26,842 INFO L263 CegarLoopForPetriNet]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:26,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2416 [2021-06-10 11:49:26,842 INFO L428 AbstractCegarLoop]: === Iteration 136 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -573117719, now seen corresponding path program 1 times [2021-06-10 11:49:26,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:26,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331616512] [2021-06-10 11:49:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:26,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:26,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:26,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:26,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2021-06-10 11:49:26,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331616512] [2021-06-10 11:49:26,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:26,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:26,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9901595] [2021-06-10 11:49:26,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:26,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:26,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:26,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1085 [2021-06-10 11:49:26,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1105 places, 903 transitions, 2338 flow. Second operand has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:26,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:26,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1085 [2021-06-10 11:49:26,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:27,402 INFO L129 PetriNetUnfolder]: 12/1116 cut-off events. [2021-06-10 11:49:27,403 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:27,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 1116 events. 12/1116 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 5098 event pairs, 0 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 1453. Up to 39 conditions per place. [2021-06-10 11:49:27,477 INFO L132 encePairwiseOnDemand]: 1083/1085 looper letters, 8 selfloop transitions, 1 changer transitions 0/901 dead transitions. [2021-06-10 11:49:27,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 901 transitions, 2351 flow [2021-06-10 11:49:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2021-06-10 11:49:27,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9210445468509985 [2021-06-10 11:49:27,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2998 transitions. [2021-06-10 11:49:27,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2998 transitions. [2021-06-10 11:49:27,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:27,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2998 transitions. [2021-06-10 11:49:27,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 999.3333333333334) internal successors, (2998), 3 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:27,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:27,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1085.0) internal successors, (4340), 4 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:27,482 INFO L185 Difference]: Start difference. First operand has 1105 places, 903 transitions, 2338 flow. Second operand 3 states and 2998 transitions. [2021-06-10 11:49:27,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 901 transitions, 2351 flow [2021-06-10 11:49:27,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1104 places, 901 transitions, 2350 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:27,493 INFO L241 Difference]: Finished difference. Result has 1104 places, 901 transitions, 2334 flow [2021-06-10 11:49:27,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1085, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=1102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2334, PETRI_PLACES=1104, PETRI_TRANSITIONS=901} [2021-06-10 11:49:27,494 INFO L343 CegarLoopForPetriNet]: 1009 programPoint places, 95 predicate places. [2021-06-10 11:49:27,494 INFO L480 AbstractCegarLoop]: Abstraction has has 1104 places, 901 transitions, 2334 flow [2021-06-10 11:49:27,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 998.3333333333334) internal successors, (2995), 3 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:27,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:27,494 INFO L263 CegarLoopForPetriNet]: trace histogram [39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:27,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417 [2021-06-10 11:49:27,494 INFO L428 AbstractCegarLoop]: === Iteration 137 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2075751141, now seen corresponding path program 1 times [2021-06-10 11:49:27,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:27,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242898760] [2021-06-10 11:49:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:49:27,520 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:49:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 11:49:27,527 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 11:49:27,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 11:49:27,553 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 11:49:27,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2418 [2021-06-10 11:49:27,553 WARN L342 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 11:49:27,553 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,623 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,628 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,629 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,636 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,637 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,638 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,639 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,650 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,687 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,688 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,689 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,690 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,691 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,693 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,698 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,700 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,709 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,710 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,711 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,712 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,713 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,714 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,722 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,723 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread8of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread8of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread9of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread9of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread10of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread10of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread11of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread11of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread12of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,728 WARN L313 ript$VariableManager]: TermVariabe thr1Thread12of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe thr1Thread13of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,729 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread13of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe thr1Thread14of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,730 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread14of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe thr1Thread15of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,731 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread15of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread16of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,732 WARN L313 ript$VariableManager]: TermVariabe thr1Thread16of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread17of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread17of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,733 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread18of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread18of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,734 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread19of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread19of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread20of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread20of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread21of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread21of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread22of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread22of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread23of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread23of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread24of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread24of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread25of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread25of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread26of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread26of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread27of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread27of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread28of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread28of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe thr1Thread29of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,744 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread29of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe thr1Thread30of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread30of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,745 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread31of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread31of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,746 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread32of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread32of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,747 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread33of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread33of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,748 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread34of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread34of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,749 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread35of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread35of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread36of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,750 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread36of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread37of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread37of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread38of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread38of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~z~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~y~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread39of39ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread39of39ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 11:49:27,754 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 11:49:27,754 INFO L253 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-06-10 11:49:27,754 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 11:49:27,754 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 11:49:27,754 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 11:49:27,754 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 11:49:27,754 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 11:49:27,755 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 11:49:27,755 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 11:49:27,755 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 11:49:27,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 1035 places, 1113 transitions, 3903 flow [2021-06-10 11:49:28,342 INFO L129 PetriNetUnfolder]: 196/1463 cut-off events. [2021-06-10 11:49:28,342 INFO L130 PetriNetUnfolder]: For 10621/10621 co-relation queries the response was YES. [2021-06-10 11:49:28,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1463 events. 196/1463 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6370 event pairs, 0 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 2272. Up to 80 conditions per place. [2021-06-10 11:49:28,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 1035 places, 1113 transitions, 3903 flow [2021-06-10 11:49:28,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1035 places, 1113 transitions, 3903 flow [2021-06-10 11:49:28,477 INFO L129 PetriNetUnfolder]: 9/100 cut-off events. [2021-06-10 11:49:28,477 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-10 11:49:28,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:28,477 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-06-10 11:49:28,477 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1316211475, now seen corresponding path program 1 times [2021-06-10 11:49:28,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:28,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503295949] [2021-06-10 11:49:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:28,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:28,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:28,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:28,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:49:28,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503295949] [2021-06-10 11:49:28,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:28,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:28,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594731235] [2021-06-10 11:49:28,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:28,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:28,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:28,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:28,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:28,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1113 transitions, 3903 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:28,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:28,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:28,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:29,002 INFO L129 PetriNetUnfolder]: 115/1150 cut-off events. [2021-06-10 11:49:29,002 INFO L130 PetriNetUnfolder]: For 10622/10622 co-relation queries the response was YES. [2021-06-10 11:49:29,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 1150 events. 115/1150 cut-off events. For 10622/10622 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4685 event pairs, 0 based on Foata normal form. 158/1152 useless extension candidates. Maximal degree in co-relation 1971. Up to 40 conditions per place. [2021-06-10 11:49:29,108 INFO L132 encePairwiseOnDemand]: 1069/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2021-06-10 11:49:29,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1030 transitions, 3751 flow [2021-06-10 11:49:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3171 transitions. [2021-06-10 11:49:29,110 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.949685534591195 [2021-06-10 11:49:29,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3171 transitions. [2021-06-10 11:49:29,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3171 transitions. [2021-06-10 11:49:29,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:29,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3171 transitions. [2021-06-10 11:49:29,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1057.0) internal successors, (3171), 3 states have internal predecessors, (3171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,113 INFO L185 Difference]: Start difference. First operand has 1035 places, 1113 transitions, 3903 flow. Second operand 3 states and 3171 transitions. [2021-06-10 11:49:29,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1030 transitions, 3751 flow [2021-06-10 11:49:29,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1030 transitions, 2269 flow, removed 741 selfloop flow, removed 0 redundant places. [2021-06-10 11:49:29,132 INFO L241 Difference]: Finished difference. Result has 995 places, 1030 transitions, 2267 flow [2021-06-10 11:49:29,133 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2267, PETRI_PLACES=995, PETRI_TRANSITIONS=1030} [2021-06-10 11:49:29,133 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -40 predicate places. [2021-06-10 11:49:29,133 INFO L480 AbstractCegarLoop]: Abstraction has has 995 places, 1030 transitions, 2267 flow [2021-06-10 11:49:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:29,133 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-06-10 11:49:29,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2419 [2021-06-10 11:49:29,133 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1316210452, now seen corresponding path program 1 times [2021-06-10 11:49:29,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:29,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125487242] [2021-06-10 11:49:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:29,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:29,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:29,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:49:29,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125487242] [2021-06-10 11:49:29,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:29,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:29,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510155184] [2021-06-10 11:49:29,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:29,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:29,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:29,158 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:29,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1030 transitions, 2267 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:29,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:29,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:29,605 INFO L129 PetriNetUnfolder]: 115/1151 cut-off events. [2021-06-10 11:49:29,605 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:29,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1151 events. 115/1151 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4694 event pairs, 0 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1268. Up to 40 conditions per place. [2021-06-10 11:49:29,701 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1031 dead transitions. [2021-06-10 11:49:29,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1031 transitions, 2293 flow [2021-06-10 11:49:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:29,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:29,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:29,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:29,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:29,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:29,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,706 INFO L185 Difference]: Start difference. First operand has 995 places, 1030 transitions, 2267 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:29,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 1031 transitions, 2293 flow [2021-06-10 11:49:29,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 1031 transitions, 2291 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:29,715 INFO L241 Difference]: Finished difference. Result has 998 places, 1031 transitions, 2283 flow [2021-06-10 11:49:29,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2283, PETRI_PLACES=998, PETRI_TRANSITIONS=1031} [2021-06-10 11:49:29,715 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -37 predicate places. [2021-06-10 11:49:29,715 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 1031 transitions, 2283 flow [2021-06-10 11:49:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:29,716 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-06-10 11:49:29,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2420 [2021-06-10 11:49:29,716 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1317163764, now seen corresponding path program 1 times [2021-06-10 11:49:29,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:29,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565121589] [2021-06-10 11:49:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:29,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:29,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:29,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:29,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:49:29,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565121589] [2021-06-10 11:49:29,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:29,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:29,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230573002] [2021-06-10 11:49:29,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:29,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:29,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:29,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1031 transitions, 2283 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:29,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:29,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:29,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:30,188 INFO L129 PetriNetUnfolder]: 114/1147 cut-off events. [2021-06-10 11:49:30,188 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:30,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 1147 events. 114/1147 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4672 event pairs, 0 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1260. Up to 40 conditions per place. [2021-06-10 11:49:30,320 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1028 dead transitions. [2021-06-10 11:49:30,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1028 transitions, 2280 flow [2021-06-10 11:49:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:30,322 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:30,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:30,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:30,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:30,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:30,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,325 INFO L185 Difference]: Start difference. First operand has 998 places, 1031 transitions, 2283 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:30,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1028 transitions, 2280 flow [2021-06-10 11:49:30,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 1028 transitions, 2272 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:30,333 INFO L241 Difference]: Finished difference. Result has 997 places, 1028 transitions, 2262 flow [2021-06-10 11:49:30,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2262, PETRI_PLACES=997, PETRI_TRANSITIONS=1028} [2021-06-10 11:49:30,334 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -38 predicate places. [2021-06-10 11:49:30,334 INFO L480 AbstractCegarLoop]: Abstraction has has 997 places, 1028 transitions, 2262 flow [2021-06-10 11:49:30,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:30,334 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-06-10 11:49:30,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2421 [2021-06-10 11:49:30,334 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1317164787, now seen corresponding path program 1 times [2021-06-10 11:49:30,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:30,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177544146] [2021-06-10 11:49:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:30,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:30,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:30,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 11:49:30,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177544146] [2021-06-10 11:49:30,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:30,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:30,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781888887] [2021-06-10 11:49:30,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:30,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:30,359 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:30,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 1028 transitions, 2262 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:30,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:30,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:30,793 INFO L129 PetriNetUnfolder]: 114/1145 cut-off events. [2021-06-10 11:49:30,794 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-06-10 11:49:30,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1145 events. 114/1145 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4658 event pairs, 0 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1268. Up to 40 conditions per place. [2021-06-10 11:49:30,888 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1026 dead transitions. [2021-06-10 11:49:30,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1026 transitions, 2275 flow [2021-06-10 11:49:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:30,889 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:30,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:30,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:30,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:30,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:30,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,892 INFO L185 Difference]: Start difference. First operand has 997 places, 1028 transitions, 2262 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 1026 transitions, 2275 flow [2021-06-10 11:49:30,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 1026 transitions, 2274 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:30,902 INFO L241 Difference]: Finished difference. Result has 996 places, 1026 transitions, 2258 flow [2021-06-10 11:49:30,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2258, PETRI_PLACES=996, PETRI_TRANSITIONS=1026} [2021-06-10 11:49:30,902 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -39 predicate places. [2021-06-10 11:49:30,902 INFO L480 AbstractCegarLoop]: Abstraction has has 996 places, 1026 transitions, 2258 flow [2021-06-10 11:49:30,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:30,902 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:30,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2422 [2021-06-10 11:49:30,903 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash 628463759, now seen corresponding path program 1 times [2021-06-10 11:49:30,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:30,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640957135] [2021-06-10 11:49:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:30,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:30,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:30,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:30,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:49:30,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640957135] [2021-06-10 11:49:30,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:30,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:30,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027857687] [2021-06-10 11:49:30,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:30,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:30,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:30,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 1026 transitions, 2258 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:30,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:30,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:30,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:31,370 INFO L129 PetriNetUnfolder]: 113/1152 cut-off events. [2021-06-10 11:49:31,370 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:31,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1152 events. 113/1152 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4718 event pairs, 0 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1273. Up to 40 conditions per place. [2021-06-10 11:49:31,467 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 6 selfloop transitions, 1 changer transitions 0/1027 dead transitions. [2021-06-10 11:49:31,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1027 transitions, 2274 flow [2021-06-10 11:49:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:31,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:31,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:31,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:31,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:31,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:31,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:31,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:31,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:31,472 INFO L185 Difference]: Start difference. First operand has 996 places, 1026 transitions, 2258 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:31,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1027 transitions, 2274 flow [2021-06-10 11:49:31,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 997 places, 1027 transitions, 2273 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:31,482 INFO L241 Difference]: Finished difference. Result has 998 places, 1026 transitions, 2262 flow [2021-06-10 11:49:31,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=995, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2262, PETRI_PLACES=998, PETRI_TRANSITIONS=1026} [2021-06-10 11:49:31,482 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -37 predicate places. [2021-06-10 11:49:31,483 INFO L480 AbstractCegarLoop]: Abstraction has has 998 places, 1026 transitions, 2262 flow [2021-06-10 11:49:31,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:31,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:31,483 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:31,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2423 [2021-06-10 11:49:31,483 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash 628464782, now seen corresponding path program 1 times [2021-06-10 11:49:31,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:31,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434887627] [2021-06-10 11:49:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:31,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:31,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:31,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:31,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:31,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:31,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:49:31,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434887627] [2021-06-10 11:49:31,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:31,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:31,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680439661] [2021-06-10 11:49:31,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:31,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:31,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:31,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1026 transitions, 2262 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:31,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:31,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:31,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:31,962 INFO L129 PetriNetUnfolder]: 111/1154 cut-off events. [2021-06-10 11:49:31,962 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:32,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1154 events. 111/1154 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4752 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1284. Up to 40 conditions per place. [2021-06-10 11:49:32,057 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1027 dead transitions. [2021-06-10 11:49:32,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1027 transitions, 2288 flow [2021-06-10 11:49:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:32,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:32,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:32,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:32,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:32,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:32,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,062 INFO L185 Difference]: Start difference. First operand has 998 places, 1026 transitions, 2262 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:32,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1027 transitions, 2288 flow [2021-06-10 11:49:32,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1027 transitions, 2287 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:32,071 INFO L241 Difference]: Finished difference. Result has 1001 places, 1027 transitions, 2279 flow [2021-06-10 11:49:32,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2279, PETRI_PLACES=1001, PETRI_TRANSITIONS=1027} [2021-06-10 11:49:32,071 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -34 predicate places. [2021-06-10 11:49:32,071 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 1027 transitions, 2279 flow [2021-06-10 11:49:32,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:32,072 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:32,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2424 [2021-06-10 11:49:32,072 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:32,072 INFO L82 PathProgramCache]: Analyzing trace with hash 627511470, now seen corresponding path program 1 times [2021-06-10 11:49:32,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:32,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580655571] [2021-06-10 11:49:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:32,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:32,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:32,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:49:32,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580655571] [2021-06-10 11:49:32,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:32,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:32,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249868114] [2021-06-10 11:49:32,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:32,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:32,097 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:32,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1027 transitions, 2279 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:32,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:32,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:32,523 INFO L129 PetriNetUnfolder]: 111/1147 cut-off events. [2021-06-10 11:49:32,523 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:32,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1147 events. 111/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4692 event pairs, 0 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 1269. Up to 40 conditions per place. [2021-06-10 11:49:32,591 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1025 dead transitions. [2021-06-10 11:49:32,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1025 transitions, 2281 flow [2021-06-10 11:49:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:32,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:32,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:32,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:32,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:32,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:32,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,596 INFO L185 Difference]: Start difference. First operand has 1001 places, 1027 transitions, 2279 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:32,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1025 transitions, 2281 flow [2021-06-10 11:49:32,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1025 transitions, 2273 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:32,605 INFO L241 Difference]: Finished difference. Result has 1001 places, 1025 transitions, 2266 flow [2021-06-10 11:49:32,605 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1024, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2266, PETRI_PLACES=1001, PETRI_TRANSITIONS=1025} [2021-06-10 11:49:32,605 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -34 predicate places. [2021-06-10 11:49:32,605 INFO L480 AbstractCegarLoop]: Abstraction has has 1001 places, 1025 transitions, 2266 flow [2021-06-10 11:49:32,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:32,606 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:32,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2425 [2021-06-10 11:49:32,606 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 627510447, now seen corresponding path program 1 times [2021-06-10 11:49:32,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:32,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206532829] [2021-06-10 11:49:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:32,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:32,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:32,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:32,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-10 11:49:32,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206532829] [2021-06-10 11:49:32,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:32,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:32,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809791977] [2021-06-10 11:49:32,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:32,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:32,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:32,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1025 transitions, 2266 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:32,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:32,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:32,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:33,073 INFO L129 PetriNetUnfolder]: 111/1145 cut-off events. [2021-06-10 11:49:33,073 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:33,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 1145 events. 111/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4676 event pairs, 0 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 1274. Up to 40 conditions per place. [2021-06-10 11:49:33,167 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1023 dead transitions. [2021-06-10 11:49:33,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1023 transitions, 2279 flow [2021-06-10 11:49:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:33,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:33,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:33,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:33,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:33,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:33,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,172 INFO L185 Difference]: Start difference. First operand has 1001 places, 1025 transitions, 2266 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:33,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1023 transitions, 2279 flow [2021-06-10 11:49:33,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1023 transitions, 2278 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:33,181 INFO L241 Difference]: Finished difference. Result has 1000 places, 1023 transitions, 2262 flow [2021-06-10 11:49:33,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2262, PETRI_PLACES=1000, PETRI_TRANSITIONS=1023} [2021-06-10 11:49:33,182 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -35 predicate places. [2021-06-10 11:49:33,182 INFO L480 AbstractCegarLoop]: Abstraction has has 1000 places, 1023 transitions, 2262 flow [2021-06-10 11:49:33,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:33,182 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:33,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2426 [2021-06-10 11:49:33,182 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1914224182, now seen corresponding path program 1 times [2021-06-10 11:49:33,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:33,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127901898] [2021-06-10 11:49:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:33,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:33,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:33,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:49:33,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127901898] [2021-06-10 11:49:33,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:33,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:33,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774301901] [2021-06-10 11:49:33,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:33,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:33,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:33,212 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:33,213 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1023 transitions, 2262 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:33,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:33,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:33,654 INFO L129 PetriNetUnfolder]: 109/1150 cut-off events. [2021-06-10 11:49:33,654 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:33,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1150 events. 109/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4726 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1277. Up to 40 conditions per place. [2021-06-10 11:49:33,746 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1024 dead transitions. [2021-06-10 11:49:33,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1024 transitions, 2278 flow [2021-06-10 11:49:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:33,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:33,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:33,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:33,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:33,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:33,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,751 INFO L185 Difference]: Start difference. First operand has 1000 places, 1023 transitions, 2262 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:33,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1024 transitions, 2278 flow [2021-06-10 11:49:33,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1001 places, 1024 transitions, 2277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:33,760 INFO L241 Difference]: Finished difference. Result has 1003 places, 1024 transitions, 2275 flow [2021-06-10 11:49:33,761 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=999, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2275, PETRI_PLACES=1003, PETRI_TRANSITIONS=1024} [2021-06-10 11:49:33,761 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -32 predicate places. [2021-06-10 11:49:33,761 INFO L480 AbstractCegarLoop]: Abstraction has has 1003 places, 1024 transitions, 2275 flow [2021-06-10 11:49:33,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:33,761 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:33,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2427 [2021-06-10 11:49:33,761 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1914225205, now seen corresponding path program 1 times [2021-06-10 11:49:33,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:33,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970947566] [2021-06-10 11:49:33,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:33,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:33,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:33,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:33,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:49:33,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970947566] [2021-06-10 11:49:33,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:33,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:33,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314595555] [2021-06-10 11:49:33,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:33,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:33,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:33,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:33,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1024 transitions, 2275 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:33,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:33,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:33,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:34,239 INFO L129 PetriNetUnfolder]: 109/1151 cut-off events. [2021-06-10 11:49:34,239 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:34,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1151 events. 109/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4737 event pairs, 0 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1285. Up to 40 conditions per place. [2021-06-10 11:49:34,337 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1025 dead transitions. [2021-06-10 11:49:34,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 1025 transitions, 2301 flow [2021-06-10 11:49:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:34,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:34,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:34,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:34,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:34,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:34,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,342 INFO L185 Difference]: Start difference. First operand has 1003 places, 1024 transitions, 2275 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:34,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 1025 transitions, 2301 flow [2021-06-10 11:49:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1025 transitions, 2299 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:34,352 INFO L241 Difference]: Finished difference. Result has 1006 places, 1025 transitions, 2291 flow [2021-06-10 11:49:34,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2291, PETRI_PLACES=1006, PETRI_TRANSITIONS=1025} [2021-06-10 11:49:34,352 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -29 predicate places. [2021-06-10 11:49:34,352 INFO L480 AbstractCegarLoop]: Abstraction has has 1006 places, 1025 transitions, 2291 flow [2021-06-10 11:49:34,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:34,353 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:34,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2428 [2021-06-10 11:49:34,353 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:34,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1913271893, now seen corresponding path program 1 times [2021-06-10 11:49:34,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:34,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428364210] [2021-06-10 11:49:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:34,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:34,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:34,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:49:34,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428364210] [2021-06-10 11:49:34,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:34,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:34,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310672080] [2021-06-10 11:49:34,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:34,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:34,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:34,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1025 transitions, 2291 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:34,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:34,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:34,813 INFO L129 PetriNetUnfolder]: 108/1147 cut-off events. [2021-06-10 11:49:34,813 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:34,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 1147 events. 108/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4711 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1278. Up to 40 conditions per place. [2021-06-10 11:49:34,899 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1022 dead transitions. [2021-06-10 11:49:34,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1022 transitions, 2288 flow [2021-06-10 11:49:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:34,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:34,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:34,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:34,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:34,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:34,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,904 INFO L185 Difference]: Start difference. First operand has 1006 places, 1025 transitions, 2291 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 1022 transitions, 2288 flow [2021-06-10 11:49:34,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1022 transitions, 2280 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:34,913 INFO L241 Difference]: Finished difference. Result has 1005 places, 1022 transitions, 2270 flow [2021-06-10 11:49:34,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1022, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2270, PETRI_PLACES=1005, PETRI_TRANSITIONS=1022} [2021-06-10 11:49:34,913 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -30 predicate places. [2021-06-10 11:49:34,913 INFO L480 AbstractCegarLoop]: Abstraction has has 1005 places, 1022 transitions, 2270 flow [2021-06-10 11:49:34,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:34,914 INFO L263 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:34,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2429 [2021-06-10 11:49:34,914 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1913270870, now seen corresponding path program 1 times [2021-06-10 11:49:34,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:34,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360474394] [2021-06-10 11:49:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:34,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:34,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:34,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:34,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-10 11:49:34,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360474394] [2021-06-10 11:49:34,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:34,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:34,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243412311] [2021-06-10 11:49:34,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:34,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:34,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:34,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 1022 transitions, 2270 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:34,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:34,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:34,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:35,376 INFO L129 PetriNetUnfolder]: 108/1145 cut-off events. [2021-06-10 11:49:35,376 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:35,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 1145 events. 108/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4694 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1281. Up to 40 conditions per place. [2021-06-10 11:49:35,468 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1020 dead transitions. [2021-06-10 11:49:35,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1005 places, 1020 transitions, 2283 flow [2021-06-10 11:49:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:35,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:35,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:35,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:35,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:35,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:35,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:35,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:35,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:35,473 INFO L185 Difference]: Start difference. First operand has 1005 places, 1022 transitions, 2270 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:35,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1005 places, 1020 transitions, 2283 flow [2021-06-10 11:49:35,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1020 transitions, 2282 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:35,482 INFO L241 Difference]: Finished difference. Result has 1004 places, 1020 transitions, 2266 flow [2021-06-10 11:49:35,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2266, PETRI_PLACES=1004, PETRI_TRANSITIONS=1020} [2021-06-10 11:49:35,483 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -31 predicate places. [2021-06-10 11:49:35,483 INFO L480 AbstractCegarLoop]: Abstraction has has 1004 places, 1020 transitions, 2266 flow [2021-06-10 11:49:35,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:35,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:35,483 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:35,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2430 [2021-06-10 11:49:35,484 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -506009368, now seen corresponding path program 1 times [2021-06-10 11:49:35,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:35,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316927472] [2021-06-10 11:49:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:35,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:35,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:35,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:35,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:35,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:35,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:49:35,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316927472] [2021-06-10 11:49:35,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:35,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:35,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672742249] [2021-06-10 11:49:35,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:35,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:35,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:35,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 1020 transitions, 2266 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:35,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:35,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:35,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:35,972 INFO L129 PetriNetUnfolder]: 107/1153 cut-off events. [2021-06-10 11:49:35,972 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:36,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 1153 events. 107/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4765 event pairs, 0 based on Foata normal form. 0/1006 useless extension candidates. Maximal degree in co-relation 1293. Up to 40 conditions per place. [2021-06-10 11:49:36,073 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2021-06-10 11:49:36,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1006 places, 1022 transitions, 2296 flow [2021-06-10 11:49:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:49:36,074 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:49:36,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:49:36,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:49:36,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:36,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:49:36,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,078 INFO L185 Difference]: Start difference. First operand has 1004 places, 1020 transitions, 2266 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:49:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1006 places, 1022 transitions, 2296 flow [2021-06-10 11:49:36,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1022 transitions, 2295 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:36,087 INFO L241 Difference]: Finished difference. Result has 1007 places, 1022 transitions, 2289 flow [2021-06-10 11:49:36,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2289, PETRI_PLACES=1007, PETRI_TRANSITIONS=1022} [2021-06-10 11:49:36,088 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -28 predicate places. [2021-06-10 11:49:36,088 INFO L480 AbstractCegarLoop]: Abstraction has has 1007 places, 1022 transitions, 2289 flow [2021-06-10 11:49:36,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:36,088 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:36,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2431 [2021-06-10 11:49:36,088 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -506008345, now seen corresponding path program 1 times [2021-06-10 11:49:36,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:36,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46376259] [2021-06-10 11:49:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:36,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:36,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:36,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:49:36,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46376259] [2021-06-10 11:49:36,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:36,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:36,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311095629] [2021-06-10 11:49:36,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:36,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:36,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:36,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1022 transitions, 2289 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:36,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:36,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:36,569 INFO L129 PetriNetUnfolder]: 106/1151 cut-off events. [2021-06-10 11:49:36,569 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:36,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1151 events. 106/1151 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4755 event pairs, 0 based on Foata normal form. 0/1007 useless extension candidates. Maximal degree in co-relation 1290. Up to 40 conditions per place. [2021-06-10 11:49:36,710 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1022 dead transitions. [2021-06-10 11:49:36,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1022 transitions, 2301 flow [2021-06-10 11:49:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:36,711 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:36,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:36,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:36,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:36,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:36,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,715 INFO L185 Difference]: Start difference. First operand has 1007 places, 1022 transitions, 2289 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:36,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1022 transitions, 2301 flow [2021-06-10 11:49:36,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 1022 transitions, 2296 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:36,723 INFO L241 Difference]: Finished difference. Result has 1010 places, 1022 transitions, 2294 flow [2021-06-10 11:49:36,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1010, PETRI_TRANSITIONS=1022} [2021-06-10 11:49:36,723 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -25 predicate places. [2021-06-10 11:49:36,724 INFO L480 AbstractCegarLoop]: Abstraction has has 1010 places, 1022 transitions, 2294 flow [2021-06-10 11:49:36,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:36,724 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:36,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2432 [2021-06-10 11:49:36,724 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash -505056056, now seen corresponding path program 1 times [2021-06-10 11:49:36,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:36,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247490957] [2021-06-10 11:49:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:36,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:36,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:36,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:36,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:49:36,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247490957] [2021-06-10 11:49:36,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:36,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:36,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052004641] [2021-06-10 11:49:36,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:36,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:36,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:36,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1022 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:36,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:36,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:36,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:37,197 INFO L129 PetriNetUnfolder]: 105/1147 cut-off events. [2021-06-10 11:49:37,197 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:49:37,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1147 events. 105/1147 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4730 event pairs, 0 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1287. Up to 40 conditions per place. [2021-06-10 11:49:37,290 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1019 dead transitions. [2021-06-10 11:49:37,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1019 transitions, 2291 flow [2021-06-10 11:49:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:37,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:37,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:37,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:37,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:37,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:37,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,297 INFO L185 Difference]: Start difference. First operand has 1010 places, 1022 transitions, 2294 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:37,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1019 transitions, 2291 flow [2021-06-10 11:49:37,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1019 transitions, 2284 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:37,306 INFO L241 Difference]: Finished difference. Result has 1009 places, 1019 transitions, 2274 flow [2021-06-10 11:49:37,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=1009, PETRI_TRANSITIONS=1019} [2021-06-10 11:49:37,307 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -26 predicate places. [2021-06-10 11:49:37,307 INFO L480 AbstractCegarLoop]: Abstraction has has 1009 places, 1019 transitions, 2274 flow [2021-06-10 11:49:37,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:37,307 INFO L263 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:37,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2433 [2021-06-10 11:49:37,307 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash -505055033, now seen corresponding path program 1 times [2021-06-10 11:49:37,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:37,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607120290] [2021-06-10 11:49:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:37,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:37,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:37,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-10 11:49:37,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607120290] [2021-06-10 11:49:37,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:37,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:37,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372218795] [2021-06-10 11:49:37,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:37,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:37,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:37,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1019 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:37,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:37,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:37,784 INFO L129 PetriNetUnfolder]: 105/1145 cut-off events. [2021-06-10 11:49:37,784 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:37,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 1145 events. 105/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4712 event pairs, 0 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1288. Up to 40 conditions per place. [2021-06-10 11:49:37,876 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1017 dead transitions. [2021-06-10 11:49:37,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1017 transitions, 2287 flow [2021-06-10 11:49:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:37,878 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:37,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:37,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:37,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:37,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:37,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,881 INFO L185 Difference]: Start difference. First operand has 1009 places, 1019 transitions, 2274 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1017 transitions, 2287 flow [2021-06-10 11:49:37,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 1017 transitions, 2286 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:37,891 INFO L241 Difference]: Finished difference. Result has 1008 places, 1017 transitions, 2270 flow [2021-06-10 11:49:37,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=1006, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2270, PETRI_PLACES=1008, PETRI_TRANSITIONS=1017} [2021-06-10 11:49:37,891 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -27 predicate places. [2021-06-10 11:49:37,891 INFO L480 AbstractCegarLoop]: Abstraction has has 1008 places, 1017 transitions, 2270 flow [2021-06-10 11:49:37,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:37,892 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:37,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2434 [2021-06-10 11:49:37,892 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1305763430, now seen corresponding path program 1 times [2021-06-10 11:49:37,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:37,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695243796] [2021-06-10 11:49:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:37,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:37,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:37,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:37,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:49:37,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695243796] [2021-06-10 11:49:37,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:37,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:37,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437557422] [2021-06-10 11:49:37,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:37,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:37,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:37,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 1017 transitions, 2270 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:37,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:37,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:37,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:38,361 INFO L129 PetriNetUnfolder]: 104/1152 cut-off events. [2021-06-10 11:49:38,361 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:38,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1152 events. 104/1152 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4774 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1293. Up to 40 conditions per place. [2021-06-10 11:49:38,451 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 6 selfloop transitions, 1 changer transitions 0/1018 dead transitions. [2021-06-10 11:49:38,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1010 places, 1018 transitions, 2286 flow [2021-06-10 11:49:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:38,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:38,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:38,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:38,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:38,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:38,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:38,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:38,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:38,456 INFO L185 Difference]: Start difference. First operand has 1008 places, 1017 transitions, 2270 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:38,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1010 places, 1018 transitions, 2286 flow [2021-06-10 11:49:38,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1009 places, 1018 transitions, 2285 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:38,465 INFO L241 Difference]: Finished difference. Result has 1010 places, 1017 transitions, 2274 flow [2021-06-10 11:49:38,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=1010, PETRI_TRANSITIONS=1017} [2021-06-10 11:49:38,466 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -25 predicate places. [2021-06-10 11:49:38,466 INFO L480 AbstractCegarLoop]: Abstraction has has 1010 places, 1017 transitions, 2274 flow [2021-06-10 11:49:38,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:38,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:38,466 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:38,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2435 [2021-06-10 11:49:38,466 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1305764453, now seen corresponding path program 1 times [2021-06-10 11:49:38,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:38,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604695869] [2021-06-10 11:49:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:38,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:38,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:38,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:38,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:38,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:38,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:49:38,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604695869] [2021-06-10 11:49:38,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:38,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:38,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341919168] [2021-06-10 11:49:38,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:38,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:38,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:38,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1017 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:38,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:38,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:38,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:38,971 INFO L129 PetriNetUnfolder]: 102/1154 cut-off events. [2021-06-10 11:49:38,971 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:39,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1154 events. 102/1154 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4803 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1304. Up to 40 conditions per place. [2021-06-10 11:49:39,049 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1018 dead transitions. [2021-06-10 11:49:39,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1018 transitions, 2300 flow [2021-06-10 11:49:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:39,051 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:39,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:39,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:39,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:39,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:39,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,055 INFO L185 Difference]: Start difference. First operand has 1010 places, 1017 transitions, 2274 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:39,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1018 transitions, 2300 flow [2021-06-10 11:49:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1018 transitions, 2299 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:39,063 INFO L241 Difference]: Finished difference. Result has 1013 places, 1018 transitions, 2291 flow [2021-06-10 11:49:39,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2291, PETRI_PLACES=1013, PETRI_TRANSITIONS=1018} [2021-06-10 11:49:39,063 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -22 predicate places. [2021-06-10 11:49:39,064 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 1018 transitions, 2291 flow [2021-06-10 11:49:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:39,064 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:39,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2436 [2021-06-10 11:49:39,064 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1304811141, now seen corresponding path program 1 times [2021-06-10 11:49:39,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:39,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957136018] [2021-06-10 11:49:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:39,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:39,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:39,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:49:39,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957136018] [2021-06-10 11:49:39,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:39,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:39,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10624059] [2021-06-10 11:49:39,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:39,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:39,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:39,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1018 transitions, 2291 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:39,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:39,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:39,606 INFO L129 PetriNetUnfolder]: 102/1147 cut-off events. [2021-06-10 11:49:39,606 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:39,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1147 events. 102/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4747 event pairs, 0 based on Foata normal form. 1/1008 useless extension candidates. Maximal degree in co-relation 1290. Up to 40 conditions per place. [2021-06-10 11:49:39,696 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1016 dead transitions. [2021-06-10 11:49:39,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1016 transitions, 2293 flow [2021-06-10 11:49:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:39,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:39,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:39,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:39,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:39,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:39,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,701 INFO L185 Difference]: Start difference. First operand has 1013 places, 1018 transitions, 2291 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:39,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1016 transitions, 2293 flow [2021-06-10 11:49:39,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1016 transitions, 2285 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:39,710 INFO L241 Difference]: Finished difference. Result has 1013 places, 1016 transitions, 2278 flow [2021-06-10 11:49:39,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2278, PETRI_PLACES=1013, PETRI_TRANSITIONS=1016} [2021-06-10 11:49:39,711 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -22 predicate places. [2021-06-10 11:49:39,711 INFO L480 AbstractCegarLoop]: Abstraction has has 1013 places, 1016 transitions, 2278 flow [2021-06-10 11:49:39,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:39,711 INFO L263 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:39,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2437 [2021-06-10 11:49:39,711 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1304810118, now seen corresponding path program 1 times [2021-06-10 11:49:39,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:39,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712332637] [2021-06-10 11:49:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:39,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:39,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:39,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:39,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-10 11:49:39,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712332637] [2021-06-10 11:49:39,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:39,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:39,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92688692] [2021-06-10 11:49:39,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:39,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:39,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:39,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1016 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:39,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:39,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:39,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:40,182 INFO L129 PetriNetUnfolder]: 102/1145 cut-off events. [2021-06-10 11:49:40,183 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:40,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 1145 events. 102/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4730 event pairs, 0 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1294. Up to 40 conditions per place. [2021-06-10 11:49:40,272 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1014 dead transitions. [2021-06-10 11:49:40,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1014 transitions, 2291 flow [2021-06-10 11:49:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:40,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:40,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:40,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:40,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:40,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:40,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,277 INFO L185 Difference]: Start difference. First operand has 1013 places, 1016 transitions, 2278 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:40,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1014 transitions, 2291 flow [2021-06-10 11:49:40,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1014 transitions, 2290 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:40,286 INFO L241 Difference]: Finished difference. Result has 1012 places, 1014 transitions, 2274 flow [2021-06-10 11:49:40,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=1012, PETRI_TRANSITIONS=1014} [2021-06-10 11:49:40,286 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -23 predicate places. [2021-06-10 11:49:40,286 INFO L480 AbstractCegarLoop]: Abstraction has has 1012 places, 1014 transitions, 2274 flow [2021-06-10 11:49:40,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,287 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:40,287 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:40,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2438 [2021-06-10 11:49:40,287 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -541603292, now seen corresponding path program 1 times [2021-06-10 11:49:40,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:40,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685537227] [2021-06-10 11:49:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:40,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:40,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:40,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:49:40,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685537227] [2021-06-10 11:49:40,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:40,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:40,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544887055] [2021-06-10 11:49:40,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:40,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:40,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:40,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1014 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:40,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:40,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:40,755 INFO L129 PetriNetUnfolder]: 100/1150 cut-off events. [2021-06-10 11:49:40,755 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:40,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 1150 events. 100/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4781 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1297. Up to 40 conditions per place. [2021-06-10 11:49:40,846 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2021-06-10 11:49:40,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 1015 transitions, 2290 flow [2021-06-10 11:49:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:40,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:40,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:40,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:40,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:40,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:40,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,851 INFO L185 Difference]: Start difference. First operand has 1012 places, 1014 transitions, 2274 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:40,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 1015 transitions, 2290 flow [2021-06-10 11:49:40,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1013 places, 1015 transitions, 2289 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:40,861 INFO L241 Difference]: Finished difference. Result has 1015 places, 1015 transitions, 2287 flow [2021-06-10 11:49:40,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2287, PETRI_PLACES=1015, PETRI_TRANSITIONS=1015} [2021-06-10 11:49:40,861 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -20 predicate places. [2021-06-10 11:49:40,861 INFO L480 AbstractCegarLoop]: Abstraction has has 1015 places, 1015 transitions, 2287 flow [2021-06-10 11:49:40,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:40,862 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:40,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2439 [2021-06-10 11:49:40,862 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash -541604315, now seen corresponding path program 1 times [2021-06-10 11:49:40,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:40,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329881340] [2021-06-10 11:49:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:40,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:40,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:40,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:40,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:49:40,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329881340] [2021-06-10 11:49:40,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:40,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:40,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683301491] [2021-06-10 11:49:40,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:40,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:40,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:40,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1015 transitions, 2287 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:40,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:40,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:40,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:41,402 INFO L129 PetriNetUnfolder]: 100/1151 cut-off events. [2021-06-10 11:49:41,403 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:41,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1151 events. 100/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4788 event pairs, 0 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1305. Up to 40 conditions per place. [2021-06-10 11:49:41,457 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2021-06-10 11:49:41,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1016 transitions, 2313 flow [2021-06-10 11:49:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:41,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:41,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:41,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:41,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:41,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:41,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:41,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:41,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:41,462 INFO L185 Difference]: Start difference. First operand has 1015 places, 1015 transitions, 2287 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:41,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1016 transitions, 2313 flow [2021-06-10 11:49:41,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1016 transitions, 2311 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:41,470 INFO L241 Difference]: Finished difference. Result has 1018 places, 1016 transitions, 2303 flow [2021-06-10 11:49:41,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2303, PETRI_PLACES=1018, PETRI_TRANSITIONS=1016} [2021-06-10 11:49:41,471 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -17 predicate places. [2021-06-10 11:49:41,471 INFO L480 AbstractCegarLoop]: Abstraction has has 1018 places, 1016 transitions, 2303 flow [2021-06-10 11:49:41,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:41,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:41,471 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:41,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2440 [2021-06-10 11:49:41,471 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -540649980, now seen corresponding path program 1 times [2021-06-10 11:49:41,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:41,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076250826] [2021-06-10 11:49:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:41,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:41,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:41,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:41,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:41,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:41,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:49:41,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076250826] [2021-06-10 11:49:41,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:41,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:41,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130961833] [2021-06-10 11:49:41,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:41,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:41,498 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:41,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1016 transitions, 2303 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:41,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:41,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:41,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:41,957 INFO L129 PetriNetUnfolder]: 99/1148 cut-off events. [2021-06-10 11:49:41,957 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-06-10 11:49:42,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1148 events. 99/1148 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4771 event pairs, 0 based on Foata normal form. 2/1012 useless extension candidates. Maximal degree in co-relation 1304. Up to 40 conditions per place. [2021-06-10 11:49:42,048 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 9 selfloop transitions, 1 changer transitions 0/1014 dead transitions. [2021-06-10 11:49:42,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1014 transitions, 2311 flow [2021-06-10 11:49:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3078 transitions. [2021-06-10 11:49:42,050 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921832884097035 [2021-06-10 11:49:42,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3078 transitions. [2021-06-10 11:49:42,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3078 transitions. [2021-06-10 11:49:42,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:42,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3078 transitions. [2021-06-10 11:49:42,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.0) internal successors, (3078), 3 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,053 INFO L185 Difference]: Start difference. First operand has 1018 places, 1016 transitions, 2303 flow. Second operand 3 states and 3078 transitions. [2021-06-10 11:49:42,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1014 transitions, 2311 flow [2021-06-10 11:49:42,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1014 transitions, 2310 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:42,062 INFO L241 Difference]: Finished difference. Result has 1019 places, 1014 transitions, 2292 flow [2021-06-10 11:49:42,063 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2292, PETRI_PLACES=1019, PETRI_TRANSITIONS=1014} [2021-06-10 11:49:42,063 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -16 predicate places. [2021-06-10 11:49:42,063 INFO L480 AbstractCegarLoop]: Abstraction has has 1019 places, 1014 transitions, 2292 flow [2021-06-10 11:49:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,063 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:42,063 INFO L263 CegarLoopForPetriNet]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:42,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2441 [2021-06-10 11:49:42,063 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -540651003, now seen corresponding path program 1 times [2021-06-10 11:49:42,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:42,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67525824] [2021-06-10 11:49:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:42,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:42,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:42,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-10 11:49:42,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67525824] [2021-06-10 11:49:42,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:42,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:42,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557783431] [2021-06-10 11:49:42,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:42,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:42,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:42,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1014 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:42,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:42,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:42,534 INFO L129 PetriNetUnfolder]: 99/1145 cut-off events. [2021-06-10 11:49:42,534 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:42,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 1145 events. 99/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4747 event pairs, 0 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1298. Up to 40 conditions per place. [2021-06-10 11:49:42,625 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1011 dead transitions. [2021-06-10 11:49:42,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1011 transitions, 2293 flow [2021-06-10 11:49:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:42,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:42,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:42,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:42,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:42,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:42,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,630 INFO L185 Difference]: Start difference. First operand has 1019 places, 1014 transitions, 2292 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:42,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1011 transitions, 2293 flow [2021-06-10 11:49:42,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1011 transitions, 2288 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:42,640 INFO L241 Difference]: Finished difference. Result has 1016 places, 1011 transitions, 2278 flow [2021-06-10 11:49:42,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2278, PETRI_PLACES=1016, PETRI_TRANSITIONS=1011} [2021-06-10 11:49:42,640 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -19 predicate places. [2021-06-10 11:49:42,640 INFO L480 AbstractCegarLoop]: Abstraction has has 1016 places, 1011 transitions, 2278 flow [2021-06-10 11:49:42,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:42,641 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:42,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2442 [2021-06-10 11:49:42,641 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -933789404, now seen corresponding path program 1 times [2021-06-10 11:49:42,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:42,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321095687] [2021-06-10 11:49:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:42,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:42,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:42,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:42,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:49:42,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321095687] [2021-06-10 11:49:42,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:42,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:42,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989316425] [2021-06-10 11:49:42,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:42,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:42,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:42,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:42,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:42,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1011 transitions, 2278 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:42,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:42,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:42,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:43,127 INFO L129 PetriNetUnfolder]: 98/1153 cut-off events. [2021-06-10 11:49:43,127 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:43,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1153 events. 98/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4818 event pairs, 0 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1315. Up to 40 conditions per place. [2021-06-10 11:49:43,218 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2021-06-10 11:49:43,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1013 transitions, 2308 flow [2021-06-10 11:49:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:49:43,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:49:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:49:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:49:43,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:43,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:49:43,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,223 INFO L185 Difference]: Start difference. First operand has 1016 places, 1011 transitions, 2278 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:49:43,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1013 transitions, 2308 flow [2021-06-10 11:49:43,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1013 transitions, 2307 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:43,233 INFO L241 Difference]: Finished difference. Result has 1019 places, 1013 transitions, 2301 flow [2021-06-10 11:49:43,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2301, PETRI_PLACES=1019, PETRI_TRANSITIONS=1013} [2021-06-10 11:49:43,233 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -16 predicate places. [2021-06-10 11:49:43,233 INFO L480 AbstractCegarLoop]: Abstraction has has 1019 places, 1013 transitions, 2301 flow [2021-06-10 11:49:43,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:43,234 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:43,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2443 [2021-06-10 11:49:43,234 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -933790427, now seen corresponding path program 1 times [2021-06-10 11:49:43,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:43,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241970205] [2021-06-10 11:49:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:43,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:43,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:43,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:49:43,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241970205] [2021-06-10 11:49:43,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:43,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:43,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021296502] [2021-06-10 11:49:43,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:43,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:43,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:43,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1013 transitions, 2301 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:43,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:43,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:43,717 INFO L129 PetriNetUnfolder]: 96/1154 cut-off events. [2021-06-10 11:49:43,717 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:43,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1154 events. 96/1154 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4838 event pairs, 0 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 1313. Up to 40 conditions per place. [2021-06-10 11:49:43,809 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 6 selfloop transitions, 1 changer transitions 0/1013 dead transitions. [2021-06-10 11:49:43,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1013 transitions, 2313 flow [2021-06-10 11:49:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:43,811 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:43,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:43,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:43,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:43,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:43,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,814 INFO L185 Difference]: Start difference. First operand has 1019 places, 1013 transitions, 2301 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:43,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1013 transitions, 2313 flow [2021-06-10 11:49:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1013 transitions, 2308 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:43,824 INFO L241 Difference]: Finished difference. Result has 1021 places, 1012 transitions, 2297 flow [2021-06-10 11:49:43,824 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2297, PETRI_PLACES=1021, PETRI_TRANSITIONS=1012} [2021-06-10 11:49:43,824 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -14 predicate places. [2021-06-10 11:49:43,824 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 1012 transitions, 2297 flow [2021-06-10 11:49:43,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:43,825 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:43,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2444 [2021-06-10 11:49:43,825 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash -934742716, now seen corresponding path program 1 times [2021-06-10 11:49:43,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:43,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778889605] [2021-06-10 11:49:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:43,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:43,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:43,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:43,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:49:43,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778889605] [2021-06-10 11:49:43,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:43,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:43,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859780053] [2021-06-10 11:49:43,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:43,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:43,851 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:43,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1012 transitions, 2297 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:43,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:43,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:43,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:44,316 INFO L129 PetriNetUnfolder]: 96/1147 cut-off events. [2021-06-10 11:49:44,316 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:44,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1147 events. 96/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4781 event pairs, 0 based on Foata normal form. 1/1014 useless extension candidates. Maximal degree in co-relation 1307. Up to 40 conditions per place. [2021-06-10 11:49:44,405 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1010 dead transitions. [2021-06-10 11:49:44,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1010 transitions, 2300 flow [2021-06-10 11:49:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:44,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:44,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:44,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:44,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:44,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:44,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,410 INFO L185 Difference]: Start difference. First operand has 1021 places, 1012 transitions, 2297 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:44,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1010 transitions, 2300 flow [2021-06-10 11:49:44,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1010 transitions, 2293 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:44,419 INFO L241 Difference]: Finished difference. Result has 1021 places, 1010 transitions, 2286 flow [2021-06-10 11:49:44,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2286, PETRI_PLACES=1021, PETRI_TRANSITIONS=1010} [2021-06-10 11:49:44,419 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -14 predicate places. [2021-06-10 11:49:44,419 INFO L480 AbstractCegarLoop]: Abstraction has has 1021 places, 1010 transitions, 2286 flow [2021-06-10 11:49:44,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:44,420 INFO L263 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:44,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2445 [2021-06-10 11:49:44,420 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -934743739, now seen corresponding path program 1 times [2021-06-10 11:49:44,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:44,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073768097] [2021-06-10 11:49:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:44,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:44,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:44,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:44,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:44,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:44,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-10 11:49:44,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073768097] [2021-06-10 11:49:44,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:44,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:44,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38055521] [2021-06-10 11:49:44,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:44,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:44,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:44,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1010 transitions, 2286 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:44,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:44,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:44,902 INFO L129 PetriNetUnfolder]: 96/1145 cut-off events. [2021-06-10 11:49:44,902 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:44,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 1145 events. 96/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4765 event pairs, 0 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1307. Up to 40 conditions per place. [2021-06-10 11:49:44,990 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1008 dead transitions. [2021-06-10 11:49:44,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1008 transitions, 2299 flow [2021-06-10 11:49:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:44,992 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:44,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:44,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:44,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:44,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:44,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:44,995 INFO L185 Difference]: Start difference. First operand has 1021 places, 1010 transitions, 2286 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:44,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1008 transitions, 2299 flow [2021-06-10 11:49:45,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1008 transitions, 2298 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:45,005 INFO L241 Difference]: Finished difference. Result has 1020 places, 1008 transitions, 2282 flow [2021-06-10 11:49:45,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2282, PETRI_PLACES=1020, PETRI_TRANSITIONS=1008} [2021-06-10 11:49:45,005 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -15 predicate places. [2021-06-10 11:49:45,005 INFO L480 AbstractCegarLoop]: Abstraction has has 1020 places, 1008 transitions, 2282 flow [2021-06-10 11:49:45,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:45,006 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:45,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2446 [2021-06-10 11:49:45,006 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:45,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1129649819, now seen corresponding path program 1 times [2021-06-10 11:49:45,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:45,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123037645] [2021-06-10 11:49:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:45,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:45,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:45,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:49:45,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123037645] [2021-06-10 11:49:45,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:45,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:45,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450876120] [2021-06-10 11:49:45,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:45,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:45,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:45,032 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:45,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1008 transitions, 2282 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:45,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:45,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:45,482 INFO L129 PetriNetUnfolder]: 94/1150 cut-off events. [2021-06-10 11:49:45,483 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:45,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 1150 events. 94/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4816 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1310. Up to 40 conditions per place. [2021-06-10 11:49:45,572 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1009 dead transitions. [2021-06-10 11:49:45,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1009 transitions, 2298 flow [2021-06-10 11:49:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:45,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:45,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:45,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:45,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:45,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:45,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,577 INFO L185 Difference]: Start difference. First operand has 1020 places, 1008 transitions, 2282 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:45,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1009 transitions, 2298 flow [2021-06-10 11:49:45,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1009 transitions, 2297 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:45,586 INFO L241 Difference]: Finished difference. Result has 1023 places, 1009 transitions, 2295 flow [2021-06-10 11:49:45,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1006, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2295, PETRI_PLACES=1023, PETRI_TRANSITIONS=1009} [2021-06-10 11:49:45,586 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -12 predicate places. [2021-06-10 11:49:45,586 INFO L480 AbstractCegarLoop]: Abstraction has has 1023 places, 1009 transitions, 2295 flow [2021-06-10 11:49:45,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:45,587 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:45,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2447 [2021-06-10 11:49:45,587 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1129650842, now seen corresponding path program 1 times [2021-06-10 11:49:45,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:45,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099073148] [2021-06-10 11:49:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:45,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:45,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:45,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:45,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:49:45,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099073148] [2021-06-10 11:49:45,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:45,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:45,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576391940] [2021-06-10 11:49:45,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:45,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:45,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:45,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1009 transitions, 2295 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:45,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:45,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:45,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:46,073 INFO L129 PetriNetUnfolder]: 94/1151 cut-off events. [2021-06-10 11:49:46,074 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:46,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1151 events. 94/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4823 event pairs, 0 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1318. Up to 40 conditions per place. [2021-06-10 11:49:46,164 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1010 dead transitions. [2021-06-10 11:49:46,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1010 transitions, 2321 flow [2021-06-10 11:49:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:46,166 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:46,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:46,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:46,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:46,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:46,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,169 INFO L185 Difference]: Start difference. First operand has 1023 places, 1009 transitions, 2295 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:46,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1010 transitions, 2321 flow [2021-06-10 11:49:46,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1010 transitions, 2319 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:46,179 INFO L241 Difference]: Finished difference. Result has 1026 places, 1010 transitions, 2311 flow [2021-06-10 11:49:46,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1006, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2311, PETRI_PLACES=1026, PETRI_TRANSITIONS=1010} [2021-06-10 11:49:46,179 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -9 predicate places. [2021-06-10 11:49:46,179 INFO L480 AbstractCegarLoop]: Abstraction has has 1026 places, 1010 transitions, 2311 flow [2021-06-10 11:49:46,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:46,179 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:46,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2448 [2021-06-10 11:49:46,179 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1128697530, now seen corresponding path program 1 times [2021-06-10 11:49:46,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:46,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450336351] [2021-06-10 11:49:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:46,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:46,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:46,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:49:46,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450336351] [2021-06-10 11:49:46,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:46,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:46,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923566487] [2021-06-10 11:49:46,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:46,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:46,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:46,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1010 transitions, 2311 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:46,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:46,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:46,654 INFO L129 PetriNetUnfolder]: 93/1147 cut-off events. [2021-06-10 11:49:46,654 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:46,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1147 events. 93/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4800 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1311. Up to 40 conditions per place. [2021-06-10 11:49:46,728 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1007 dead transitions. [2021-06-10 11:49:46,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1007 transitions, 2308 flow [2021-06-10 11:49:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:46,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:46,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:46,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:46,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:46,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:46,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,733 INFO L185 Difference]: Start difference. First operand has 1026 places, 1010 transitions, 2311 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:46,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1007 transitions, 2308 flow [2021-06-10 11:49:46,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1007 transitions, 2300 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:46,741 INFO L241 Difference]: Finished difference. Result has 1025 places, 1007 transitions, 2290 flow [2021-06-10 11:49:46,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1006, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2290, PETRI_PLACES=1025, PETRI_TRANSITIONS=1007} [2021-06-10 11:49:46,742 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -10 predicate places. [2021-06-10 11:49:46,742 INFO L480 AbstractCegarLoop]: Abstraction has has 1025 places, 1007 transitions, 2290 flow [2021-06-10 11:49:46,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:46,742 INFO L263 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:46,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2449 [2021-06-10 11:49:46,742 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1128696507, now seen corresponding path program 1 times [2021-06-10 11:49:46,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:46,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295057133] [2021-06-10 11:49:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:46,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:46,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:46,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:46,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-06-10 11:49:46,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295057133] [2021-06-10 11:49:46,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:46,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:46,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865280454] [2021-06-10 11:49:46,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:46,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:46,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:46,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:46,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1007 transitions, 2290 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:46,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:46,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:46,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:47,222 INFO L129 PetriNetUnfolder]: 93/1145 cut-off events. [2021-06-10 11:49:47,222 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:47,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1145 events. 93/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4782 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1314. Up to 40 conditions per place. [2021-06-10 11:49:47,317 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1005 dead transitions. [2021-06-10 11:49:47,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1005 transitions, 2303 flow [2021-06-10 11:49:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:47,318 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:47,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:47,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:47,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:47,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:47,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,321 INFO L185 Difference]: Start difference. First operand has 1025 places, 1007 transitions, 2290 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:47,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1005 transitions, 2303 flow [2021-06-10 11:49:47,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1005 transitions, 2302 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:47,331 INFO L241 Difference]: Finished difference. Result has 1024 places, 1005 transitions, 2286 flow [2021-06-10 11:49:47,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1004, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2286, PETRI_PLACES=1024, PETRI_TRANSITIONS=1005} [2021-06-10 11:49:47,331 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -11 predicate places. [2021-06-10 11:49:47,331 INFO L480 AbstractCegarLoop]: Abstraction has has 1024 places, 1005 transitions, 2286 flow [2021-06-10 11:49:47,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:47,332 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:47,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2450 [2021-06-10 11:49:47,332 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1153324007, now seen corresponding path program 1 times [2021-06-10 11:49:47,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:47,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358745987] [2021-06-10 11:49:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:47,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:47,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:47,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:49:47,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358745987] [2021-06-10 11:49:47,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:47,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:47,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522026068] [2021-06-10 11:49:47,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:47,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:47,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:47,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:47,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:47,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1005 transitions, 2286 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:47,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:47,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:47,815 INFO L129 PetriNetUnfolder]: 92/1153 cut-off events. [2021-06-10 11:49:47,816 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:47,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 1153 events. 92/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4851 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1326. Up to 40 conditions per place. [2021-06-10 11:49:47,904 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/1007 dead transitions. [2021-06-10 11:49:47,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1007 transitions, 2316 flow [2021-06-10 11:49:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:49:47,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:49:47,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:49:47,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:49:47,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:47,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:49:47,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,909 INFO L185 Difference]: Start difference. First operand has 1024 places, 1005 transitions, 2286 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:49:47,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1007 transitions, 2316 flow [2021-06-10 11:49:47,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1007 transitions, 2315 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:47,918 INFO L241 Difference]: Finished difference. Result has 1027 places, 1007 transitions, 2309 flow [2021-06-10 11:49:47,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2309, PETRI_PLACES=1027, PETRI_TRANSITIONS=1007} [2021-06-10 11:49:47,918 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -8 predicate places. [2021-06-10 11:49:47,918 INFO L480 AbstractCegarLoop]: Abstraction has has 1027 places, 1007 transitions, 2309 flow [2021-06-10 11:49:47,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:47,919 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:47,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2451 [2021-06-10 11:49:47,919 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1153322984, now seen corresponding path program 1 times [2021-06-10 11:49:47,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:47,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721478540] [2021-06-10 11:49:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:47,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:47,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:47,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:47,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:49:47,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721478540] [2021-06-10 11:49:47,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:47,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:47,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310847066] [2021-06-10 11:49:47,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:47,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:47,945 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:47,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1007 transitions, 2309 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:47,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:47,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:47,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:48,407 INFO L129 PetriNetUnfolder]: 90/1154 cut-off events. [2021-06-10 11:49:48,408 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:48,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1154 events. 90/1154 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4871 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1326. Up to 40 conditions per place. [2021-06-10 11:49:48,498 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 6 selfloop transitions, 1 changer transitions 0/1007 dead transitions. [2021-06-10 11:49:48,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1007 transitions, 2321 flow [2021-06-10 11:49:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:48,500 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:48,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:48,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:48,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:48,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:48,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:48,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:48,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:48,503 INFO L185 Difference]: Start difference. First operand has 1027 places, 1007 transitions, 2309 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:48,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1007 transitions, 2321 flow [2021-06-10 11:49:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1007 transitions, 2316 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:48,513 INFO L241 Difference]: Finished difference. Result has 1029 places, 1006 transitions, 2305 flow [2021-06-10 11:49:48,514 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1006, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1005, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2305, PETRI_PLACES=1029, PETRI_TRANSITIONS=1006} [2021-06-10 11:49:48,514 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -6 predicate places. [2021-06-10 11:49:48,514 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 1006 transitions, 2305 flow [2021-06-10 11:49:48,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:48,514 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:48,514 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:48,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2452 [2021-06-10 11:49:48,514 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1152370695, now seen corresponding path program 1 times [2021-06-10 11:49:48,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:48,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216702180] [2021-06-10 11:49:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:48,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:48,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:48,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:48,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:48,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:48,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:49:48,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216702180] [2021-06-10 11:49:48,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:48,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:48,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799402497] [2021-06-10 11:49:48,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:48,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:48,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:48,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:48,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1006 transitions, 2305 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:48,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:48,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:48,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:49,024 INFO L129 PetriNetUnfolder]: 90/1147 cut-off events. [2021-06-10 11:49:49,024 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:49,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1147 events. 90/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4814 event pairs, 0 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 1320. Up to 40 conditions per place. [2021-06-10 11:49:49,084 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/1004 dead transitions. [2021-06-10 11:49:49,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1004 transitions, 2308 flow [2021-06-10 11:49:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:49,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:49,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:49,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:49,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:49,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:49,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,089 INFO L185 Difference]: Start difference. First operand has 1029 places, 1006 transitions, 2305 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:49,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1004 transitions, 2308 flow [2021-06-10 11:49:49,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1004 transitions, 2301 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:49,097 INFO L241 Difference]: Finished difference. Result has 1029 places, 1004 transitions, 2294 flow [2021-06-10 11:49:49,098 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1003, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1029, PETRI_TRANSITIONS=1004} [2021-06-10 11:49:49,098 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -6 predicate places. [2021-06-10 11:49:49,098 INFO L480 AbstractCegarLoop]: Abstraction has has 1029 places, 1004 transitions, 2294 flow [2021-06-10 11:49:49,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:49,098 INFO L263 CegarLoopForPetriNet]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:49,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2453 [2021-06-10 11:49:49,098 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1152369672, now seen corresponding path program 1 times [2021-06-10 11:49:49,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:49,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914571778] [2021-06-10 11:49:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:49,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:49,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:49,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-06-10 11:49:49,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914571778] [2021-06-10 11:49:49,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:49,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:49,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668119953] [2021-06-10 11:49:49,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:49,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:49,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:49,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1004 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:49,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:49,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:49,574 INFO L129 PetriNetUnfolder]: 90/1145 cut-off events. [2021-06-10 11:49:49,574 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:49,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1145 events. 90/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4798 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1320. Up to 40 conditions per place. [2021-06-10 11:49:49,660 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/1002 dead transitions. [2021-06-10 11:49:49,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1002 transitions, 2307 flow [2021-06-10 11:49:49,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:49,662 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:49,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:49,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:49,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:49,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,665 INFO L185 Difference]: Start difference. First operand has 1029 places, 1004 transitions, 2294 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:49,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1002 transitions, 2307 flow [2021-06-10 11:49:49,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1002 transitions, 2306 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:49,674 INFO L241 Difference]: Finished difference. Result has 1028 places, 1002 transitions, 2290 flow [2021-06-10 11:49:49,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2290, PETRI_PLACES=1028, PETRI_TRANSITIONS=1002} [2021-06-10 11:49:49,674 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -7 predicate places. [2021-06-10 11:49:49,674 INFO L480 AbstractCegarLoop]: Abstraction has has 1028 places, 1002 transitions, 2290 flow [2021-06-10 11:49:49,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,675 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:49,675 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:49,675 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2454 [2021-06-10 11:49:49,675 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1724218966, now seen corresponding path program 1 times [2021-06-10 11:49:49,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:49,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725842901] [2021-06-10 11:49:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:49,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:49,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:49,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:49,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:49:49,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725842901] [2021-06-10 11:49:49,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:49,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:49,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150746785] [2021-06-10 11:49:49,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:49,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:49,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:49,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1002 transitions, 2290 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:49,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:49,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:49,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:50,156 INFO L129 PetriNetUnfolder]: 88/1150 cut-off events. [2021-06-10 11:49:50,156 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:50,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1150 events. 88/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4849 event pairs, 0 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1323. Up to 40 conditions per place. [2021-06-10 11:49:50,244 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2021-06-10 11:49:50,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1003 transitions, 2306 flow [2021-06-10 11:49:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:50,246 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:50,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:50,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:50,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:50,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,249 INFO L185 Difference]: Start difference. First operand has 1028 places, 1002 transitions, 2290 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:50,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1003 transitions, 2306 flow [2021-06-10 11:49:50,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1003 transitions, 2305 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:50,259 INFO L241 Difference]: Finished difference. Result has 1031 places, 1003 transitions, 2303 flow [2021-06-10 11:49:50,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2303, PETRI_PLACES=1031, PETRI_TRANSITIONS=1003} [2021-06-10 11:49:50,259 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -4 predicate places. [2021-06-10 11:49:50,259 INFO L480 AbstractCegarLoop]: Abstraction has has 1031 places, 1003 transitions, 2303 flow [2021-06-10 11:49:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,260 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:50,260 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:50,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2455 [2021-06-10 11:49:50,260 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1724219989, now seen corresponding path program 1 times [2021-06-10 11:49:50,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:50,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779627889] [2021-06-10 11:49:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:50,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:50,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:50,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:49:50,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779627889] [2021-06-10 11:49:50,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:50,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:50,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93919804] [2021-06-10 11:49:50,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:50,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:50,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:50,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1003 transitions, 2303 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:50,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:50,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:50,751 INFO L129 PetriNetUnfolder]: 88/1151 cut-off events. [2021-06-10 11:49:50,752 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:50,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1151 events. 88/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4856 event pairs, 0 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 1331. Up to 40 conditions per place. [2021-06-10 11:49:50,838 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/1004 dead transitions. [2021-06-10 11:49:50,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1004 transitions, 2329 flow [2021-06-10 11:49:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:50,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:50,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:50,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:50,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:50,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:50,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,843 INFO L185 Difference]: Start difference. First operand has 1031 places, 1003 transitions, 2303 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:50,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1004 transitions, 2329 flow [2021-06-10 11:49:50,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1004 transitions, 2327 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:50,853 INFO L241 Difference]: Finished difference. Result has 1034 places, 1004 transitions, 2319 flow [2021-06-10 11:49:50,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2319, PETRI_PLACES=1034, PETRI_TRANSITIONS=1004} [2021-06-10 11:49:50,853 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -1 predicate places. [2021-06-10 11:49:50,853 INFO L480 AbstractCegarLoop]: Abstraction has has 1034 places, 1004 transitions, 2319 flow [2021-06-10 11:49:50,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:50,854 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:50,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2456 [2021-06-10 11:49:50,854 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:50,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1723265654, now seen corresponding path program 1 times [2021-06-10 11:49:50,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:50,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904416428] [2021-06-10 11:49:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:50,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:50,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:50,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:50,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:49:50,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904416428] [2021-06-10 11:49:50,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:50,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:50,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476327784] [2021-06-10 11:49:50,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:50,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:50,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:50,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1034 places, 1004 transitions, 2319 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:50,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:50,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:50,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:51,404 INFO L129 PetriNetUnfolder]: 87/1148 cut-off events. [2021-06-10 11:49:51,404 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-06-10 11:49:51,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1148 events. 87/1148 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4841 event pairs, 0 based on Foata normal form. 2/1024 useless extension candidates. Maximal degree in co-relation 1330. Up to 40 conditions per place. [2021-06-10 11:49:51,456 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 9 selfloop transitions, 1 changer transitions 0/1002 dead transitions. [2021-06-10 11:49:51,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 1002 transitions, 2327 flow [2021-06-10 11:49:51,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3078 transitions. [2021-06-10 11:49:51,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.921832884097035 [2021-06-10 11:49:51,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3078 transitions. [2021-06-10 11:49:51,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3078 transitions. [2021-06-10 11:49:51,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:51,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3078 transitions. [2021-06-10 11:49:51,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.0) internal successors, (3078), 3 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:51,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:51,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:51,461 INFO L185 Difference]: Start difference. First operand has 1034 places, 1004 transitions, 2319 flow. Second operand 3 states and 3078 transitions. [2021-06-10 11:49:51,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1036 places, 1002 transitions, 2327 flow [2021-06-10 11:49:51,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1035 places, 1002 transitions, 2326 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:51,469 INFO L241 Difference]: Finished difference. Result has 1035 places, 1002 transitions, 2308 flow [2021-06-10 11:49:51,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=1033, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1001, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2308, PETRI_PLACES=1035, PETRI_TRANSITIONS=1002} [2021-06-10 11:49:51,470 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 0 predicate places. [2021-06-10 11:49:51,470 INFO L480 AbstractCegarLoop]: Abstraction has has 1035 places, 1002 transitions, 2308 flow [2021-06-10 11:49:51,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:51,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:51,470 INFO L263 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:51,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2457 [2021-06-10 11:49:51,470 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1723266677, now seen corresponding path program 1 times [2021-06-10 11:49:51,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:51,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576460439] [2021-06-10 11:49:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:51,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:51,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:51,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:51,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:51,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:51,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-06-10 11:49:51,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576460439] [2021-06-10 11:49:51,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:51,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:51,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858878099] [2021-06-10 11:49:51,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:51,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:51,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:51,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1002 transitions, 2308 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:51,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:51,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:51,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:51,957 INFO L129 PetriNetUnfolder]: 87/1145 cut-off events. [2021-06-10 11:49:51,957 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:49:52,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 1145 events. 87/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4815 event pairs, 0 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1324. Up to 40 conditions per place. [2021-06-10 11:49:52,053 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/999 dead transitions. [2021-06-10 11:49:52,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 999 transitions, 2309 flow [2021-06-10 11:49:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:52,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:52,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:52,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:52,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:52,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:52,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,058 INFO L185 Difference]: Start difference. First operand has 1035 places, 1002 transitions, 2308 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:52,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 999 transitions, 2309 flow [2021-06-10 11:49:52,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 999 transitions, 2304 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:52,067 INFO L241 Difference]: Finished difference. Result has 1032 places, 999 transitions, 2294 flow [2021-06-10 11:49:52,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=1032, PETRI_TRANSITIONS=999} [2021-06-10 11:49:52,068 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, -3 predicate places. [2021-06-10 11:49:52,068 INFO L480 AbstractCegarLoop]: Abstraction has has 1032 places, 999 transitions, 2294 flow [2021-06-10 11:49:52,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:52,068 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:52,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2458 [2021-06-10 11:49:52,068 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash -564618289, now seen corresponding path program 1 times [2021-06-10 11:49:52,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:52,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690300170] [2021-06-10 11:49:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:52,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:52,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:52,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:49:52,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690300170] [2021-06-10 11:49:52,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:52,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:52,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971054291] [2021-06-10 11:49:52,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:52,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:52,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:52,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 999 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:52,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:52,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:52,600 INFO L129 PetriNetUnfolder]: 86/1153 cut-off events. [2021-06-10 11:49:52,600 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:52,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1153 events. 86/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4887 event pairs, 0 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1341. Up to 40 conditions per place. [2021-06-10 11:49:52,690 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/1001 dead transitions. [2021-06-10 11:49:52,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1001 transitions, 2324 flow [2021-06-10 11:49:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:49:52,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:49:52,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:49:52,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:49:52,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:52,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:49:52,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,695 INFO L185 Difference]: Start difference. First operand has 1032 places, 999 transitions, 2294 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:49:52,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1001 transitions, 2324 flow [2021-06-10 11:49:52,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1001 transitions, 2323 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:52,704 INFO L241 Difference]: Finished difference. Result has 1035 places, 1001 transitions, 2317 flow [2021-06-10 11:49:52,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2317, PETRI_PLACES=1035, PETRI_TRANSITIONS=1001} [2021-06-10 11:49:52,705 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 0 predicate places. [2021-06-10 11:49:52,705 INFO L480 AbstractCegarLoop]: Abstraction has has 1035 places, 1001 transitions, 2317 flow [2021-06-10 11:49:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:52,705 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:52,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2459 [2021-06-10 11:49:52,705 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -564617266, now seen corresponding path program 1 times [2021-06-10 11:49:52,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:52,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567230230] [2021-06-10 11:49:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:52,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:52,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:52,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:52,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:49:52,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567230230] [2021-06-10 11:49:52,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:52,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:52,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129274740] [2021-06-10 11:49:52,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:52,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:52,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:52,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1001 transitions, 2317 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:52,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:52,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:52,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:53,194 INFO L129 PetriNetUnfolder]: 85/1151 cut-off events. [2021-06-10 11:49:53,194 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:53,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 1151 events. 85/1151 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4877 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1336. Up to 40 conditions per place. [2021-06-10 11:49:53,282 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/1001 dead transitions. [2021-06-10 11:49:53,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1001 transitions, 2329 flow [2021-06-10 11:49:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:53,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:53,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:53,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:53,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:53,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:53,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,287 INFO L185 Difference]: Start difference. First operand has 1035 places, 1001 transitions, 2317 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:53,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1001 transitions, 2329 flow [2021-06-10 11:49:53,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1001 transitions, 2324 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:53,296 INFO L241 Difference]: Finished difference. Result has 1038 places, 1001 transitions, 2322 flow [2021-06-10 11:49:53,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2322, PETRI_PLACES=1038, PETRI_TRANSITIONS=1001} [2021-06-10 11:49:53,297 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 3 predicate places. [2021-06-10 11:49:53,297 INFO L480 AbstractCegarLoop]: Abstraction has has 1038 places, 1001 transitions, 2322 flow [2021-06-10 11:49:53,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:53,297 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:53,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2460 [2021-06-10 11:49:53,297 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash -563664977, now seen corresponding path program 1 times [2021-06-10 11:49:53,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:53,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781649470] [2021-06-10 11:49:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:53,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:53,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:53,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:49:53,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781649470] [2021-06-10 11:49:53,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:53,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:53,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224780136] [2021-06-10 11:49:53,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:53,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:53,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:53,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 1001 transitions, 2322 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:53,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:53,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:53,789 INFO L129 PetriNetUnfolder]: 84/1147 cut-off events. [2021-06-10 11:49:53,789 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:49:53,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1147 events. 84/1147 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4850 event pairs, 0 based on Foata normal form. 1/1026 useless extension candidates. Maximal degree in co-relation 1333. Up to 40 conditions per place. [2021-06-10 11:49:53,936 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/998 dead transitions. [2021-06-10 11:49:53,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 998 transitions, 2319 flow [2021-06-10 11:49:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:53,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:53,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:53,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:53,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:53,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:53,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,941 INFO L185 Difference]: Start difference. First operand has 1038 places, 1001 transitions, 2322 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:53,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 998 transitions, 2319 flow [2021-06-10 11:49:53,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 998 transitions, 2312 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:53,949 INFO L241 Difference]: Finished difference. Result has 1037 places, 998 transitions, 2302 flow [2021-06-10 11:49:53,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1037, PETRI_TRANSITIONS=998} [2021-06-10 11:49:53,950 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 2 predicate places. [2021-06-10 11:49:53,950 INFO L480 AbstractCegarLoop]: Abstraction has has 1037 places, 998 transitions, 2302 flow [2021-06-10 11:49:53,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:53,950 INFO L263 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:53,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2461 [2021-06-10 11:49:53,950 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash -563663954, now seen corresponding path program 1 times [2021-06-10 11:49:53,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:53,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709368881] [2021-06-10 11:49:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:53,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:53,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:53,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:53,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-06-10 11:49:53,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709368881] [2021-06-10 11:49:53,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:53,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:53,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309556202] [2021-06-10 11:49:53,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:53,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:53,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:53,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:53,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:53,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 998 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:53,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:53,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:53,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:54,446 INFO L129 PetriNetUnfolder]: 84/1145 cut-off events. [2021-06-10 11:49:54,446 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:54,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1145 events. 84/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4834 event pairs, 0 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1334. Up to 40 conditions per place. [2021-06-10 11:49:54,534 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/996 dead transitions. [2021-06-10 11:49:54,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 996 transitions, 2315 flow [2021-06-10 11:49:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:54,535 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:54,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:54,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:54,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:54,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:54,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:54,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:54,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:54,539 INFO L185 Difference]: Start difference. First operand has 1037 places, 998 transitions, 2302 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:54,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 996 transitions, 2315 flow [2021-06-10 11:49:54,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 996 transitions, 2314 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:54,548 INFO L241 Difference]: Finished difference. Result has 1036 places, 996 transitions, 2298 flow [2021-06-10 11:49:54,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2298, PETRI_PLACES=1036, PETRI_TRANSITIONS=996} [2021-06-10 11:49:54,549 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 1 predicate places. [2021-06-10 11:49:54,549 INFO L480 AbstractCegarLoop]: Abstraction has has 1036 places, 996 transitions, 2298 flow [2021-06-10 11:49:54,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:54,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:54,549 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:54,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2462 [2021-06-10 11:49:54,549 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1486697229, now seen corresponding path program 1 times [2021-06-10 11:49:54,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:54,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950601346] [2021-06-10 11:49:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:54,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:54,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:54,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:54,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:54,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:54,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:49:54,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950601346] [2021-06-10 11:49:54,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:54,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:54,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408108204] [2021-06-10 11:49:54,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:54,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:54,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:54,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:54,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 996 transitions, 2298 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:54,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:54,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:54,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:55,040 INFO L129 PetriNetUnfolder]: 82/1150 cut-off events. [2021-06-10 11:49:55,040 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:55,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 1150 events. 82/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4886 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1337. Up to 40 conditions per place. [2021-06-10 11:49:55,128 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2021-06-10 11:49:55,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 997 transitions, 2314 flow [2021-06-10 11:49:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:55,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:55,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:55,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:55,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:55,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:55,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,134 INFO L185 Difference]: Start difference. First operand has 1036 places, 996 transitions, 2298 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:55,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 997 transitions, 2314 flow [2021-06-10 11:49:55,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 997 transitions, 2313 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:55,143 INFO L241 Difference]: Finished difference. Result has 1039 places, 997 transitions, 2311 flow [2021-06-10 11:49:55,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2311, PETRI_PLACES=1039, PETRI_TRANSITIONS=997} [2021-06-10 11:49:55,144 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 4 predicate places. [2021-06-10 11:49:55,144 INFO L480 AbstractCegarLoop]: Abstraction has has 1039 places, 997 transitions, 2311 flow [2021-06-10 11:49:55,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,144 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:55,144 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:55,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2463 [2021-06-10 11:49:55,144 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1486698252, now seen corresponding path program 1 times [2021-06-10 11:49:55,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:55,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934631572] [2021-06-10 11:49:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:55,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:55,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:55,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:49:55,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934631572] [2021-06-10 11:49:55,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:55,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:55,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140068323] [2021-06-10 11:49:55,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:55,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:55,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:55,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 997 transitions, 2311 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:55,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:55,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:55,642 INFO L129 PetriNetUnfolder]: 82/1151 cut-off events. [2021-06-10 11:49:55,642 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:55,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1151 events. 82/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4893 event pairs, 0 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1345. Up to 40 conditions per place. [2021-06-10 11:49:55,730 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/998 dead transitions. [2021-06-10 11:49:55,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 998 transitions, 2337 flow [2021-06-10 11:49:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:55,731 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:55,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:55,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:55,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:55,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:55,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,735 INFO L185 Difference]: Start difference. First operand has 1039 places, 997 transitions, 2311 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:55,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 998 transitions, 2337 flow [2021-06-10 11:49:55,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 998 transitions, 2335 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:55,744 INFO L241 Difference]: Finished difference. Result has 1042 places, 998 transitions, 2327 flow [2021-06-10 11:49:55,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2327, PETRI_PLACES=1042, PETRI_TRANSITIONS=998} [2021-06-10 11:49:55,745 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 7 predicate places. [2021-06-10 11:49:55,745 INFO L480 AbstractCegarLoop]: Abstraction has has 1042 places, 998 transitions, 2327 flow [2021-06-10 11:49:55,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:55,745 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:55,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2464 [2021-06-10 11:49:55,745 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1485744940, now seen corresponding path program 1 times [2021-06-10 11:49:55,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:55,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010736662] [2021-06-10 11:49:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:55,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:55,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:55,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:55,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:49:55,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010736662] [2021-06-10 11:49:55,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:55,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:55,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067703065] [2021-06-10 11:49:55,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:55,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:55,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:55,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 998 transitions, 2327 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:55,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:55,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:55,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:56,242 INFO L129 PetriNetUnfolder]: 81/1147 cut-off events. [2021-06-10 11:49:56,242 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:56,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1147 events. 81/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4869 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1338. Up to 40 conditions per place. [2021-06-10 11:49:56,331 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/995 dead transitions. [2021-06-10 11:49:56,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 995 transitions, 2324 flow [2021-06-10 11:49:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:56,333 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:56,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:56,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:56,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:56,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:56,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,336 INFO L185 Difference]: Start difference. First operand has 1042 places, 998 transitions, 2327 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:56,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 995 transitions, 2324 flow [2021-06-10 11:49:56,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 995 transitions, 2316 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:56,346 INFO L241 Difference]: Finished difference. Result has 1041 places, 995 transitions, 2306 flow [2021-06-10 11:49:56,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1041, PETRI_TRANSITIONS=995} [2021-06-10 11:49:56,347 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 6 predicate places. [2021-06-10 11:49:56,347 INFO L480 AbstractCegarLoop]: Abstraction has has 1041 places, 995 transitions, 2306 flow [2021-06-10 11:49:56,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:56,347 INFO L263 CegarLoopForPetriNet]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:56,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2465 [2021-06-10 11:49:56,347 INFO L428 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1485743917, now seen corresponding path program 1 times [2021-06-10 11:49:56,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:56,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399738620] [2021-06-10 11:49:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:56,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:56,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:56,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-06-10 11:49:56,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399738620] [2021-06-10 11:49:56,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:56,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:56,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586687212] [2021-06-10 11:49:56,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:56,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:56,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:56,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 995 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:56,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:56,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:56,859 INFO L129 PetriNetUnfolder]: 81/1145 cut-off events. [2021-06-10 11:49:56,859 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:56,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1145 events. 81/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4851 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1341. Up to 40 conditions per place. [2021-06-10 11:49:56,944 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/993 dead transitions. [2021-06-10 11:49:56,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 993 transitions, 2319 flow [2021-06-10 11:49:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:56,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:56,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:56,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:56,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:56,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:56,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,948 INFO L185 Difference]: Start difference. First operand has 1041 places, 995 transitions, 2306 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:56,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 993 transitions, 2319 flow [2021-06-10 11:49:56,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 993 transitions, 2318 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:56,958 INFO L241 Difference]: Finished difference. Result has 1040 places, 993 transitions, 2302 flow [2021-06-10 11:49:56,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2302, PETRI_PLACES=1040, PETRI_TRANSITIONS=993} [2021-06-10 11:49:56,958 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 5 predicate places. [2021-06-10 11:49:56,958 INFO L480 AbstractCegarLoop]: Abstraction has has 1040 places, 993 transitions, 2302 flow [2021-06-10 11:49:56,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,958 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:56,958 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:56,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2466 [2021-06-10 11:49:56,958 INFO L428 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1656318873, now seen corresponding path program 1 times [2021-06-10 11:49:56,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:56,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674433885] [2021-06-10 11:49:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:56,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:56,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:56,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:56,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:49:56,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674433885] [2021-06-10 11:49:56,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:56,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:56,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536876314] [2021-06-10 11:49:56,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:56,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:56,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:56,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 993 transitions, 2302 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:56,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:56,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:56,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:57,455 INFO L129 PetriNetUnfolder]: 79/1150 cut-off events. [2021-06-10 11:49:57,455 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:57,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 1150 events. 79/1150 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4903 event pairs, 0 based on Foata normal form. 0/1031 useless extension candidates. Maximal degree in co-relation 1344. Up to 40 conditions per place. [2021-06-10 11:49:57,543 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/994 dead transitions. [2021-06-10 11:49:57,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 994 transitions, 2318 flow [2021-06-10 11:49:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:49:57,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:49:57,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:49:57,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:49:57,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:57,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:49:57,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:57,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:57,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:57,548 INFO L185 Difference]: Start difference. First operand has 1040 places, 993 transitions, 2302 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:49:57,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 994 transitions, 2318 flow [2021-06-10 11:49:57,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 994 transitions, 2317 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:57,557 INFO L241 Difference]: Finished difference. Result has 1043 places, 994 transitions, 2315 flow [2021-06-10 11:49:57,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2315, PETRI_PLACES=1043, PETRI_TRANSITIONS=994} [2021-06-10 11:49:57,558 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 8 predicate places. [2021-06-10 11:49:57,558 INFO L480 AbstractCegarLoop]: Abstraction has has 1043 places, 994 transitions, 2315 flow [2021-06-10 11:49:57,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:57,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:57,558 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:57,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2467 [2021-06-10 11:49:57,558 INFO L428 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1656317850, now seen corresponding path program 1 times [2021-06-10 11:49:57,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:57,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933805718] [2021-06-10 11:49:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:57,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:57,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:57,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:57,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:49:57,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:57,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:49:57,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933805718] [2021-06-10 11:49:57,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:57,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:57,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993974775] [2021-06-10 11:49:57,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:57,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:57,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:57,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:57,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:57,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 994 transitions, 2315 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:57,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:57,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:57,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:58,061 INFO L129 PetriNetUnfolder]: 79/1151 cut-off events. [2021-06-10 11:49:58,061 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-06-10 11:49:58,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1151 events. 79/1151 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4913 event pairs, 0 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 1352. Up to 40 conditions per place. [2021-06-10 11:49:58,146 INFO L132 encePairwiseOnDemand]: 1109/1113 looper letters, 9 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2021-06-10 11:49:58,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 995 transitions, 2341 flow [2021-06-10 11:49:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3079 transitions. [2021-06-10 11:49:58,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221323749625636 [2021-06-10 11:49:58,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3079 transitions. [2021-06-10 11:49:58,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3079 transitions. [2021-06-10 11:49:58,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:58,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3079 transitions. [2021-06-10 11:49:58,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1026.3333333333333) internal successors, (3079), 3 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,151 INFO L185 Difference]: Start difference. First operand has 1043 places, 994 transitions, 2315 flow. Second operand 3 states and 3079 transitions. [2021-06-10 11:49:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 995 transitions, 2341 flow [2021-06-10 11:49:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 995 transitions, 2339 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:58,160 INFO L241 Difference]: Finished difference. Result has 1046 places, 995 transitions, 2331 flow [2021-06-10 11:49:58,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2331, PETRI_PLACES=1046, PETRI_TRANSITIONS=995} [2021-06-10 11:49:58,161 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 11 predicate places. [2021-06-10 11:49:58,161 INFO L480 AbstractCegarLoop]: Abstraction has has 1046 places, 995 transitions, 2331 flow [2021-06-10 11:49:58,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:58,161 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:58,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2468 [2021-06-10 11:49:58,161 INFO L428 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1657271162, now seen corresponding path program 1 times [2021-06-10 11:49:58,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:58,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581950687] [2021-06-10 11:49:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:58,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:58,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:58,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:49:58,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581950687] [2021-06-10 11:49:58,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:58,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:58,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179602018] [2021-06-10 11:49:58,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:58,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:58,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:58,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 995 transitions, 2331 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:58,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:58,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:58,659 INFO L129 PetriNetUnfolder]: 78/1147 cut-off events. [2021-06-10 11:49:58,659 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:49:58,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1147 events. 78/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4887 event pairs, 0 based on Foata normal form. 0/1031 useless extension candidates. Maximal degree in co-relation 1345. Up to 40 conditions per place. [2021-06-10 11:49:58,745 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/992 dead transitions. [2021-06-10 11:49:58,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 992 transitions, 2328 flow [2021-06-10 11:49:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:49:58,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:49:58,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:49:58,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:49:58,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:58,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:49:58,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,750 INFO L185 Difference]: Start difference. First operand has 1046 places, 995 transitions, 2331 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:49:58,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1048 places, 992 transitions, 2328 flow [2021-06-10 11:49:58,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 992 transitions, 2320 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:49:58,760 INFO L241 Difference]: Finished difference. Result has 1045 places, 992 transitions, 2310 flow [2021-06-10 11:49:58,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=992, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1045, PETRI_TRANSITIONS=992} [2021-06-10 11:49:58,760 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 10 predicate places. [2021-06-10 11:49:58,760 INFO L480 AbstractCegarLoop]: Abstraction has has 1045 places, 992 transitions, 2310 flow [2021-06-10 11:49:58,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:58,761 INFO L263 CegarLoopForPetriNet]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:58,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2469 [2021-06-10 11:49:58,761 INFO L428 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1657272185, now seen corresponding path program 1 times [2021-06-10 11:49:58,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:58,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607459873] [2021-06-10 11:49:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:58,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:58,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:58,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:58,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-10 11:49:58,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607459873] [2021-06-10 11:49:58,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:58,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:58,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179623293] [2021-06-10 11:49:58,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:58,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:58,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:58,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 992 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:58,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:58,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:58,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:59,257 INFO L129 PetriNetUnfolder]: 78/1145 cut-off events. [2021-06-10 11:49:59,257 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:59,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 1145 events. 78/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4874 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 1348. Up to 40 conditions per place. [2021-06-10 11:49:59,337 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/990 dead transitions. [2021-06-10 11:49:59,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 990 transitions, 2323 flow [2021-06-10 11:49:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:49:59,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:49:59,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:49:59,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:49:59,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:59,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:49:59,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,341 INFO L185 Difference]: Start difference. First operand has 1045 places, 992 transitions, 2310 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:49:59,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 990 transitions, 2323 flow [2021-06-10 11:49:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 990 transitions, 2322 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:59,351 INFO L241 Difference]: Finished difference. Result has 1044 places, 990 transitions, 2306 flow [2021-06-10 11:49:59,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=989, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2306, PETRI_PLACES=1044, PETRI_TRANSITIONS=990} [2021-06-10 11:49:59,351 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 9 predicate places. [2021-06-10 11:49:59,351 INFO L480 AbstractCegarLoop]: Abstraction has has 1044 places, 990 transitions, 2306 flow [2021-06-10 11:49:59,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,352 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:59,352 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:59,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2470 [2021-06-10 11:49:59,352 INFO L428 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1157511968, now seen corresponding path program 1 times [2021-06-10 11:49:59,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:59,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450371909] [2021-06-10 11:49:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:59,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:59,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:49:59,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:49:59,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450371909] [2021-06-10 11:49:59,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:59,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:59,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326921255] [2021-06-10 11:49:59,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:59,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:59,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:49:59,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 990 transitions, 2306 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:59,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:49:59,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:49:59,855 INFO L129 PetriNetUnfolder]: 77/1153 cut-off events. [2021-06-10 11:49:59,855 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:49:59,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1153 events. 77/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4939 event pairs, 0 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 1360. Up to 40 conditions per place. [2021-06-10 11:49:59,943 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/992 dead transitions. [2021-06-10 11:49:59,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 992 transitions, 2336 flow [2021-06-10 11:49:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:49:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:49:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:49:59,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:49:59,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:49:59,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:49:59,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:49:59,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:49:59,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,948 INFO L185 Difference]: Start difference. First operand has 1044 places, 990 transitions, 2306 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:49:59,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 992 transitions, 2336 flow [2021-06-10 11:49:59,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 992 transitions, 2335 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:49:59,958 INFO L241 Difference]: Finished difference. Result has 1047 places, 992 transitions, 2329 flow [2021-06-10 11:49:59,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2329, PETRI_PLACES=1047, PETRI_TRANSITIONS=992} [2021-06-10 11:49:59,959 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 12 predicate places. [2021-06-10 11:49:59,959 INFO L480 AbstractCegarLoop]: Abstraction has has 1047 places, 992 transitions, 2329 flow [2021-06-10 11:49:59,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:49:59,959 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:49:59,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2471 [2021-06-10 11:49:59,959 INFO L428 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:49:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:49:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1157510945, now seen corresponding path program 1 times [2021-06-10 11:49:59,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:49:59,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008001568] [2021-06-10 11:49:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:49:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:49:59,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:59,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:49:59,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:49:59,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:49:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:49:59,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008001568] [2021-06-10 11:49:59,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:49:59,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:49:59,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642855979] [2021-06-10 11:49:59,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:49:59,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:49:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:49:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:49:59,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:49:59,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 992 transitions, 2329 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:49:59,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:49:59,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:49:59,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:00,471 INFO L129 PetriNetUnfolder]: 75/1154 cut-off events. [2021-06-10 11:50:00,472 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:50:00,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1154 events. 75/1154 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4962 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1360. Up to 40 conditions per place. [2021-06-10 11:50:00,560 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 6 selfloop transitions, 1 changer transitions 0/992 dead transitions. [2021-06-10 11:50:00,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 992 transitions, 2341 flow [2021-06-10 11:50:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:50:00,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:50:00,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:50:00,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:50:00,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:00,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:50:00,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:00,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:00,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:00,565 INFO L185 Difference]: Start difference. First operand has 1047 places, 992 transitions, 2329 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:50:00,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 992 transitions, 2341 flow [2021-06-10 11:50:00,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 992 transitions, 2336 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:50:00,575 INFO L241 Difference]: Finished difference. Result has 1049 places, 991 transitions, 2325 flow [2021-06-10 11:50:00,575 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2325, PETRI_PLACES=1049, PETRI_TRANSITIONS=991} [2021-06-10 11:50:00,575 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 14 predicate places. [2021-06-10 11:50:00,575 INFO L480 AbstractCegarLoop]: Abstraction has has 1049 places, 991 transitions, 2325 flow [2021-06-10 11:50:00,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:00,576 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:00,576 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:00,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2472 [2021-06-10 11:50:00,576 INFO L428 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1156558656, now seen corresponding path program 1 times [2021-06-10 11:50:00,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:00,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68512654] [2021-06-10 11:50:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:00,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:00,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:00,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:00,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:50:00,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:00,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:50:00,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68512654] [2021-06-10 11:50:00,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:00,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:00,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794799354] [2021-06-10 11:50:00,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:00,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:00,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:50:00,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 991 transitions, 2325 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:00,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:00,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:50:00,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:01,080 INFO L129 PetriNetUnfolder]: 75/1147 cut-off events. [2021-06-10 11:50:01,080 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:50:01,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1147 events. 75/1147 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4904 event pairs, 0 based on Foata normal form. 1/1035 useless extension candidates. Maximal degree in co-relation 1354. Up to 40 conditions per place. [2021-06-10 11:50:01,168 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/989 dead transitions. [2021-06-10 11:50:01,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 989 transitions, 2328 flow [2021-06-10 11:50:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:50:01,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:50:01,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:50:01,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:50:01,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:01,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:50:01,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,173 INFO L185 Difference]: Start difference. First operand has 1049 places, 991 transitions, 2325 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:50:01,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1051 places, 989 transitions, 2328 flow [2021-06-10 11:50:01,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 989 transitions, 2321 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:50:01,183 INFO L241 Difference]: Finished difference. Result has 1049 places, 989 transitions, 2314 flow [2021-06-10 11:50:01,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1049, PETRI_TRANSITIONS=989} [2021-06-10 11:50:01,184 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 14 predicate places. [2021-06-10 11:50:01,184 INFO L480 AbstractCegarLoop]: Abstraction has has 1049 places, 989 transitions, 2314 flow [2021-06-10 11:50:01,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:01,184 INFO L263 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:01,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2473 [2021-06-10 11:50:01,184 INFO L428 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1156557633, now seen corresponding path program 1 times [2021-06-10 11:50:01,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:01,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073772331] [2021-06-10 11:50:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:01,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:01,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:50:01,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-06-10 11:50:01,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073772331] [2021-06-10 11:50:01,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:01,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:01,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424920689] [2021-06-10 11:50:01,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:01,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:01,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:50:01,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 989 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:01,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:50:01,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:01,719 INFO L129 PetriNetUnfolder]: 75/1145 cut-off events. [2021-06-10 11:50:01,719 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-06-10 11:50:01,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1145 events. 75/1145 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4887 event pairs, 0 based on Foata normal form. 0/1031 useless extension candidates. Maximal degree in co-relation 1354. Up to 40 conditions per place. [2021-06-10 11:50:01,792 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/987 dead transitions. [2021-06-10 11:50:01,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 987 transitions, 2327 flow [2021-06-10 11:50:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:50:01,794 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:50:01,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:50:01,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:50:01,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:01,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:50:01,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,797 INFO L185 Difference]: Start difference. First operand has 1049 places, 989 transitions, 2314 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:50:01,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 987 transitions, 2327 flow [2021-06-10 11:50:01,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 987 transitions, 2326 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:50:01,806 INFO L241 Difference]: Finished difference. Result has 1048 places, 987 transitions, 2310 flow [2021-06-10 11:50:01,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=987, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2310, PETRI_PLACES=1048, PETRI_TRANSITIONS=987} [2021-06-10 11:50:01,806 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 13 predicate places. [2021-06-10 11:50:01,806 INFO L480 AbstractCegarLoop]: Abstraction has has 1048 places, 987 transitions, 2310 flow [2021-06-10 11:50:01,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,806 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:01,806 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:01,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2474 [2021-06-10 11:50:01,807 INFO L428 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash 988126313, now seen corresponding path program 1 times [2021-06-10 11:50:01,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:01,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995288013] [2021-06-10 11:50:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:01,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:01,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:50:01,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:01,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:50:01,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995288013] [2021-06-10 11:50:01,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:01,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:01,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092446118] [2021-06-10 11:50:01,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:01,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:01,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:01,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:01,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:50:01,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 987 transitions, 2310 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:01,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:01,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:50:01,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:02,329 INFO L129 PetriNetUnfolder]: 74/1153 cut-off events. [2021-06-10 11:50:02,329 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:50:02,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1153 events. 74/1153 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4960 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1366. Up to 40 conditions per place. [2021-06-10 11:50:02,420 INFO L132 encePairwiseOnDemand]: 1108/1113 looper letters, 10 selfloop transitions, 3 changer transitions 0/989 dead transitions. [2021-06-10 11:50:02,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 989 transitions, 2340 flow [2021-06-10 11:50:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3081 transitions. [2021-06-10 11:50:02,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9227313566936208 [2021-06-10 11:50:02,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3081 transitions. [2021-06-10 11:50:02,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3081 transitions. [2021-06-10 11:50:02,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:02,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3081 transitions. [2021-06-10 11:50:02,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1027.0) internal successors, (3081), 3 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:02,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:02,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:02,425 INFO L185 Difference]: Start difference. First operand has 1048 places, 987 transitions, 2310 flow. Second operand 3 states and 3081 transitions. [2021-06-10 11:50:02,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 989 transitions, 2340 flow [2021-06-10 11:50:02,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 989 transitions, 2339 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:50:02,436 INFO L241 Difference]: Finished difference. Result has 1051 places, 989 transitions, 2333 flow [2021-06-10 11:50:02,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=987, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2333, PETRI_PLACES=1051, PETRI_TRANSITIONS=989} [2021-06-10 11:50:02,436 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 16 predicate places. [2021-06-10 11:50:02,436 INFO L480 AbstractCegarLoop]: Abstraction has has 1051 places, 989 transitions, 2333 flow [2021-06-10 11:50:02,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:02,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:02,437 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:02,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2475 [2021-06-10 11:50:02,437 INFO L428 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 988127336, now seen corresponding path program 1 times [2021-06-10 11:50:02,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:02,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783459068] [2021-06-10 11:50:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:02,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:02,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:02,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:02,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:50:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:02,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:50:02,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783459068] [2021-06-10 11:50:02,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:02,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:02,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859476964] [2021-06-10 11:50:02,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:02,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:02,467 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:50:02,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 989 transitions, 2333 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:02,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:02,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:50:02,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:02,963 INFO L129 PetriNetUnfolder]: 73/1151 cut-off events. [2021-06-10 11:50:02,963 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2021-06-10 11:50:03,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1151 events. 73/1151 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4950 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1363. Up to 40 conditions per place. [2021-06-10 11:50:03,061 INFO L132 encePairwiseOnDemand]: 1110/1113 looper letters, 5 selfloop transitions, 2 changer transitions 0/989 dead transitions. [2021-06-10 11:50:03,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 989 transitions, 2345 flow [2021-06-10 11:50:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3089 transitions. [2021-06-10 11:50:03,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9251272836178497 [2021-06-10 11:50:03,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3089 transitions. [2021-06-10 11:50:03,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3089 transitions. [2021-06-10 11:50:03,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:03,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3089 transitions. [2021-06-10 11:50:03,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.6666666666667) internal successors, (3089), 3 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,067 INFO L185 Difference]: Start difference. First operand has 1051 places, 989 transitions, 2333 flow. Second operand 3 states and 3089 transitions. [2021-06-10 11:50:03,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 989 transitions, 2345 flow [2021-06-10 11:50:03,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 989 transitions, 2340 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 11:50:03,077 INFO L241 Difference]: Finished difference. Result has 1054 places, 989 transitions, 2338 flow [2021-06-10 11:50:03,077 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2338, PETRI_PLACES=1054, PETRI_TRANSITIONS=989} [2021-06-10 11:50:03,077 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 19 predicate places. [2021-06-10 11:50:03,078 INFO L480 AbstractCegarLoop]: Abstraction has has 1054 places, 989 transitions, 2338 flow [2021-06-10 11:50:03,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:03,078 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:03,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2476 [2021-06-10 11:50:03,078 INFO L428 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash 989079625, now seen corresponding path program 1 times [2021-06-10 11:50:03,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:03,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603742082] [2021-06-10 11:50:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:03,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:03,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 11:50:03,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:50:03,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603742082] [2021-06-10 11:50:03,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:03,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:03,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297804816] [2021-06-10 11:50:03,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:03,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:03,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1113 [2021-06-10 11:50:03,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1054 places, 989 transitions, 2338 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:03,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1113 [2021-06-10 11:50:03,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:03,599 INFO L129 PetriNetUnfolder]: 72/1147 cut-off events. [2021-06-10 11:50:03,600 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2021-06-10 11:50:03,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1147 events. 72/1147 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4921 event pairs, 0 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 1360. Up to 40 conditions per place. [2021-06-10 11:50:03,688 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 5 selfloop transitions, 1 changer transitions 0/986 dead transitions. [2021-06-10 11:50:03,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1056 places, 986 transitions, 2335 flow [2021-06-10 11:50:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3088 transitions. [2021-06-10 11:50:03,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2021-06-10 11:50:03,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3088 transitions. [2021-06-10 11:50:03,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3088 transitions. [2021-06-10 11:50:03,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:03,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3088 transitions. [2021-06-10 11:50:03,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1029.3333333333333) internal successors, (3088), 3 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,693 INFO L185 Difference]: Start difference. First operand has 1054 places, 989 transitions, 2338 flow. Second operand 3 states and 3088 transitions. [2021-06-10 11:50:03,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1056 places, 986 transitions, 2335 flow [2021-06-10 11:50:03,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1053 places, 986 transitions, 2328 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 11:50:03,702 INFO L241 Difference]: Finished difference. Result has 1053 places, 986 transitions, 2318 flow [2021-06-10 11:50:03,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=1051, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2318, PETRI_PLACES=1053, PETRI_TRANSITIONS=986} [2021-06-10 11:50:03,703 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 18 predicate places. [2021-06-10 11:50:03,703 INFO L480 AbstractCegarLoop]: Abstraction has has 1053 places, 986 transitions, 2318 flow [2021-06-10 11:50:03,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:03,703 INFO L263 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:03,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2477 [2021-06-10 11:50:03,703 INFO L428 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash 989080648, now seen corresponding path program 1 times [2021-06-10 11:50:03,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:03,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761037216] [2021-06-10 11:50:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:03,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:03,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 11:50:03,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:03,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2021-06-10 11:50:03,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761037216] [2021-06-10 11:50:03,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:03,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:03,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504957324] [2021-06-10 11:50:03,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:03,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:03,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:50:03,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1053 places, 986 transitions, 2318 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:03,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:03,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:50:03,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 11:50:04,204 INFO L129 PetriNetUnfolder]: 72/1145 cut-off events. [2021-06-10 11:50:04,205 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-06-10 11:50:04,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1145 events. 72/1145 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 4904 event pairs, 0 based on Foata normal form. 0/1034 useless extension candidates. Maximal degree in co-relation 1361. Up to 40 conditions per place. [2021-06-10 11:50:04,285 INFO L132 encePairwiseOnDemand]: 1111/1113 looper letters, 8 selfloop transitions, 1 changer transitions 0/984 dead transitions. [2021-06-10 11:50:04,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 984 transitions, 2331 flow [2021-06-10 11:50:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 11:50:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3076 transitions. [2021-06-10 11:50:04,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9212339023659778 [2021-06-10 11:50:04,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3076 transitions. [2021-06-10 11:50:04,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3076 transitions. [2021-06-10 11:50:04,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 11:50:04,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3076 transitions. [2021-06-10 11:50:04,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1025.3333333333333) internal successors, (3076), 3 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:04,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:04,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1113.0) internal successors, (4452), 4 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:04,297 INFO L185 Difference]: Start difference. First operand has 1053 places, 986 transitions, 2318 flow. Second operand 3 states and 3076 transitions. [2021-06-10 11:50:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 984 transitions, 2331 flow [2021-06-10 11:50:04,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 984 transitions, 2330 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 11:50:04,307 INFO L241 Difference]: Finished difference. Result has 1052 places, 984 transitions, 2314 flow [2021-06-10 11:50:04,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=1113, PETRI_DIFFERENCE_MINUEND_FLOW=2312, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2314, PETRI_PLACES=1052, PETRI_TRANSITIONS=984} [2021-06-10 11:50:04,307 INFO L343 CegarLoopForPetriNet]: 1035 programPoint places, 17 predicate places. [2021-06-10 11:50:04,307 INFO L480 AbstractCegarLoop]: Abstraction has has 1052 places, 984 transitions, 2314 flow [2021-06-10 11:50:04,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:04,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 11:50:04,307 INFO L263 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 11:50:04,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2478 [2021-06-10 11:50:04,308 INFO L428 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 11:50:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 11:50:04,308 INFO L82 PathProgramCache]: Analyzing trace with hash -479310190, now seen corresponding path program 1 times [2021-06-10 11:50:04,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 11:50:04,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697868174] [2021-06-10 11:50:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 11:50:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 11:50:04,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:04,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:04,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:04,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 11:50:04,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 11:50:04,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 11:50:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-06-10 11:50:04,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697868174] [2021-06-10 11:50:04,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 11:50:04,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 11:50:04,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529384434] [2021-06-10 11:50:04,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 11:50:04,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 11:50:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 11:50:04,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 11:50:04,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 1022 out of 1113 [2021-06-10 11:50:04,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 984 transitions, 2314 flow. Second operand has 3 states, 3 states have (on average 1024.3333333333333) internal successors, (3073), 3 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 11:50:04,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 11:50:04,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1022 of 1113 [2021-06-10 11:50:04,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2021-06-10 11:50:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 11:50:04,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2479 [2021-06-10 11:50:04,920 WARN L545 AbstractCegarLoop]: Verification canceled [2021-06-10 11:50:04,938 WARN L224 ceAbstractionStarter]: Timeout [2021-06-10 11:50:04,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 11:50:04 BasicIcfg [2021-06-10 11:50:04,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 11:50:04,939 INFO L168 Benchmark]: Toolchain (without parser) took 851957.40 ms. Allocated memory was 320.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 283.1 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 940.8 MB. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 320.9 MB. Free memory was 301.3 MB in the beginning and 301.2 MB in the end (delta: 87.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.36 ms. Allocated memory is still 320.9 MB. Free memory was 283.0 MB in the beginning and 286.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.52 ms. Allocated memory is still 320.9 MB. Free memory was 285.1 MB in the beginning and 284.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: Boogie Preprocessor took 24.58 ms. Allocated memory is still 320.9 MB. Free memory was 284.1 MB in the beginning and 283.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: RCFGBuilder took 364.49 ms. Allocated memory is still 320.9 MB. Free memory was 283.0 MB in the beginning and 255.8 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 INFO L168 Benchmark]: TraceAbstraction took 851159.68 ms. Allocated memory was 320.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 255.8 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 911.7 MB. Max. memory is 16.0 GB. [2021-06-10 11:50:04,940 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.09 ms. Allocated memory is still 320.9 MB. Free memory was 301.3 MB in the beginning and 301.2 MB in the end (delta: 87.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 363.36 ms. Allocated memory is still 320.9 MB. Free memory was 283.0 MB in the beginning and 286.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 39.52 ms. Allocated memory is still 320.9 MB. Free memory was 285.1 MB in the beginning and 284.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.58 ms. Allocated memory is still 320.9 MB. Free memory was 284.1 MB in the beginning and 283.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 364.49 ms. Allocated memory is still 320.9 MB. Free memory was 283.0 MB in the beginning and 255.8 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 851159.68 ms. Allocated memory was 320.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 255.8 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 911.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable (line 718). Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (3states, 1022/1113 universal loopers) in iteration 61,while PetriNetUnfolder was constructing finite prefix that currently has 1428 conditions, 1137 events (68/1136 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4955 event pairs, 0 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 1356. Up to 40 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 39 CEGAR loops. EmptinessCheckTime: 212.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 846542.0ms, OverallIterations: 2480, TraceHistogramMax: 39, EmptinessCheckTime: 0.0ms, AutomataDifference: 786299.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10010.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 16943 SDtfs, 2755 SDslu, 0 SDs, 0 SdLazy, 17175 SolverSat, 1917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10747.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7326 GetRequests, 4884 SyntacticMatches, 0 SemanticMatches, 2442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4253.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3903occurred in iteration=0, InterpolantAutomatonStates: 7323, 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: 2530.5ms SsaConstructionTime, 4415.6ms SatisfiabilityAnalysisTime, 16400.5ms InterpolantComputationTime, 183216 NumberOfCodeBlocks, 183216 NumberOfCodeBlocksAsserted, 2480 NumberOfCheckSat, 177278 ConstructedInterpolants, 0 QuantifiedInterpolants, 188876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2442 InterpolantComputations, 2442 PerfectInterpolantSequences, 925305/925305 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 could not prove your program: Timeout Completed graceful shutdown !SESSION 2021-06-10 11:35:50.785 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.11 java.vendor=Debian BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i Command-line arguments: -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i !ENTRY org.eclipse.osgi 4 0 2021-06-10 11:50:05.276 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(null)[566]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee97fa9cc/.metadata/.plugins/org.eclipse.core.resources/.safetable/org.eclipse.core.resources (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:158) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:48) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:44) at org.eclipse.core.internal.resources.SaveManager.saveMasterTable(SaveManager.java:1265) at org.eclipse.core.internal.resources.SaveManager.saveMasterTable(SaveManager.java:1255) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1232) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438)